GATE CSE
For all GATE CSE Questions
Toggle navigation
GATE Overflow
Facebook Login
Google Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
All Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous
Blogs
New Blog
Exams
First time here? Checkout the
FAQ
!
x
×
Close
Use the google search bar on side panel. It searches through all previous GATE/other questions.
Recent activity by ABKUNDAN
User ABKUNDAN
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User ABKUNDAN
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
7
answers
1
GATE 2016141
Let $Q$ denote a queue containing sixteen numbers and $S$ be an empty stack. Head(Q) returns the element at the head of the queue $Q$ without removing it from $Q$. Similarly Top (S) returns the element at the top of $S$ without removing ... ); Enqueue (Q, x); end end The maximum possible number of iterations of the while loop in the algorithm is _______.
commented
Aug 29
in
DS

3.4k
views
gate20161
datastructure
queues
difficult
numericalanswers
4
answers
2
GATE200613
A scheme for storing binary trees in an array X is as follows. Indexing of X starts at 1 instead of 0. the root is stored at X[1]. For a node stored at X[i], the left child, if any, is stored in X[2i] and the right child, if any, in X[2i+1]. To be able to store any binary tree on n vertices the minimum size of X should be $\log_2 n$ $n$ $2n+1$ $2^n1$
commented
Aug 25
in
DS

1.4k
views
gate2006
datastructure
binarytree
normal
2
answers
3
Sorted List
suppose there are 4 sorted lists of n/4 elements each. if we merge these list into a single sorted list of n elements, for the n=400 number of key comparisons in the worst case using an efficient algorithm is
asked
Aug 21
in
Algorithms

128
views
sorting
algorithms
3
answers
4
GATE200655
Consider these two functions and two statements S1 and S2 about them. int work1(int *a, int i, int j) { int x = a[i+2]; a[j] = x+1; return a[i+2]  3; } int work2(int *a, int i, int j) { int t1 = i+2; int t2 = a[t1]; a ... ) of work2 compared to work1 S1 is false and S2 is false S1 is false and S2 is true S1 is true and S2 is false S1 is true and S2 is true
commented
Aug 17
in
Compiler Design

1.2k
views
gate2006
compilerdesign
codetransformation
normal
codeoptimization
outofsyllabusnow
3
answers
5
Made Easy Workbook Instruction Pipelining
commented
Aug 13
in
CO & Architecture

733
views
co&architecture
madeeasytestseries
1
answer
6
madeeasy workbook
if a disk system has an average seek time of 30ns and rotation rate of 360RPM. each track of the disk has 512 sectors each of size 512 Bytes. what is the time taken to read 4 successive sectors,also compute the effective data transfer rate a) 0.0843 sec , 1536 kbps b) 0.123 sec , 1436 kbps c) 0.156 sec ,1326 kbps d) 0.135 sec , 1252 kbps
asked
Aug 11
in
CO & Architecture

74
views
1
answer
7
IEEE floating point
in IEEE floating point representation, all the exponent bits are one and mantissa bits are non zero. this represent A) 0 B) infinity C) denormalized value D) error
asked
Aug 11
in
CO & Architecture

47
views
3
answers
8
GATE20002.12
The following arrangement of masterslave flip flops has the initial state of P, Q as 0, 1 (respectively). After a clock cycle the output state P, Q is (respectively), 1, 0 1, 1 0, 0 0, 1
answered
Aug 1
in
Digital Logic

1.3k
views
gate2000
digitallogic
circuitoutput
normal
27,422
questions
35,273
answers
84,587
comments
33,511
users