1
Which of the following procedure results same output as Dijkstra’s Algo. on unweighted graph on $'n'$ verices? $A)$ BFS $B)$ DFS $C)$Kruskal $D)$ Prims As far I know Dijkstra and Prims both have $T.C.=O(E+VlogV)$ But ans given BFS. How this ans possible??
2
What are the final states of the DFA generated from the following NFA? $q_{0}, q_{1}, q_{2}$ $[q_{0}, q_{1}], [q_{0}, q_{2}], [ ]$ $q_{0}, [q_{1}, q_{2}]$ $[q_{0}, q_{1}], q_{2}$
3
The $FSM$ (Finite State Machine) machine pictured in the figure above Complements a given bit pattern Finds $2's$ complement of a given bit pattern Increments a given bit pattern by $1$ Changes the sign bit
4
Calculate the effective throughput for transferring a 1000 KB file assuming TCP using slow start congestion control technique. Given the round trip time 100 ms, and maximum segment size is 1460 bytes. Assume there are no losses and both the bandwidth and the receiver window size is infinite. (A) 5MBPS (B) 10Mbps (C) 1MBPS (D) 1Mbps
5
What is the length of a contention slot in CSMA/CD for (a) a 2-km twin-lead cable (signal propagation speed is 82% of the signal propagation speed in vacuum)?, and (b) a 40-km multimode fiber optic cable (signal propagation speed is 65% of the signal propagation speed in vacuum)?
6
How many frames per second can gigabit Ethernet handle? Think carefully and take into account all the relevant cases. Hint: the fact that it is gigabit Ethernet matters.
7
Consider the following relational schemes: R(A, B, C, D, E, F) and S(A, B, C) with in the following functional dependencies: I. AB --> C II. C --> ABDE III. ADE --> F Assume {A,B} is the key for both schemes. Which of the following statements is true? R ... : only AB→ C is the relation for the S table, which satisfies BCNF properties. (So S is in BCNF) Please let me know if it is correct or not.
8
9
What is the effect on line utilization if we increase the number of frames for a constant message size? Lower line efficiency Higher line efficiency No change in line efficiency No relation between line efficiency and frame size
10
11
If the memory is 768 MB and the block’s size is 384 Bytes, what will be the size of the bitmap in Bytes? I think it should be 2^21 Bytes, but I’m not quite sure. Could you show me also your solution?
12
Banker algorithm is used by OS to avoid the deadlock. Following table shows the current allocation and maximum demand by process $P_{1}$,$P_{2}$,$P_{3}$ and $P_{4}$ for the instances $A,B,C$ Process Max Demand (A,B,C) Current Allocation(A,B,C) $P_{1}$ $8,2,3$ ... $A,B,C$ respectively Req2: $P_{4}$ requests $1,0,1$ of $A,B,C$ respectively Which of these two requests will be granted?
13
for(i=10;i<10;++i) printf("%d" i&1) prints (a) 0101010101 (b) 0111111111 (c) 0000000000 (d) 1111111111
14
void foo(int n) { for(i1=1;i1<=n;i1++) { for(i2=1;i2<=i1;i2++) { ....... { for(i6=1;i6<=i5;i6++) { count++; } } } } } Count initially 0.What is value returned by foo(8)?
15
void print(int i){ static int x=4; if(i!=0){ print(--x); } printf("%d",x); } What will be output printed for print(10)? Will it print value as call by value or call by reference?
16
Runtime stack doesnot contain (A) Local variables (B) Static Variables (C) Parameter Passed (D) Return Address
17
#include <stdio.h> int main(void) { char s1[15]="SREE"; char s2[10]="ALL THE BEST"; strcpy(s2,s1); printf("\n%s",s2); return 0; } 1)How s2 will contain a string of size 12, while it only contain size 10? 2)Why strcpy will not merge the rest string of s2 with s1 after copying , I mean “SREETHE BEST” Will it work like pointer that s2 pointing to same as s1? Anything link good to read about strcpy
18
void find(int x){ static int i=10,y=0; y=y+i; for(i;i>0;i=i-10){ if(x!=0) find(x-1); else{ printf("%d",y); } } } What will be output printed for find(4)?
19
In which of the following case CPU utilization will be higher? (a) If all the processes are I/O bound (b) Is all the processes are equally CPU bound and I/O bound (c) If all the processes are CPU bound (d) Both (B) and (C)
20
Can we solve fractional knapsack using dynamic programming?
21
q = you can access the library r = you have a valid ID s = you have paid subscription fee of that day Consider the following English sentence “You cannot access the library if you don’t have a valid ID unless you have paid subscription fee of that day” which of the following is the correct logical expression? $q \rightarrow (r \vee s )$ $(q \rightarrow r) \vee s$
22
Please explain the Question number 33 and 34. What is significance of word "only" ?
23
How many minimum number of tables needed for this Quaternary Relationship?
24
What are minimum number of tables required for the following given ER models such that they satisfy 1NF ?
25
What are the parameters or procedure to follow to find out minimum no. of tables for given ER Diagram type of questions?
Value of an Integral : I = $\frac{1}{\sqrt{2\Pi }} \int_{0}^{\infty } e^{\frac{-x^{2}}{8}}dx$ Answer given is 1.
$\int x^7.e^{x^4}dx$ How to do this?