# Questions by Akriti sood

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.
1 vote
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
1 vote
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??
1 vote
4
why is it showing error?? #include <stdio.h> int main() { extern int i; i=20; printf("%d",i); }
1 vote
5
can someone pls explain how is the internal path length of complete binary tree is O(n logn)? (if it is correct)
6
for asymptotically positive values- state True or False- f(n) + o(f(n)) = theta(f(n) o is small oh.
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-
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%.
1 vote
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)
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
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.
1 vote
12
how is statement iv always true??
13
will there be no compile time error as we are initialising array greater than its size??
14
please tell the time complexity?i was getting O(2n)
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??
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??
1 vote
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?
1 vote