Company: Texas_MCQ
Difficulty: medium
Consider an unsorted list of 8 elements: 23, 61, 73, 82, 9, 43, 11, 3. What will be the sequence after two passes of quick sort if the first element of the list is chosen as the pivot always and the list is sorted in ascending order? Note: Both left and right recursive calls are made together. 3 9 11 23 43 61 82 73 61 73 82 23 9 43 11 3 9 3 11 23 82 43 73 61 3 9 11 23 82 43 73 61 Consider the given segment map table along with the logical addresses for the corresponding segments: Segment | Base | Length 0 | 90 | 600 1 | 1992 | 60 2 | 569 | 14 3 | 2659 | 256 4 | 912 | 123 Consider the following logical addresses: (0, 430), (1, 236), (2, 200), (4, 100). Which request is invalid? (2, 200) (4, 100) (1, 236) (0, 430) Consider the following pseudo-code algorithm segment: algo-1(G) for all vertices v ∈ G: visited[v] = false, parent[v] = null q = new Queue(), i = 1 while there is a vertex v such that num[v] = 0: num[v] = i++, enqueue(v) while queue is not empty: &