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 2018
User 2018
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User 2018
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
4
answers
1
GATE2004IT77
Consider the following schedule S of transactions T1 and T2: T1 T2 Read(A) A = A  10 Read (A) Temp = 0.2*A Write(A) Read(B) Write(A) Read(B) B = B + 10 Write(B) B = B + Temp Write(B) Which of the following is TRUE about the ... as T1, T2 S is serializable only as T2, T1 S is serializable both as T1, T2 and T2, T1 S is serializable either as T1 or as T2
commented
Apr 16
in
Databases

593
views
gate2004it
databases
transactions
normal
0
answers
2
ISI 2013 Subjective
Q C4 b) If it is known that the language L1=$\left \{ 0^{n}1^{n}2^{i}\mid n\neq i \right \}$ is not a context free language (CFL). Now consider the language L2=$\left \{ 0^{i}1^{n}2^{n}\mid i\neq ... not CFL by converting L2 into L1 by applying two operation, both know to be closed on CFLs. What are two operation you will use for this construction.
commented
Apr 5
in
Theory of Computation

51
views
isi2013
theoryofcomputation
cfl
3
answers
3
combinatorics
THERE ARE 10 PRIZES AND 4 STUDENTS. WE WANT ONLY TWO STUDENTS TO GET THE PRIZES. HOW MANY WAYS ARE THERE??
commented
Apr 5
in
Mathematical Logic

91
views
discretemathematics
permutationsandcombinations
4
answers
4
ISRO201436
Consider a standard Circular Queue implementation (which has the same condition for Queue Full and Queue Empty) whose size is $11$ and the elements of the queue are $q[0], q[1], \ldots q[10]$. The front and rear pointers are initialized to point at $q[2]$. In which position will the ninth element be added? $q[0]$ $q[1]$ $q[9]$ $q[10]$
answer selected
Apr 5
in
DS

1.2k
views
datastructure
queues
isro2014
1
answer
5
theory of computation
Eliminate all Null productions from S $\rightarrow$ AaB  aaB, A $\rightarrow$ Null B $\rightarrow$ bbA Null.
commented
Apr 5
in
Theory of Computation

49
views
theoryofcomputation
grammar
1
answer
6
#hpsc asst professor
A set of techniques that allow to execute a program which is not entirely in memory is? ademand paging bvirtual memory cauxilary memory dsecondary memory
commented
Apr 5
in
Operating System

76
views
1
answer
7
theory of computation
I guess the Language , L = { } ...please verify ...
answered
Apr 5
in
Theory of Computation

35
views
theoryofcomputation
grammar
3
answers
8
Gate math book
Find the sum of n terms of the series $log a+ log \frac{a^{2}}{b} + log \frac{a^{3}}{b^{2}}+ ...$ to n terms
answered
Apr 5
in
Mathematical Logic

61
views
engineeringmathematics
2
answers
9
theory of computation
Let L = {anbn : n ≥ 0}...Is complement of the language L , DCFL or not ??? please explain your answer ...I feel it is a DCFL ...
answered
Apr 5
in
Theory of Computation

45
views
theoryofcomputation
regularexpressions
contextfree
3
answers
10
theory of computation
The language generated by the below grammar is S > aSS / b
commented
Apr 5
in
Theory of Computation

106
views
theoryofcomputation
finiteautomata
1
answer
11
theory of computation
The language L = {anbm : 2n ≤ m ≤ 3n} is a Non deterministic CFL but not a DCFL right ??? please correct me if i am wrong ...
answer selected
Apr 5
in
Theory of Computation

25
views
theoryofcomputation
#contextfreelanguage
1
answer
12
ISI 2004 MIII
Q14 The inequality $\frac{2gx+x^{2}}{1x+x^{2}}\leq 3$ is true for all the value of x if and only if A) $1\leq g\leq 7$ B) $1\leq g\leq 1$ C) $6\leq g\leq 7$ D) $1\leq g\leq 7$
commented
Apr 4
in
Set Theory & Algebra

83
views
isi2004
inequality
1
answer
13
ISI 2004 MIII
commented
Apr 4
in
Combinatory

