CBSE NET Computer-Science September-2013 Solved Paper II

1. 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?

1. 112 Mbits

2. 6.72 Mbits

3. 67.20 Mbits

4. 672 Mbits

2. 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.

1. Non-persistent

2. 0-persistent

3. 1-persistent

4. p-persistent

3. 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?

1. Monoalphabetic

2. Polyalphabetic

3. Transpositional

4. None of the above

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

1. 100 meters

2. 200 meters

3. 1000 meters

4. 2000 meters

5. 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.

1. Hyper Text Markup Language

2. File Transfer Protocol

3. Hyper Text Transfer Protocol

4. Common Gateway Interface

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

1. Flooding algorithm

2. Hierarchical routing algorithm

3. Distance vector routing algorithm

7. The IEEE single-precision and double-precsion format to represent floating-point numbers, has a length of ______ and ______ respectively.

1. 8 bits and 16 bits

2. 16 bits and 32 bits

3. 32 bits and 64 bits

4. 64 bits and 128 bits

8. 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

1. 2451

2. 4950

3. 4851

4. 9900

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

1. Search

2. Search and Insert

3. Search and Delete

4. Search, Insert and Delete

10. 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

1. 0.5 β Ig n

2. 0.5 (1 – β) Ig n

3. – (Ig n)/(Ig β)

4. – (Ig n)/Ig (1 – β)

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

1. 2d – 1

2. 2d + 1 – 1

3. d + 1

4. d

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

1. Queue

4. Binary tree

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

1. 3

2. 4

3. 5

4. 6

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

1. (1 + 010) *

2. (01 + 10) *

3. (1 + 010) * (0 + λ)

4. (1 + 01) * (0 + λ)

15. 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?

1. L1 is regular language and L2 is not regular language.

2. Both L1 and L2 are regular languages.

3. Both L1 and L2 are not regular languages.

4. L1 is not regular language and L2 is regular language.

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

1. S → aSc | S1; S1 → bS1c | λ

2. S → aSc | S1|; S1 → bS1c

3. S → aSc | S1| λ S1 → bS1c| λ

4. S → aSc | λ S1 → bS1c| λ

17. 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?

1. S1 is correct and S2 is not correct.

2. Both S1 and S2 are correct.

3. Both S1 and S2 are not correct.

4. S1 is not correct and S2 is correct.

18. The number of eight-bit strings beginning with either 111 or 101 is ______.

1. 64

2. 128

3. 265

4. None of the above

19. 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 whte.

1. 55, 440

2. 1, 66, 320

3. 4.790E + 08

4. 39, 91, 680

20. Consider the following statements:

1. A graph in which there is a unique path between every pair of vertices is a tree.

2. A connected graph with e = v – 1 is a tree.

3. A graph with e = v – 1 that has no circuit is a tree.

Which of the above statements is/are true?

1. 1 & 3

2. 2 & 3

3. 1 & 2

4. All of the above

21. 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

1. a b f e j k n o p c d g l m h 1

2. a b c d e f j k n o p g l m h 1

3. a b e j k n o p f c d g l m h 1

4. j e n o p k f b c l m g h 1 d a

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

1. (n – 1) (n – 2)/2 edges

2. More than (n – 1) (n – 2)/2 edges

3. Less than (n – 1) (n – 2)/2 edges

4. ∑ki = 1 C (ni, 2) edges

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

1. AND, OR, NOT

2. NAND, NOR

3. EX-OR, EX-NOR

4. None of the above

24. 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:

1. ∃x P (x) ∨∀x∀y ( (P (x) ∨ P (y) ) → x = y)

2. ∀ x P (x) ∧∀x∀y ( (P (x) ∨ P (y) ) → x = y)

3. ∃x P (x) ∧∀x∀y ( (P (x) ∧ P (y) ) → x = y)

4. ∃x P (x) ∧∃x∃y ( (P (x) ∨ P (y) ) → x = y)

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

1. F ≤ F + G and F G ≤ F

2. G ≤ F + G and F G ≥ G

3. F ≥ F + G and F G ≤ F

4. G ≥ F + G and F G ≤ F

