GATE Overflow for GATE CSE
Login Register
@
  • Dark Mode
  • Profile
  • Edit my Profile
  • Messages
  • My favorites
  • Register
  • Activity
  • Q&A
  • Questions
  • Unanswered
  • Tags
  • Subjects
  • Users
  • Ask
  • Previous Years
  • Blogs
  • New Blog
  • Exams
Dark Mode
Filter
  • Recent
  • Hot!
  • Most votes
  • Most answers
  • Most views
  • Previous GATE
  • Featured

Highest voted questions

228 votes
13 answers
1
GATE CSE 2008 | Question: 67
A processor uses $36$ bit physical address and $32$ bit virtual addresses, with a page frame size of $4$ Kbytes. Each page table entry is of size $4$ bytes. A three level page table is used for virtual to physical address translation, where the virtual address is used as ... tables are respectively $\text{20,20,20}$ $\text{24,24,24}$ $\text{24,24,20}$ $\text{25,25,24}$
Kathleen asked in Operating System Sep 12, 2014
by Kathleen
61.8k views
  • gatecse-2008
  • operating-system
  • virtual-memory
  • normal
157 votes
12 answers
2
GATE IT 2007 | Question: 29
When searching for the key value $60$ in a binary search tree, nodes containing the key values $10, 20, 40, 50, 70, 80, 90$ are traversed, not necessarily in the order given. How many different orders are possible in which these key values can occur on the search path from the root to the node containing the value $60$? $35$ $64$ $128$ $5040$
Ishrat Jahan asked in DS Oct 30, 2014
by Ishrat Jahan
31.9k views
  • gateit-2007
  • data-structures
  • binary-search-tree
  • normal
151 votes
16 answers
3
GATE CSE 2016 Set 2 | Question: 40
The number of ways in which the numbers $1, 2, 3, 4, 5, 6, 7$ can be inserted in an empty binary search tree, such that the resulting tree has height $6$, is _________. Note: The height of a tree with a single node is $0$.
Akash Kanase asked in DS Feb 12, 2016
by Akash Kanase
39.2k views
  • gatecse-2016-set2
  • data-structures
  • binary-search-tree
  • normal
  • numerical-answers