38
views
permutationsandcombinations
isi2004
3
answers
14
theory of computation
Is the language given below regular or not ? I feel it is regular. The equivalent language is, L = {anblak ; n>=1,l>=1,k>=1 }  { a1b1a1 , a1b1a2 , a1b1a3 , a1b2a1 , a1b2a2 , a1b3a1 and few more strings (but ... is regular ... QUESTION TAKEN FROM PETER LINZ TEXTBOOK AND ANSWER WAS NOT GIVEN. So please verify whether i am correct ...???
answer selected
Apr 4
in
Theory of Computation

55
views
theoryofcomputation
finiteautomata
2
answers
15
ISI 2004 MIII
Q7 The equation $x^{6}5x^{4}+16x^{2}72x+9=0$ has A) Exactly two distinct real roots B) Exactly three distinct real roots C) Exactly four distinct real roots D) six different real roots
commented
Apr 4
in
Set Theory & Algebra

64
views
isi2004
polynomials
1
answer
16
ME test
Let f(n) = Ω(n), g(n) = O(n), h(n) = θ(n). Then [ f(n) + g(n)]  h(n) is ______________ ? A) Ω(n2) B) O(n) C) θ(n) D) None
commented
Apr 4
in
Algorithms

59
views
2
answers
17
theory of computation
Let L = {anblak: n = l or l ≠ k}. The language is A) regular B) DCFL but not regular. C) NDCFL but not DCFL. D) context sensitive but not CFL. The Option is C) right ...??? Please verify ...
commented
Apr 4
in
Theory of Computation

33
views
theoryofcomputation
finiteautomata
4
answers
18
GATE200763, ISRO201659
The order of a leaf node in a B$^+$  tree is the maximum number of (value, data record pointer) pairs it can hold. Given that the block size is 1K bytes, data record pointer is 7 bytes long, the value field is 9 bytes long and a block pointer is 6 bytes long, what is the order of the leaf node? 63 64 67 68
commented
Apr 4
in
Databases

3.3k
views
gate2007
databases
btree
normal
isro2016
3
answers
19
GATE2017111
Consider the C struct defined below: struct data { int marks [100]; char grade; int cnumber; }; struct data student; The base address of student is available in register R1. The field student.grade can be accessed efficiently using (A) Post ... , R1 (D) Index addressing mode, X(R1), where X is an offset represented in 2's complement 16bit representation.
commented
Apr 4
in
CO & Architecture

738
views
gate20171
co&architecture
addressingmodes
1
answer
20
theory of computation
L = {an: n is either prime or the product of two or more prime numbers}, This language is regular ...right ? Please verify ... The equivalent language is L = { an ; n >= 2 } ...right ?
answered
Apr 4
in
Theory of Computation

34
views
theoryofcomputation
finiteautomata
1
answer
21
ISI 2004 MIII
Q9 The equation' $\frac{1}{3}+\frac{1}{2}s^{2}+\frac{1}{6}s^{3}=s$ has A) exactly three solution in [0.1] B) exactly one solution in [0,1] C) exactly two solution in [0,1] D) no solution in [0,1]
answered
Apr 3
in
Set Theory & Algebra

24
views
isi2004
polynomials
1
answer
22
ISI 2004 MIII
Q8 If $\alpha 1,\alpha 2,\alpha 3....\alpha n$ be the roots of $x^{n}+1=0$, then $\left ( 1\alpha 1 \right )*\left ( 1\alpha 2 \right )...\left ( 1\alpha n \right )$ is equal to A) 1 B) 0 C) n D) 2
answered
Apr 3
in
Set Theory & Algebra

24
views
isi2004
polynomials
0
answers
23
some suggestion from expert and experience people needed? please take yr time and comment here..
asked
Apr 3
in
NITs

31
views
2
answers
24
deterministic and non deterministic push down automata
commented
Apr 1
in
Theory of Computation

294
views
1
answer
25
tanenbaum
An upperlayer packet is split into 10 frames, each of which has an 80% chance of arriving undamaged. If no error control is done by the data link protocol, how many times must the message be sent on average to get the entire thing through? how is it different if we use error control ?
answered
Apr 1
in
Computer Networks

