7. An algorithm represented in the form of programming language is a) Program b)

Question

7. An algorithm represented in the form of programming language is a) Program b) Flow chart c) Pseudo code d) a and b 8. Pseudo code also known as a) Hardware design language C)Program design language b) Software design language d) Algorithms 9. The elements are removal from a stack in order. c) Alternative d) Sequential a) Reverse 10. Swapping b) Hierarchical the largest value to the end using pair-wise comparisons and d) Merge a) Bubble b) Insertion c)selection 11. Asymptotic notation O(n) defines complexity of type d) Quadratic a) Linear b) n log n c) Constant

Explanation / Answer

7) a - program

Explanation: In programming languages an algorithm is represented in the form of a program.

8) c -Program Design Language

  Explanation: A Pseudocode is not real code, but it looks like code by helping the people to understand a problem domain or solution better without having to add all the baggage necessary when using a real language.

9) a - Reverse

  Explanation: AStack is a collection of elements which follows LIFO(Last In First Out ) order which means that the element which is inserted most recently will be removed first . i.e reverse order

10) a -Bubble

  Explanation: Bubble sorting is the simplest sorting algorithm that works by repeatedly comparing adjacent items and exchanging those that are out of order.

11) a - Linear

  Explanation: The asymptotic notation O(N) denotes the performance of an algorithm will grow linearly and in direct proportion to the input data set size.

Related Questions

Navigate

• Browse (All)
• Browse 7
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.