My Profile Home Log Out

Welcome Partha Garai (impersonating Hiranmoy

Mondal)
CUET Mock4 (DS + InC + OS)_Random

Logged in as Student
Sunday 3rd Mar, 2024 08:36:49 AM

Section : C-1st_Sem 2023 Course : JECA Joint Entrance Exam MCA (WB JECA)

Year : 2023-2024 Full Marks : 120

Group A (Data Structure): Answer All question(s)

1. Consider the usual algorithm for determining whether a sequence of parentheses is balanced. The Marks: 1 (Correct: c)
maximum number of parentheses that appear on the stack AT ANY ONE TIME when the algorithm analyzes:
(()(())(()))?
a) 1 b) 2 c) 3 d) 4 or more

Explanation: In the entire parenthesis balancing method when the incoming token is a left parenthesis it is pushed into stack. A right parenthesis makes pop operation to delete
the elements in stack till we get left parenthesis as top most element. 3 elements are there in stack before right parentheses comes. Therefore, maximum number of elements in
stack at run time is 3.

2. Evaluate the following statement using infix evaluation algorithm and choose the correct answer. 1+2*3-2 Marks: 2 (Correct: c)
a) 3 b) 6 c) 5 d) 4

Explanation: According to precedence of operators, * is evaluated first. + and – have equal priorities. Hence, 1+6-2= 5.

3. In linked list each node contains a minimum of two fields. One field is data field to store the data second Marks: 1 (Correct: c)
field is?
a) Pointer to character b) Pointer to integer c) Pointer to node d) Node

Explanation: Each node in a linked list contains data and a pointer (reference) to the next node. Second field contains pointer to node.

4. Which of the following points is/are not true about Linked List data structure when it is compared with an Marks: 1 (Correct: d)
array?
a) Arrays have better cache locality d) Access of elements in linked list
b) It is easy to insert and delete c) Random access is not allowed in a
that can make them better in terms of takes less time than compared to
elements in Linked List typical implementation of Linked Lists
performance arrays

Explanation: To access an element in a linked list, we need to traverse every element until we reach the desired element. This will take more time than arrays as arrays provide
random access to its elements.

5. Which of the following application makes use of a circular linked list? Marks: 1 (Correct: a)
a) Undo operation in a text editor b) Recursive function calls c) Allocating CPU to resources d) Implement Hash Tables

Explanation: If the list is empty make the new node as ‘head’, otherwise traverse the list to the end and make its ‘next’ pointer point to the new node, set the new node’s next
point to the current head and make the new node as the head.

6. You are asked to perform a queue operation using a stack. Assume the size of the stack is some value ‘n’ Marks: 1 (Correct: a)
and there are ‘m’ number of variables in this stack. The time complexity of performing deQueue operation is
(Using only stack operations like push and pop)(Tightly bound).
a) O(m) b) O(n) c) O(m*n) d) Data is insufficient

Explanation: To perform deQueue operation you need to pop each element from the first stack and push it into the second stack. In this case you need to pop ‘m’ times and
need to perform push operations also ‘m’ times. Then you pop the first element from this second stack (constant time) and pass all the elements to the first stack (as done in the
beginning)(‘m-1’ times). Therfore the time complexity is O(m).

7. The type of expression in which operator succeeds its operands is? Marks: 1 (Correct: c)
d) Both Prefix and Postfix
a) Infix Expression b) Prefix Expression c) Postfix Expression
Expressions

Explanation: The expression in which operator succeeds its operands is called postfix expression. The expression in which operator precedes the operands is called prefix
expression. If an operator is present between two operands, then it is called infix expressions.

8. Which of the following data structure is used to convert postfix expression to infix expression? Marks: 1 (Correct: a)
a) Stack b) Queue c) Linked List d) Heap

Explanation: To convert the postfix expression into infix expression we need stack. We need stack to maintain the intermediate infix expressions. We use stack to hold
operands.

9. Which of the following statement is incorrect with respect to infix to postfix conversion algorithm? Marks: 1 (Correct: c)
b) operator is placed in the stack
a) operand is always placed in the c) parenthesis are included in the d) higher and equal priority operators
when the stack operator has lower
output output follow the same condition
precedence

Explanation: Parentheses are not included in the output. They are placed in the operator stack and then discarded.

10. Linked list data structure offers considerable saving in _____________ Marks: 1 (Correct: c)
This Site Maintained by Webtech Services
 c) Space Utilization and
a) Computational Time b) Space Utilization d) Speed Utilization
Computational Time

Explanation: Linked lists saves both space and time.

11. What is the value of the postfix expression 6 3 2 4 + - *? Marks: 1 (Correct: d)

a) 1 b) 40 c) 74 d) -18