32
views
computernetworks
tanenbaum
1
answer
26
CFG (Timothy WIlliams)
The following CFG S>aS bS a b is equivalent to the regular expression a)(a*+b)* b)(a+b)+ c)(a+b)(a+b)* d)(a+b)* (a+b)
answer selected
Mar 30
in
Theory of Computation

44
views
1
answer
27
theory of computation
The number of prefixes and suffixes respectively in the string "abbab" are ___ and ___ .
answer selected
Mar 30
in
Theory of Computation

37
views
theoryofcomputation
1
answer
28
From a Question bank
answered
Mar 30
in
Calculus

50
views
calculus
limits
engineeringmathematics
gate
2
answers
29
Which circle should I choose for BSNL jto CSE OC AIR1370 n.marks50.29?
commented
Mar 28
in
Job Queries

340
views
2
answers
30
C Programming (interview)
WAP where smallest subarrays with sum greater than x? Say an array={1,5,6,2,45,17}; Now, x=60 Now we have to find smallest subarray which is greater than x
commented
Mar 23
in
Programming

133
views
programminginc
output
3
answers
31
GATE2017250
A message is made uo entirely of characters from the set $X=\{P, Q, R, S, T\}$. The table of probabilities for each of the characters is shown below: Character Probability P 0.22 Q 0.34 R 0.17 S 0.19 T 0.08 Total 1.00 If a message of 100 characters over $X$ is encoded using Huffman coding, then the expected length of the encoded message in bits is ______.
commented
Mar 23
in
Computer Networks

966
views
gate20172
huffmancode
numericalanswers
3
answers
32
MIT Course
For each group of functions, sort the functions in increasing order of asymptotic (bigO) complexity: $\begin{align*} &(a) \;\;f1(n) = n^{0.999999} * \log n \\ &(b) \;\;f2(n) = 10000000n \\ &(c) \;\; ... exponential function, but since the power is to 1.000001, it is growing very slowly, since base is tending to 1 only. Someone please check this.
answered
Mar 22
in
Algorithms

114
views
timecomplexity
algorithms
3
answers
33
GATE2017113
Consider the following C code: #include<stdio.h> int *assignval (int *x, int val) { *x = val; return x; } void main () { int *x = malloc(sizeof(int)); if (NULL == x) return; x = assignval (x,0); ... not as shown. (C) compiles successfully but execution may result in dangling pointer. (D) compiles successfully but execution may result in memory leak.
commented
Mar 19
in
Programming

1.2k
views
gate20171
programminginc
programming
3
answers
34
recursion in c
output of program: void function(int); void main() { function(3); } void function(int num){ if(num>0) { function(num); printf("%d",num); function(num); } } will the argument num value be retained at all recursion levels?
answer selected
Mar 18
in
Programming

123
views
programminginc
recursion
1
answer
35
Peter Linz Exercise 4.3
answered
Mar 18
in
Theory of Computation

34
views
theoryofcomputation
regularlanguages
pumpinglemma
2
answers
36
typedef
typedef int (*test)(float*, float*); test tmp; i am unable to understand the code ,please help!
commented
Mar 15
in
Programming

110
views
2
answers
37
geeksforgeeks Computer NEtwork IP adressing
commented
Mar 15
in
Computer Networks

78
views
computernetworks
ip
adressing
1
answer
38
source
void fun(int **pptr) { int q = 10; *pptr = &q; } int main() { int r = 20; int *p = &r; fun(&p); printf("%d", *p); return 0; } The output of the program is 10 . But as q here is an automatic variable, the result shouldn't be 10.
commented
Mar 15
in
Programming

168
views
1
answer
39
ISRO 2007ECE Memory
A memory system of size 16K bytes is required to be designed using memory chips, which have 12 address lines and 4 data lines each. The number of such chips required to design the memory system is a) 2 b) 4 c) 8 d) 16
answer selected
Mar 14
in
CO & Architecture

184
views
isro
isroece
co&architecture
1
answer
40
probability
A man takes a step forward with probability 0.4 and backwards with probability 0.6 .find the probability that at the end of eleven steps he is just one step away from the starting point
commented
Mar 14
in
Probability

134
views
23,428
questions
30,143
answers
67,576
comments
28,472
users