GPL - Gate Question |

X Close

You need to enable javascript to view this page properly.

Branch

All

Loading

139.

In quick sort, for sorting n elements, the (n/4)th smallest element is selected as pivot using an O(n) time algorithm. What is the worst case time complexity of the quick sort?
[2 marks]
(A) θ(n)
(B) θ(n log n)
(C) θ(n²)
(D) θ(n²logn)

last reply by CpjJwWHV • 13 years ago • asked in Computer Science And Engineering, 2009

View Comments [2 Reply]
140.

Consider the following graph:

Which one of the following is NOT the sequence of edges added to the minimum spanning tree using Kruskal’s algorithm? [2 marks]
(A) (b,e) (e,f) (a,c) (b,c) (f,g) (c,d)
(B) (b,e) (e,f) (a,c) (f,g) (b,c) (c,d)
(C) (b,e) (a,c) (e,f) (b,c) (f,g) (c,d)
(D) (b,e) (e,f) (b,c) (a,c) (f,g) (c,d)

last reply by CpjJwWHV • 14 years ago • asked in Computer Science And Engineering, 2009

View Comments [1 Reply]
141.

What is the maximum height of any AVL- tree with 7 nodes? Assume that the height of a tree with a single node is 0. [2 marks]
(A) 2
(B) 3
(C) 4
(D) 5

last reply by CpjJwWHV • 14 years ago • asked in Computer Science And Engineering, 2009

View Comments [1 Reply]
142.

The keys 12,18,13,2,3,23,5 and 15 are inserted into an initially empty hash table of length 10 using open addressing with the hash function h(k)=k mod 10 and linear probing. What is the resultant hash table? [2 marks]

last reply by CpjJwWHV • 14 years ago • asked in Computer Science And Engineering, 2009

View Comments [1 Reply]
143.

The running time of the algorithm is represented by the following recurrence relation:

Which one of the following represent the time complexity of the algorithm? [2 marks]
(A) θ(n)
(B) θ(n log n)
(C) θ(n²)
(D) θ(n²logn)

last reply by CpjJwWHV • 14 years ago • asked in Computer Science And Engineering, 2009

View Comments [1 Reply]
144.

A multilevel page table is preferred in comparison to a single level page table for translating virtual address to physical address because [2 marks]
(A) It reduces the memory access time to read or write a memory location
(B) It helps to reduce the size of page table needed to implement the virtual address space of a process
(C) It is required by the translation lookaside buffer
(D) It helps to reduce the number of page faults in page replacement algorithms

last reply by CpjJwWHV • 14 years ago • asked in Computer Science And Engineering, 2009

View Comments [1 Reply]

801 1 ...‹‹22 2324 25 26 ›› ... 134

High Frequency Word List with Mnemonics

GPL Dictionary is fast way to learn words with mnemonics.
It contains high frequency word list which are mostly asked in various examinations.
It is dedicated for student appearing for PSUs, GRE, UPSC or any other exams in which vocabulary test is taken.
User can save their own mnemonics (key and link).

Check Now