UGC – NET Computer Science December 2009 – Paper-II

1. If she is my friend and you are her friend, then we are friends. Given this, the friend relationship in this context is __.

• (A) commutative
• (B) transitive
• (C) implicative
• (D) equivalence

2. Circle has____

• (A) No vertices
• (B) Only 1 vertex
• (C) ∞ vertices
• (D) None of these

3. If in an error detection and correction code a message M: “You are good students” is stored as M’ : Youare areyou aregood goodare goodstudents studentsgood. What is the space required to store M’ in general? (assume that ‘n’ is the length of M)

• (A) 2n
• (B) 3n
• (C) 4n
• (D) less than 4n

4. P : “Program is a step-by-step execution of the instructions”. Given P, which of the following is true?

• (A) Program is a subset of an instruction set.
• (B) Program is sequence of a subset of an instruction set.
• (C) Program is a partially ordered set of an instruction set.
• (D) All of the above

5. In a MIU puzzle, either of the letters M, I or U could go as a start symbol. Production rules are: R1 : U → IU, R2 : M.x → M.x.x. Which holds for (i) MIUIUIUIUIU (ii) MIUIUIUIUIUIUIUIU?

• (A) Either (i) or (ii) but not both are valid words.
• (B) Both (i) and (ii) are valid words and take identical transformations.
• (C) Both (i) and (ii) are valid but involve different number of transformations.
• (D) None of these

6. The simplified form of the Boolean expression (X + Y + XY) (X + Z) is

• (A) X + Y + ZX + Y
• (B) XY – YZ
• (C) X + YZ
• (D) XZ + Y

7. Identify the logic function performed by the circuit shown (Standard XNOR Symbol).

• (A) exclusive OR
• (B) exclusive NOR
• (C) NAND
• (D) NOR

8. The highest noise margin is offered by

• (A) BICMOS
• (B) TTL
• (C) ECL
• (D) CMOS

9. The answer of the operation (10111)2 * (1110)2 in hex equivalence is

• (A) 150
• (B) 241
• (C) 142
• (D) 101011110

10. How many 1’s are present in the binary representation of 3×512 + 7×64 + 5×8 + 3

• (A) 8
• (B) 9
• (C) 10
• (D) 11

11. Recursive functions are executed in a

• (A) First in first out order
• (B) Last in first out order
• (C) Parallel fashion
• (D) Load balancing

12. What would be the output of the following program, if run from the command line as “myprog 1 2 3”?
main (int argc, char * argv[ ]) { int i; i = argv[1] + argv[2] + argv[3]; printf ("%d", i); }

• (A) 123
• (B) 6
• (C) Error
• (D) “123”

13. A ________ is a special method used to initialize the instance variable of a class.

• (A) Member function
• (B) Destructor
• (C) Constructor
• (D) Structure

14. Encapsulation is

• (A) Dynamic binding
• (B) A mechanism to associate the code and data
• (C) Data abstraction
• (D) Creating new class

15. Which of the statements are true?
I. Function overloading is done at compile time.
II. Protected members are accessible to the member of derived class.
III. A derived class inherits constructors and destructors.
IV. A friend function can be called like a normal function.
V. Nested class is a derived class.

• (A) I, II, III
• (B) II, III, V
• (C) III, IV, V
• (D) I, II, IV

16. The E-R model is expressed in term of
I. Entities
II. The relationship among entities
III. The attributes of the entities
IV. Functional relationship

• (A) I, II
• (B) I, II, IV
• (C) II, III, IV
• (D) I, II, III

17. Specialization is ____ process.

• (A) top-down
• (B) bottom up
• (C) both 1 and 2
• (D) none of these

18. Match the following :
1. Determinants -> (d) Group of attributes on LHS of function dependency
2. Candidate key -> (b) Uniquely identified a row
3. Non-redundancy -> (a) No attribute can be added
4. Functional dependency -> (c) A constraint between two attribute

• (A) 1–d, 2–b, 3–a, 4–c
• (B) 2–d, 3–a, 1–b, 4–c
• (C) 4–a, 3–b, 2–c, 1–d
• (D) 3–a, 4–b, 1–c, 2–d

19. A function that has no partial functional dependencies is in __ form.

• (A) 3NF
• (B) 2NF
• (C) 4NF
• (D) BCNF

20. Which of the following statement is wrong?
I. 2-phase locking protocol suffer from dead lock.
II. Time stamp protocol suffer from more aborts.
III. A block hole in a DFD is a data store with only inbound flows.
IV. Multivalued dependency among attribute is checked at 3 NF level.
V. An entity-relationship diagram is a tool to represent event model.

• (A) I, II, III
• (B) II, III, IV
• (C) III, IV, V
• (D) II, IV, V

21. If the number of leaves in a strictly binary tree is an odd number, then what can you say with full conviction about total number of nodes in the tree?

• (A) It is an odd number
• (B) It is an even number
• (C) It cannot be equal to the number of leaves
• (D) It is always greater than twice the number of leaves

22. The number of edges in a complete graph of n vertices is

• (A) n
• (B) n(n-1)/2
• (C) n(n+1)/2
• (D) n^2/2

23. At a hill station, the parking lot is one long drive way… A car can’t leave until all the cars in front of it have left. Is the parking lot more like

• (A) An array
• (B) A stack
• (C) A queue
• (D) A linked list

24. With regard to linked list, which of the following statement is false?

