Computer Science and Application UGC-NET 2009 December Paper II - Q.25- Q.36
25. A hash function f defined as f(key)=key mod 7, with linear probing used to resolve collisions. Insert the keys 37,38,72,48,98 and 11 into the table indexed from 0 to 6. What will be the location of 11?
(A) 3 (B) 4 (C ) 5 (D) 6
Ans:- C
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
Ans:- D
27. What is the maximum window size in sliding window protocol used in a computer network?
(A) 4 (B) 8 (C ) 15 (D) 16
Ans:- A
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
Ans:- C
29. In case of Bus/Tree topology signal balancing issue is overcome by
(A) Modulation (B) Polling
(C ) Segmentation (D) Strong transmitter
Ans:- C
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
Ans:- A
31. In an absolute loading scheme which loader function is accomplished by assembler?
(A) re-allocation (B) allocation (C ) linking (D) loading
Ans:- A.
Explanation: Implementation of Absolute loader: The four loader functions are performed as following: 1.Allocation- By programmer 2.Linking- By programmer 3.Relocation- By assembler 4.Loading- By loader
32. Which of the following grammar is LR(1)?
(A) A->aAb, A->bAb,A->a,A->b
(B) A->aAa,A->aAb,A->c
(C ) A->A+A,A->a
(D)Both (A) and (B)
Ans:- D
33. A shift-reduce parser carries out the actions specified within braces immediately after reducing with the corresponding rule of the grammar.
S->xxW[ 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
Ans:- C
34. Context-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)
Ans:- D
35. Synthesized attribute can be easily simulated by a
(A) LL grammar (B) Ambiguous grammar
(C ) LR grammar (D) None of the above
Ans:- C
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
Ans:- B
25. A hash function f defined as f(key)=key mod 7, with linear probing used to resolve collisions. Insert the keys 37,38,72,48,98 and 11 into the table indexed from 0 to 6. What will be the location of 11?
(A) 3 (B) 4 (C ) 5 (D) 6
Ans:- C
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
Ans:- D
27. What is the maximum window size in sliding window protocol used in a computer network?
(A) 4 (B) 8 (C ) 15 (D) 16
Ans:- A
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
Ans:- C
29. In case of Bus/Tree topology signal balancing issue is overcome by
(A) Modulation (B) Polling
(C ) Segmentation (D) Strong transmitter
Ans:- C
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
Ans:- A
31. In an absolute loading scheme which loader function is accomplished by assembler?
(A) re-allocation (B) allocation (C ) linking (D) loading
Ans:- A.
Explanation: Implementation of Absolute loader: The four loader functions are performed as following: 1.Allocation- By programmer 2.Linking- By programmer 3.Relocation- By assembler 4.Loading- By loader
32. Which of the following grammar is LR(1)?
(A) A->aAb, A->bAb,A->a,A->b
(B) A->aAa,A->aAb,A->c
(C ) A->A+A,A->a
(D)Both (A) and (B)
Ans:- D
33. A shift-reduce parser carries out the actions specified within braces immediately after reducing with the corresponding rule of the grammar.
S->xxW[ 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
Ans:- C
34. Context-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)
Ans:- D
35. Synthesized attribute can be easily simulated by a
(A) LL grammar (B) Ambiguous grammar
(C ) LR grammar (D) None of the above
Ans:- C
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
Ans:- B