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
Chat
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.
Answers by Prashant.
User Prashant.
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User Prashant.
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
+1
vote
1
GATE2017104
Consider the following functions from positive integers to real numbers: $10$, $\sqrt{n}$, $n$, $\log_{2}n$, $\frac{100}{n}$. The CORRECT arrangement of the above functions in increasing order of asymptotic complexity is: (A) $\log_{2}n$, $\frac{100}{n}$, $10$, $\sqrt ... $\sqrt{n}$, $\log_{2}n$, $n$ (D) $\frac{100}{n}$, $\log_{2}n$, $10$, $\sqrt{n}$, $n$
answered
5 hours
ago
in
Algorithms

885
views
gate20171
algorithms
asymptoticnotations
normal
+2
votes
2
Made Easy test series
"A" sort a particular dataset of size n using merge sort in 640 msec, "B" uses the same algorithm on dataset of size 16, it takes 256 msec to sort them. what is size of data set used by "A" A. 32 B. 64 C. 128 D. None of above
answered
3 days
ago
in
Algorithms

48
views
0
votes
3
why this program give "Invalid memory reference" error explain it?
answered
6 days
ago
in
Programming

62
views
programminginc
0
votes
4
T(n)=16T(n/4)+n! using the Master Theorem
answered
Apr 18
in
Algorithms

200
views
algorithms
mastertheorem
+1
vote
5
Rosen chapter6 (counting)
How many solutions are there to the equation x1 + x2 + x3 + x4 + x5 = 21, where xi , i = 1, 2, 3, 4, 5, is a nonnegative integer such that: 0$\leq$ x1$\leq$10 ?
answered
Apr 14
in
Combinatory

120
views
discretemathematics
kennethrosen
+2
votes
6
Rosen chapter6 (counting)
How many solutions are there to the equation x1 + x2 + x3 + x4 + x5 = 21, where xi , i = 1, 2, 3, 4, 5, is a nonnegative integer such that: 0$\leq$ x1$\leq$10 ?
answered
Apr 14
in
Combinatory

120
views
discretemathematics
kennethrosen
+3
votes
7
kenneith rosen
At least how many numbers should be selected from the set {1, 5, 9, 13, …125} to be assured that two of the numbers selected have a sum of 146?
answered
Apr 13
in
Set Theory & Algebra

87
views
kennethrosen
discretemathematics
+1
vote
8
GATE20011.4
Consider the following two statements: $S1: \left\{ 0^{2n} \mid n \geq 1 \right\}$ is a regular language $S2: \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 S1 is correct Only S2 is correct Both S1 and S2 are correct None of S1 and S2 is correct
answered
Apr 13
in
Theory of Computation

321
views
gate2001
theoryofcomputation
regularset
easy
+2
votes
9
Rosen, Discrete Mathematics ,counting
answered
Apr 11
in
Combinatory

36
views
+2
votes
10
Gatebook Test
A man ate 300 mangoes in 15 days , each day eating two more than the previous day . How many mangoes did he eat on the 3rd day?
answered
Apr 10
in
Numerical Ability

84
views
+1
vote
11
GATE200580
The ALU, the bus and all the registers in the data path are of identical size. All operations including incrementation of the PC and the GPRs are to be carried out in the ALU. Two clock cycles are needed for memory read operation – ... M[PC]; The minimum number of CPU clock cycles needed during the execution cycle of this instruction is: 2 3 4 5
answered
Apr 8
in
CO & Architecture

978
views
co&architecture
normal
gate2005
datapath
machineinstructions
+3
votes
12
GATE200759
Information about a collection of students is given by the relation $\text{studInfo(}\underline{\text{studId}},\text{ name, sex)}$. The relation $\text{enroll(}\underline{\text{studId}}, \underline{\text{ courseId}})$ gives which ... in which a proper subset of female students are enrolled. Courses in which only male students are enrolled. None of the above
answered
Apr 7
in
Databases

1.4k
views
gate2007
databases
relationalalgebra
normal
+3
votes
13
Average Access time in Memory Organization
answered
Apr 5
in
CO & Architecture

647
views
cachememory
co&architecture
fault
+4
votes
14
c language
#include <stdio.h> int main() { int a = 1; int b = 1; int c = a  b; printf("%d %d",c,b); } Answer is given 1, 1 but i m having doubt in logical OR operator and uninary operator .uni operator having higher precedence then so we firstly decrement the 'b' and then perform OR by which i got output 1,0 where i m wrong plz explain.
answered
Apr 4
in
Programming

