Q1. A file is downloaded in a home computer using a 56 kbps MODEM connected to an Internet Service Provider . If the download of file completes in 2 minutes, what is the maximum size of data downloaded?

Q2. In _________ CSMA protocol, after the station finds the line idle, it sends or refrains from sending based on the outcome of a random number generator .

Q3. Which of the following substitution technique have the relationship between a character in the plaintext and a character in the ciphertext as one-to-many?

Q4. What is the maximum length of CAT-5 UTP cable in Fast Ethernet network?

Q5. The _______________ is a set of standards that defines how a dynamic web document should be written, how input data should be supplied to the program, and how the output result should be used.

Q6. The count-to-infinity problem is associated with

Q7. The IEEE single-precision and double-precision format to represent floating-point numbers, has a length of ___________ and _____________.

Q8.Consider an undirected graph G with 100 nodes. The maximum number of edges to be included in G so that the graph is not connected is

Q9. The amortized time complexity to perform __________ operation(s) in Splay trees is O(Ig n).

Q10. Suppose that the splits at every level of Quicksort are in proportion 1-β to β, where 0<β≤0.5 is a constant. The number of elements in an array is n. The maximum depth is approximately

Q11. The minimum number of nodes in a binary tree of depth d (root is at level 0) is

Q12. The efficient data structure to insert/delete a number in a stored set of numbers is

Q13. The number of states in a minimal deterministic finite automaton corresponding to the language L = { an | n≥4 } is

Q14. Regular expression for the language L = { w ∈ {0, 1}* | w has no pair of consecutive zeros} is

Q15. Consider the following two languages:
L1 = {an bl ak | n + l +k>5 }
L2 = {an bl ak |n>5, l >3, k≤ l }
Which of the following is true?

Q16. LL grammar for the language L = {an bm cn+m | m≥0, n≥0} is

Q17. Assume the statements S1 and S2 given as:
S1: Given a context free grammar G, there exists an algorithm for determining whether L(G) is infinite.
S2: There exists an algorithm to determine whether two context free grammars generate the same language.
Which of the following is true?

Q18. The number of eight-bit strings beginning with either 111 or 101 is ___________

Q19. Find the number of ways to paint 12 offices so that 3 of them will be green, 2 of them pink, 2 of them yellow and the rest ones white.

Q20. Consider the following statements:
(i) A graph in which there is a unique path between every pair of vertices is a tree.
(ii) A connected graph with e = v – 1 is a tree.
(iii) A graph with e = v – 1 that has no circuit is a tree.
Which of the above statements is/are true?

Q21. Consider the In-order and Post-order traversals of a tree as given below:
In-order: j e n k o p b f a c l g m d h i
Post-order: j n o p k e f b c l m g h i d a
The Pre-order traversal of the tree shall be

Q22. A simple graph G with n-vertices is connected if the graph has

Q23. Which one of the following set of gates is best suited for ‘parity’ checking and ‘parity’ generation?

Q24. The quantification ∃ !x P(x) denotes the proposition “There exists a unique x such that P(x) is true”, express the quantification using universal and existential quantifications and logical operators:

Q25. If F and G are Boolean functions of degree n. Then, which of the following is true?

Q26. Match the following identities/laws to their corresponding name:
(a) x + x = x
  x • x = x                     i. Dominance
(b) x + 0 = x
  x • 1 = x                     ii. Absorption
(c) x + 1 = 1
  x • 0 = 0                     iii. Idempotent
(d) x • (x + y) = x         iv. Identity
Codes:

Q27. In which one of the following, continuous process improvement is done?

Q28. The ______________ of a program or computing system is the structure or structures of the system, which comprise software components, the externally visible properties of these components, and the relationship among them.

Q29. Working software is not available until late in the process in

Q30. Equivalence partitioning is a _________ testing method that divides the input domain of a program into classes of data from which test cases can be derived.

Q31. Consider the following characteristics:
(i) Correct and unambiguous
(ii) Complete and consistent
(iii) Ranked for importance and/or stability and verifiable
(iv) Modifiable and Traceable
Which of the following is true for a good SRS?

Q32. Linked Lists are not suitable for _____________

Q33. What is the size of the following Union ?
Assume that the size of int = 2, size of float = 4, size of char = 1
union tag {
int a;
float b;
char c;
};

Q34. What is the output of the following program segment?
sum(n) {
if ( n < 1 )
return n;
else
return (n + sum(n–1));
}
main() {
printf(“%d”, sum(5));
}

Q35.Assume that x and y are non-zero positive integers. What does the following program segment perform?
while (x!=0) {
if (x>y)
x = x-y
else y=y-x;
printf(“%d”,x);

Q36. Consider the following program segment:
d=0;
for(i=1; i<31, ++i)
for(j=1; j<31, ++j)
for(k=1; k<31, ++k)
if ((i+j+k)%3)= = 0);
d = d + 1;
printf(“%d”, d);
The output will be

Q37. Usage of Preemption and Transaction Rollback prevents _____________

Q38. The _____________ language was originally designed as the Transformation Language for Style Sheet facility.

Q39. Views are useful for ____________ unwanted information, and for collecting together information from more than one relation into a single view.

Q40. The decision tree classifier is a widely used technique for ___________

Q41. Cross_tab displays permit users to view __________ of multidimensional data at a time.

Q42. A method to provide secure transmission of email is called ___________

Q43. Thoma’s-write rule is ___________

Q44. Match the following:

Q45. The hit ratio of a Translation Look Aside Buffer (TLAB) is 80%. It takes 20 nanoseconds (ns) to search TLAB and 100 ns to access main memory. The effective memory access time is ____________

Q46. Consider the input/output (I/O) requests made at different instants of time directed at a hypothetical disk having 200 tracks as given in the following table:
Assume that: Current head position is at track no. 65 Direction of last movement is towards higher numbered tracks Current clock time is 160 milliseconds Head movement time per track is 1 millisecond. “look” is a variant of “SCAN” disk-arm scheduling algorithm. In this algorithm, if no more I/O requests are left in current direction, the disk head reverses its direction. The seek times in Shortest Seek First (SSF) and “look” disk-arm scheduling algorithms respectively are:

Q47. Assume that an implementation of Unix operating system uses inodes to keep track of data blocks allocated to a file. It supports 12 direct block addresses, one indirect block address and one double indirect block address. The file system has 256 bytes block size and 2 bytes for disk block address. The maximum possible size of a file in this system is

Q48. Which of the following set of Unix commands will always display “WELCOME” ?

Q49. What type of logic circuit is represented by the figure shown below?

Q50. The speed up of a pipeline processing over an equivalent nonpipeline processing is defined by the ratio: Where n → no. of tasks
tn → time of completion of each task
k → no. of segments of pipeline
tp → clock cycle time
S → speed up ratio