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.
Answers 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
0
votes
1
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
1 day
ago
in
Algorithms

51
views
timecomplexity
algorithms
0
votes
2
Peter Linz Exercise 4.3
answered
5 days
ago
in
Theory of Computation

28
views
theoryofcomputation
regularlanguage
pumpinglemma
0
votes
3
set theory and algebra
answered
Mar 14
in
Set Theory & Algebra

22
views
settheory&algebra
engineeringmathematics
discretemathematics
sets
0
votes
4
typedef
typedef int (*test)(float*, float*); test tmp; i am unable to understand the code ,please help!
answered
Mar 14
in
Programming

71
views
+1
vote
5
geeksforgeeks Computer NEtwork IP adressing
answered
Mar 14
in
Computer Networks

35
views
computernetworks
ip
adressing
0
votes
6
GATE20171GA1
After Rajendra Chola returned from his voyage to Indonesia, he ________ to visit the temple in Thanjavur. (A) was wishing (B) is wishing (C) wished (D) had wished
answered
Mar 10
in
Verbal Ability

835
views
gate20171
verbalability
tenses
englishgrammar
normal
0
votes
7
graph theory
can somebody explain the logic behind this theorem ?
answered
Mar 9
in
Graph Theory

39
views
graphtheory
discretemathematics
graphconnectivity
engineeringmathematics
+2
votes
8
rosen excercise
How many solutions are there to the equation x1 + x2 + x3 + x4 + x5 + x6 = 29, where xi , i = 1, 2, 3, 4, 5, 6, is a nonnegative integer such that a) x1 ≤ 5? b) x1 < 8 and x2 > 8?
answered
Mar 9
in
Combinatory

14
views
0
votes
9
algorithm
finf the tc T(n)=nlogn +T(n1)
answered
Mar 9
in
Algorithms

49
views
0
votes
10
ISI 2015 PCB C4 C
For the alphabet Σ = {a,b}, the enumeration of the strings of {a,b}* in the lexicographic order is following {ϵ, a, b, aa, ab, ba, bb, aaa, aab,...} List the fist 5 strings in lexicographic order, in the complement of {a, ab}*
answered
Mar 9
in
Theory of Computation

25
views
isi2015
theoryofcomputation
0
votes
11
ISI 2015 PCB C4 B
Draw a 4state DFA for the language $L \subseteq$ {a,b}* , L = {x : the number of time ab appears in x is even}
answered
Mar 9
in
Theory of Computation

33
views
theoryofcomputation
isi2015
finiteautomata
dfa
0
votes
12
Peter LinzChapter 3.1 Regular Expressions
answered
Mar 9
in
Theory of Computation

38
views
theoryofcomputation
regularexpressions
0
votes
13
Peter LinzChapter 3.1 Regular Expressions
answered
Mar 9
in
Theory of Computation

25
views
theoryofcomputation
regularexpressions
0
votes
14
Peter LinzChapter 3.1 Regular Expressions
answered
Mar 9
in
Theory of Computation

19
views
theoryofcomputation
regularexpressions
0
votes
15
MadeEasy Test Series
Consider the following schedule S : r1(A) w2(A) r3(A) w4(A) r5(A) w6(A) The number of schedules equal to given schedule(s) which not conflict equal to schedule(s) are _______.
answered
Mar 9
in
Databases

178
views
databases
transactions
0
votes
16
maximum records in join operation ME mock
answered
Mar 8
in
Databases

45
views
+1
vote
17
ISRO 2013  Matrices [Mech]
If A is Square Matrix of order 3, then product of A and its transpose is (a) Unit Matrix (b) Zero Matrix (c) Identity Matrix (d) Symmetric Matrix
answered
Mar 8
in
Linear Algebra

45
views
engineeringmathematics
isro
isromech
+2
votes
18
Code optimization
Consider the following source code : c = a + b d = c c = c – e a = d – e b = b * e b = d/b (A) No optimization is possible (B) d = c c = c – e a = d – e b = b * e b = d/b (C) c = a + b d = c c = c – e a = d – e b = d/b (D) c = a + b t = b * e a = d – e b = d/t c = a
answered
Mar 8
in
Compiler Design

