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
Answers by KISHALAY DAS
User KISHALAY DAS
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User KISHALAY DAS
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
+1
vote
1
gate 2017
actual marks 62.33 set 1 gate 2017 normalized marks 69.37 Score 852.91 Rank Estimate 85  118 i am a general category student should i expect a call from iit bombay for 2 year mtech plan or what other colleges i should prefer thank you
answered
Mar 1, 2017
in
GATE Application

486
views
gate2017
0
votes
2
Compilers_BottomUpParsing
Consider the grammar: S → aSa  bSb  aa  bb A shiftreduce parser works by identifying the handle of each rightsentential form and replacing it by the head of the corresponding production. In this question, we indicate the handle of a rightsentential ... above grammar with the handle properly marked? a) abab[aababa] b) ababaS[ababa] c) ababbS[bbaba] d) abab[bSb]baba
answered
Jan 8, 2017
in
Compiler Design

101
views
+1
vote
3
TIFR2016B13
An undorected graph $G = (V, E)$ is said to be $k$colourable if there exists a mapping $c: V \rightarrow \{1, 2, \dots k \}$ such that for every edge $\{u, v\} \in E$ we have $c(u) \neq c(v)$. Which of the following statements is ... \Delta$ is the maximum degree in $G$ There is a polynomial time algorithm to check if $G$ is 2colourable If $G$ has no triangle then it is 3colourable
answered
Dec 29, 2016
in
Others

63
views
tifr2016
+13
votes
4
GATE200447
Consider a system with a twolevel 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 ... 000$ instructions. What is the effective average instruction execution time? $645$ $nanoseconds$ $1050$ $nanoseconds$ $1215$ $nanoseconds$ $1230$ $nanoseconds$
answered
Dec 28, 2016
in
CO & Architecture

12.7k
views
gate2004
coandarchitecture
virtualmemory
normal
+6
votes
5
Complement of language
What is the complement of language $L = \big \{a^nb^n, n\ge 0 \big \}$. Is it regular? What about complement of $L = \big \{a^nc^nb^n, n\ge 0 \big \}$ ?
answered
Nov 15, 2016
in
Theory of Computation

398
views
gate2017
practice
theoryofcomputation
+1
vote
6
Compiler Parse Tree Evaluation
answered
Nov 14, 2016
in
Compiler Design

105
views
0
votes
7
TIFR2011MathsA10
Let $m \leq n$ be natural numbers. The number of injective maps from a set of cardinality m to a set of cardinality $n$ is $m!$ $n!$ $(n − m)!$ None of the above.
answered
Nov 4, 2016
in
Set Theory & Algebra

121
views
tifrmaths2011
settheory&algebra
functions
+1
vote
8
Practice Set Made Easy  Page #455, Question #72
answered
Nov 3, 2016
in
CO & Architecture

91
views
+2
votes
9
parser
What is the maximum number of reduce moves that can be taken by a bottom up parser for a grammar without epsilon and unit production (i.e., of type A →∈ and A →B ) to parse a string with n tokens? 2n – 1 2n n – 1 n/2
answered
Nov 3, 2016
in
Compiler Design

179
views
compilerdesign
grammar
+4
votes
10
TOCMinimal FA
answered
Nov 3, 2016
in
Theory of Computation

326
views
+3
votes
11
madeeasy CO
answered
Oct 25, 2016
in
CO & Architecture

90
views
+7
votes
12
computer nwtworks (wrap around time)
A TCP segments of size(excluding headers) 1500 bytes with life time of a packet as 120 sec is sent over a TCP connection. There is no wrap around time for sequence numbers and sender sends the packets continuously. Consider TCP, IP and Ethernet overhead into consideration, what is the required data rate? 1. 299 Mbps 2. 319Mbps 3. 288 Mbps 4. 240 Mbps
answered
Oct 23, 2016
in
Computer Networks

848
views
tcp
computernetworks
+2
votes
13
UGCNETJune2016II25
In how many ways can the string $A \cap B  A \cap B A$ be fully paranthesized to yield an infix expression? 15 14 13 12
answered
Oct 22, 2016
in
Algorithms

2.2k
views
ugcnetjune2016ii
parenthesization
+5
votes
14
B+ Tree insertion
I think it would be 7..please check
answered
Oct 19, 2016
in
Databases

379
views
indexing
+3
votes
15
Ace exam
How to solve this type of questions..
answered
Oct 18, 2016
in
Digital Logic

190
views
digitallogic
+4
votes
16
ACE test series(OS):
Consider a $64$bit processor. A process has a $64$ bit logical address space with twolevel paging. The outer table is indexed using 32bits and the inner table using $16$bits. What is the size of outer page table size ? a). $4GB$ b). $8GB$ c). $32MB$ d). $32GB$
answered
Oct 11, 2016
in
Operating System

915
views
testseries
operatingsystem
memorymanagement
badquestion
0
votes
17
self_doubt
answered
Oct 11, 2016
in
Compiler Design

102
views
+4
votes
18
DS\Hashing
Consider a hash table of size seven, with starting index zero, and a hash function (3x + 4) mod 7. Assuming the hash table is initially empty, which of the following is the contents of the table when the sequence 1, 3, 8, 10 is inserted into the table using closed hashing? Note that denotes an empty location in the ... 8, 10, , , , 3 (C) 1, , , , , , 3 (D) 1, 10, 8, , , , 3
answered
Oct 11, 2016
in
DS

276
views
datastructure
hashing
0
votes
19
#testbook_digital
my sol to truth table is Y=A'B+AB=B both opyion B and C satisfied it option B , AB+B=(A+1)B=B option C, A'B+B=(A'+1)B=B
answered
Oct 11, 2016
in
Digital Logic

62
views
0
votes
20
MADE EASY TEST SERIES
Consider a clocked sequential circuit as shown in the figure below. Assuming initial state to be Q1 Q0 = 00 For an input sequence X = 1010, the respective output sequence will be _______.
answered
Oct 11, 2016
in
Digital Logic

182
views
39,751
questions
46,767
answers
140,662
comments
58,536
users