Explanation: Postfix Expression is (6*(3-(2+4))) which results -18 as output.

12. Which of the following arrays are used in the implementation of list data type in python? Marks: 1 (Correct: b)
a) Bit array b) Dynamic arrays c) Sparse arrays d) Parallel arrays

Explanation: Dynamic arrays are used in the implementation of list data type in python. Sparse arrays are used in the implementation of sparse matrix in Numpy module. All bit
array operations are implemented in bitarray module.

13. Which data structure is used for implementing recursion? Marks: 1 (Correct: b)
a) Queue b) Stack c) Array d) List

Explanation: Stacks are used for the implementation of Recursion.

14. Express -15 as a 6-bit signed binary number. Marks: 2 (Correct: b)

a) 1111 b) 101111 c) 101110 d) 1110

Explanation: The first 4 1s from the right represent the number 15, 2 more bits are padded to make it 6 digits and the leftmost bit is a 1 to represent that it is -15.

15. Given only a single array of size 10 and no other memory is available. Which of the following operation is Marks: 2 (Correct: c)
not feasible to implement (Given only push and pop operation)?
a) Push b) Pop c) Enqueue d) Returntop

Explanation: To perform Enqueue using just push and pop operations, there is a need of another array of same size. But as there is no extra available memeory, the given
operation is not feasible.

16. You have two jars, one jar which has 10 rings and the other has none. They are placed one above the Marks: 2 (Correct: b)
other. You want to remove the last ring in the jar. And the second jar is weak and cannot be used to store
rings for a long time.
b) Empty the first jar by removing it
a) Empty the first jar by removing it one by one from the first jar and
c) There exists no possible way to do d) Break the jar and remove the last
one by one from the first jar and placing it into the second jar and
this one
placing it into the second jar empty the second jar by placing all
the rings into the first jar one by one

Explanation: This is similar to performing dequeue operation using push and pop only. Elements in the first jar are taken out and placed in the second jar. After removing the last
element from the first jar, remove all the elements in the second jar and place them in the first jar.

17. The result of the postfix expression 5 3 * 9 + 6 / 8 4 / + is _____________ Marks: 2 (Correct: b)

a) 8 b) 6 c) 10 d) 9

Explanation: Given postfix expression: 5 3 * 9 + 6 / 8 4 / + Result = 5 3 * 9 + 6 / 8 4 / + = (5 * 3) 9 + 6 / (8 / 4) + = ((5 * 3) + 9) / 6 + ( 8 / 4) = ( 24 / 6) + 2 = 4 + 2 = 6.

18. How many stacks are required for reversing a word algorithm? Marks: 1 (Correct: a)
a) one b) two c) three d) four

Explanation: Only 1 stack is required for reversing a word using stack. In that stack, push and pop operations are carried out.

19. Which of the following is an infix expression? Marks: 1 (Correct: a)

a) (a+ b) *(c+d) c) d)

Explanation: (a+b)*(c+d) is an infix expression. +ab is a prefix expression and ab+c* is a postfix expression.

