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
Questions 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
0
votes
1
answer
1
iit kanpur written test
I had been shortlisted for iit kanpur test to be held on 13th may in their campus but i could'nt fill up the form to register myself for th exam.Today i got a mail from IIT kanpur that since i have not confirmed my participation,they wont arrange tests for me. will i not be allowed to give test now?Can anyone pls suggest something?? THanks in advand.
asked
May 9, 2017
in
Written Exam

440
views
iitkanpur
writtentest
mtech
+1
vote
1
answer
2
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
asked
Mar 27, 2017
in
IISc/IITs

1.1k
views
iiscinterview
+1
vote
1
answer
3
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??
asked
Mar 24, 2017
in
Programming

93
views
programminginc
+1
vote
2
answers
4
error in the code
why is it showing error?? #include <stdio.h> int main() { extern int i; i=20; printf("%d",i); }
asked
Mar 24, 2017
in
Programming

208
views
programminginc
+1
vote
0
answers
5
internal path length of complete binary tree
can someone pls explain how is the internal path length of complete binary tree is O(n logn)? (if it is correct)
asked
Mar 24, 2017
in
Algorithms

656
views
al
binarytree
datastructures
graphalgorithms
0
votes
1
answer
6
small o  true or false
for asymptotically positive values state True or False f(n) + o(f(n)) = theta(f(n) o is small oh.
asked
Mar 2, 2017
in
Algorithms

119
views
algorithms
0
votes
0
answers
7
which os the following is not a valid probability density?
which os the following is not a valid probability density? 0.1 1 100 1.1 //this question is taken from one of the IIT kanpur interview experience blogs
asked
Feb 28, 2017
in
Probability

72
views
engineeringmathematics
probability
+2
votes
1
answer
8
Consider a system with the main memory size of 32MB and each process size 4MB
Consider a system with the main memory size of 32MB and each process size 4MB, if each process spends 80% of its time in doing I/O, what is the CPU utilization percentage? (Assuming there is no virtual memory and ... can perform I/0 in parallel.so at that CPU will be free and therefore its utilisation will be only 20%.
asked
Jan 24, 2017
in
Operating System

473
views
operatingsystem
+1
vote
1
answer
9
find the time complexity
What is the time complexity of the following function foo() void foo() { int i, j; for(i = 1; i <= n ; i++) for(j = i; j <= log(i); j++) printf(“gate”); } what is the time complexity? the answer given is nlogn. but I think it should be O(n)
asked
Jan 24, 2017
in
Algorithms

456
views
algorithms
+2
votes
0
answers
10
which one is R.E??
Consider the following languages: L1={0^(2k)│k≥0} L2={b∈{0,1}*│b∈L(Mb] ) } Which of the above languages is TM recognizable? please explain second one
asked
Jan 24, 2017
in
Theory of Computation

68
views
theoryofcomputation
+5
votes
1
answer
11
Testbook live Testseries
Which of the following statements are false ? $1.$ A depthfirst search of a directed graph always produces the same number of tree edges (i.e., independent of the order in which the vertices are provided and independent of the order of the ... between any two vertices will not change. $4.$ Dijkstra's algorithm may not terminate if the graph contains negative weight edges.
asked
Jan 23, 2017
in
Algorithms

399
views
algorithms
testseries
+1
vote
0
answers
12
choose the correct one testbook testseries
how is statement iv always true??
asked
Jan 23, 2017
in
Algorithms

99
views
algorithms
testseries
+2
votes
1
answer
13
predict the outputtestbook livetest
will there be no compile time error as we are initialising array greater than its size??
asked
Jan 23, 2017
in
Algorithms

76
views
programminginc
+2
votes
1
answer
14
find the time complexitytestbook livetest
please tell the time complexity?i was getting O(2n)
asked
Jan 23, 2017
in
Algorithms

192
views
timecomplexity
algorithms
0
votes
1
answer
15
type of relation
how is it not transitive?? i mean take any time instant.ie x= 4:00 and y=4:20,z= 4:40..they are transitive..right??
asked
Jan 23, 2017
in
Set Theory & Algebra

100
views
relations
engineeringmathematics
+2
votes
2
answers
16
time required to fins the unknowm integer
as we already know the range,so can we use counting sort??and complexity of counting sort is O(n+k) what other method is there to know the missing number??
asked
Jan 22, 2017
in
Algorithms

131
views
algorithms
+1
vote
0
answers
17
find the number of rows returned
name salaray A 1000 B 500 C 600 D 900 E NULL select name from employee where salary > ANY(select salary from employee); how many rows will be fetched?? 4 5 6 will B be returned ?as in if 500 is smaller than every other ,so we cant compare 500 with NULL,so it wont be printed ..right??and what about E??will it be printed?
asked
Jan 22, 2017
in
Databases

63
views
databases
+1
vote
0
answers
18
L1 = {aibjck  i≠j or j≠k or i≠k}.
L1 = {aibjck  i≠j or j≠k or i≠k}. is'nt this language regular? as this can be equivalent to { aibjck i,j,k>=0} because of OR in the question.even if any one is equal then also it will be accepted because of OR. pls correct me. and if it is not regular then it is non deterministic PDA??
asked
Jan 22, 2017
in
Theory of Computation

956
views
theoryofcomputation
+4
votes
2
answers
19
What is the expected length of the cycle containing vertex 1?
A random permutation π of set[n] = {1, 2, , n} can be represent by a directed graph on n vertices with directed arc (i, πi) where πi is the ith entry in the permutation. Observe that the resulting graph is just a collection of disjoint cycles. ... containing vertex 1? n(n1)/2n (n+1)/2n ((n1))/2 ((n+1))/2 /pls explain the question
asked
Jan 16, 2017
in
Graph Theory

456
views
expectation
graphtheory
engineeringmathematics
+1
vote
0
answers
20
L={<M>  M is a turing machine and it takes less than 481 steps on some input>
L={<M>  M is a turing machine and it takes less than 481 steps on some input> decidable or R.E?? i think it is decidable..just confirm it pls
asked
Jan 15, 2017
in
Theory of Computation

478
views
theoryofcomputation
turingmachine
+2
votes
2
answers
21
L={<M> : M is a TM that accepts all even numbers }
L={<M> : M is a TM that accepts all even numbers } is it recursive/R.E??
asked
Jan 15, 2017
in
Theory of Computation

771
views
theoryofcomputation
decidability
+1
vote
2
answers
22
hoe many different choices for classes does we have? ________
Tom Riddle must choose 4 classes for his final semester at school. He must take at least 1 science class and at least 1 art class. In his school offers 4 (distinct) science classes, 3 (distinct) art classes and three other (distinct) classes, hoe many different choices for classes does we have? ________ 195 175 210 160
asked
Jan 13, 2017
in
Combinatory

142
views
permutationandcombination
+1
vote
1
answer
23
what is the probability that the mother could have had the very long or very short pregnancy
asked
Jan 12, 2017
in
Probability

191
views
probability
engineeringmathematics
0
votes
0
answers
24
findthe probability that all the customers that arrive at the shop within the first 10 minutes, all bought product A?
asked
Jan 12, 2017
in
Probability

103
views
engineeringmathematics
probability
+1
vote
0
answers
25
pagetable and modes
what is the mode used when page tables of a process are loaded and modified?KERNEL /USER? are page tables of the process also stored in process control block??
asked
Jan 12, 2017
in
Operating System

75
views
operatingsystem
+1
vote
2
answers
26
switch case output in case of expressions
#include int main() { char check = 'a'; switch (check) { case 'a'  1: printf("Gates "); case 'b'  2: printf("Quiz "); break; default: printf("GatesQuiz"); } return 0; } (a) Gates (b) Gates Quiz (c) Gates Quiz GatesQuiz (d) Compiletime error
asked
Jan 12, 2017
in
Programming

356
views
programminginc
0
votes
0
answers
27
self soubt
while (++x){ } here ++x is executed first and then condition is checked or first condition is checked then ++x
asked
Jan 12, 2017
in
Programming

46
views
programminginc
+2
votes
1
answer
28
find the output
include <stdio.h> int main() { int a[][3] = {1, 2, 3, 4, 5, 6}; int (*ptr)[3] = a; printf("%d %d ", (*ptr)[1], (*ptr)[2]); ++ptr; printf("%d %d\n", (*ptr)[1], (*ptr)[2]); return 0; } (a) 2 3 5 6 (b) 2 3 4 5 (c) 4 5 0 0 (d) none of the above
asked
Jan 12, 2017
in
Programming

283
views
programminginc
+2
votes
1
answer
29
find the output
#include int main() { char *x; x = (char *) &a; a = 512; x[0] = 1; x[1] = 2; printf("%d\n",a); return 0; } What is the output of above program? (a) Machine dependent b) 513 (c) 258 (d) Compiler Error
asked
Jan 11, 2017
in
Programming

180
views
programminginc
0
votes
0
answers
30
In the following program where is the variable a getting defined and where it is getting declared?
asked
Jan 11, 2017
in
Programming

218
views
programminginc
Page:
1
2
3
4
5
6
...
8
next »
50,737
questions
57,275
answers
198,154
comments
104,823
users