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 Golam Murtuza
User Golam Murtuza
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User Golam Murtuza
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
5
answers
1
GATE200388
In the following $C$ program fragment, $j$, $k$, $n$ and TwoLog_n are integer variables, and $A$ is an array of integers. The variable $n$ is initialized to an integer $\geqslant 3$, and TwoLog_n is initialized to the value of $2^*\lceil \log_2(n) \rceil$ for (k = 3; k <= n; ... $\left\{m \mid m \leq n, \text{m is prime} \right\}$ { }
commented
Aug 27
in
Algorithms

3.1k
views
gate2003
algorithms
identifyfunction
normal
4
answers
2
GATE201246
Consider the set of strings on $\{0,1\}$ in which, every substring of $3$ symbols has at most two zeros. For example, $001110$ and $011001$ are in the language, but $100010$ is not. All strings of length less than $3$ are also in the language. A partially completed DFA that ...
commented
Aug 24
in
Theory of Computation

3.3k
views
gate2012
theoryofcomputation
finiteautomata
normal
4
answers
3
GATE200851
Match the following: $\small{\begin{array}{llll}\hline \text{E.} & \text{Checking that identifiers are declared before their use} & \text{P.} & \text{$ ... $\text{ER, FP, GS, HQ}$ $\text{ER, FP, GQ, HS}$ $\text{EP, FR, GS, HQ}$
commented
Aug 23
in
Theory of Computation

4.2k
views
gate2008
normal
theoryofcomputation
grammar
2
answers
4
GATE19903vi
Choose the correct alternatives (More than one may be correct). Recursive languages are: A proper superset of context free languages. Always recognizable by pushdown automata. Also called type $0$ languages. Recognizable by Turing machines.
commented
Aug 19
in
Theory of Computation

1.8k
views
gate1990
normal
theoryofcomputation
turingmachine
recursiveandrecursivelyenumerablelanguages
4
answers
5
ISI2014PCBCS4b
Consider the following statement: $\text{ For all languages }L \subseteq \{0, 1\}^*, \text{ if }L^* \text{ is regular then L is regular.}$ Is the above statement true? Justify your answer.
commented
Aug 18
in
Theory of Computation

495
views
descriptive
isi2014pcbcs
theoryofcomputation
regularlanguages
1
answer
6
GATE200853
Which of the following are regular sets? $\left\{a^nb^{2m} \mid n \geq 0, m \geq 0 \right\}$ $\left\{a^nb^m \mid n =2m \right\}$ $\left\{a^nb^m \mid n \neq m \right\}$ $\left\{xcy \mid x, y, \in \left\{a, b\right\} ^* \right\}$ I and IV only I and III only I only IV only
commented
Aug 18
in
Theory of Computation

2.2k
views
gate2008
theoryofcomputation
normal
regularlanguages
2
answers
7
GATE20011.4
Consider the following two statements: $S_1: \left\{ 0^{2n} \mid n \geq 1 \right\}$ is a regular language $S_2: \left\{0^m1^n0^{m+n} \mid m \geq 1 \text{ and } n \geq 1 \right\}$ is a regular language Which of the following statement is correct? Only $S_1$ is correct Only $S_2$ is correct Both $S_1$ and $S_2$ are correct None of $S_1$ and $S_2$ is correct
commented
Aug 18
in
Theory of Computation

1.8k
views
gate2001
theoryofcomputation
easy
regularlanguages
1
answer
8
GATE199216
Which of the following three statements are true? Prove your answer. The union of two recursive languages is recursive. The language $\{O^n \mid n\text{ is a prime} \}$ is not regular. Regular languages are closed under infinite union.
comment edited
Aug 17
in
Theory of Computation

1.2k
views
gate1992
theoryofcomputation
normal
closureproperty
1
answer
9
GATE199202,xiii
Choose the correct alternatives (more than one may be correct) and write the corresponding letters only: For a context free grammar, FOLLOW(A) is the set of terminals that can appear immediately to the right of nonterminal $A$ in some "sentential" form. ... . FOLLOW(A) and RFOLLOW(A) are always the same. All the three sets are identical. All the three sets are different.
commented
Aug 13
in
Compiler Design

1.7k
views
gate1992
parsing
compilerdesign
normal
2
answers
10
TIFR2012B17
Which of the following correctly describes $LR(k)$ parsing? The input string is alternately scanned left to right and right to left with $k$ reversals. Input string is scanned once left to right with rightmost derivation and $k$ symbol lookahead. $LR(k)$ ... . Input string is scanned from left to right once with $k$ symbol to the right as lookahead to give leftmost derivation.
commented
Aug 12
in
Compiler Design

522
views
tifr2012
compilerdesign
parsing
3
answers
11
TIFR2011A11
$\int_{0}^{1} \ln x\, \mathrm{d}x=$ $1$ $1$ $\infty $ $\infty $ None of the above.
comment edited
Aug 7
in
Calculus

556
views
tifr2011
calculus
integration
2
answers
12
ISI2004MIII13
Let $X =\frac{1}{1001}+\frac{1}{1002}+\frac{1}{1003}+\ldots+\frac{1}{3001}$. Then $X< 1$ $X>\frac{3}{2}$ $1< X< \frac{3}{2}$ none of the above
commented
Aug 6
in
Calculus

571
views
isi2004
engineeringmathematics
integration
7
answers
13
GATE2015226
Let $f(x)=x^{\left(\frac{1}{3}\right)}$ and $A$ denote the area of region bounded by $f(x)$ and the Xaxis, when $x$ varies from $1$ to $1$. Which of the following statements is/are TRUE? $f$ is continuous in $[1, 1]$ $f$ is not bounded in $[1, 1]$ $A$ is nonzero and finite II only III only II and III only I, II and III
commented
Aug 6
in
Calculus

4.8k
views
gate20152
continuity
functions
normal
0
answers
14
KPGCETCSE20191
The relational DBMS is constructed on relational principles which are based on The matrix theory Axiomatic principles Primary key Primary & foreign key relationship
commented
Aug 5
in
Others

26
views
kpgcetcse2019
4
answers
15
GATE2015116
For a set $A$, the power set of $A$ is denoted by $2^{A}$. If $A = \left\{5,\left\{6\right\}, \left\{7\right\}\right\}$, which of the following options are TRUE? $\phi \in 2^{A}$ $\phi \subseteq 2^{A}$ $\left\{5,\left\{6\right\}\right\} \in 2^{A}$ $\left\{5,\left\{6\right\}\right\} \subseteq 2^{A}$ I and III only II and III only I, II and III only I, II and IV only
commented
Jul 30
in
Set Theory & Algebra

5k
views
gate20151
settheory&algebra
sets
normal
3
answers
16
GATE200479
How many graphs on $n$ labeled vertices exist which have at least $\frac{(n^2  3n)}{ 2}$ edges ? $^{\left(\frac{n^2n}{2}\right)}C_{\left(\frac{n^23n} {2}\right)}$ $^{{\large\sum\limits_{k=0}^{\left (\frac{n^23n}{2} \right )}}.\left(n^2n\right)}C_k\\$ $^{\left(\frac{n^2n}{2}\right)}C_n\\$ $^{{\large\sum\limits_{k=0}^n}.\left(\frac{n^2n}{2}\right)}C_k$
comment edited
Jul 20
in
Graph Theory

4.4k
views
gate2004
graphtheory
permutationandcombination
normal
counting
6
answers
17
GATE20044, ISRO200926
The following numbers are inserted into an empty binary search tree in the given order: $10, 1, 3, 5, 15, 12, 16$. What is the height of the binary search tree (the height is the maximum distance of a leaf node from the root)? $2$ $3$ $4$ $6$
commented
Jul 18
in
DS

4.2k
views
gate2004
datastructure
binarysearchtree
easy
isro2009
6
answers
18
GATE200365
Consider the following $234$ tree (i.e., Btree with a minimum degree of two) in which each data item is a letter. The usual alphabetical ordering of letters is used in constructing the tree. What is the result of inserting $G$ in the above tree? None of the above
commented
Jul 16
in
Databases

2.9k
views
gate2003
databases
btree
normal
4
answers
19
GATE2016123
A database of research articles in a journal uses the following schema. $\text{(VOLUME, NUMBER, STARTPAGE, ENDPAGE, TITLE, YEAR, PRICE)}$ The primary key is '$\text{(VOLUME, NUMBER, STARTPAGE, ENDPAGE)}$ ... the weakest normal form that the new database satisfies, but the old one does not? $1NF$ $2NF$ $3NF$ $\text{BCNF}$
commented
Jul 16
in
Databases

5k
views
gate20161
databases
databasenormalization
normal
1
answer
20
GATE2019 ME2: GA9
Mola is a digital platform for taxis in a city. It offers three types of rides  Pool, Mini and Prime. The table below presents the number of rides for the past four months. The platform earns one US dollar per ride. What is the percentage share of the revenue contributed by Prime to ... $16.24$ $23.97$ $25.86$ $38.74$
commented
Jul 8
in
Numerical Ability

78
views
gate2019me2
generalaptitude
numericalability
datainterpretation
2
answers
21
TIFR2017A7
Consider the sequence $S_0, S_1, S_2, \dots$ defined as follows: $S_0=0, \: S_1=1 \: $ and $S_n=2S_{n1} + S_{n2}$ for $n \geq 2$. Which of the following statements is FALSE? for every $n \geq 1$, $S_{2n}$ is even for every $n \geq 1$, $S_{2n+1}$ is odd for every $n \geq 1$, $S_{3n}$ is multiple of $3$ for every $n \geq 1$, $S_{4n}$ is multiple of $6$ none of the above
comment edited
Jun 19
in
Combinatory

503
views
tifr2017
recurrence
9
answers
22
GATE2008IT66
Data transmitted on a link uses the following $2D$ parity scheme for error detection: Each sequence of $28$ bits is arranged in a $4\times 7$ matrix (rows $r_0$ through $r_3$, and columns $d_7$ through $d_1$) and is padded with a column $d_0$ and row $r_4$ of ... data received by a receiver and has $n$ corrupted bits. What is the minimum possible value of $n$? $1$ $2$ $3$ $4$
commented
Jun 16
in
Computer Networks

4.2k
views
gate2008it
computernetworks
normal
errordetection
5
answers
23
GATE20182
Consider the following C program: #include<stdio.h> struct Ournode{ char x, y, z; }; int main() { struct Ournode p={'1', '0', 'a'+2}; struct Ournode *q=&p; printf("%c, %c", *((char*)q+1), *((char*)q+2)); return 0; } The output of this program is: 0, c 0, a+2 '0', 'a+2' '0', 'c'
commented
May 19
in
Programming

4.4k
views
gate2018
programminginc
programming
structures
pointers
normal
5
answers
24
GATE2007IT80
Let $P_{1},P_{2},\ldots,P_{n}$ be $n$ points in the $xy$plane such that no three of them are collinear. For every pair of points $P_{i}$ and $P_{j}$, let $L_{ij}$ be the line passing through them. Let $L_{ab}$ be the line with the ... largest or the smallest $y$coordinate among all the points The difference between $x$coordinates $P_{a}$ and $P_{b}$ is minimum None of the above
commented
May 8
in
Linear Algebra

1.1k
views
gate2007it
cartesiancoordinates
5
answers
25
GATE200875
Consider the following C functions: int f1 (int n) { if(n == 0  n == 1) return n; else return (2 * f1(n1) + 3 * f1(n2)); } int f2(int n) { int i; int X[N], Y[N], Z[N]; X[0] = Y[0] = Z[0] = 0; X[1] = 1; Y[1] = 2; Z[1] = 3; for(i = 2; i < ... ; Z[i] = 3 * X[i]; } return X[n]; } $f1(8)$ and $f2(8)$ return the values $1661$ and $1640$ $59$ and $59$ $1640$ and $1640$ $1640$ and $1661$
commented
May 1
in
Algorithms

1.8k
views
gate2008
normal
algorithms
timecomplexity
5
answers
26
TIFR2016B1
A Boolean formula is said to be a $tautology$ if it evaluates to TRUE for all assignments to its variables. Which one of the following is NOT a tautology? $(( p \vee q) \wedge (r \vee s)) \Rightarrow (( p \wedge r) \vee q \vee s)$ ... $(( p \vee q ) \wedge ( r \vee s)) \Rightarrow ( p \vee q)$
commented
Apr 29
in
Digital Logic

347
views
tifr2016
booleanalgebra
0
answers
27
#DBMS#Transaction
commented
Apr 17
in
Databases

22
views
1
answer
28
Gateoverflow Hard copy Pune
Last 1 and half month before I got gateoverflow hard copy I havent used it due to workload in office . In next month I am travelling outside india for official work for 6 months due to which I will not use these books so anybody want these books ... I live near hinjewadi . @Arjun sir ,Sorry for irrelevant post I thought it will be helpful for someone who really need it .
answered
Apr 14
in
Others

49
views
1
answer
29
GO pdf hard copy
Pre booking for GO pdf hardcopy available?
asked
Apr 14
in
Study Resources

79
views
0
answers
30
# Binary tree
A weight balanced tree is a binary tree in which for each node, the no. of nodes in the left sub tree is atleast half and at most twice the no. of nodes in the right sub tree. The maximum possible height of such a tree with n nodes is best described by which of the following? (a) log2 n (b) log4/3 n (c) log3 n (d) log3/2 n
asked
Apr 13
in
DS

36
views
0
answers
31
I want to buy go pdf hardcopy for gate 2020,how can i get that
commented
Mar 26
in
Others

393
views
50,647
questions
56,497
answers
195,494
comments
100,826
users