Register

Recent questions tagged gatecse-2005

33 votes
5 answers
42
GATE CSE 2005 | Question: 37
Suppose $T(n) =2T (\frac{n}{2}) + n$, $T(0) = T(1) =1$ Which one of the following is FALSE? $T(n)=O(n^2)$ $T(n)=\Theta(n \log n)$ $T(n)=\Omega(n^2)$ $T(n)=O(n \log n)$
Suppose $T(n) =2T (\frac{n}{2}) + n$, $T(0) = T(1) =1$Which one of the following is FALSE?$T(n)=O(n^2)$$T(n)=\Theta(n \log n)$$T(n)=\Omega(n^2)$$T(n)=O(n \log n)$
User Avatar
22 votes
8 answers
43
GATE CSE 2005 | Question: 36
In a complete $k$-ary tree, every internal node has exactly $k$ children. The number of leaves in such a tree with $n$ internal node is: $nk$ $(n-1)k + 1$ $n(k-1) +1$ $n(k-1)$
In a complete $k$-ary tree, every internal node has exactly $k$ children. The number of leaves in such a tree with $n$ internal node is:$nk$$(n-1)k + 1$$n(k-1) +1$$n(k-1)...
User Avatar
31 votes
4 answers
44
GATE CSE 2005 | Question: 35
How many distinct binary search trees can be created out of $4$ distinct keys? $5$ $14$ $24$ $42$
How many distinct binary search trees can be created out of $4$ distinct keys?$5$$14$$24$$42$
User Avatar
20 votes
1 answer
45
GATE CSE 2005 | Question: 34
A priority queue is implemented as a Max-Heap. Initially, it has $5$ elements. The level-order traversal of the heap is: $10, 8, 5, 3, 2$. Two new elements $1$ and $7$ ... $10, 8, 7, 2, 3, 1, 5$ $10, 8, 7, 1, 2, 3, 5$ $10, 8, 7, 3, 2, 1, 5$
A priority queue is implemented as a Max-Heap. Initially, it has $5$ elements. The level-order traversal of the heap is: $10, 8, 5, 3, 2$. Two new elements $1$ and $7$ ar...
User Avatar
27 votes
5 answers
52
GATE CSE 2005 | Question: 27
An organization has a class $B$ network and wishes to form subnets for $64$ departments. The subnet mask would be: $255.255.0.0$ $255.255.64.0$ $255.255.128.0$ $255.255.252.0$
An organization has a class $B$ network and wishes to form subnets for $64$ departments. The subnet mask would be:$255.255.0.0$$255.255.64.0$$255.255.128.0$$255.255.252.0...
User Avatar
25 votes
8 answers
54
GATE CSE 2005 | Question: 25
The maximum window size for data transmission using the selective reject protocol with $n\text{-bit}$ frame sequence numbers is: $2^n$ $2^{n-1}$ $2^n-1$ $2^{n-2}$
The maximum window size for data transmission using the selective reject protocol with $n\text{-bit}$ frame sequence numbers is:$2^n$$2^{n-1}$$2^n-1$$2^{n-2}$
User Avatar
30 votes
5 answers
56
GATE CSE 2005 | Question: 23
Packets of the same session may be routed through different paths in: TCP, but not UDP TCP and UDP UDP, but not TCP Neither TCP nor UDP
Packets of the same session may be routed through different paths in:TCP, but not UDPTCP and UDPUDP, but not TCPNeither TCP nor UDP
User Avatar
36 votes
2 answers
57
GATE CSE 2005 | Question: 22, ISRO2015-36
Increasing the RAM of a computer typically improves performance because: Virtual Memory increases Larger RAMs are faster Fewer page faults occur Fewer segmentation faults occur
Increasing the RAM of a computer typically improves performance because:Virtual Memory increasesLarger RAMs are fasterFewer page faults occurFewer segmentation faults occ...
User Avatar
23 votes
5 answers
58
GATE CSE 2005 | Question: 21
What is the swap space in the disk used for? Saving temporary html pages Saving process data Storing the super-block Storing device drivers
What is the swap space in the disk used for?Saving temporary html pagesSaving process dataStoring the super-blockStoring device drivers
User Avatar
Page: