The Gateway to Computer Science Excellence
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. For hardcopy of previous year questions please see
here
Questions by Kapil
User Kapil
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User Kapil
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
+1
vote
2
answers
1
GATE 2017 EC Aptitude
$900$ men and $500$ woman complete a task in $2$ weeks. $1200$ men and $250$ woman took $3$ weeks to complete the same task. Then, how many men are required to complete the same task in $1$ week ?
asked
Feb 7, 2017
in
Numerical Ability

1.6k
views
numericalanswers
0
votes
3
answers
2
What is the output  Single linked list ?
asked
Feb 3, 2017
in
DS

304
views
linkedlists
datastructure
programminginc
output
+3
votes
1
answer
3
Time Complexity of the given code ?
#include <stdio.h> int main(void) { for(i=1;i<=n;i*=2) { for(j=0;j<=i;j++) { for(k=0;k<=n;k++) { ..... O(1)....; } } } return 0; } What is the time complexity of given code ?
asked
Jan 29, 2017
in
Algorithms

246
views
timecomplexity
algorithms
programminginc
+3
votes
2
answers
4
Difference between Kruskal's and Prim's algorithm ?
asked
Jan 24, 2017
in
Algorithms

1.6k
views
algorithms
graphalgorithms
kruskalsalgorithm
primsalgorithm
+15
votes
0
answers
5
Discussion regarding Cache Memory
What is the size of $MUX$ needed in direct mapped cache ? For ex :  Tag = $17$  line = $10$  word = $5$  Diagram Reference : Direct mapped cache with multi word block In set associative cache, Do MUX and OR gate ... OR gate work parallely, then Hit latency includes both delays ? Diagram Reference :  Also, any reason/explaination regarding below image ?
asked
Jan 21, 2017
in
CO & Architecture

673
views
cachememory
coandarchitecture
directmapping
+4
votes
1
answer
6
Draw the LL(1) parsing table of the given grammar ?
asked
Dec 27, 2016
in
Compiler Design

2.5k
views
parsing
compilerdesign
ll1
grammar
0
votes
0
answers
7
DBMS Decomposition into 3NF and BCNF
Suppose a relation is given $R\left ( ABCDEF \right )$ with the given set of FD's $\left \{ A \rightarrow BCD, BC\rightarrow DE, B\rightarrow D,D\rightarrow A \right \}$ A). Compute the Canonical Cover ? B). Give 3NF decomposition of R based on canonical cover ? C). Give BCNF decomposition of R based on original set of FD ?
asked
Nov 20, 2016
in
Databases

578
views
databasenormalization
databases
canonicalcover
functionaldependencies
+3
votes
1
answer
8
TOC Grand Test 1 Question 27  Gatebook
Consider languages L1 and L2 over {0,1} alphabet . L2= { w  w contains some x as a substring and x belongs to L1 } Which of the following must be true? I. If L1 is regular, L2 is also regular. II. If L1 is CFL, L2 is also CFL. III. If L1 is recursive, L2 is also recursive I and II only I, II and III I and III only II and III only
asked
Nov 10, 2016
in
Theory of Computation

215
views
gatebook_toc
regularlanguages
theoryofcomputation
+7
votes
1
answer
9
How to draw register allocation interference graph ?
asked
Nov 2, 2016
in
Compiler Design

374
views
compilerdesign
registerallocation
+2
votes
0
answers
10
Gateway vs. routers vs. bridges
Explain the followīng sentences with an example ? A). "Bridge is used to connect different LAN's in the same network" B). "Router is used to connect different similar networks" C). "Gateway is used to connect different dissimilar networks"
asked
Oct 19, 2016
in
Computer Networks

158
views
computernetworks
routersbridgehubsswitches
+3
votes
1
answer
11
Computer Networking
Is there any way / Approach or any idea to how to learn port addresses for different protocols. I have seen many questions in test series regarding ports. I have never seen GATE asking such questions. But what if it comes. If anyone of you, has any technique to by heart them, then please share here . It will be beneficial to all . Thanks !!!
asked
Oct 18, 2016
in
Computer Networks

155
views
computernetworks
+2
votes
1
answer
12
Check whether the given schedule is conflict serializable or not ?
asked
Sep 29, 2016
in
Databases

252
views
databases
conflictserializable
+5
votes
2
answers
13
Halting Problem of Turing Machines
Can anyone provide the proof of halting problem of turing machines by contradiction ? If possible, give example, how is it reduced to other turing problems ?
asked
Sep 27, 2016
in
Theory of Computation

922
views
theoryofcomputation
turingmachine
decidability
0
votes
0
answers
14
C programming  (Initialization)
Consider 2 Program initializations P and Q . Are both the initializations equivalent ? P:: x:=1; y:=1; z:=1; u:=0 Q:: x, y, z, u := 1, 1, 1, 0;
asked
Sep 16, 2016
in
Programming

242
views
programminginc
output
0
votes
3
answers
15
Theory of Computation  Decidability
Is this language Decidable ? L = { < M1,M2 >  M1,M2 are TM's and Ɛ ∈ L(M1) ∪ L(M2) } Where Ɛ = Epsilon EDIT => I think it is the nontrivial property of TM making it undecidable. By applying rice theorem 1, Take Tyes = Σ* and Tno = (0) , making it REL.
asked
Sep 7, 2016
in
Theory of Computation

391
views
theoryofcomputation
decidability
turingmachine
+5
votes
2
answers
16
7th smallest element in a MinHeap
In a minheap with n elements 1). The 7th smallest element can be found in time, if duplicates are allowed ? 2). The 7th distinct smallest element can be found in time, If duplicates are allowed ?
asked
Sep 4, 2016
in
Algorithms

979
views
algorithms
heap
binaryheap
sorting
timecomplexity
+6
votes
2
answers
17
Computer Architecture > Interrupt Driven I/O
asked
Aug 30, 2016
in
CO & Architecture

907
views
coandarchitecture
interrupts
+3
votes
2
answers
18
Minimization of DFA
asked
Aug 11, 2016
in
Theory of Computation

1.1k
views
theoryofcomputation
minimalstateautomata
dfa
finiteautomata
+1
vote
1
answer
19
Cormen
2n is the order of 3n . Is it True or False ? State with reason.
asked
Aug 5, 2016
in
Algorithms

91
views
+1
vote
2
answers
20
Regular Expression time complexity
The equality of two regular expression is computed in? Give reasons also.. Constant Time polynomial time logarithmic Polynomial time Exponential time
asked
Jul 8, 2016
in
Theory of Computation

334
views
regularexpressions
finiteautomata
regular
expression
theoryofcomputation
0
votes
0
answers
21
page size vs frame size
What is the page size taken if page size is less than frame size? Take an example page size =4kb and frame size = 8kb , Then for calculating virtual address space , which page size value do we take?
asked
Jun 26, 2016
in
Operating System

520
views
pagetable
operatingsystem
memorymanagement
+2
votes
3
answers
22
Tree traversals
If the inorder traversal and preorder traversal of a binary tree having N elements are given, then what will be the time complexity of post order traversal and level order traversal of such a tree. Plz explain also ?
asked
Jun 23, 2016
in
Algorithms

193
views
binarytree
0
votes
3
answers
23
singly linked list
Consider an implementation of unsorted singly linked list. Suppose it has its representation with a head and tail pointer. Given the representation, which of the following operation can be implemented in O(1) time? i) Insertion at the front of the linked list ii ... the linked list iii) Deletion of the front node of the linked list iv) Deletion of the last node of the linked list
asked
Jun 14, 2016
in
DS

1.3k
views
+11
votes
2
answers
24
DMA operation
A) Consider $1$mbps harddisk is interfaced to the processor in a cycle stealing mode of DMA whenever $64$ bytes of data is available in the buffer,then it is transferred to main memory (1 word = $64$ bits) and machine cycle time is $2$ micro sec. Then, percentage of CPU time consumed for DMA operation is ? B) Percentage of CPU time consumed for DMA operation, if burst mode is used ?
asked
Jan 23, 2016
in
CO & Architecture

1.5k
views
dma
coandarchitecture
36,162
questions
43,620
answers
124,005
comments
42,880
users