Computer Science MCQs | Computer Science Multiple Choice Questions with Answers

Questions
1 STRIPS addresses the problem of efficiently representing and implementation of a planner. It is not related to which one of the following ?
A SHAKEY
B SRI
C NLP
D None of these

Answer: Option [A]
2 Slots and facets are used in
A Semantic Networks
B Frames
C Rules
D All of these

Answer: Option [B]
3 Consider f(N) = g(N) + h(N) Where function g is a measure of the cost of getting from the start node to the current node N and h is an estimate of additional cost of getting from the current node N to the goal node. Then f(N) = h(N) is used in which one of the following algorithms ?
A A* algorithm
B AO* algorithm
C Greedy best first search algorithm
D Iterative A* algorithm

Answer: Option [D]
4 ________predicate calculus allows quantified variables to refer to objects in the domain of discourse and not to predicates or functions.
A Zero-order
B First-order
C Second-order
D High-order

Answer: Option [A]
5 ________ is used in game trees to reduce the number of branches of the search tree to be traversed without affecting the solution.
A Best first search
B Goal stack planning
C Alpha-beta pruning procedure
D Min-max search

Answer: Option [B]
6 Consider a uniprocessor system where new processes arrive at an average of five processes per minute and each process needs an average of 6 seconds of service time. What will be the CPU utilization ?
A 80 %
B 50 %
C 60 %
D 30 %

Answer: Option [B]
7 Consider a program that consists of 8 pages (from 0 to 7) and we have 4 page frames in the physical memory for the pages. The page reference string is : 1 2 3 2 5 6 3 4 6 3 7 3 1 5 3 6 3 4 2 4 3 4 5 1 The number of page faults in LRU and optimal page replacement algorithms are respectively (without including initial page faults to fill available page frames with pages) : starvation problem
A 9 and 6
B 10 and 7
C 9 and 7
D 10 and 6

Answer: Option [B]
8 Which of the following statements is not true about disk-arm scheduling algorithms ?
A SSTF (shortest seek time first) algorithm increases performance of FCFS
B The number of requests for disk service are not influenced by file allocation method
C Caching the directories and index blocks in main memory can also help in reducing disk arm movements
D SCAN and C-SCAN algorithms are less likely to have a

Answer: Option [B]
9 _________ maintains the list of free disk blocks in the Unix file system.
A I-node
B Boot block
C Super block
D File allocation table

Answer: Option [B]
10 A part of Windows 2000 operating system that is not portable is
A Device Management
B Virtual Memory Management
C Processor Management
D User Interface

Answer: Option [B]
11 The advantage of _______ is that it can reference memory without paying the price of having a full memory address in the instruction.
A Direct addressing
B Indexed addressing
C Register addressing
D Register Indirect addressing

Answer: Option [A]
12 The reverse polish notation equivalent to the infix expression ((A + B) * C + D)/(E + F + G)
A A B + C * D + EF + G + /
B A B + C D * + E F + G + /
C A B + C * D + E F G + +/
D A B + C * D + E + F G + /

Answer: Option [B]
13 The output of a sequential circuit depends on
A present input only
B past input only
C both present and past input
D past output only

Answer: Option [D]
14 A byte addressable computer has a memory capacity of 2m Kbytes and can perform 2n operations. An instruction involving 3 operands and one operator needs a maximum of
A 3m bits
B m + n bits
C 3m + n bits
D 3m + n + 30 bits

Answer: Option [A]
15 Which of the following flip-flops is free from race condition ?
A T flip-flop
B SR flip-flop
C Master-slave JK flip-flop
D None of the above

Answer: Option [B]
16 One of the main features that distinguish microprocessor from micro-computers is
A words are usually larger in microprocessors
B words are shorter in microprocessors
C microprocessor does not contain I/O devices
D None of the above

Answer: Option [B]
17 The output generated by the LINUX command : $ seq 1 2 10 will be
A 1 2 10
B 1 2 3 4 5 6 7 8 9 10
C 1 3 5 7 9
D 1 5 10

Answer: Option [B]
18 All the classes necessary for windows programming are available in the module :
A win.txt
B win.main
C win.std
D MFC

Answer: Option [B]
19 Windows 32 API supports
A 16-bit Windows
B 32-bit Windows
C 64-bit Windows
D All of the above

Answer: Option [B]
20 Superficially the term “objectoriented”, means that, we organize software as a
A collection of continuous objects that incorporates both data structure and behaviour
B collection of discrete objects that incorporates both discrete structure and behaviour
C collection of discrete objects that incorporates both data structure and behaviour
D collection of objects that incorporates both discrete data structure and behaviour

Answer: Option [B]