49
views
+2
votes
15
Peter Linz Exercise 8.1
#8 Determine whether or not the following languages are contextfree (a) L= { anwwRan : n>=0 , w ∈ {a,b}* } (b) L = { anbjanbj : n>=0, j>=0 } (c) L = { anbjajbn : n>=0, j>=0 } (d) L= { anbjakbl : n+j<=k+l } (e) L ... nb(w)=2nc(w) } My answers are : (a)CFL (b)Not CFL (c)CFL (d) CFL (e)Not CFL (f)Not CFL (g) Not CFL Please verify.
answered
Apr 3
in
Theory of Computation

56
views
theoryofcomputation
contextfree
+2
votes
16
GATE2017154
A cache memory unit with capacity of $N$ words and block size of $B$ words is to be designed. If it is designed as a direct mapped cache, the length of the TAG field is 10 bits. If the cache unit is now designed as a 16way setassociative cache, the length of the TAG field is ____________ bits.
answered
Apr 3
in
CO & Architecture

1.4k
views
gate20171
co&architecture
cachememory
normal
numericalanswers
+4
votes
17
ISRO2016ECE Digital Logic
How many inputs & outputs does a full adder have? (a) 3, 2 (b) 2, 3 (c) 3, 3 (d) 2, 2
answered
Feb 21
in
Digital Logic

55
views
isro2016ece
digitallogic
+3
votes
18
GATE2017239
Let $\delta$ denote the transition function and $\widehat{\delta}$ denote the extended transition function of the $\epsilon$NFA whose transition table is given below: $\delta$ $\epsilon$ $a$ $b$ $\rightarrow \: q_0$ $\{q_2\}$ $\{q_1\}$ $\{q_0\}$ $q_1$ $\{q_2\}$ $\ ... }(q_2, aba)$ is $\emptyset$ $\{q_0, q_1, q_3\}$ $\{q_0, q_1, q_2\}$ $\{q_0, q_2, q_3 \}$
answered
Feb 14
in
Theory of Computation

918
views
gate20172
+4
votes
19
GATE2017241
Let $L(R)$ be the language represented by regular expression $R$. Let $L(G)$ be the language generated by a context free grammar $G$. Let $L(M)$ be the language accepted by a Turing machine $M$. Which of the following decision problems are undecidable? Given a ... $w$, is $w \in L(M)$? I and IV only II and III only II, III and IV only III and IV only
answered
Feb 14
in
Theory of Computation

890
views
gate20172
theoryofcomputation
+4
votes
20
GATE2017253
Consider a machine with a byte addressable main memory of $2^{32}$ bytes divided into blocks of size 32 bytes. Assume that a direct mapped cache having 512 cache lines is used with this machine. The size of the tag field in bits is _______
answered
Feb 14
in
CO & Architecture

1.1k
views
gate20172
co&architecture
cachememory
numericalanswers
+3
votes
21
GATE2017216
Identify the language generated by the following grammar, where $S$ is the start variable. $$ S \rightarrow XY$$ $$ X \rightarrow aX \mid a$$ $$ Y \rightarrow aYb \mid \epsilon$$ $\{a^mb^n \mid m \geq n, n > 0 \}$ $ \{ a^mb^n \mid m \geq n, n \geq 0 \}$ $\{a^mb^n \mid m > n, n \geq 0 \}$ $\{a^mb^n \mid m > n, n > 0 \}$
answered
Feb 14
in
Theory of Computation

684
views
gate20172
theoryofcomputation
+1
vote
22
GATE20172GA5
There are 3 red socks, 4 green socks and 3 blue socks. You choose 2 socks. The probability that they are of the same colour is 1/5 7/30 1/4 4/15
answered
Feb 14
in
Numerical Ability

805
views
gate20172
numericalability
probability
+10
votes
23
GATE2017225
The minimum possible number of states of a deterministic finite automaton that accepts the regular language $L$ = {$w_{1}aw_{2}$  $w_{1},w_{2}$ $\in$ $\left \{ a,b \right \}^{*}$ , $\left  w_{1} \right  = 2, \left  w_{2} \right \geq 3$} is ______________ .
answered
Feb 14
in
Theory of Computation

