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 Akriti sood
User Akriti sood
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User Akriti sood
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
1
answer
1
Which one of the following statements is correct regarding the elements and subsets of the set
commented
39 minutes
ago
in
Linear Algebra

15
views
linearalgebra
1
answer
2
Dennis Ritche The C programming Language
commented
11 hours
ago
in
Programming

16
views
programminginc
cprogramming
2
answers
3
self doubt
Suppose one process is running, and another high priority process arrives and lets assume CPU uses preemptive priority scheduling, how does short term scheduler come to know that a high priority process has arrived and it has to preempt the ... itself is a process, how does it run and everything gets managed?? please someone give a clear explanation. Thanx
commented
11 hours
ago
in
Operating System

39
views
operatingsystem
processschedule
cpuscheduling
0
answers
4
Let X={a,b,c,d} and Y={1,2,3,45,6}.How many functions from X to Y contain (a,1) or(b,2) or both?
commented
12 hours
ago
in
Mathematical Logic

8
views
1
answer
5
IIT Madras interview  what is the output of the C code?
commented
12 hours
ago
in
Programming

54
views
0
answers
6
coal india
commented
20 hours
ago
in
Computer Networks

13
views
1
answer
7
coal india MT
Which is the correct option?
commented
22 hours
ago
in
Databases

36
views
algorithms
datastructure
0
answers
8
rosen(sets relation function)
Find a formula for $\sum_{k=0}^{m}G.I.F(\sqrt{k})$, when m is a positive integer (where G.I.F is greatest integer function or floor function).
commented
1 day
ago
in
Set Theory & Algebra

23
views
generatingfunctions
2
answers
9
Solve the following Recurrence using any method
commented
1 day
ago
in
Algorithms

72
views
algorithms
timecomplexity
algorithm
asymptoticnotations
recurrenceequation
2
answers
10
Suppose there are n positive real numbers such that their sum is 20
commented
1 day
ago
in
Combinatory

42
views
combinatorics
2
answers
11
IISCCSAResearchTest9
Which of the following statement(s) is(are) true? If $n$ is odd prime number then $2^{n1} \text{ mod } n =1$ If $2^{n1} \text{ mod } n =1$ for a number $n$ then $n$ is prime
commented
1 day
ago
in
Numerical Ability

65
views
iisccsaresearch2016
descriptive
numericalability
iiscinterview
1
answer
12
#advice #gate17 #admission
Gate score of 783 and rank 259 What are the chances for old iits??? Can i make it to kgp?
commented
1 day
ago
in
IISc/IITs

170
views
1
answer
13
CDS programme
can someone pls guide about the CDS program at IISC??what prerequisites are required and how is it different from mtech.i had gone through the site but want to ask here for a clear picture before filling the form. it would be really helpful if someone could advice as deadline is near. Thanks in advance
commented
1 day
ago
in
IISc/IITs

94
views
iiscinterview
0
answers
14
Calculate the shortest path using TSP Greedy Appraoch
commented
3 days
ago
in
Algorithms

12
views
algorithms
shortestpath
travel
salesman
0
answers
15
made easy
what is the expected number of probs required when inserting an element into an open address hash table with load factor alpha(a), assume uniform hashing??
comment edited
3 days
ago
in
Programming

20
views
datastructure
hashing
madeeasy
0
answers
16
Why the isro tests are not working properly?
commented
3 days
ago
in
Others

35
views
1
answer
17
Throughput of Scheduling algorithm
commented
3 days
ago
in
Operating System

19
views
operatingsystem
1
answer
18
What is the highest power of 18 contained
commented
3 days
ago
in
Combinatory

82
views
combinatory
0
answers
19
Test Book
commented
4 days
ago
in
Programming

38
views
testbook
1
answer
20
MadeEasy Workbook[2016] Q48
Find the integer value of x satisfying the inequality$\binom{10}{x1} < 2\binom{10}{x}$ .
commented
4 days
ago
in
Combinatory

26
views
1
answer
21
Rosen (proposition logic)
The nth statement in a list of 100 statements is “Exactly n of the statements in this list are false.” a) What conclusions can you draw from these statements? b) Answer part (a) if the nth statement is “At least n of the statements in this list are false.” c) Answer part (b) assuming that the list contains 99 statements.
commented
4 days
ago
in
Mathematical Logic

45
views
1
answer
22
list type
// Graph class represents a undirected graph // using adjacency list representation class Graph { int V; // No. of vertices // Pointer to an array containing adjacency lists list<int> *adj; } is 'list' a datatype?? where can i study about it??
commented
5 days
ago
in
Programming

44
views
programminginc
0
answers
23
internal path length of complete binary tree
commented
5 days
ago
in
Algorithms

