Computer Science Quiz 2

Moving process from main memory to disk is called:
(A) Caching                  (B) Termination
(C) Swapping               (D) Interruption
Answer: C

Part of a program where the shared memory is accessed and which should be executed indivisibly, is called:
(A) Semaphores                      (B) Directory
(C) Critical Section                  (D) Mutual exclusion
Answer: C

Windows is a .................. operating system.
(A) Non pre-emptive                (B) Pre-emptive
(C) Multi-user                           (D) Real time
Answer: C

The “nice” command is used in Unix:
(A) to decrease the priority of a process
(B) to increase the priority of a process
(C) to get the highest priority
(D) nothing to do with the priorities
Answer: A, B
Explanation:
For Increase or decrease the priority of a job/Process we use Nice command, and its range -19 to 20.
If we need to increase the priority then we needs to decrease the priority number
If we need to decrease the priority then we needs to increase the priority number
Ex:- Nice -n 10 <cmd>

 Which page replacement policy suffers from Belady’s anomaly?
(A) LRU             (B) LFU
(C) FIFO            (D) OPTIMAL
Answer: C

Cache memory is:
(A) High Speed Register        (B) Low-Speed RAM
(C) Non-Volatile RAM             (D) High-Speed RAM
Answer: D

  A recursive foreign key is a:
(A) references a relation                 
(B) references a table
(C) references its own relation       
(D) references a foreign key
Answer: C

 A sub class having more than one super class is called:
(A) Category                 (B) Classification
(C) Combination          (D) Partial Participation
Answer: A

 A relation R={A,B,C,D,E,F} is given with following set of functional dependencies:

F={A→B,AD→C,B→F,A→E}. Which of the following is Candidate Key?
(A) A                   (B) AC

(C) AD               (D) None of these
Answer: C

Which statement is false regarding data independence?
(A) Hierarchical data model suffers from data Independence
(B) Network model suffers from data Independence
(C) Relational model suffers only from logical data Independence
(D) Relational model suffers only from physical data Independence
Answer: C


The time required to find shortest path in a graph with n vertices and e edges is:
(A) O(e)              (B) O(n)
(C) O(e2)            (D) O(n2)
Answer: D

Pre order is also known as:
(A) Depth first order                 (B) Breadth first order
(C) Topological order              (D) Linear order
Answer: A

SHARE

About df