The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
Facebook Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
Recent activity by Kaushik.P.E
User Kaushik.P.E
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User Kaushik.P.E
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
1
answer
1
IIT Madras MS Interview Call Letter
Did anyone received Call Letter for Written Test for IIT Madras MS ( for AIR > 800  General Category) Program in Computer Science ?
answered
Apr 20, 2017
in
Written Exam

1.4k
views
iitmadras
ms
admissions
2
answers
2
UGCNETDEC2016III64
Let C be a binary linear code with minimum distance 2t+1 then it can correct upto ___ bits of error t+1 t t2 t/2
answer selected
Feb 20, 2017
in
Others

1.2k
views
ugcnetdec2016iii
1
answer
3
Gate_2017_Set_1_9
answer selected
Feb 14, 2017
in
Operating System

241
views
operatingsystem
1
answer
4
GATE 2017  1 (Control flow)
The question was like this ; if e1 then e2 else e3 is statement, and e1,e2,e3 correspond to expressions. This statement has 2 control paths What are the total number of control paths if there are 10 if statements?
answer selected
Feb 14, 2017
in
Compiler Design

792
views
compilerdesign
2
answers
5
Gate ECE GA 2017
answer selected
Feb 9, 2017
in
Numerical Ability

1k
views
speedtimedistance
1
answer
6
what is the probability that the mother could have had the very long or very short pregnancy
answered
Feb 8, 2017
in
Probability

191
views
probability
engineeringmathematics
3
answers
7
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 (A). I and II only (B). I, II, III only (C). I and III only (D). II and III only
commented
Feb 8, 2017
in
Theory of Computation

331
views
gatebook_toc
theoryofcomputation
regularlanguages
2
answers
8
GATE200717
Consider the following statements about user level threads and kernel level threads. Which one of the following statements is FALSE? Context switch time is longer for kernel level threads than for user level threads. User level threads do not need any ... can be scheduled on different processors in a multiprocessor system. Blocking one kernel level thread blocks all related threads.
commented
Feb 7, 2017
in
Operating System

3.6k
views
gate2007
operatingsystem
threads
normal
3
answers
9
GATE2017 ME1: GA5
$P$, $Q$ and $R$ talk about $S's$ car collection. $P$ states that $S$ has at least $3$ cars. $Q$ believes that $S$ has less than $3$ cars. $R$ indicates that to his knowledge, $S$ has at least one car. Only one of $P, Q$ and $R$ is right. The number of cars owned by $S$ is. $0$ $1$ $3$ Cannot be determined.
comment reshown
Feb 7, 2017
in
Numerical Ability

139
views
gate2017me1
generalaptitude
logicalreasoning
2
answers
10
Choose the correct statement about HEAP
I. A heap is always nearly complete tree. II. Worst case complexity of heapify operation is O( log n) III. Worst case complexity of build heap operation is O( n log n) a. I only b. I and II only c. II and III only d. I, II and III
commented
Feb 7, 2017
in
Algorithms

199
views
datastructures
2
answers
11
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 ?
comment reshown
Feb 7, 2017
in
Numerical Ability

2.4k
views
numericalanswers
3
answers
12
gate ec
How C Iam getting D
commented
Feb 7, 2017
in
Verbal Ability

505
views
1
answer
13
gate ece
answered
Feb 7, 2017
in
Numerical Ability

2.9k
views
2
answers
14
Self framed
Is the following schedule view serializable? T1 T2 T3 R(A) R(A) W(A) W(A) W(A)
commented
Feb 5, 2017
in
Databases

123
views
viewserializability
3
answers
15
No. of DFA's Possible
The number of different DFA's with two states X and Y,where X is the initial state,over the alphabet $\sum$ = {0,1,2}
commented
Feb 5, 2017
in
Theory of Computation

446
views
finiteautomata
counting
7
answers
16
GATE20002.17
Consider the following functions $f(n) = 3n^{\sqrt{n}}$ $g(n) = 2^{\sqrt{n}{\log_{2}n}}$ $h(n) = n!$ Which of the following is true? $h(n)$ is $O(f(n))$ $h(n)$ is $O(g(n))$ $g(n)$ is not $O(f(n))$ $f(n)$ is $O(g(n))$
comment edited
Feb 4, 2017
in
Algorithms