• (A) Searching in singly linked list requires O(n).
• (B) Deleting the first element in a singly linked list requires O(n) operations in the worst case.
• (C) Finding max value in circular linked list requires O(n).
• (D) Deleting middle node of circular linked list requires O(n).

25. A hash function f defined as f(key) = key mod 7, with linear probing… Insert keys 37, 38, 72, 48, 98 and 11 into table indexed 0 to 6. What will be the location of 11?

• (A) 3
• (B) 4
• (C) 5
• (D) 6

26. Device on one network can communicate with devices on another network via a

• (A) Hub/Switch
• (B) Utility server
• (C) File server
• (D) Gateway

27. What is the maximum window size in sliding window protocol used in a computer network (Standard 3-bit seq numbers assumed)?

• (A) 4
• (B) 8
• (C) 15
• (D) 16

28. Which of the following are Data Link Layer standard?
1. Ethernet 2. HSSI 3. Frame Relay 4. 10 – Base T 5. Token Ring

• (A) 1, 2, 3
• (B) 1, 3, 5
• (C) 1, 3, 4, 5
• (D) 1, 2, 3, 4, 5

29. In case of Bus/Tree topology signal balancing issue is overcome by

• (A) Modulation
• (B) Polling
• (C) Segmentation
• (D) Strong transmitter

30. Match the following :
(i) Ethernet – (a) Deterministic
(ii) Token Ring – (b) Utilize the full wire speed
(iii) Cut-through switch – (c) Prevent looping
(iv) Spanning tree – (d) Checking valid address Codes

• (A) i – d, ii – a, iii – b, iv – c
• (B) i – a, ii – d, iii – b, iv – c
• (C) i – d, ii – d, iii – c, iv – b
• (D) i – d, ii – c, iii – b, iv – a

31. In an absolute loading scheme which loader function is accomplished by assembler ?

• (A) re-allocation
• (B) allocation
• (C) linking
• (D) loading

32. Which of the following grammar is LR(1)?

• (A) A → a A b, A → b A b, A → a , A → b
• (B) A → a A a, A → a A b, A → c
• (C) A → A + A, A → a
• (D) Both (A) and (B)

33. A shift-reduce parser carries out the actions specified within braces… S → x x W [ print “1”] S → y [print “2”] W → S2 [print “3”]. What is the translation of “x x x x y z z” ?

• (A) 1 1 2 3 1
• (B) 1 1 2 3 3
• (C) 2 3 1 3 1
• (D) 2 3 3 2 1

34. Contex-free Grammar (CFG) can be recognized by

• (A) Finite state automata
• (B) 2-way linear bounded automata
• (C) push down automata
• (D) both (B) and (C)

35. Synthesized attribute can be easily simulated by a

• (A) LL grammar
• (B) Ambiguous grammar
• (C) LR grammar
• (D) None of the above

36. In the process management Round-robin method is essentially the pre-emptive version of ____

• (A) FILO
• (B) FIFO
• (C) SSF
• (D) Longest time first

37. A page fault

• (A) is an error specific page.
• (B) is an access to the page not currently in memory.
• (C) occur when a page program occur in a page memory.
• (D) page used in the previous page reference.

38. A semaphore count of negative n means (s = – n) that the queue contains ____________ waiting processes.

• (A) n + 1
• (B) n
• (C) n – 1
• (D) 0

39. A program is located in the smallest available hole in the memory is

• (A) best-fit
• (B) first-fit
• (C) worst -fit
• (D) buddy

40. The Unix command used to find out the number of characters in a file is

• (A) nc
• (B) wc
• (C) chcnt
• (D) lc

41. Software Engineering is a discipline that integrates __ for the development of computer software.

• (A) Process
• (B) Methods
• (C) Tools
• (D) All

42. Any error whose cause cannot be identified anywhere within the software system is called __

• (A) Internal error
• (B) External error
• (C) Inherent error
• (D) Logic error

43. Recorded software attributes can be used in the following endeavors :
(i) Cost and schedule estimates.
(ii) Software product reliability predictions.
(iii) Managing the development process.
(iv) No where

• (A) i, ii, iv
• (B) ii, iii, iv
• (C) i, ii, iii
• (D) i, ii, iii, iv

44. Black Box testing is done

• (A) to show that s/w is operational at its interfaces i.e. input and output.
• (B) to examine internal details of code.
• (C) at client side
• (D) none of above

45. The name of the transaction file shall be provided by the operator and the file that contains the edited transaction ready for the execution shall be called

• (A) Batch .Exe
• (B) Trans. Exe
• (C) Opt. Exe
• (D) Edit. Exe

46. The single stage network is also called

• (A) one sided network
• (B) two sided network
• (C) recirculating network
• (D) pipeline network

47. Analysis of large database to retrieve information is called

• (A) OLTP
• (B) OLAP
• (C) OLDP
• (D) OLPP

48. Which technology is sometime referred to as wireless cable?

• (A) MMDS
• (B) ATM
• (C) LMDS
• (D) CDMA

49. Another name of IEEE 802.11a is _________

• (A) Wi-Max
• (B) Fast Ethernet
• (C) Wi-Fi5
• (D) Wi-Fi (Classic 5GHz)

50. The unlicensed National Information Infrastructure band operates at the ________

• (A) 2.4 GHz
• (B) 5 GHz
• (C) 33 MHz
• (D) 5 MHz