Saturday, 8 November 2014

UGC NET/JRF Computer Science Paper III June 2013 Solved Mcqs - Part 2

41.       Which one of the following is not an addressing mode?
(A) Register indirect    (B) Auto increment
(C) Relative indexed   (D) Immediate operand
Answer: C
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
Answer: D
43.       Which is not a typical program control instruction?
(A) BR                (B) JMP
(C) SHL                         (D) TST
Answer: C
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
Answer: B
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)
Answer: A
46.       Match the following:
a. TTL                 i. High component density
b. ECL               ii. Low power consumption
c. MOS               iii. Evolution of “diodetransistor- logic”
d. CMOS           iv. High speed digital circuits
Codes:
      a   b   c    d
(A) iii   ii    i    iv
(B) i    iv   iii   ii
(C) iii  iv    i    ii
(D) i    ii    iii   iv
Answer: C
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
Answer: B
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.
Answer: A
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
Answer: B
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
Answer: Marks given to all
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
Answer: C
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
Answer: A
53.    Binary symmetric channel uses
(A) Half duplex protocol        
(B) Full duplex protocol
(C) Bit oriented protocol        
(D) None of the above
Answer: A
54.    Hamming distance between 100101000110 and 110111101101 is
(A) 3       (B) 4
(C) 5       (D) 6
Answer: D
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
Answer: A
56.    The number of distinct binary images which can be generated from a given binary image of right M × N are
(A) M + N           (B) M × N
(C) 2M + N            (D) 2MN
Answer: D
57.    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
Answer: A
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 turn around time of these processes will be
(A) 19.25 milliseconds                        (B) 18.25 milliseconds
(C) 19.5 milliseconds              (D) 18.5 milliseconds
Answer: B
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
Answer: C
60.    Suppose S and Q are two semaphores initialized to 1. P1 and P2 are two processes which are sharing resources.
P1 has statements                 P2 has statements
wait(S) ;                                     wait(Q) ;
wait(Q) ;                                     wait(S) ;
critical section1;                       critical 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
Answer: D
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 1   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 1 is safe and state 2 is unsafe.
(C) Both, state 1 and state 2 are safe.
(D) Both, state 1 and state 2 are unsafe.
Answer: A
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.
Answer: A
63.    Working set model is used in memory management to implement the concept of
(A) Swapping               (B) Principal of Locality
(C) Segmentation        (D) Thrashing
Answer: B
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
Answer: C
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.
Answer: B
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
Answer: D
67.    Which one of the following is a correct implementation of the metapredicate “not” in PROLOG (Here G represents a goal) ?
(A) not(G):– !, call(G), fail.
not(G).
(B) not(G):– call(G), !, fail.
not(G).
(C) not(G):– call(G), fail, !.
not(G).
(D) not(G):– call(G), fail.
not(G):– !.
Answer: B
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
Answer: D
69.    If we convert
u v x y (P(f(u),v, x, y) → Q(u,v,y)) to
v x (P(f(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
Answer: C
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
Answer: D
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
Answer: B
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
Answer: C
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
Answer: C
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 μ(AB)’(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}
Answer: C
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
Answer: B

  Part 1   Part 2 

0 comments:

Post a Comment

UGC NET Computer Science

Computer GK App