42
views
al
binarytree
datastructure
graphalgorithms
2
answers
24
error in the code
why is it showing error?? #include <stdio.h> int main() { extern int i; i=20; printf("%d",i); }
commented
5 days
ago
in
Programming

61
views
programminginc
2
answers
25
C programming doubt
I am getting segmentation fault for the following code.Please help to rectify. #include <stdio.h> #include <stdlib.h> struct person { int age; float weight; char *name; }; int main() { struct person *ptr; int i, num; printf("Enter number of ... ;%s\t%d\t%.2f\n", ptr>name[i], (ptr+i)>age, (ptr+i)>weight); return 0; }
commented
5 days
ago
in
Programming

94
views
0
answers
26
C Programming(interview)
Write an algorithm of the given problem Given a chess board of order NxM and source points (s1,s2) and destination points (d1,d2), Your task to find min number of moves required by the Knight to go to the destination cell.
commented
6 days
ago
in
Programming

111
views
programminginc
cprogramming
0
answers
27
BARC ECE 2017
In digital ,b7,b6,b5,b4,b3,b2,b1,b0 if each bit is shift left ,after 8 th clock cycle ,we will get some bytes .. . What ll 'll be the operation ? 1.binary to 2's complement converter 2.binary to 1 s comp. Converter 3." binary" to grey 4. " binary" to excess 3
commented
Mar 22
in
Digital Logic

41
views
1
answer
28
What is the value of ssthresh at the 24 th transmission round?
commented
Mar 22
in
Computer Networks

67
views
thrashing
computernetworks
gatebook_mt2
0
answers
29
Made easy Test Series 2017 Proposition Logic
commented
Mar 22
in
Mathematical Logic

69
views
badquestion
2
answers
30
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.
commented
Mar 21
in
Algorithms

71
views
timecomplexity
algorithms
0
answers
31
Peter Linz Exercise 5.1
Find context free grammars for the following languages (with n>=0, m>=0, k>=0) (a) L={anbmck : n=m or m<=k} (b) L={ anbmck : n=m or m≠k} (c) L={anbmck : k=n+m } (d) L={ anbmck : n+2m=k} (e) L={anbmck : k=nm } (f) L={ w ∈ {a,b,c}* : na(w)+nb(w)≠nc(w) } (g) L={ anbmck : k≠n+m } (h) L= { anbmck : K>=3}
commented
Mar 21
in
Theory of Computation

100
views
theoryofcomputation
grammar
1
answer
32
set theory
a) Find the maximal elements. b) Find the minimal elements. c) Is there a greatest element? d) Is there a least element? e) Find all upper bounds of {a, b, c}. f ) Find the least upper bound of {a, b, c}, if it exists. g) Find all lower bounds of {f, g, h}. h) Find the greatest lower bound of {f, g, h}, if it exists.
commented
Mar 21
in
Set Theory & Algebra

18
views
settheory&algebra
discretemathematics
engineeringmathematics
sets
0
answers
33
APTITUDE
comment edited
Mar 19
in
Numerical Ability

41
views
1
answer
34
ISRO 2K16
answered
Mar 19
in
Numerical Ability

27
views
1
answer
35
Peter Linz Exercise 5.3
Find the contextfree grammar for the following language(n>=0 and m>=0) ? L={an bm : n<=m+3}
comment edited
Mar 19
in
Theory of Computation

35
views
theoryofcomputation
grammar
0
answers
36
find order
What will be the order of B+ tree with a database of 5,00,000 records of 200 bytes each and the search key is 15 bytes?Assume tree and data pointers are are 5 bytes each and the index node is 1024 bytes?
comment edited
Mar 19
in
Databases

32
views
1
answer
37
pointer
int main(){ int a[5]={1,2,3,4,5}; char *str="hello"; printf("%p %p",a,&a); printf("%p %p",str,&str); } Why in $1$st printf , both the outputs are same($a$,&$a$) And in $2$nd printf ,both the outputs are different(str,&str) please help!
comment edited
Mar 18
in
Programming

81
views
programminginc
2
answers
38
APTITUDE
A class is composed of 2 brothers and 6 other boys. In how many ways can all the boys be seated at a round table so that the two brothers are not seated together?
answer edited
Mar 16
in
Study Resources

30
views
1
answer
39
probability
There are $N$ persons sitting in a row. Two of them are selected at random.The probability that two selected persons are not together ?
comment edited
Mar 16
in
Probability

47
views
discretemathematics
probability
1
answer
40
MEBook
Assume that a fair sixsided die is rolled once. If the value on the die is 1, 2, or 3, the die is rolled a second time.So find the probability that the aggregate of total of values that turn up is at least 6?
answered
Mar 15
in
Probability

16
views
21,549
questions
26,889
answers
61,246
comments
23,251
users