139 votes
5 answers
4
GATE CSE 2010 | Question: 46
A system has $n$ resources $R_0, \dots,R_{n-1}$, and $k$ processes $P_0, \dots, P_{k-1}$. The implementation of the resource request logic of each process $P_i$ is as follows: $\text{if} (i\%2==0) \{$ $\quad\text{if} (i<n) \text{ request } R_i;$ ... which of the following situations is a deadlock possible? $n=40,\: k=26$ $n=21,\:k=12$ $n=20,\:k=10$ $n=41,\:k=19$
go_editor asked in Operating System Sep 30, 2014
by go_editor
24.0k views
  • gatecse-2010
  • operating-system
  • resource-allocation
  • normal
132 votes
4 answers
5
GATE CSE 2005 | Question: 68
A $5$ stage pipelined CPU has the following sequence of stages: IF - instruction fetch from instruction memory RD - Instruction decode and register read EX - Execute: ALU operation for data and address computation MA - Data memory access - for write access, the ... taken to complete the above sequence of instructions starting from the fetch of $I_1$? $8$ $10$ $12$ $15$
Kathleen asked in CO and Architecture Sep 22, 2014
by Kathleen
37.3k views
  • gatecse-2005
  • co-and-architecture
  • pipelining
  • normal
126 votes
18 answers
6
GATE CSE 2017 Set 2 | Question: 44
Two transactions $T_1$ and $T_2$ are given as $T_1:r_1(X)w_1(X)r_1(Y)w_1(Y)$ $T_2:r_2(Y)w_2(Y)r_2(Z)w_2(Z)$ where $r_i(V)$ denotes a $\textit{read}$ operation by transaction $T_i$ on a variable $V$ and $w_i(V)$ denotes a ... by transaction $T_i$ on a variable $V$. The total number of conflict serializable schedules that can be formed by $T_1$ and $T_2$ is ______
Madhav asked in Databases Feb 14, 2017
by Madhav
56.1k views
  • gatecse-2017-set2
  • databases
  • transaction-and-concurrency
  • numerical-answers
  • conflict-serializable
124 votes
18 answers
7
GATE CSE 2004 | Question: 47
Consider a system with a two-level paging scheme in which a regular memory access takes $150$ $nanoseconds$, and servicing a page fault takes $8$ $milliseconds$. An average instruction takes $100$ nanoseconds of CPU time, and two memory accesses. ... execution time? $\text{645 nanoseconds}$ $\text{1050 nanoseconds}$ $\text{1215 nanoseconds}$ $\text{1230 nanoseconds}$
gatecse asked in CO and Architecture Sep 5, 2014
by gatecse
50.4k views
  • gatecse-2004
  • co-and-architecture
  • virtual-memory
  • normal
122 votes
12 answers
8
GATE CSE 2016 Set 1 | Question: 41
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 ... = Pop(S); Enqueue (Q, x); end end The maximum possible number of iterations of the while loop in the algorithm is _______.
Sandeep Singh asked in DS Feb 12, 2016
by Sandeep Singh
24.8k views
  • gatecse-2016-set1
  • data-structures
  • queue
  • difficult
  • numerical-answers
114 votes
3 answers
9
GATE CSE 2014 Set 2 | Question: 11
Suppose $n$ and $p$ are unsigned int variables in a C program. We wish to set $p$ to $^nC_3$. If $n$ is large, which one of the following statements is most likely to set $p$ correctly? $p = n * (n-1) * (n-2) / 6;$ $p = n * (n-1) / 2 * (n-2) / 3;$ $p = n * (n-1) / 3 * (n-2) / 2;$ $p = n * (n-1) * (n-2) / 6.0;$
go_editor asked in Programming Sep 28, 2014
by go_editor
12.1k views
  • gatecse-2014-set2
  • programming
  • programming-in-c
  • normal
114 votes
6 answers
10
GATE CSE 2001 | Question: 2.23
$R(A,B,C,D)$ is a relation. Which of the following does not have a lossless join, dependency preserving $BCNF$ decomposition? $A \rightarrow B, B \rightarrow CD$ $A \rightarrow B, B \rightarrow C, C \rightarrow D$ $ AB \rightarrow C, C \rightarrow AD$ $A \rightarrow BCD$
Kathleen asked in Databases Sep 15, 2014
by Kathleen
43.2k views
  • gatecse-2001
  • databases
  • database-normalization
  • normal
113 votes
18 answers
11
GATE CSE 2009 | Question: 57, ISRO2016-75
Frames of $\text{1000 bits}$ are sent over a $10^6$ $\text{bps}$ duplex link between two hosts. The propagation time is $\text{25 ms}$. Frames are to be transmitted into this link to maximally pack them in transit (within the link). What is the ... ? Assume that no time gap needs to be given between transmission of two frames. $I=2$ $I=3$ $I=4$ $I=5$
Kathleen asked in Computer Networks Sep 22, 2014
by Kathleen
39.1k views
  • gatecse-2009
  • computer-networks
  • sliding-window
  • normal
  • isro2016
111 votes
9 answers
12
GATE CSE 2014 Set 1 | Question: 44
An access sequence of cache block addresses is of length $N$ and contains n unique block addresses. The number of unique block addresses between two consecutive accesses to the same block address is bounded above by $k$. What is the miss ratio if the access sequence is passed ... $\left(\dfrac{1}{N}\right)$ $\left(\dfrac{1}{A}\right)$ $\left(\dfrac{k}{n}\right)$
go_editor asked in CO and Architecture Sep 28, 2014
by go_editor
18.4k views
  • gatecse-2014-set1
  • co-and-architecture
  • cache-memory
  • normal
108 votes
14 answers
13
GATE CSE 2003 | Question: 78
A processor uses $2-level$ page tables for virtual to physical address translation. Page tables for both levels are stored in the main memory. Virtual and physical addresses are both $32$ bits wide. The memory is byte addressable. For virtual to physical address translation, the ... virtual address is approximately (to the nearest $0.5$ ns) $1.5$ ns $2$ ns $3$ ns $4$ ns
gatecse asked in Operating System Sep 15, 2014
by gatecse
33.9k views
  • gatecse-2003
  • operating-system
  • normal
  • virtual-memory
107 votes
8 answers
14
GATE CSE 2005 | Question: 72
Consider the following code fragment: if (fork() == 0) { a = a + 5; printf("%d, %p n", a, &a); } else { a = a - 5; printf ("%d, %p n", a,& a); } Let $u,v$ be the values printed by the parent process and $x,y$ be the values printed by the child ... $u + 10 = x \text{ and } v = y$ $u + 10 = x \text{ and } v != y$
Nishant T-rex asked in Operating System Sep 15, 2014
by Nishant T-rex
29.9k views
  • gatecse-2005
  • operating-system
  • fork-system-call
  • normal
106 votes
19 answers
15
GATE CSE 2016 Set 1 | Question: 8
We want to design a synchronous counter that counts the sequence $0-1-0-2-0-3$ and then repeats. The minimum number of $\text{J-K}$ flip-flops required to implement this counter is _____________.
Sandeep Singh asked in Digital Logic Feb 12, 2016
by Sandeep Singh
44.4k views
  • gatecse-2016-set1
  • digital-logic
  • digital-counter
  • flip-flop
  • normal
  • numerical-answers
105 votes
5 answers
16
GATE CSE 2008 | Question: 46
You are given the postorder traversal, $P$, of a binary search tree on the $n$ elements $1, 2, \dots, n$. You have to determine the unique binary search tree that has $P$ as its postorder traversal. What is the time complexity of the most efficient algorithm ... $\Theta(\log n)$ $\Theta(n)$ $\Theta(n\log n)$ None of the above, as the tree cannot be uniquely determined
Kathleen asked in DS Sep 12, 2014
by Kathleen
30.9k views
  • gatecse-2008
  • data-structures
  • binary-search-tree
  • normal
104 votes
6 answers
17
GATE CSE 2014 Set 2 | Question: 36
Let $L_1=\{w\in\{0,1\}^*\mid w$ $\text{ has at least as many occurrences of }$ $(110)'\text{s as }$ $(011)'\text{s} \}$. Let $L_2=\{w \in\{0,1\}^*\ \mid w$ $ \text{ has at least as many occurrences of }$ ... is TRUE? $L_1$ is regular but not $L_2$ $L_2$ is regular but not $L_1$ Both $L_1$ and $L_2$ are regular Neither $L_1$ nor $L_2$ are regular
go_editor asked in Theory of Computation Sep 28, 2014
by go_editor
19.7k views
  • gatecse-2014-set2
  • theory-of-computation
  • normal
  • regular-language
103 votes
6 answers
18
GATE CSE 2016 Set 1 | Question: 40
$G=(V, E)$ is an undirected simple graph in which each edge has a distinct weight, and $e$ is a particular edge of $G$. Which of the following statements about the minimum spanning trees $(MSTs)$ of $G$ is/are TRUE? If $e$ is the lightest edge of some ... some cycle in $G$, then every MST of $G$ excludes $e$. I only. II only. Both I and II. Neither I nor II.
Sandeep Singh asked in Algorithms Feb 12, 2016
by Sandeep Singh
21.6k views
  • gatecse-2016-set1
  • algorithms
  • spanning-tree
  • normal
102 votes
7 answers
19
GATE CSE 2017 Set 1 | Question: 27
A multithreaded program $P$ executes with $x$ number of threads and uses $y$ number of locks for ensuring mutual exclusion while operating on shared memory locations. All locks in the program are non-reentrant, i.e., if a thread holds a lock $l$, then it cannot re-acquire lock $l$ without releasing ... $x = 1, y = 2$ $x = 2, y = 1$ $x = 2, y = 2$ $x = 1, y = 1$
Arjun asked in Operating System Feb 14, 2017
by Arjun
25.3k views
  • gatecse-2017-set1
  • operating-system
  • process-synchronization
  • normal
102 votes
6 answers
20
GATE CSE 2015 Set 1 | Question: 35
What is the output of the following C code? Assume that the address of $x$ is $2000$ (in decimal) and an integer requires four bytes of memory. int main () { unsigned int x [4] [3] = {{1, 2, 3}, {4, 5, 6}, {7, 8, 9}, {10, 11, 12}}; printf ("%u, %u, %u", x + 3, *(x + 3), *(x + 2) + 3); } $2036, 2036, 2036$ $2012, 4, 2204$ $2036, 10, 10$ $2012, 4, 6$
makhdoom ghaya asked in Programming Feb 13, 2015
by makhdoom ghaya
22.0k views
  • gatecse-2015-set1
  • programming
  • programming-in-c
  • normal
Page:
  • 1
  • 2
  • 3
  • 4
  • 5
  • 6
  • ...
  • 2936
  • next »

Subscribe to GATE CSE 2023 Test Series

Subscribe to GO Classes for GATE CSE 2023

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

Recent Posts

  • DRDO Previous Year Papers
  • From Rank 4200 to 64: My Journey to Success in GATE CSE Exam
  • What are the key things to focus on during the final 10-15 days before the GATE exam to improve performance?
  • All India GO Classes Mock test
  • NTA UGC NET JRF December 2022 Apply Online Form 2023

Subjects

  • All categories
  • General Aptitude (2.5k)
  • Engineering Mathematics (9.3k)
  • Digital Logic (3.3k)
  • Programming and DS (5.9k)
  • Algorithms (4.6k)
  • Theory of Computation (6.7k)
  • Compiler Design (2.3k)
  • Operating System (5.0k)
  • Databases (4.6k)
  • CO and Architecture (3.8k)
  • Computer Networks (4.6k)
  • Non GATE (1.3k)
  • Others (2.4k)
  • Admissions (649)
  • Exam Queries (842)
  • Tier 1 Placement Questions (17)
  • Job Queries (74)
  • Projects (9)
  • Unknown Category (853)

Recent Blog Comments

  • Can Someone guide me how to prepare for interview...
  • It's not a standard resource, don't follow them.
  • https://byjus.com/maths/diagonalization/
  • @amit166 can you share the reference of the...
  • Twist at every point Man

Network Sites

 GO Mechanical
 GO Electrical
 GO Electronics
 GO Civil
 CSE Doubts
 Aptitude Overflow
  • Send feedback
  • Rank Predictor
  • College Prediction
  • Useful Links
  • FAQ
  • Corrections
  • Discuss
  • Copyright
  • Request
  • Testimonials
  • Chat Logs
  • Chat
  • Badges
  • Search tips
  • Exam Category
  • Blog Category
  • Blog Tags
  • Privacy
  • Test Series
  • Contact Us
Developed by Chun