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:35:20 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
maximum number of parentheses that appear on the stack AT ANY ONE TIME when the algorithm analyzes:
(()(())(()))?

1 3 2 4 or more

2. Evaluate the following statement using infix evaluation algorithm and choose the correct answer. 1+2*3-2 Marks: 2

5 3 4 6

3. In linked list each node contains a minimum of two fields. One field is data field to store the data second Marks: 1
field is?

Pointer to character Node Pointer to integer 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
array?

Random access is not allowed in Arrays have better cache locality Access of elements in linked list
It is easy to insert and delete
a typical implementation of Linked that can make them better in terms of takes less time than compared to
elements in Linked List
Lists performance arrays

5. Which of the following application makes use of a circular linked list? Marks: 1

Allocating CPU to resources Recursive function calls Implement Hash Tables Undo operation in a text editor

6. You are asked to perform a queue operation using a stack. Assume the size of the stack is some value ‘n’ Marks: 1
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).

O(n) O(m) O(m*n) Data is insufficient

7. The type of expression in which operator succeeds its operands is? Marks: 1

Both Prefix and Postfix

Infix Expression Postfix Expression Prefix Expression
Expressions

8. Which of the following data structure is used to convert postfix expression to infix expression? Marks: 1

Queue Heap Stack Linked List

9. Which of the following statement is incorrect with respect to infix to postfix conversion algorithm? Marks: 1

operator is placed in the stack

parenthesis are included in the operand is always placed in the higher and equal priority
when the stack operator has lower
output output operators follow the same condition
precedence

10. Linked list data structure offers considerable saving in _____________ Marks: 1

Space Utilization and

Computational Time Space Utilization Speed Utilization
Computational Time

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

74 40 -18 1

12. Which of the following arrays are used in the implementation of list data type in python? Marks: 1

Sparse arrays Bit array Parallel arrays Dynamic arrays

13. Which data structure is used for implementing recursion? Marks: 1

This Site Maintained by Webtech Services
 Queue List Array Stack

14. Express -15 as a 6-bit signed binary number. Marks: 2

101110 1110 101111 1111

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

Returntop Push Pop Enqueue

16. You have two jars, one jar which has 10 rings and the other has none. They are placed one above the Marks: 2
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.

Empty the first jar by removing it

Empty the first jar by removing it one by one from the first jar and
There exists no possible way to Break the jar and remove the last
one by one from the first jar and placing it into the second jar and
do this one
placing it into the second jar empty the second jar by placing all
the rings into the first jar one by one

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

6 8 9 10

18. How many stacks are required for reversing a word algorithm? Marks: 1

one three four two

19. Which of the following is an infix expression? Marks: 1

