GAT Subject
Engineering
Computer Science Civil Engineering Chemical Engineering Agricultural Engineering Mechanical Engineering Electronics and Communication
Queue Operations - Section 4 Multiple Questions and Answers.
| 26. | Which of the following sorting algorithms does not have a worst case running time of O(n2)? | ||
| A. | Insertion sort | ||
| B. | Quick sort | ||
| C. | Bubble sort | ||
| D. | Merge sort | ||
| 27. | The quick sort algorithm exploit _________ design technique: | ||
| A. | Overflow | ||
| B. | Backtracking | ||
| C. | Dynamic Programming | ||
| D. | Divide and Conquer | ||
| 28. | A linear list in which the last node points to the first node is ........: | ||
| A. | singly linked list | ||
| B. | doubly linked list | ||
| C. | circular linked list | ||
| D. | none of the above | ||
| 29. | A ...... indicates the end of the list: | ||
| A. | Guard | ||
| B. | Sentinel | ||
| C. | End pointer | ||
| D. | Last pointer | ||
| 30. | RLINK is the pointer pointing to the......: | ||
| A. | last node | ||
| B. | head node | ||
| C. | successor node | ||
| D. | predecessor node | ||
Quick Links
GAT Subject
Computer Science English Mcqs Agriculture
Engineering
Computer Science Civil Engineering
Technical
Networking Electronics Database
Past Papers
Model Papers FPSC Papers