7.1k
views
gate2000
algorithms
asymptoticnotations
normal
1
answer
17
Gate Practice Question
A relational schema R with attributes (ABCDEFG).It is known that D never appears on RHS of any FD.How many different possibilities are there for what a Candidate key of R can be.?
commented
Feb 3, 2017
in
Databases

143
views
candidatekeys
databases
7
answers
18
GATE2016155
A sender uses the StopandWait ARQ protocol for reliable transmission of frames. Frames are of size $1000$ bytes and the transmission rate at the sender is $80$ Kbps (1 Kbps = 1000 bits/second). Size of an acknowledgment is $100$ bytes and the ... $100$ milliseconds. Assuming no frame is lost, the sender throughput is ________ bytes/ second.
commented
Feb 3, 2017
in
Computer Networks

8.5k
views
gate20161
computernetworks
stopandwait
normal
numericalanswers
3
answers
19
GATE2006IT2
For the set $N$ of natural numbers and a binary operation $f : N \times N \to N,$ an element $z \in N$ is called an identity for $f,$ if $f (a, z) = a = f(z, a),$ for all $a \in N.$ Which of the following binary operations have an identity? $f (x, y) = x + y  3$ $f (x, y) = \max(x, y)$ $f (x, y) = x^y$ I and II only II and III only I and III only None of these
commented
Feb 3, 2017
in
Set Theory & Algebra

2.4k
views
gate2006it
settheory&algebra
easy
binaryoperation
1
answer
20
madeeasy
Which of the following statements is true ? S1 : Source to destination delivery is the functionality that must be implemented by network layer above datalink layer. S2 : Packet delivery in correct order is the functionality that must be implemented by network layer above datalink layer. Which of ... S1 is true b. Only S2 is true c. Both S1 and S2 are true d. Neither of S1 or S2 is true
answer edited
Feb 3, 2017
in
Computer Networks

127
views
2
answers
21
number of schedules conflict equivalent schedule
Consider the following schedule: S : w1(A) w1(B) r2(A) w2(B) r3(A) w3(B) The number of schedules conflict equivalent are __________ .
commented
Feb 3, 2017
in
Databases

1.3k
views
databases
1
answer
22
NPTELOperating System,Week2Quiz2Q5
In the Contiguous allocation for disk blocks, files cannot grow dynamically because _______ The next block could be occupied by another file The scheme does not allow files to grow (by design itself) (No answer is correct because files can grow) The disk does not have enough space I think both 1 and 2 are correct . What do you say ?
answered
Feb 3, 2017
in
Operating System

245
views
nptelquiz
operatingsystem
1
answer
23
NPTELDesign and Analysis of AlgorithmsWeek1Quiz2Q12
State true or false. When a user encounters a page fault, 1) The user application informs the OS, 2) User uses API calls to the hardware Memory Management unit, 3) Memory Management unit brings the page from hard disk to main memory. Is Statement 2 correct ?
answered
Feb 3, 2017
in
Operating System

555
views
nptelquiz
operatingsystem
1
answer
24
C program
What is the error in the following code . Please do correct them #include <stdio.h> int main () { char *x[5] = {"raju","ramu","tinu","ben","ali"}; printf("%s\n",(x[2][0]) ); return 0; }
answered
Feb 3, 2017
in
Programming

103
views
programminginc
1
answer
25
True/false
Consider the following statements with respect to storage allocation: 1. Names local to a procedure are allocated space on a heap automatically. 2. Stack allocation is used for data that may live even after a procedure call returns. 3. Heap allocation is used for symbol table. Which one of ... false 1, 3 are true but 2 is false 2, 3 are true but 1 is false 1, 2 are false but 3 is true
comment edited
Feb 3, 2017
in
Programming

484
views
1
answer
26
risc vs cisc
State True/False: "CISC architectures may perform better than RISC architectures in network centric applications."
answered
Feb 2, 2017
in
CO and Architecture

286
views
2
answers
27
DBMS normalization concept problem
R(ABCDEF) FD set{ AB>CDE. CD>E, E>C } False statement? A. 2 NF decomposition possible B.3 NF decomposition possible C.BCNF decomposition possible D. ALL
comment edited
Feb 2, 2017
in
Databases

