UGC NET Computer Science Solved Paper -III June2013

36. The grammar with production rules
S à aSb|SS|λ
generates language L given by :
(A) L = {w ∈{a,b}*| na (w)= nb (w) and na (v) ≥ nb (v) where v is any prefix of w}
(B) L = {w {a,b}*| na (w)= nb (w) and na (v) n(v) where v is any prefix of w}
(C) L = {w {a,b}*| na (w) nb (w) and na (v) ≥ nb (v) where v is any prefix of w}
(D) L = {w {a,b}*| na (w)nb (w) and na (v) nb (v) where v is any prefix of w}

37. A pushdown automation M = (Q, Σ, Γ, δ, q0, z, F) is a set to be deterministic subject to which of the following condition(s), for every q ∈ Q, a∈Σ U{ λ } and b Γ (s1) δ(q, a, b) contains at most one element (s2) if δ(q, λ, b) is not empty than δ(q, c, b) must be empty for every c Σ
(A) only s1
(B) only s2
(C) both s1 and s2
(D) neither s1 nor s2

38. For every context free grammar (G) there exists an algorithm that passes any W L(G) in number of steps proportional to
(A) |n|w| (B) |w| (C) |w|2 (D) |w|3

39. Match the following:
a. Context sensitive language          i. Deterministic finite automation
b. Regular grammar                     ii. Recursive enumerable
c. Context free grammar               iii. Recursive language
d. Unrestricted grammar               iv. Pushdown automation
codes:
ab c d
(A) ii i iv iii
(B) iii iv i iii
(C) iii i iv ii
(D) ii iv i iii

40. The statements s1 and s2 are given as :
s1 : Context sensitive languages are closed under intersection. concatenation, substitution and inverse homomorphism.
s2 Context free languages are closed under complementation. substitution and homomorphism.
Which of the following is correct statement?
(A) Both s1 and s2 are correct.
(B) s1 is correct and s2 is not correct.
(C) sl is not correct and s2 is correct.
(D) Both s1 and s2 are not correct.

41. Which one of the following is not an addressing mode?
(A) Register indirect
(B) Autoincrement
(C) Relative indexed
(D) Immediate operand

42. Computers can have instruction formats with
(A) only two address and three address instructions
(B) only one address and two address instructions
(C) only one address, two address .and three address instructions
(D) zero address, one address, two address and three address instructions

43. Which is not a typical program control instruction?
(A) BR (B) JMP (C) SHL (D) TST

44. Interrupt which arises from illegal or erroneous use of an instruction or data is
(A) Software interrupt
(B) Internal interrupt
(C) External interrupt
(D) All of the above

45. The simplified function in product of sums of Boolean function F(W, X, Y, Z) =Σ(0, 1,2,5,8,9.10) is
(A) (W’ + X’) (Y’ + Z’) (X’ + Z)
(B) (W’ + X’) (Y’ + Z’) (X’ + Z’)
(C) (W’ + X’) (Y’ + Z) (X’ + Z)
(D) (W’ + X’) (Y + Z’) (X’ + Z)

46. Match the following:
a. TTL        i High component density
b. ECL        ii Low power consumption
c. MOS      iii Evolution of “diode-transistor-logic”
d.CMOS    iv High speed digital circuits
codes:
a b c d
(A) iii ii i iv
(B) i iv i ii
(C) iii iv i ii
(D) i ii iii iv

47. Match the following:
a. Foreign keys                             i. Domain constraint
b. Private key                               ii. Referential integrity
c. Event control action model    iii. Encryption
d. Data security                           iv. Trigger
codes:
a b c d
(A) iii ii i iv
(B) ii i iv iii
(C) iii iv i ii
(D) i ii iii iv

48. When an array is passed as a parameter to a function which of the following statements is correct?
(A) The function can change values in the original array.
(B) The function cannot change values in the original array.
(C) Results in compilation error.
(D) Results in runtime error

49. Suppose you want to delete the name that occurs before “Vivek” in an alphabetical listing. Which of the following data structures shall be most efficient for this operation?
(A) Circular linked list
(B) Doubly linked list
(C) Linked list
(D) Dequeue

50. What will be the output of the following segment of the program ?
main( )
(
char *s = “hello world”;
int i = 7;
Printf(“%.*s”, i,s);
}
(A) Syntax error
(B) hello w
(C) hello
(D) o world
Note: All the given options are wrongoutput for the given c progam is %.*s

51. Trace the error:
void main()
(
int *b, &a;
*b=20
printf(“%d, %d”, a, *b)
}
(A) No error
(B) Logical error
(C) Syntax error
(D) Semantic error

52. Match the following:
a. calloc() i. Frees previously allocated space
b. free() ii. Modifies previously allocated space
c. malloc() iii. Allocates space for array
d. realloc() iv. Allocates requested size of space
codes:
a b c d
(A) iii i iv ii
(B) iii ii i iv
(C) iii iv i ii
(D) iv ii iii i

53. Binary symmetric channel uses
(A) Half duplex protocol
(B) Full duplex protocol
(C) Bit oriented protocol
(D) None of the above

54. Hamming distance between 100101000110 and 110111101101 is
(A) 3 (B) 4 (C) 5 (D) 6

55. Given code word 1110001010 is to be transmitted with even parity check bit. The encoded word to be transmitted for this code is
(A) 11100010101 (B) 11100010100 (C) 1110001010 (D) 111000101

56. The number of distinct binary images which can be generated from a given binary image of right M x N are
(A) M + N (B) M x N (C) 2M+N (D) 2MN