39
views
codeoptimization
compilerdesign
0
votes
19
techtud c programming
Ans is C can anybody justify why compilation error
answered
Mar 8
in
Programming

64
views
programminginc
output
+2
votes
20
k.Rosen excercise. . How many positive integers less than 1000....
answered
Mar 8
in
Combinatory

39
views
0
votes
21
Ace Test Series_Mock Test1_Question 23
answered
Mar 8
in
Algorithms

27
views
acetestseries
algorithms
+1
vote
22
palindrome TOC
answered
Mar 8
in
Theory of Computation

23
views
+1
vote
23
ISRO 2013 Probability [Mech]
If the probability for A to fail an examination is 0.2 and that for B is 0.3, then probability that either A of B fail is (a) 0.5 (b) 0.06 (c) 0.44 (d) 0.38
answered
Mar 8
in
Probability

40
views
engineeringmathematics
isromech
probability
0
votes
24
GATE2017135
Consider the following two functions. void fun1(int n) { if(n == 0) return; printf("%d", n); fun2(n  2); printf("%d", n); } void fun2(int n) { if(n == 0) return; printf("%d", n); ... n); } The output printed when $\text{fun1}(5)$ is called is (A) $53423122233445$ (B) $53423120112233$ (C) $53423122132435$ (D) $53423120213243$
answered
Mar 7
in
Programming

888
views
gate20171
programming
normal
tricky
+1
vote
25
Consider the following program segment
answered
Mar 6
in
Programming

29
views
+2
votes
26
program output
char *c[] = {"GeksQuiz", "MCQ", "TEST", "QUIZ"}; char **cp[] = {c+3, c+2, c+1, c}; char ***cpp = cp; int main() { printf("%s ", **++cpp); printf("%s ", **++cpp+3); printf("%s ", *cpp[2]+3); printf("%s ", cpp[1][1]+1); return 0; }
answered
Mar 6
in
Programming

91
views
programminginc
pointers
0
votes
27
propositional logic
answered
Mar 6
in
Mathematical Logic

20
views
propositionallogic
discretemathematics
mathematicallogic
firstorderlogic
engineeringmathematics
+1
vote
28
propositional logic
Let x be { } (empty set) and P(x) be a predicate function , then which of the following is TRUE ? A) "for all x,P(x)" is TRUE and "there exists atleast one x ,P(x)" is TRUE B) "for all x,P(x)" is TRUE ... ,P(x)" is TRUE D) "for all x,P(x)" is FALSE and "there exists atleast one x ,P(x)" is FALSE
answered
Mar 6
in
Mathematical Logic

44
views
propositionallogic
discretemathematics
mathematicallogic
firstorderlogic
engineeringmathematics
+1
vote
29
GATE2017144
In a RSA cryptosystem, a participant $A$ uses two prime numbers $p = 13$ and $q = 17$ to generate here public and private keys. If the public key of $A$ is $35$, then the private key of $A$ is __________ .
answered
Mar 5
in
Computer Networks