20. The postfix form of the expression (A+ B)*(C*D- E)*F / G is? Marks: 1 (Correct: c)
a) AB+ CD*E - FG /** b) AB + CD* E - F **G / c) AB + CD* E - *F *G / d) AB + CDE * - * F *G /

Explanation: (((A+ B)*(C*D- E)*F) / G) is converted to postfix expression as (AB+(*(C*D- E)*F )/ G) (AB+CD*E-*F) / G (AB+CD*E-*F * G/). Thus Postfix expression is AB+CD*E-
*F*G/

21. When an operand is read, which of the following is done? Marks: 1 (Correct: a)
a) It is placed on to the output b) It is placed in operator stack c) It is ignored d) Operator stack is emptied

Explanation: While converting an infix expression to a postfix expression, when an operand is read, it is placed on to the output. When an operator is read, it is placed in the
operator stack.

22. Linked list is considered as an example of ___________ type of memory allocation. Marks: 1 (Correct: a)
a) Dynamic b) Static c) Compile time d) Heap

Explanation: As memory is allocated at the run time.

23. What is the time complexity of reversing a word using stack algorithm? Marks: 1 (Correct: c)
a) O (N log N) 2 c) O (N) d) O (M log N)
b) O (N )

Explanation: The time complexity of reversing a stack is mathematically found to be O (N) where N is the input.

This Site Maintained by Webtech Services

 24. Consider you have an array of some random size. You need to perform dequeue operation. You can Marks: 2 (Correct: a)
perform it using stack operation (push and pop) or using queue operations itself (enQueue and Dequeue).
The output is guaranteed to be same. Find some differences?
a) They will have different time b) The memory used will not be c) There are chances that output
d) No differences
complexities different might be different

Explanation: To perform operations such as Dequeue using stack operation you need to empty all the elements from the current stack and push it into the next stack, resulting
in a O(number of elements) complexity whereas the time complexity of dequeue operation itself is O(1). And there is a need of a extra stack. Therefore more memory is needed.

25. Is the given statement ((A+B) + [C-D]] valid with respect to balancing of symbols? Marks: 1 (Correct: b)
a) TRUE b) False View Answer c) d)

Explanation: The given statement is invalid with respect to balancing of symbols because the last parentheses do not correspond to the opening braces.

26. Which of these operators have the highest order of precedence? Marks: 1 (Correct: c)
a) ‘(‘ and ‘)’ b) ‘*’ and ‘/’ c) ‘~’ and ‘^’ d) ‘+’ and ‘-‘

Explanation: The highest order of precedence is ~ and ^ followed by ‘*’ ,’ /’, ‘+’ ,’-‘ and then braces ‘(‘ ‘)’.

27. From the given Expression tree, identify the correct postfix expression from the list of options. Marks: 1 (Correct: b)

a) ab*cd*+ b) ab*cd-+ c) abcd-*+ d) ab*+cd-

Explanation: From the given expression tree, the infix expression is found to be (a*b)+(c-d). Converting it to postfix, we get, ab*cd-+.

28. In a circular queue, how do you increment the rear end of the queue? Marks: 1 (Correct: b)
a) rear++ b) (rear+1) % CAPACITY c) (rear % CAPACITY)+1 d) rear-

Explanation: Ensures rear takes the values from 0 to (CAPACITY-1).

29. Process of removing an element from stack is called __________ Marks: 1 (Correct: d)
a) Create b) Push c) Evaluation d) Pop

Explanation: Elements in the stack are removed using pop operation. Pop operation removes the top most element in the stack i.e. last entered element.

30. What does ‘stack underflow’ refer to? Marks: 1 (Correct: c)

a) accessing item from an undefined c) removing items from an empty
b) adding items to a full stack d) index out of bounds exception
stack stack

Explanation: Removing items from an empty stack is termed as stack underflow.

31. Which application of stack is used to ensure that the pair of parentheses is properly nested? Marks: 1 (Correct: a)
c) Conversion of an infix to postfix d) Conversion of an infix to prefix
a) Balancing symbols b) Reversing a stack
expression expression

Explanation: Balancing symbols application ensures that the pair of parentheses are properly nested while reversing stack reverses a stack.

32. Operations required for reversing a word or a string using stack are push() and pop(). Marks: 1 (Correct: a)
a) TRUE b) False View Answer c) d)

Explanation: Push operation inserts a character into the stack and pop operation pops the top of the stack.

33. It is easier for a computer to process a postfix expression than an infix expression. Marks: 1 (Correct: a)
a) TRUE b) False View Answer c) d)

Explanation: Computers can easily process a postfix expression because a postfix expression keeps track of precedence of operators.

34. What are the applications of dequeue? Marks: 1 (Correct: b)

b) Can be used as both stack and c) To find the maximum of all sub
a) A-Steal job scheduling algorithm d) All of the mentioned
queue arrays of size k

Explanation: Have two pointers, one(temp) pointing to the first element and the other(cur) pointing to the second element. Make the ‘head’ point to the second element, this
removes all reference for ‘temp’.

35. Out of the following operators (^, *, +, and, $), the one having highest priority is _________ Marks: 1 (Correct: c)
a) + b) $ c) ^ d) and

Explanation: According to the algorithm (infix-prefix), it follows that the exponentiation will have the highest priority.

36. How many passes does the balancing symbols algorithm makes through the input? Marks: 1 (Correct: a)
a) one b) two c) three d) four

Explanation: The balancing symbols algorithm makes only one pass through the input since it is linear.

37. The prefix form of A-B/ (C * D ^ E) is? Marks: 1 (Correct: c)

This Site Maintained by Webtech Services
 a) -/*^ACBDE b) -ABCD*^DE c) -A/B*C^DE d) -A/BC*^DE

Explanation: Infix Expression is (A-B)/(C*D^E) (-A/B)(C*D^E) -A/B*C^DE. Thus prefix expression is -A/B*C^DE.

38. What would be the asymptotic time complexity to find an element in the linked list? Marks: 1 (Correct: b)
a) O(1) b) O(n) c) O(n2) d) O(n4)

Explanation: If the required element is in the last position, we need to traverse the entire linked list. This will take O (n) time to search the element.

39. What is the time complexity of balancing parentheses algorithm? Marks: 1 (Correct: a)
a) O (N) b) O (N log N) c) O (M log N) d) O (N2)

Explanation: The time complexity of balancing parentheses algorithm is mathematically found to be O (N).

40. If the elements "A", "B", "C" and "D" are placed in a queue and are deleted one at a time, in what order Marks: 1 (Correct: a)
will they be removed?
a) ABCD b) DCBA c) DCAB d) ABDC

Explanation: Queue follows FIFO approach. i.e. First in First Out Approach. So, the order of removal elements are ABCD.

Group B (Introduction of Computers): Answer All question(s)

41. The internal components of the processor are connected by _______ Marks: 1 (Correct: b)
a) Processor intra-connectivity
b) Processor bus c) Memory bus d) Rambus
circuitry

Explanation: The processor BUS is used to connect the various parts in order to provide a direct connection to the CPU.

42. ______ type circuits are generally used for interrupt service lines. Marks: 1 (Correct: a)
i) open-collector
ii) open-drain
iii) XOR
iv) XNOR
a) i, ii b) ii c) ii, iii d) ii, iv

Explanation: None.

43. The main advantage of multiple bus organisation over a single bus is _____ Marks: 1 (Correct: a)
a) Reduction in the number of cycles
b) Increase in size of the registers c) Better Connectivity d) None of the mentioned
for execution

Explanation: None.

44. The added output of the bits of the interrupt register and the mask register is set as an input of Marks: 2 (Correct: b)
______________
a) Priority decoder b) Priority encoder c) Process id encoder d) Multiplexer

Explanation: In a parallel priority system, the priority of the device is obtained by adding the contents of the interrupt register and the mask register.

45. The return address of the Sub-routine is pointed to by _______ Marks: 1 (Correct: b)
a) IR b) PC c) MAR d) Special memory registers

Explanation: The return address from the subroutine is pointed to by the PC.

46. After the device completes its operation _____ assumes the control of the BUS. Marks: 1 (Correct: b)
a) Another device b) Processor c) Controller d) None of the mentioned

Explanation: After the device completes the operation it releases the BUS and the processor takes over it.

47. A memory organisation that can hold upto 1024 bits and has a minimum of 10 address lines can be Marks: 1 (Correct: d)
organized into _____
a) 128 X 8 b) 256 X 4 c) 512 X 2 d) 1024 X 1

Explanation: All the others require less than 10 address bits.

48. ______________ register is used for the purpose of controlling the status of each interrupt request in Marks: 2 (Correct: d)
parallel priority interrupt.
a) Mass b) Mark c) Make d) Mask

Explanation: None.

49. Which of the following describes the correct format of an input instruction? Marks: 1 (Correct: a)
a) IN 82 b) INPUT 82 c) INP 82 d) 82 INP

Explanation: The input/output instructions are used to transfer information between external peripherals and the CPU. The correct format of an input instruction is: IN 8-bit port
address. Here, IN 82 is the correct option, where 82 is the designated port address. All the other options are invalid.

50. What is subroutine nesting? Marks: 1 (Correct: c)

b) Using a linking nest statement to
a) Having multiple subroutines in a
put many subroutines under the same c) Having one routine call the other d) None of the mentioned
program
name

This Site Maintained by Webtech Services

 Explanation: None.

51. VLSI stands for ___________ Marks: 1 (Correct: a)

a) Very Large Scale Integration b) Very Large Stand-alone Integration c) Volatile Layer System Interface d) None of the mentioned

Explanation: None.

52. ______ are used to overcome the difference in data transfer speeds of various devices. Marks: 1 (Correct: d)
a) Speed enhancing circuitory b) Bridge circuits c) Multiple Buses d) Buffer registers

Explanation: By using Buffer registers, the processor sends the data to the I/O device at the processor speed and the data gets stored in the buffer. After that the data gets sent
to or from the buffer to the devices at the device speed.

53. In Centralised Arbitration ______ is/are is the BUS master. Marks: 1 (Correct: d)
a) Processor b) DMA controller c) Device d) Both Processor and DMA controller

Explanation: The BUS master is the one that decides which will get the BUS.

54. The private work space dedicated to a subroutine is called as ________ Marks: 1 (Correct: c)
a) System heap b) Reserve c) Stack frame d) Allocation

Explanation: This work space is where the intermediate values of the subroutines are stored.

55. To reduce the number of external connections required, we make use of ______ Marks: 1 (Correct: b)
a) De-multiplexer b) Multiplexer c) Encoder d) Decoder

Explanation: We multiplex the various address lines onto fewer pins.

56. The registers of the controller are ______ Marks: 1 (Correct: c)

a) 64 bits b) 24 bits c) 32 bits d) 16 bits

Explanation: None.

57. The I/O interface required to connect the I/O device to the bus consists of ______ Marks: 1 (Correct: c)
c) Address decoder, registers and
a) Address decoder and registers b) Control circuits d) Only Control circuits
Control circuits

Explanation: The I/O devices are connected to the CPU via BUS and to interact with the BUS they have an interface.

58. The only difference between the EEPROM and flash memory is that the latter doesn’t allow bulk data to be Marks: 1 (Correct: a)
written.
a) TRUE b) False View Answer c) d)

Explanation: This is not permitted as the previous contents of the cells will be overwritten.

59. 1 yottabyte = ______________ Marks: 1 (Correct: c)

a) 1024 TB b) 1024 EB c) 1024 ZB d) 1024 PB

Explanation: 1 yottabyte is equal to 1024 ZB, which stands for zettabyte. Further, 1 ZB=1024 EB (exabyte) and and 1 EB=1024PB (petabyte).

60. When Performing a looping operation, the instruction gets stored in the ______ Marks: 1 (Correct: b)
a) Registers b) Cache c) System Heap d) System stack

Explanation: When a looping or branching operation is carried out the offset value is stored in the cache along with the data.

61. The disadvantage of the EEPROM is/are ________ Marks: 1 (Correct: a)

a) The requirement of different
c) The inefficient memory mapping
voltages to read, write and store b) The Latency read operation d) All of the mentioned
schemes used
information

Explanation: None.

62. Which registers can interact with the secondary storage? Marks: 1 (Correct: a)
a) MAR b) PC c) IR d) R0

Explanation: MAR can interact with secondary storage in order to fetch data from it.

63. What does the COMPUTER stand for? Marks: 1 (Correct: a)

a) Commonly Operated Machines b) Commonly Occupied Machines c) Commonly Operated Machines d) Commonly Oriented Machines
Used in Technical and Educational Used in Technical and Educational Used in Technical and Environmental Used in Technical and Educational
Research Research Research Research

Explanation: The word COMPUTER is an abbreviation for the terms “Commonly Operated Machines Used in Technical and Educational Research”. The word COMPUTER also
relates to the word COMPUTE which means to calculate. So, initially it was thought that a computer is a device which is used to perform calculations.

64. The less space consideration as lead to the development of ________ (for large memories). Marks: 2 (Correct: d)
a) SIMM’s b) DIMS’s c) SRAM’s d) Both SIMM’s and DIMS’s

Explanation: The SIMM (single inline memory module) or DIMM (dual inline memory module) occupy less space while providing greater memory space.

65. The processor must take into account the delay in accessing the memory location, such memories are Marks: 1 (Correct: b)
called ______
a) Delay integrated b) Asynchronous memories c) Synchronous memories d) Isochronous memories
This Site Maintained by Webtech Services
 Explanation: None.

66. What does SVGA stand for? Marks: 1 (Correct: d)

a) Standard Visual Graphics Array b) Super Visual Graphics Array c) Standard Video Graphics Array d) Super Video Graphics Array

Explanation: Super Video Graphics Array is a type of Visual Display Unit.It supports 1024 by 768 pixels with 16 million different operations.

67. In SDRAM’s buffers are used to store data that is read or written. Marks: 1 (Correct: a)
a) TRUE b) False View Answer c) d)

Explanation: In SDRAM’s all the bytes of data to be read or written are stored in the buffer until the operation is complete.

68. In case of nested subroutines the return addresses are stored in __________ Marks: 1 (Correct: c)
a) System heap b) Special memory buffers c) Processor stack d) Registers

Explanation: In this case, there will be more number of return addresses it is stored on the processor stack.

69. The only language which the computer understands is ______________ Marks: 1 (Correct: b)
a) Assembly Language b) Binary Language c) BASIC d) C Language

Explanation: The Computer understands only binary language which is written in the form of 0s & 1s. A computer can understand assembly language but an assembler is
required which converts the assembly language to binary language. Similarly, for understanding high level languages, compilers/interpreters are required.

70. A RAMBUS which has 18 data lines is called as _______ Marks: 2 (Correct: b)
a) Extended RAMBUS b) Direct RAMBUS c) Multiple RAMBUS d) Indirect RAMBUS

Explanation: The direct RAMBUS is used to transmit 2 bytes of data at a time.

71. The cells in a row are connected to a common line called ______ Marks: 1 (Correct: b)
a) Work line b) Word line c) Length line d) Principle diagonal

Explanation: This means that the cell contents together form one word of instruction or data.

72. The most efficient way of handling parameter passing is by using ______ Marks: 1 (Correct: a)
a) General purpose registers b) Stacks c) Memory locations d) None of the mentioned

Explanation: By using general purpose registers for the parameter passing we make the process more efficient.

73. The main virtue for using single Bus structure is ____________ Marks: 1 (Correct: c)
b) Cost effective connectivity and c) Cost effective connectivity and
a) Fast data transfers d) None of the mentioned
speed ease of attaching peripheral devices

Explanation: By using a single BUS structure we can minimize the amount of hardware (wire) required and thereby reducing the cost.

74. The controller multiplexes the addresses after getting the _____ signal. Marks: 2 (Correct: d)
a) INTR b) ACK c) RESET d) Request

Explanation: The controller gets the request from the device needing the memory read or write operation and then it multiplexes the address.

75. In multiple Bus organisation, the registers are collectively placed and referred as ______ Marks: 1 (Correct: b)
a) Set registers b) Register file c) Register Block d) Map registers

Explanation: None.

76. To overcome the slow operating speeds of the secondary memory we make use of faster flash drives. Marks: 1 (Correct: a)
a) TRUE b) False View Answer c) d)

Explanation: To improve the speed we use flash drives at the cost of memory space.

77. The registers, ALU and the interconnection between them are collectively called as _____ Marks: 1 (Correct: d)
a) process route b) information trail c) information path d) data path

Explanation: The Operational and processing part of the CPU are collectively called as a data path.

78. The BUS busy line is made of ________ Marks: 1 (Correct: b)

a) Open-drain circuit b) Open-collector circuit c) EX-Or circuit d) Nor circuit

Explanation: None.

79. The interrupt-request line is a part of the ___________ Marks: 1 (Correct: b)

a) Data line b) Control line c) Address line d) None of the mentioned

Explanation: The Interrupt-request line is a control line along which the device is allowed to send the interrupt signal.

80. IBM developed a bus standard for their line of computers ‘PC AT’ called _____ Marks: 1 (Correct: c)
a) IB bus b) M-bus c) ISA d) None of the mentioned

Explanation: None.

Group C (Operating System): Answer All question(s)

81. What is a short-term scheduler? Marks: 1 (Correct: b)
This Site Maintained by Webtech Services
 a) It selects which process has to be b) It selects which process has to be c) It selects which process to remove
d) None of the mentioned
brought into the ready queue executed next and allocates CPU from memory by swapping

Explanation: A short-term scheduler selects a process which has to be executed next and allocates CPU. Short-term scheduler selects a process from the ready queue. It
selects processes frequently.

82. Round robin scheduling falls under the category of ____________ Marks: 1 (Correct: b)
a) Non-preemptive scheduling b) Preemptive scheduling c) All of the mentioned d) None of the mentioned

Explanation: None.

83. The bounded buffer problem is also known as ____________ Marks: 1 (Correct: c)
a) Readers - Writers problem b) Dining - Philosophers problem c) Producer - Consumer problem d) None of the mentioned

Explanation: None.

84. In Unix, Which system call creates the new process? Marks: 1 (Correct: a)
a) Fork b) Create c) New d) None of the mentioned

Explanation: In UNIX, a new process is created by fork() system call. fork() system call returns a process ID which is generally the process id of the child process created.

85. What will happen if a non-recursive mutex is locked more than once? Marks: 2 (Correct: b)
a) Starvation b) Deadlock c) Aging d) Signaling

Explanation: If a thread which had already locked a mutex, tries to lock the mutex again, it will enter into the waiting list of that mutex, which results in a deadlock. It is because
no other thread can unlock the mutex.

86. In Operating Systems, which of the following is/are CPU scheduling algorithms? Marks: 1 (Correct: d)
a) Round Robin b) Shortest Job First c) Priority d) All of the mentioned

Explanation: In Operating Systems, CPU scheduling algorithms are: i) First Come First Served scheduling ii) Shortest Job First scheduling iii) Priority scheduling iv) Round
Robin scheduling v) Multilevel Queue scheduling vi) Multilevel Feedback Queue scheduling All of these scheduling algorithms have their own advantages and disadvantages.

87. What is an interrupt vector? Marks: 2 (Correct: a)

a) It is an address that is indexed to b) It is a unique device number that is c) It is a unique identity given to an
d) None of the mentioned
an interrupt handler indexed by an address interrupt

Explanation: None.

88. Which of the following need not necessarily be saved on a context switch between processes? Marks: 1 (Correct: b)
a) General purpose registers b) Translation lookaside buffer c) Program counter d) All of the mentioned

Explanation: Translation Look-aside Buffer (TLB) need not necessarily be saved on a context switch between processes. A special, small, fast-lookup hardware cache is called
Translation Look-aside Buffer. TLB used to reduce memory access time.

89. In an interrupt driven input/output __________ Marks: 2 (Correct: c)

b) The CPU writes one data byte to
a) The CPU uses polling to watch the c) The CPU receives an interrupt
the data register and sets a bit in d) The CPU runs a user written code
control bit constantly, looping to see if when the device is ready for the next
control register to show that a byte is and does accordingly
a device is ready byte
available

Explanation: None.

90. What are Spinlocks? Marks: 1 (Correct: d)

a) CPU cycles wasting locks over b) Locks that avoid time wastage in c) Locks that work better on
d) All of the mentioned
critical sections of programs context switches multiprocessor systems

Explanation: None.

91. Cascading termination refers to termination of all child processes if the parent process terminates ______ Marks: 1 (Correct: c)
a) Normally b) Abnormally c) Normally or abnormally d) None of the mentioned

Explanation: Cascading termination refers to termination of all child processes if the parent process terminates Normally or Abnormally. Some systems don’t allow child
processes to exist if the parent process has terminated. Cascading termination is normally initiated by the operating system.

92. In priority scheduling algorithm, when a process arrives at the ready queue, its priority is compared with Marks: 1 (Correct: b)
the priority of ____________
a) All process b) Currently running process c) Parent process d) Init process

Explanation: None.

93. Which of the following does not interrupt a running process? Marks: 1 (Correct: c)
a) A device b) Timer c) Scheduler process d) Power failure

Explanation: Scheduler process does not interrupt a running process. Scheduler process selects an available process from a pool of available processes and allocates CPU to
it.

94. A process stack does not contain __________ Marks: 1 (Correct: d)

a) Function parameters b) Local variables c) Return addresses d) PID of child process

Explanation: Process stack contains Function parameters, Local variables and Return address. It does not contain the PID of child process.

95. Scheduling is done so as to ____________ Marks: 1 (Correct: a)

a) Increase CPU utilization b) Decrease CPU utilization c) Keep the CPU more idle d) None of the mentioned
This Site Maintained by Webtech Services
 Explanation: None.

96. What is the degree of multiprogramming? Marks: 1 (Correct: d)

a) The number of processes executed b) The number of processes in the c) The number of processes in the I/O d) The number of processes in
per unit time ready queue queue memory

Explanation: Multiprogramming means the number of processes are in the ready states. To increase utilization of CPU, Multiprogramming is one of the most important abilities
of OS. Generally, a single process cannot use CPU or I/O at all time, whenever CPU or I/O is available another process can use it. By doing this CPU utilization is increased.

97. What is the objective of multiprogramming? Marks: 1 (Correct: c)

b) Have multiple programs waiting in
a) Have a process running at all time c) To increase CPU utilization d) None of the mentioned
a queue ready to run

Explanation: The objective of multiprogramming is to increase CPU utilization. Generally, a single process cannot use CPU or I/O at all time, whenever CPU or I/O is available
another process can use it. Multiprogramming offers this ability to OS by keeping multiple programs in a ready queue.

98. Which system call can be used by a parent process to determine the termination of child process? Marks: 1 (Correct: a)
a) Wait b) Exit c) Fork d) Get

Explanation: wait() system call is used by the parent process to determine termination of child process. The parent process uses wait() system call and gets the exit status of
the child process as well as the pid of the child process which is terminated.

99. Consider the following set of processes, the length of the CPU burst time given in milliseconds. Marks: 1 (Correct: a)

Process Burst time P1 6 P2 8 P3 7 P4 3

Assuming the above process being scheduled with the SJF scheduling algorithm.
a) The waiting time for process P1 is b) The waiting time for process P1 is c) The waiting time for process P1 is d) The waiting time for process P1 is
3ms 0ms 16ms 9ms

Explanation: None.

100. To access the services of operating system, the interface is provided by the ___________ Marks: 1 (Correct: a)
a) System calls b) API c) Library d) Assembly instructions

Explanation: To access services of the Operating System an interface is provided by the System Calls. Generally, these are functions written in C and C++. Open, Close, Read,
Write are some of most prominently used system calls.

101. Suppose that a process is in "Blocked" state waiting for some I/O service. When the service is Marks: 1 (Correct: b)
completed, it goes to the __________
a) Running state b) Ready state c) Suspended state d) Terminated state

Explanation: Suppose that a process is in “Blocked” state waiting for some I/O service. When the service is completed, it goes to the ready state. Process never goes directly to
the running state from the waiting state. Only processes which are in ready state go to the running state whenever CPU allocated by operating system.

102. Which one of the following is a visual ( mathematical ) way to determine the deadlock occurrence? Marks: 1 (Correct: a)
a) Resource allocation graph b) Starvation graph c) Inversion graph d) None of the mentioned

Explanation: None.

103. Which of the following concurrency control protocols ensure both conflict serializability and freedom Marks: 2 (Correct: b)
from deadlock?
I) 2-phase locking
II) Timestamp ordering
a) I only b) II only c) Both I and II d) Neither I nor II

Explanation: None.

104. The OS X has ____________ Marks: 2 (Correct: b)

a) Monolithic kernel b) Hybrid kernel c) Microkernel d) Monolithic kernel with modules

Explanation: OS X has a hybrid kernel. Hybrid kernel is a combination of two different kernels. OS X is developed by Apple and originally it is known as Mac OS X.

105. An actual update is not allowed to a data item ____________ Marks: 2 (Correct: a)
a) Before the corresponding log b) After the corresponding log record c) Until the whole log record has been
d) All of the mentioned
record is written out to stable storage is written out to stable storage checked for inconsistencies

Explanation: None.

106. Under multiprogramming, turnaround time for short jobs is usually ________ and that for long jobs is Marks: 1 (Correct: b)
slightly ___________
a) Lengthened; Shortened b) Shortened; Lengthened c) Shortened; Shortened d) Shortened; Unchanged

Explanation: None.

107. In priority scheduling algorithm ____________ Marks: 1 (Correct: a)

a) CPU is allocated to the process b) CPU is allocated to the process c) Equal priority processes can not be
d) None of the mentioned
with highest priority with lowest priority scheduled

Explanation: None.

108. In operating system, each process has its own __________ Marks: 1 (Correct: d)

This Site Maintained by Webtech Services

 a) Address space and global c) Pending alarms, signals and signal
b) Open files d) All of the mentioned
variables handlers

Explanation: In Operating Systems, each process has its own address space which contains code, data, stack and heap segments or sections. Each process also has a list of
files which is opened by the process as well as all pending alarms, signals and various signal handlers.

109. If no process is suspended, the signal operation ____________ Marks: 1 (Correct: c)

a) Puts the system into a deadlock b) Suspends some default process
c) Nothing happens d) The output is unpredictable
state execution

Explanation: None.

110. A monitor is characterized by ____________ Marks: 1 (Correct: a)

a) A set of programmer defined
b) An identifier c) The number of variables in it d) All of the mentioned
operators

Explanation: None.

111. An SJF algorithm is simply a priority algorithm where the priority is ____________ Marks: 1 (Correct: a)
b) The inverse of the predicted next
a) The predicted next CPU burst c) The current CPU burst d) Anything the user wants
CPU burst

Explanation: The larger the CPU burst, the lower the priority.

112. The two phase locking protocol consists of ____________ Marks: 2 (Correct: a)
a) Growing and shrinking phase b) Shrinking and creation phase c) Creation and growing phase d) Destruction and creation phase

Explanation: None.

113. Bounded waiting implies that there exists a bound on the number of times a process is allowed to enter Marks: 2 (Correct: a)
its critical section ____________
a) After a process has made a
b) When another process is in its c) Before a process has made a
request to enter its critical section and d) None of the mentioned
critical section request to enter its critical section
before the request is granted

Explanation: None.

114. The circular wait condition can be prevented by ____________ Marks: 1 (Correct: a)
a) Defining a linear ordering of
b) Using thread c) Using pipes d) All of the mentioned
resource types

Explanation: None.

115. What is an operating system? Marks: 1 (Correct: d)

a) Collection of programs that b) System service provider to the c) Interface between the hardware
d) All of the mentioned
manages hardware resources application programs and application programs

Explanation: An Operating System acts as an intermediary between user/user applications/application programs and hardware. It is a program that manages hardware
resources. It provides services to application programs.

116. Serializable schedules are ones where ____________ Marks: 2 (Correct: a)

a) Concurrent execution of
b) The transactions can be carried out c) A valid result occurs after
transactions is equivalent to the d) None of the mentioned
one after the other execution transactions
transactions executed serially

Explanation: None.

117. The initial program that is run when the computer is powered up is called __________ Marks: 1 (Correct: d)
a) Boot program b) Bootloader c) Initializer d) Bootstrap program

Explanation: None.

118. What are Multithreaded programs? Marks: 1 (Correct: b)

a) Lesser prone to deadlocks b) More prone to deadlocks c) Not at all prone to deadlocks d) None of the mentioned

Explanation: Multiple threads can compete for shared resources.

119. Scheduling is done so as to ____________ Marks: 1 (Correct: b)

d) There is no relation between
a) Increase the turnaround time b) Decrease the turnaround time c) Keep the turnaround time same
scheduling and turnaround time

Explanation: None.

120. Scheduling is done so as to ____________ Marks: 1 (Correct: c)

a) Increase the waiting time b) Keep the waiting time the same c) Decrease the waiting time d) None of the mentioned

Explanation: None.

Back

This Site Maintained by Webtech Services

This Site Maintained by Webtech Services