26. Match the following identities/laws to their corresponding name:

 List-I List-II x + x = x x • x = x x + 0 = x x • 1 = x x + 1 = 1 x • 0 = 0 x • (x + y) = x Dominance Absorption Idempotent Identity
• A
• B
• C
• D
• 3
• 4
• 1
• 2
• 4
• 3
• 1
• 2
• 4
• 3
• 2
• 1
• 3
• 4
• 2
• 1

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

1. ISO9001

2. RMMM

3. CMM

4. None of the above

28. 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.

1. E-R diagram

2. Data flow diagram

3. Software architecture

4. Software design

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

1. Waterfall model

2. Prototyping model

3. Incremental model

4. Evolutionary Development model

30. 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.

1. White box

2. Black box

3. Regression

4. Smoke

31. Consider the following characteristics:

1. Correct and unambiguous

2. Complete and consistent

3. Ranked for importance and/or stability and verifiable

4. Modifiable and Traceable

Which of the following is true for a good SRS?

1. 1, 2 and 3

2. 1, 3 and 4

3. 2, 3 and 4

4. 1, 2, 3 and 4

32. Linked Lists are not suitable for _____.

1. Binary Search

2. Polynomial Manipulation

3. Insertion

33. 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; }

1. 2

2. 4

3. 1

4. 7

34. What is the output of the following program segment? sum (n) { else return (n + sum (n–1) ); } main () { print f ( “%d” sum (5) ); }

1. 10

2. 16

3. 15

4. 14

35. Assume that x and y is 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); }

1. Computes LCM of two numbers

2. Computes GCD of two numbers

3. Divides large number with small number

4. Subtracts smaller number from large number

36. 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

1. 9000

2. 3000

3. 90

4. 2700

37. Usage of Preemption and Transacton Rollback prevents ______.

1. Unauthorized usage of data file

3. Data manipulation

4. File preemption

38. The _____ language was originally designed as the Transformation Language for Style Sheet facility.

1. XSTL

2. XML

3. XQuery

4. XPath

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

1. Hiding

2. Deleting

3. Highlighting

4. All of the above

40. The decision tree classifier is a widely used technique for ______.

1. Classification

2. Association

3. Partition

4. Clustering

41. Cross_tab displays permit users to view ______ of multidimensional data at a time.

1. One dimension

2. Two dimensions

3. Three dimensions

4. Multi dimensions

42. A method to provide secure transmission of email is called ____.

1. TLS

2. SA

3. IPSec

4. PGP

43. Thoma's-write rule is ______.

1. Two phase locking protocol

2. Timestamp ordering protocol

3. One phase locking protocol

4. Sliding window protocol

44. Match the following:

 List-I (Process state transition) List-II (Reason for transition) Ready→ Running Blocked→ Ready Running→ Blocked Running→ Ready Request made by the process is satisfied or an event for which it was waiting occurs. Process wishes to wait for some action by another process. The process is dispatched. The process is preempted.
• A
• B
• C
• D
• 3
• 1
• 2
• 4
• 4
• 1
• 3
• 2
• 4
• 3
• 1
• 2
• 4
• 3
• 2
• 1

45. 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 ______.

1. 36 ns

2. 140 ns

3. 122 ns

4. 40 ns

46. 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: Serial No. 1 2 3 4 5 Track No. 12 85 40 100 75 Time of arrival 65 80 110 100 175 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” diskarm 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:

1. 144 and 123 milliseconds

2. 143 and 123 milliseconds

3. 149 and 124 milliseconds

4. 256 and 186 milliseconds

47. Assume that an implementation of UNIX operating system uses i-nodes 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

1. 16 MB

2. 16 KB

3. 70 KB

4. 71 KB

48. Which of the following set of UNIX commands will always display “WELCOME”

1. Export title = WELCOME; Echo $title 2. Title = WELCOME; export$title; sh –c “echo $title” 3. Title = WELCOME; export title; sh –c “echo$title”

4. Title = WELCOME; echo \$title

49. The speed up of a pipeline processing over an equivalent non-pipeline processing is defined by the ratio:

1. S = n tn/(k + n – 1) tp

2. S = n tn/(k + n + 1) tp

3. S = n tn/(k – n + 1) tp

4. S = (k + n – 1) tp/n tn

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