1k
views
theoryofcomputation
gate20172
dfa
numericalanswers
+17
votes
24
GATE2017221
Consider the set $X=\{a, b, c, d, e\}$ under partial ordering $R=\{(a,a), (a, b), (a, c), (a, d), (a, e), (b, b), (b, c), (b, e), (c, c), (c, e), (d, d), (d, e), (e, e) \}$. The Hasse diagram ... Hasse diagram of the partial order $(X, R)$ is shown below. The minimum number of ordered pairs that need to be added to $R$ to make $(X, R)$ a lattice is ______
answered
Feb 14
in
Set Theory & Algebra

786
views
gate20172
discretemathematics
lattice
numericalanswers
+2
votes
25
GATE2017254
Consider the following C program. #include<stdio.h> int main () { int m=10; int n, n1; n=++m; n1=m++; n; n1; n=n1; printf(“%d”, n); return 0; } The output of the program is ______
answered
Feb 14
in
Programming

921
views
gate20172
programminginc
numericalanswers
+8
votes
26
GATE2017234
Consider the binary code that consists of only four valid codewords as given below: 00000, 01011, 10101, 11110 Let the minimum Hamming distance of the code $p$ and the maximum number of erroneous bits that can be corrected by the code be $q$. Then the values of $p$ and $q$ are $p=3$ and $q=1$ $p=3$ and $q=2$ $p=4$ and $q=1$ $p=4$ and $q=2$
answered
Feb 14
in
Digital Logic

749
views
gate20172
digitallogic
hammingcode
+2
votes
27
GATE2017214
Consider the following function implemented in C: void printxy(int x, int y) { int *ptr; x=0; ptr=&x; y=*ptr; *ptr=1; printf(“%d, %d”, x, y); } The output of invoking printxy(1,1) is 0, 0 0, 1 1, 0 1, 1
answered
Feb 14
in
Programming

744
views
gate20172
programminginc
+4
votes
28
GATE2017211
Let $p, q, r$ denote the statements It is raining , It is cold , and It is pleasant , respectively. Then the statement It is not raining and it is pleasant, and it is not pleasant only if it is raining and it is cold is represented by $(\neg p \wedge ... r) \vee ((p \wedge q) \rightarrow \neg r)$ $(\neg p \wedge r) \vee (r \rightarrow (p \wedge q))$
answered
Feb 14
in
Mathematical Logic

951
views
gate20172
mathematicallogic
predicatelogic
+5
votes
29
GATE201722
Match the following: P. static char var; i. Sequence of memory locations to store addresses Q. m=malloc(10); m=NULL; ii. A variable located in data section of memory R. char *ptr[10]; iii. Request to allocate a CPU register to store data S. register int varl; iv. A lost memory ... Siii Pii; Qi; Riv; Siii Pii; Qiv; Riii; Si Piii; Qiv; Ri; Sii
answered
Feb 14
in
Programming

771
views
gate20172
programming
programminginc
+18
votes
30
GATE2017213
A circular queue has been implemented using a singly linked list where each node consists of a value and a single pointer pointing to the next node. We maintain exactly two external pointers FRONT and REAR pointing to the front node and the rear node of the queue, respectively. ... (I) only. (B) (II) only. (C) Both (I) and (II). (D) Neither (I) nor (II).
answered
Feb 14
in
DS

2.5k
views
gate20172
datastructure
+2
votes
31
dpda }} Linz7.34
DPDA for $L = \left \{ a^nb^n:n\geq 1 \right \} \cup\left \{ a \right \}$
answered
Dec 7, 2016
in
Theory of Computation

102
views
pushdownautomata
theoryofcomputation
+4
votes
32
Discrete Maths
Explain each one of the following: a ) In how many ways can we put 31 people in 3 rooms such that each room has an odd number of people ? b ) Coefficient of $x^4$ in the expansion $(1+ x + x^2 + x^3)^{11}$ using generating functions. c)Find out number of solutions $x_1+x_2+x_3 = 20 , 2<x_1<6 , 6<x_2<10 , 0<x_3<5$
answered
Dec 6, 2016
in
Mathematical Logic

373
views
combinatory
+3
votes
33
Calicut Gate Academy Test Series  TOC Q32
answered
Dec 5, 2016
in
Theory of Computation

87
views
testseries
calicutgateacademytestseries
theoryofcomputation
turingmachine
+3
votes
34
Find the predicate logic for the following statement.
answered
Dec 5, 2016
in
Mathematical Logic

106
views
engineeringmathematics
mathematicallogic
+3
votes
35
cormen chapter 23 third edition.
answered
Dec 1, 2016
in
Algorithms

121
views
algorithms
Page:
1
2
3
4
5
6
...
15
next »
22,147
questions
28,138
answers
63,516
comments
24,290
users