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
0
answers
1
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
12 hours
ago
in
Programming

56
views
programminginc
output
cprogramming
2
answers
2
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
12 hours
ago
in
Computer Networks

738
views
gate20172
huffmancode
numericalanswers
2
answers
3
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
3
answers
4
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
4 days
ago
in
Programming

933
views
gate20171
programminginc
programming
2
answers
5
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
5 days
ago
in
Programming

60
views
programminginc
recursion
1
answer
6
Peter Linz Exercise 4.3
answered
5 days
ago
in
Theory of Computation

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

71
views
2
answers
8
geeksforgeeks Computer NEtwork IP adressing
commented
Mar 15
in
Computer Networks

35
views
computernetworks
ip
adressing
1
answer
9
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

149
views
1
answer
10
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

37
views
isro
isroece
co&architecture
1
answer
11
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

59
views
2
answers
12
set theory and algebra
answered
Mar 14
in
Set Theory & Algebra

22
views
settheory&algebra
engineeringmathematics
discretemathematics
sets
1
answer
13
Rosen ex.55 chp 8
If the simple graph G has v vertices and e edges, how many edges does G complement have?
commented
Mar 14
in
Graph Theory

32
views
1
answer
14
set theory
commented
Mar 14
in
Set Theory & Algebra

22
views
settheory&algebra
engineeringmathematics
0
answers
15
CIL Exam: Matrices
In an MxN matrix such that all nonzero entries are covered in a rows and b columns. Then the maximum number of nonzero entries, such that no two are on the same row or column, is A) a + b B) max {a, b} C) min {Ma, Nb} D) min {a, b}
closed
Mar 14
in
Linear Algebra

25
views
engineeringmathematics
1
answer
16
ISRO201329
How many programmable fuses are required in a PLA which takes $16$ inputs and gives $8$ outputs? It has to use $8$ OR gates and $32$ AND gates. $1032$ $776$ $1284$ $1536$
commented
Mar 14
in
Digital Logic

658
views
isro2013
digitallogic
pla
1
answer
17
Peter Linz Exercise 3.3
answer selected
Mar 14
in
Theory of Computation

39
views
theoryofcomputation
regularexpressions
2
answers
18
CSMA/CD
answer selected
Mar 14
in
Computer Networks

38
views
computernetworks
csmacd
ethernet
2
answers
19
Peter Linz Exercise 3.2
GIve a DFA that accepts the following language : L(ab(a+ab)*(a+aa)) What could be the minimum number of states in such DFA?
answer selected
Mar 14
in
Theory of Computation

50
views
theoryofcomputation
regularexpressions
dfa
1
answer
20
Peter LinzChapter 3.1 Regular Expressions
commented
Mar 10
in
Theory of Computation

25
views
theoryofcomputation
regularexpressions
3
answers
21
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
1
answer
22
binary search
I/p  array of n element in which untill some postion all are integer and afterward all are star (*) O/p find the postion of 1st star (*) Hint  if lenear search is possible the go to BS Find time complexity ..?
commented
Mar 10
in
Algorithms

87
views
algorithms
binarysearch
binarysearchtree
2
answers
23
Peter LinzChapter 3.1 Regular Expressions
commented
Mar 10
in
Theory of Computation

38
views
theoryofcomputation
regularexpressions
1
answer
24
graph theory
can somebody explain the logic behind this theorem ?
answered
Mar 9
in
Graph Theory

39
views
graphtheory
discretemathematics
graphconnectivity
engineeringmathematics
2
answers
25
maximum records in join operation ME mock
commented
Mar 9
in
Databases

45
views
1
answer
26
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}
commented
Mar 9
in
Theory of Computation

33
views
theoryofcomputation
isi2015
finiteautomata
dfa
2
answers
27
TECHTUD, C PROGRAMMING
commented
Mar 9
in
Programming

124
views
programminginc
output
1
answer
28
integer promotion RULE in C gate 2017
commented
Mar 9
in
Programming

147
views
1
answer
29
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
1
answer
30
how many solutions are there to equation x1+x2+x3 =11
commented
Mar 9
in
Combinatory

38
views
2
answers
31
algorithm
finf the tc T(n)=nlogn +T(n1)
answered
Mar 9
in
Algorithms

49
views
1
answer
32
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
1
answer
33
Peter LinzChapter 3.1 Regular Expressions
answered
Mar 9
in
Theory of Computation

19
views
theoryofcomputation
regularexpressions
1
answer
34
decomposition made easy mock
Which of the following relation can decompose into BCNF with dependency preserving and lossless join decomposition. (i) R(ABCDE) {AB → C, C → AB, C → D, D → E} (ii) R(ABCDE) {AB → C, C → A, C → D, D → E} A) only i B) Only II C) Both D) Neither
commented
Mar 9
in
Databases

38
views
2
answers
35
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
2
answers
36
techtud c programming
Ans is C can anybody justify why compilation error
commented
Mar 8
in
Programming

64
views
programminginc
output
2
answers
37
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
answer edited
Mar 8
in
Linear Algebra

45
views
engineeringmathematics
isro
isromech
1
answer
38
ME TEST
commented
Mar 8
in
Databases

57
views
madeeasy_testseries
dbms
1
answer
39
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
2
answers
40
graph theory
commented
Mar 8
in
Graph Theory

21
views
graphtheory
discretemathematics
engineeringmathematics
21,446
questions
26,759
answers
60,943
comments
22,955
users