548
views
gate20171
networksecurity
computernetworks
rsasecuritynetworks
numericalanswers
normal
+1
vote
30
GATE2017136
Consider the C functions foo and bar given below: int foo(int val) { int x=0; while(val > 0) { x = x + foo(val); } return val; } int bar(int val) { int x = 0; while(val > 0) { x ... 6 and 6 respectively. (B) Infinite loop and abnormal termination respectively. (C) Abnormal termination and infinite loop respectively. (D) Both terminating abnormally.
answered
Mar 5
in
Programming

799
views
gate20171
programminginc
programming
normal
0
votes
31
GATE2017129
Let $p$, $q$ and $r$ be propositions and the expression $\left ( p\rightarrow q \right )\rightarrow r$ be a contradiction. Then, the expression $\left ( r\rightarrow p \right )\rightarrow q$ is (A) a tautology. (B) a contradiction. (C) always TRUE when $p$ is FALSE. (D) always TRUE when $q$ is TRUE.
answered
Mar 5
in
Mathematical Logic

437
views
gate20171
mathematicallogic
predicatelogic
0
votes
32
GATE2017117
Consider the following grammar: $P\rightarrow xQRS$ $Q\rightarrow yzz$ $R\rightarrow w\varepsilon$ $S\rightarrow y$ What is FOLLOW($Q$)? (A) $\left \{ R \right \}$ (B) $\left \{ w \right \}$ (C) $\left \{ w,y \right \}$ (D) $\left \{ w,\$ \right \}$
answered
Mar 5
in
Compiler Design

444
views
gate20171
compilerdesign
parsing
firstandfollow
0
votes
33
GATE2017116
The following functional dependencies hold true for the relational schema $R\left \{V,W,X,Y,Z \right \}$: V $\rightarrow$ W VW $\rightarrow$ X Y $\rightarrow$ VX Y $\rightarrow$ Z Which of the following is irreducible equivalent for this set of ... $\rightarrow$ Z (D) V $\rightarrow$ W W $\rightarrow$ X Y $\rightarrow$ V Y $\rightarrow$ X Y $\rightarrow$ Z
answered
Mar 5
in
Databases

585
views
gate20171
databases
functionaldependencies
normal
0
votes
34
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.
answered
Mar 5
in
Programming

933
views
gate20171
programminginc
programming
+1
vote
35
GATE2017112
Consider the following intermediate program in three address code p = a  b q = p * c p = u * v q = p + q Which one of the following corresponds to a static single assignment form of the above code? (A) p1 = a  b q1 = p1 * c p1 = u * v q1 = p1 + q1 (B) p3 = a  b q4 ... b q1 = p2 * c p3 = u * v q2 = p4 + q3 (D) p1 = a  b q1 = p * c p2 = u * v q2 = p + q
answered
Mar 4
in
Compiler Design

521
views
gate20171
compilerdesign
intermediatecode
normal
staticsingleassignment
+2
votes
36
GATE201719
When two 8bit numbers $A_{7}...A_{0}$ and $B_{7}...B_{0}$ in 2's complement representation (with $A_{0}$ and $B_{0}$ as the least significant bits) are added using a ripplecarry adder, the sum bits obtained are $S_{7}...S_{0}$ and the carry bits are $C_{7}...C_{0} ... is 1. (D) $\left ( A_{0}.B_{0}.\bar{S_{0}}+\bar{A_{0}}.\bar{B_{0}}.S_{0} \right )$ is 1.
answered
Mar 4
in
Digital Logic

520
views
gate20171
digitallogic
numberrepresentation
0
votes
37
TIFR 2012 Probability
Amar and Akbar both tell the truth with probability 3/4 and lie with probability 1/4. Amar watches a test match and talks to Akbar about the outcome. Akbar, in turn, tells Anthony, "Amar told me that India won". What probability should Anthony assign to India's win? (a) 9/16 (b) 6/16 (c) 7/16 (d) 10/16
answered
Mar 4
in
Probability

60
views
engineeringmathematics
tifr2012
+3
votes
38
GATE2017114
Consider a TCP client and a TCP server running on two different machines. After completing data transfer, the TCP client calls close to terminate the connection and a FIN segment is sent to the TCP server. Serverside TCP responds by sending an ACK, which is received ... FIN from the serverside TCP? (A) LASTACK (B) TIMEWAIT (C) FINWAIT1 (D) FINWAIT2
answered
Mar 4
in
Computer Networks

777
views
gate20171
computernetworks
tcp
+1
vote
39
ISRO 2006 ECE K Map
The function shown in the figure when simplified will yield a result with____ terms a)2 b) 4 c) 7 d) 14
answered
Mar 3
in
Digital Logic

54
views
isro
digitallogic
isroece
+2
votes
40
GATE201717
The nbit fixedpoint representation of an unsigned real number $X$ uses $f$ bits for the fraction part. Let $i = nf$. The range of decimal values for $X$ in this representation is (A) $2^{f}$ to $2^{i}$ (B) $2^{f}$ to $\left ( 2^{i}  2^{f} \right )$ (C) 0 to $2^{i}$ (D) 0 to $\left ( 2^{i}  2^{f} \right )$
answered
Mar 3
in
Digital Logic

605
views
gate20171
digitallogic
numberrepresentation
fixedpointrepresentation
Page:
1
2
next »
21,446
questions
26,759
answers
60,943
comments
22,955
users