57. If f(x, y) is a digital image, then x, y and amplitude values of f are
(A) Finite
(B) Infinite
(C) Neither finite nor infinite
(D) None of the above

58. Consider the following processes with time slice of 4 milliseconds (I/O requests are ignored) :
Process A B C D
Arrival time    0 1 2 3
CPU cycle        8 4 9 5
The average tum around time of these processes will be
(A) 19.25 milliseconds
(B) 18.25 milliseconds
(C) 19.5 milliseconds
(D) 18.5 milliseconds

59. A job has four pages A, B, C, D and the main memory has two page frames only. The job needs to
process its pages in following order: ABACABDBACD Assuming that a page interrupt occurs when a new page is brought in the main memory, irrespective of whether the page is swapped out or not. The number of page interrupts in FIFO and LRU page replacement algorithms are
(A) 9 and 7 (B) 7 and 6 (C) 9 and 8 (D) 8 and 6

60. Suppose S and Q are two semaphores initialized to 1. PI and P2 are two processes which are sharing resources.
P1 has statements P2 has statements
wait(S) ;                        wait(Q) ;
wait(Q) ;                       wait(S) ;
critical- critical-
section1; section 2;
signal(S) ; signal(Q) ;
signal(Q) ; signal(S) ;
Their execution may sometimes lead to an undesirable situation called
(A) Starvation
(B) Race condition
(C) Multithreading
(D) Deadlock

61. An operating system using banker’s algorithm for deadlock avoidance has ten dedicated devices (of same type) and has three processes P1, P2 and P3 with maximum resource requirements of 4, 5 and 8 respectively. There are two states of allocation of devices as follows:
State I Processes P1 P2 P3
Devices allocated 2 3 4
State 2 Processes P1 P2 P3
Devices allocated 0 2 4
Which of the following is correct?
(A) State 1 is unsafe and state 2 is safe.
(B) State I is safe and state 2 is unsafe.
(C) Both, state I and state 2 are safe.
(D) Both, state I and state 2 are unsafe.

62. Let the time taken to switch between user mode and kernel mode of execution be T1 while time taken to switch between two user processes be T2. Which of the following is correct?
(A) T1 <T2
(B) T1 >T2
(C) T1 = T2
(D) Nothing can be said about the relation between T1 and T2

63. Working set model is used in memory management to implement the concept of
(A) Swapping
(B) Principal of Locality
(C) Segmentation
(D) Thrashing

64. A UNIX file system has 1 KB block size and 4-byte disk addresses. What is the maximum file size if the inode contains ten direct block entries, one single indirect block entry, one double indirect block entry and one triple indirect block entry ?
(A) 30 GB (B) 64 GB  (C) 16 GB (D) 1 GB
Explanation:   

65. A thread is usually defined as a light weight process because an Operating System (OS) maintains smaller data structure for a thread than for a process. In relation to this, which of the following statement is correct?
(A) OS maintains only scheduling .and accounting information for each thread.
(B) OS maintains only CPU registers for each thread.
(C) OS does not maintain a separate stack for each thread.
(D) OS does not maintain virtual memory state for each thread.

66. The versions of windows operating system like windows XP and window Vista uses following file system:
(A) FAT-16
(B) FAT-32
(C) NTFS (NT File System)
(D) All of the above

67. Which one of the following is a correct implementation of the meta-predicate “not” in PROLOG (Here G
represents a goal) ?
(A) not(G):- !, call(G), fail. not(G).
(B) not(G):- cal1(G), !, fail.not(G).
(C) not(G):- cal1(G), fail, !. not(G).
(D) not(G):- cal1(G), fail. not(G):- !.

68. Which one of the following is not an informed search technique?
(A) Hill climbing search
(B) Best first search
(C) A* search
(D) Depth first search

69. If we convert
∃u ∀v ∀x ∃y (Pf(u),v,x,y) —> Q(u,v,y)) to ∀v ∀x (Pf(a),v,x, g(v,x)) –> Q(a,v,g(v,x)))
This process is known as
(A) Simplification
(B) Unification
(C) Skolemization
(D) Resolution

70. Given two jugs of capacities 5 litres and 3 litres with no measuring markers on them. Assume that there
is endless supply of water. Then the minimum number of states to measure 4 litres water will be
(A) 3 (B) 4 (C) 5 (D) 7

71. The map colouring problem can be solved using which of the following technique?
(A) Means·end analysis
(B) Constraint satisfaction
(C) AO’ search
(D) Breadth first search

72. Which of the following is a knowledge representation technique used to represent knowledge about stereotype situation?
(A) Semantic network
(B) Frames
(C) Scripts
(D) Conceptual Dependency
73. A fuzzy set A on R is ________ iff A(λx1 + (1- λ)x2) ≥ min [A(x1),A(x2)]
for all x1, x2 R and all λ [0,1], where min denotes
the minimum operator
(A)Support
(B)α-cut
(C)Convex
(D)Concave

74. If A and B are two fuzzy sets with membership functions
μA(x) = {0.6,0.5,0.1,0.7, 0.8}
μB(x) = {0.9,0.2,0.6, 0.8, 0.5}
Then the value of μAUB(x)will be
(A) {0.9, 0.5, 0.6, 0.8, 0.8}
(B) {0.6, 0.2, 0.1, 0.7, 0.5}
(C) {0.1, 0.5, 0.4, 0.2, 0.2}
(D) {0.1, 0.5, 0.4, 0.2, 0.3}

75. Consider a single perception with weights as given in the following figure:

The above perception can solve
(A) OR problem
(B) AND problem
(C) XOR problem
(D) All of the above

Comments are closed.