(a+ *(c+d)

20. The postfix form of the expression (A+ B)*(C*D- E)*F / G is? Marks: 1

AB + CDE * - * F *G / AB + CD* E - *F *G / AB + CD* E - F **G / AB+ CD*E - FG /**

21. When an operand is read, which of the following is done? Marks: 1

It is placed in operator stack It is placed on to the output It is ignored Operator stack is emptied

22. Linked list is considered as an example of ___________ type of memory allocation. Marks: 1

Compile time Static Heap Dynamic

23. What is the time complexity of reversing a word using stack algorithm? Marks: 1

O (M log N) O (N) O (N2) O (N log N)

24. Consider you have an array of some random size. You need to perform dequeue operation. You can Marks: 2
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?

They will have different time There are chances that output The memory used will not be
No differences
complexities might be different different

25. Is the given statement ((A+B) + [C-D]] valid with respect to balancing of symbols? Marks: 1

False View Answer TRUE

26. Which of these operators have the highest order of precedence? Marks: 1

‘*’ and ‘/’ ‘~’ and ‘^’ ‘(‘ and ‘)’ ‘+’ and ‘-‘

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

abcd-*+ ab*+cd- ab*cd*+ ab*cd-+

28. In a circular queue, how do you increment the rear end of the queue? Marks: 1
This Site Maintained by Webtech Services
 (rear % CAPACITY)+1 (rear+1) % CAPACITY rear++ rear-

29. Process of removing an element from stack is called __________ Marks: 1

Push Pop Create Evaluation

30. What does ‘stack underflow’ refer to? Marks: 1

accessing item from an undefined removing items from an empty

adding items to a full stack index out of bounds exception
stack stack

31. Which application of stack is used to ensure that the pair of parentheses is properly nested? Marks: 1

Conversion of an infix to postfix Conversion of an infix to prefix

Balancing symbols Reversing a stack
expression expression

32. Operations required for reversing a word or a string using stack are push() and pop(). Marks: 1

False View Answer TRUE

33. It is easier for a computer to process a postfix expression than an infix expression. Marks: 1

False View Answer TRUE

34. What are the applications of dequeue? Marks: 1

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

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

and $ ^ +

36. How many passes does the balancing symbols algorithm makes through the input? Marks: 1

one three two four

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

-/*^ACBDE -ABCD*^DE -A/B*C^DE -A/BC*^DE

38. What would be the asymptotic time complexity to find an element in the linked list? Marks: 1
4 2
O(n ) O(n ) O(n) O(1)

39. What is the time complexity of balancing parentheses algorithm? Marks: 1

2
O (N log N) O (M log N) O (N ) 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
will they be removed?

ABCD DCAB DCBA ABDC

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

41. The internal components of the processor are connected by _______ Marks: 1

Processor intra-connectivity
Processor bus Rambus Memory bus
circuitry

42. ______ type circuits are generally used for interrupt service lines. Marks: 1
i) open-collector
ii) open-drain
iii) XOR
iv) XNOR

ii, iv i, ii ii ii, iii

43. The main advantage of multiple bus organisation over a single bus is _____ Marks: 1

Reduction in the number of

Increase in size of the registers Better Connectivity None of the mentioned
cycles for execution

44. The added output of the bits of the interrupt register and the mask register is set as an input of Marks: 2
______________

This Site Maintained by Webtech Services

 Process id encoder Priority encoder Priority decoder Multiplexer

45. The return address of the Sub-routine is pointed to by _______ Marks: 1

MAR Special memory registers IR PC

46. After the device completes its operation _____ assumes the control of the BUS. Marks: 1

Controller Processor None of the mentioned Another device

47. A memory organisation that can hold upto 1024 bits and has a minimum of 10 address lines can be Marks: 1
organized into _____

1024 X 1 128 X 8 256 X 4 512 X 2

48. ______________ register is used for the purpose of controlling the status of each interrupt request in Marks: 2
parallel priority interrupt.

Mark Make Mask Mass

49. Which of the following describes the correct format of an input instruction? Marks: 1

INP 82 82 INP IN 82 INPUT 82

50. What is subroutine nesting? Marks: 1

Using a linking nest statement to

Having multiple subroutines in a
None of the mentioned Having one routine call the other put many subroutines under the same
program
name

51. VLSI stands for ___________ Marks: 1

Very Large Stand-alone

None of the mentioned Volatile Layer System Interface Very Large Scale Integration
Integration

52. ______ are used to overcome the difference in data transfer speeds of various devices. Marks: 1

Bridge circuits Multiple Buses Buffer registers Speed enhancing circuitory

53. In Centralised Arbitration ______ is/are is the BUS master. Marks: 1

Both Processor and DMA

Device Processor DMA controller
controller

54. The private work space dedicated to a subroutine is called as ________ Marks: 1

Stack frame Reserve Allocation System heap

55. To reduce the number of external connections required, we make use of ______ Marks: 1

Decoder Multiplexer Encoder De-multiplexer

56. The registers of the controller are ______ Marks: 1

64 bits 16 bits 24 bits 32 bits

57. The I/O interface required to connect the I/O device to the bus consists of ______ Marks: 1

Address decoder, registers and

Only Control circuits Address decoder and registers Control circuits
Control circuits

58. The only difference between the EEPROM and flash memory is that the latter doesn’t allow bulk data to be Marks: 1
written.

False View Answer TRUE

59. 1 yottabyte = ______________ Marks: 1

1024 PB 1024 ZB 1024 TB 1024 EB

60. When Performing a looping operation, the instruction gets stored in the ______ Marks: 1

Cache Registers System stack System Heap

61. The disadvantage of the EEPROM is/are ________ Marks: 1

This Site Maintained by Webtech Services

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

62. Which registers can interact with the secondary storage? Marks: 1

IR R0 MAR PC

63. What does the COMPUTER stand for? Marks: 1

Commonly Operated Machines Commonly Operated Machines Commonly Occupied Machines Commonly Oriented Machines
Used in Technical and Environmental Used in Technical and Educational Used in Technical and Educational Used in Technical and Educational
Research Research Research Research

64. The less space consideration as lead to the development of ________ (for large memories). Marks: 2

DIMS’s SIMM’s SRAM’s Both SIMM’s and DIMS’s

65. The processor must take into account the delay in accessing the memory location, such memories are Marks: 1
called ______

Asynchronous memories Isochronous memories Delay integrated Synchronous memories

66. What does SVGA stand for? Marks: 1

Standard Visual Graphics Array Super Visual Graphics Array Standard Video Graphics Array Super Video Graphics Array

67. In SDRAM’s buffers are used to store data that is read or written. Marks: 1

TRUE False View Answer

68. In case of nested subroutines the return addresses are stored in __________ Marks: 1

Registers Processor stack System heap Special memory buffers

69. The only language which the computer understands is ______________ Marks: 1

BASIC C Language Assembly Language Binary Language

70. A RAMBUS which has 18 data lines is called as _______ Marks: 2

Direct RAMBUS Extended RAMBUS Indirect RAMBUS Multiple RAMBUS

71. The cells in a row are connected to a common line called ______ Marks: 1

Work line Principle diagonal Word line Length line

72. The most efficient way of handling parameter passing is by using ______ Marks: 1

None of the mentioned General purpose registers Memory locations Stacks

73. The main virtue for using single Bus structure is ____________ Marks: 1

Cost effective connectivity and Cost effective connectivity and

Fast data transfers None of the mentioned
speed ease of attaching peripheral devices

74. The controller multiplexes the addresses after getting the _____ signal. Marks: 2

Request INTR RESET ACK

75. In multiple Bus organisation, the registers are collectively placed and referred as ______ Marks: 1

Register file Register Block Set registers Map registers

76. To overcome the slow operating speeds of the secondary memory we make use of faster flash drives. Marks: 1

TRUE False View Answer

77. The registers, ALU and the interconnection between them are collectively called as _____ Marks: 1

process route information path information trail data path

78. The BUS busy line is made of ________ Marks: 1

EX-Or circuit Open-drain circuit Open-collector circuit Nor circuit

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

This Site Maintained by Webtech Services

 Data line None of the mentioned Address line Control line

80. IBM developed a bus standard for their line of computers ‘PC AT’ called _____ Marks: 1

ISA IB bus None of the mentioned M-bus

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

81. What is a short-term scheduler? Marks: 1

It selects which process has to be It selects which process has to be It selects which process to
None of the mentioned
executed next and allocates CPU brought into the ready queue remove from memory by swapping

82. Round robin scheduling falls under the category of ____________ Marks: 1

All of the mentioned Non-preemptive scheduling None of the mentioned Preemptive scheduling

83. The bounded buffer problem is also known as ____________ Marks: 1

None of the mentioned Dining - Philosophers problem Readers - Writers problem Producer - Consumer problem

84. In Unix, Which system call creates the new process? Marks: 1

Fork Create None of the mentioned New

85. What will happen if a non-recursive mutex is locked more than once? Marks: 2

Aging Starvation Deadlock Signaling

86. In Operating Systems, which of the following is/are CPU scheduling algorithms? Marks: 1

Shortest Job First Round Robin Priority All of the mentioned

87. What is an interrupt vector? Marks: 2

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

88. Which of the following need not necessarily be saved on a context switch between processes? Marks: 1

General purpose registers Translation lookaside buffer Program counter All of the mentioned

89. In an interrupt driven input/output __________ Marks: 2

The CPU writes one data byte to

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

90. What are Spinlocks? Marks: 1

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

91. Cascading termination refers to termination of all child processes if the parent process terminates ______ Marks: 1

Normally None of the mentioned Normally or abnormally Abnormally

92. In priority scheduling algorithm, when a process arrives at the ready queue, its priority is compared with Marks: 1
the priority of ____________

Parent process Init process All process Currently running process

93. Which of the following does not interrupt a running process? Marks: 1

A device Scheduler process Timer Power failure

94. A process stack does not contain __________ Marks: 1

PID of child process Function parameters Return addresses Local variables

95. Scheduling is done so as to ____________ Marks: 1

Decrease CPU utilization Increase CPU utilization Keep the CPU more idle None of the mentioned

96. What is the degree of multiprogramming? Marks: 1

This Site Maintained by Webtech Services

 The number of processes in the The number of processes in The number of processes The number of processes in the I/
ready queue memory executed per unit time O queue

97. What is the objective of multiprogramming? Marks: 1

Have a process running at all Have multiple programs waiting in

To increase CPU utilization None of the mentioned
time a queue ready to run

98. Which system call can be used by a parent process to determine the termination of child process? Marks: 1

Exit Fork Get Wait

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

Process Burst time P1 6 P2 8 P3 7 P4 3

Assuming the above process being scheduled with the SJF scheduling algorithm.

The waiting time for process P1 is The waiting time for process P1 is The waiting time for process P1 is The waiting time for process P1 is
0ms 9ms 16ms 3ms

100. To access the services of operating system, the interface is provided by the ___________ Marks: 1

API Library System calls Assembly instructions

101. Suppose that a process is in "Blocked" state waiting for some I/O service. When the service is Marks: 1
completed, it goes to the __________

Running state Ready state Terminated state Suspended state

102. Which one of the following is a visual ( mathematical ) way to determine the deadlock occurrence? Marks: 1

Starvation graph Inversion graph Resource allocation graph None of the mentioned

103. Which of the following concurrency control protocols ensure both conflict serializability and freedom Marks: 2
from deadlock?
I) 2-phase locking
II) Timestamp ordering

Both I and II I only II only Neither I nor II

104. The OS X has ____________ Marks: 2

Hybrid kernel Monolithic kernel with modules Microkernel Monolithic kernel

105. An actual update is not allowed to a data item ____________ Marks: 2

After the corresponding log Until the whole log record has Before the corresponding log
All of the mentioned
record is written out to stable storage been checked for inconsistencies record is written out to stable storage

106. Under multiprogramming, turnaround time for short jobs is usually ________ and that for long jobs is Marks: 1
slightly ___________

Shortened; Unchanged Lengthened; Shortened Shortened; Shortened Shortened; Lengthened

107. In priority scheduling algorithm ____________ Marks: 1

CPU is allocated to the process Equal priority processes can not CPU is allocated to the process
None of the mentioned
with highest priority be scheduled with lowest priority

108. In operating system, each process has its own __________ Marks: 1

Pending alarms, signals and Address space and global

All of the mentioned Open files
signal handlers variables

109. If no process is suspended, the signal operation ____________ Marks: 1

Puts the system into a deadlock Suspends some default process

The output is unpredictable Nothing happens
state execution

110. A monitor is characterized by ____________ Marks: 1

A set of programmer defined

All of the mentioned An identifier The number of variables in it
operators

111. An SJF algorithm is simply a priority algorithm where the priority is ____________ Marks: 1

The inverse of the predicted next

Anything the user wants The predicted next CPU burst The current CPU burst
CPU burst
This Site Maintained by Webtech Services
 112. The two phase locking protocol consists of ____________ Marks: 2

Destruction and creation phase Growing and shrinking phase Shrinking and creation phase Creation and growing phase

113. Bounded waiting implies that there exists a bound on the number of times a process is allowed to enter Marks: 2
its critical section ____________

After a process has made a

When another process is in its Before a process has made a
None of the mentioned request to enter its critical section and
critical section request to enter its critical section
before the request is granted

114. The circular wait condition can be prevented by ____________ Marks: 1

Defining a linear ordering of

Using pipes Using thread All of the mentioned
resource types

115. What is an operating system? Marks: 1

Collection of programs that Interface between the hardware System service provider to the
All of the mentioned
manages hardware resources and application programs application programs

116. Serializable schedules are ones where ____________ Marks: 2

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

117. The initial program that is run when the computer is powered up is called __________ Marks: 1

Initializer Bootloader Boot program Bootstrap program

118. What are Multithreaded programs? Marks: 1

Lesser prone to deadlocks More prone to deadlocks None of the mentioned Not at all prone to deadlocks

119. Scheduling is done so as to ____________ Marks: 1

There is no relation between

Keep the turnaround time same Increase the turnaround time Decrease the turnaround time
scheduling and turnaround time

120. Scheduling is done so as to ____________ Marks: 1

None of the mentioned Keep the waiting time the same Increase the waiting time Decrease the waiting time

Submit Cancel

This Site Maintained by Webtech Services