426
views
databases
1
answer
28
Choose the regular langauge
L1:{wwR∣w,x∈{a,b}∗ and w>0},wR is the reverse of string w L2:{wxwR∣w,x∈{a,b}∗ and w,x>0},wR is the reverse of string w L1 is regular but not L2 L2 is regular but not L1 Both L1 and L2 are regular Neither L1 nor L2 is regular
answered
Feb 1, 2017
in
Theory of Computation

43
views
theoryofcomputation
1
answer
29
MadeEasy Workbook: CO & Architecture  Clock Frequency
answered
Feb 1, 2017
in
CO and Architecture

83
views
coandarchitecture
madeeasybooklet
clockfrequency
1
answer
30
OS conceptual problem
In a system, there are 2 process and Round robin policy is employed. After some time one process gets completed, but another process is remaining with 6 unit burst time.Time Quantam is 2 unit. So, how many context switch occurs to complete this remaining process?(Ignore previous and last context switch.) A. 0 B. 2 C. 3 D. 4
answered
Feb 1, 2017
in
Operating System

73
views
operatingsystem
1
answer
31
Compiler design
G : Grammar S1 : Every LALR(1) G is LR(1). S2 : Every LR(1) G is LALR(1). S3: Some LL(1) is Regular. A. TFF B.TFT C. TTF D. FTT E. NONE
answered
Feb 1, 2017
in
Compiler Design

105
views
compilerdesign
1
answer
32
Programming problem : Test Series
answered
Feb 1, 2017
in
Programming

51
views
1
answer
33
TOC Test Series
L1 and L2 Are Decidable. then L1 union L2 is (a)______ and L1  L2 is(b) _________. a. Regular, cfl ,csl, rel. rec b. decidable, undecidable
answered
Feb 1, 2017
in
Theory of Computation

74
views
theoryofcomputation
1
answer
34
Intersection and concatenation in CFG
Given that L1 is regular and L2 context free. i) L3 = L1 ∩ L2 ii) L4= L1.L2 Selct the most appropriate statement: a. L3 , L4 are regular b. L3 is regular L4 is CFG not regular c. L3 is CFG, not regular L4 is regular d. L3,L4 are CFG not regular
answered
Feb 1, 2017
in
Compiler Design

345
views
theoryofcomputation
1
answer
35
UGCNETDEC2016III63
Which of the following statements is false? Every contextsensitive language is recursive The set of all languages that are not recursively enumerable is countable The family of recursively enumerable language is closed under union The families of recursively enumerable and recursive languages are closed under reversal
answered
Feb 1, 2017
in
Others

541
views
ugcnetdec2016iii
1
answer
36
UGCNETDEC2016III62
Which of the following pairs have different expressive power? Singletapeturing machine and multidimensional turing machine Multitapeturing machine and multidimensional turing machine Deterministic push down automata and nondeterministic push down automata Deterministic finite automata and nondeterministic finite automata
answered
Feb 1, 2017
in
Others

339
views
ugcnetdec2016iii
1
answer
37
madeeasy
Consider the two hosts A and B are connected Via a Router R which is having a queuing delay of 7 μsec . The Router R has two links Link1 and Link2, connected to A and B respectively. Each link is 250 meters long and has a bandwidth of 10 9 bps. The propagation speed is 500,000 km/sec. The total transfer delay for 2 KB packet from A to B is __________ μsec. (ignore the processing delay).
answer edited
Feb 1, 2017
in
Computer Networks

101
views
1
answer
38
BFS traversal
here S1 ans S2 seems confusing for me can someone help me to varify this answer i think given 3 are true in some case??
answer edited
Feb 1, 2017
in
Algorithms

73
views
bfs
4
answers
39
Determine the highest possible normal form of the given relation?
Consider the relation R(Name,courseNO,rolNO,grade) name,courseno >grade rollno,courseno>grade name>rollno rollno>name Given answer as it is 3NF . But Im getting 1NF. is it correct ?
answered
Feb 1, 2017
in
Computer Networks

251
views
databasenormalization
databases
2
answers
40
Self doubt
If the productions were: S> AC  BD A > a B > a C> c D> d For considering whethr this grmmar is LL(k) where, k>=2 , is left factoring essential? I think no because based on atleast 2 lookaheads, it would decide which production to take. In above example, only 1 lookahead is same.
answer edited
Feb 1, 2017
in
Compiler Design

113
views
left_factoring
50,737
questions
57,324
answers
198,408
comments
105,175
users