search
Log In

Questions by Akriti sood

0 votes
1 answer
1
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 495 views
1 vote
1 answer
2
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.6k views
1 vote
1 answer
3
// 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 112 views
1 vote
2 answers
4
why is it showing error?? #include <stdio.h> int main() { extern int i; i=20; printf("%d",i); }
asked Mar 24, 2017 in Programming 253 views
1 vote
0 answers
5
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 909 views
0 votes
1 answer
6
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 140 views
0 votes
0 answers
7
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 88 views
2 votes
1 answer
8
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 the space required for OS is negligible) ----------- ... 4MB,so at max 8 processes 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 599 views
1 vote
1 answer
9
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 588 views
2 votes
0 answers
10
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 114 views
5 votes
1 answer
11
Which of the following statements are false ? $1.$ A depth-first 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 adjacency list). ... path 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 548 views
1 vote
0 answers
12
2 votes
1 answer
13
will there be no compile time error as we are initialising array greater than its size??
asked Jan 23, 2017 in Algorithms 83 views
2 votes
1 answer
14
please tell the time complexity?i was getting O(2n)
asked Jan 23, 2017 in Algorithms 228 views
0 votes
1 answer
15
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 172 views
2 votes
2 answers
16
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 162 views
1 vote
0 answers
17
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 102 views
1 vote
0 answers
18
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 1.3k views
4 votes
2 answers
19
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. What is the expected length of the cycle containing vertex 1? n(n-1)/2n (n+1)/2n ((n-1))/2 ((n+1))/2 /pls explain the question
asked Jan 16, 2017 in Graph Theory 590 views
1 vote
0 answers
20
...