Computer Science and Application MP Set Exam 2022 Q-131 to 140

 131. Coaxial cable 10 base-2, used on ethenet can also be known as :

(A) Thick coaxial cable

(B) Thin coaxial cable

(C) Twisted pair cable

(D) None of the above

Answer: (B)

132. Which layer of OSI reference model is responsible for data compression ?

(A) Application layer

(B) Presentation layer

(C) Session layer

(D) Transport layer

Answer: (B)

133. The propagation speed of electromagnetic signals depends on the :

(A) Frequency of the signal

(B) Communication medium

(C) Both (A) and (B)

(D) None of the above

Answer: (C)

134. Which generation of cellular networks is completely based on packet switching technology ?

(A) 4G

(B) 3G

(C) 2G

(D) 1G

Answer: (A)

135. Which is an overlay network on the top of public networks but with most of the properties of private network?

(A) VPN

(B) Proxy

(C) DNS

(D) Radius

Answer: (A)

136. What is the semantics HTTP error status code related to Forbidden, when manipulating resources ? (A) 400

(B) 500

(C) 404

(D) 403

Answer: (D)

137. In data communication, data rate depends on :

(A) The available bandwidth

(B) The level of signal

(C) The level of noise

(D) All of the above

Answer: (D)

138. How long does downloading an uncompressed text file of 1 Mega bit over a 32 kilobites/sec modem take ?

(A) 312.5 sec

(B) 212.5 sec

(C) 350.5 sec

(D) 250.5 sec

Answer: (A)

139. In an IP packet, receiver discards the packet that received with first 8 bits as 01000010. What is the possible reason?

(A) Incorrect IP version and incorrect header length

(B) Incorrect IP version and correct header length

(C) Correct IP version and incorrect header length

(D) None of the above

Answer: (C)

140. Which mode of communication is utilized by ethernet using CSMA/CD protocol ?

(A) Full duplex

(B) Half duplex

(C) Simplex

(D) None of the above

Answer: (B)

Computer Science and Application MP Set Exam 2022 Q-121 to 130

 121. What will be the value of n, if turing machines is defined using n-tuples ?

(A) 7

(B) 6

(C) 5

(D) 8

Answer: (A) 

122. Consider the following CFG :

S ->■ aB I bA

A ^ b I aS I bAA

B -> b I bS I aBB.

Which of the following strings of termi nals generated by this CFG ?

(A) Odd numbers of a's and odd number of b's

(B) Equal number of a's and equal number of b's

(C) Even number of a's and even number of b's

(D) Odd numbers of a's even number of b's

Answer: Deleted

123. Turing machine accepts :

(A) Universal languages

(B) Recursive languages

(C) Recursively enumerable languages

(D) Non-recursive languages

Answer: (C) 

124. Which of the following is not a

 regular language?

(A) L = {aⁿ bⁿ⁺³|n>=0}

(B) L = { aⁿ aⁿ⁺³|n>=0}

(C) L = { aⁿ aⁿ⁺³ aⁿ |n>=0}

(D) All of the above

Answer: (A) 

125. A problem is NP-complete if:.

(A) Solution can be verified easily

(B) A quick algorithm to solve this problem can be used to solve all other NP problem quickly

(C) It can be solved in polynomial time

(D) All of the above

Answer: (D) 

126. Consider the following grammar :

S à ABSc I Abc

BA-> AB

Bb -> bb

Ab -> ab

Aa -> aa

Which of the following statements can be derived by this grammar ?

(A) aab

(B) abc

(C) abcc

(D) abbe

Answer: (B) 

127. Non-recursive predictive parsing is constructed using stack that contains :

(A) Parsing table

(B) Sequence of grammar symbols

(C) Only terminals

(D) E

Answer: (B) 

128. A dangling reference occurs when there is a reference to storage that has been

(A) Allocated

(B) Reallocated

(C) Deallocated

(D) None of the above

Answer: (C) 

129. Consider the following C-code segment:

a = b + c

c = a + I

d = b + c

f=d+1

g= e + +

Suppose this code segment is represented internally as directed acyclic graph, then the number of nodes in the DAG is :

(A) 4

(B) 5

(C) 6

(D) 3

Answer: Deleted

130. Which of the following represents intermediate codes ?

(A) Triples

(B) Quadriples

(C) Indirected Triples

(D) All of the above

Answer: (D) 

Computer Science and Application MP Set Exam 2022 Q-111 to 120

 111. What is the worst case time complexity • of a quicksort algorithm ?

(A) O (N)

(B) O (N log N)

(C) O (N²)

(D) O(logN)

Answer :  (C)

112. What is an AVL tree ?

(A)- A tree which is balanced and is a height balanced tree

(B) A tree which is unbalanced and is a height balanced tree .

(C) A tree with three children

(D) A tree with at most three childrens

Answer :  (A)

113. Which ofthe following design techniques is used in Quick Sort algorithm ?

(A) Greedy algorithm

(B) Divide and conquer algorithm

(C) Hash table

(D) Parsing

Answer :  (B)

114. In the input restricted deque :

(A) insertion at only one end, rear end

(B) deletion at only one end, front end

(C) insertion at both ends, rear and front end

(D) All of the above

Answer :  (A)

115. What is the number .of edges present in a complete graph having 'n' vertices ?

(A) (n*(n+1))/2

(B) {n*{n-1))/2

(C) n

(D) Information given is insufficient

Answer :  (B)

116. Which of the following sorting algorithms has the lowest worst case complexity ?

(A) Merge sort

(B) Bubble sort

(C) Quick sort

(D) Selection sort

Answer :  (A)

117. Suppose a circular queue of capacity (n- 1) elements is implemented with an array of n elements. Assume that the insertion and deletion operation are carried out using REAR and FRONT as array index variables, respectively. Initially REAR = FRONT = 0. The conditions to detect queue full and queue empty are :

(A) Full : (REAR +1) mod n = = FRONT

Empty : REAR ==FRONT == NULL

(B) Full : (REAR + 1) mod « = = FRONT

Empty : (FRONT + 1) mod n = = REAR

(C) Full : REAR = = FRONT

Empty : (REAR + 1) mod n = = FRONT

(D) Full ; (FRONT + 1) mod « = = REAR

Empty : REAR = FRONT

Answer :  (A)

118. The best data structure to check whether an arithmetic expression has balanced parentheses is a : (A) Queue

(B) Stack

(C) Tree

(D) Graph

Answer :  (B)

119. Which of the following is an application of stack ? –

(A) Finding factorial

(B) Tower of Hanoi

(C) Infix to post-fix

(D) All of the above

Answer :  (D)

120. The pre-fix notation is also called as :

(A) Polish notation

(B) Infix notation

(C) Post-fix notation

(D) None of the above

Answer :  (A)

Computer Science and Application MP Set Exam 2022 Q-101 to 110

 101. Requirements which specify the constraints imposed on the software are called :

(A) Domain requirements

(B) Functional requirements

(C) Non-functional requirements

(D) None of the above

Answer : (C) 

102. Exchange of data between two modules in a structure chart is shown by :

(A) Data couple

(B) Flag

(C) Condition

(D) None of the above

Answer : (A) 

103. If P is risk probability, L is loss, then Risk Exposure (RE) is computed as :

(A) RE = P/L

(B) RE = P * L

(C) RE = P + L

(D) RE = P * L/2

Answer : (B) 

104. Cost of software mainjejiance-is very high. A large amount of software life cycle costs is expanded, in the maintenance activities. The maximum effort spent on which of the following maintenance activities ?

(A) Preventive maintenance

(B) Corrective maintenance

(C) Adaptive maintenance

(D) Perfective maintenance

Answer : (D) 

105. All activities which are on critical i«th have slack time equal to :

(A) 0

(B) 1

(C) 2

(D) None of the above

Answer : (A) 

106. Which of the following architectures is characteristized by a series of transformations on orderly defined set of input data ? .

(A) Data centered architecture

(B) Data flow architecture

(C) layer architecture

(D) Call and return architecture

Answer : (B) 

107. If a program has two integer inputs on a machine with a 32-bit word, then how many, possible test cases does ;this program have ?

(A) 2¹⁶ 

(B) 2³²

(C) 2⁶⁴

(D) 2¹²⁸

Answer : (C) 

108. Which of the following is a calculated value of programmer effort/COCOMO effort for an organic project under the category of application program with estimated size of 10 K Line of Code (LOC) ?

(A) 13.0

(B) 26.9

(C) 41.2

(D) 55.8

Answer : (B) 

109. In basic COCOMO model, effort for, embedded system is given by :

(A) 2.4 * (KLOC)^1.05

(B) 3.0 * (KLOC)^1.120

(C) 3.6 * (KLOC)^1.20

(D) None of the above

Answer : (C) 

110. If the software had 5 failures in 100 tests during 10 days of testing, what would be a good estimate of the reliability of the software over the next day (assume 10 test per day, average from last 10 days) ?

(A) 0.05

(B) 0.027

(C) 0.005

(D) 0.598

Answer : (D) 

Computer Science and Application MP Set Exam 2022 Q-91to 100

 91. A system call is invoked by :

(A) Polling

(B) Software interrupt

(C) Instruction

(D) Jump

Answer: (B)

92. Suppose we have 12 identical resources and 3 processes Pj, P2 and P3. The maximum claims of the processes are 10, 5, 3 respectively. Currently, the process Pj holds 8 resources, P2 holds 2 resources and P3 holds 1 resource. Which of the following is/are correct ?

(i) The system is in safe state.

(ii) The system is in unsafe state.

(iii) The minimum one more resource is needed to make it safe state.

(iv) The unsafe system does not employ the existence of deadlock.

(A) (i) and (iv)

(B) (ii) and (iii)

(C) (ii) and (iv)

(D) (ii), (iii) and (iv)

Answer: (D)

93. One thread immediately terminates the target thread is called ;

(A) Asynchronous cancellation

(B) Deferred cancellation

(C) Synchronous cancellation

(D) None of the above

Answer: (A)

94. Consider the situation where several processes access and manipulate the same data concurrently and the outcome of the execution depends on the particular order in which the access takes place. The situation is called :-.

(A) Deadlock

(B) Process synchronization

(C) Race condition

(D) Unsafe condition

Answer: (C)

95. The TLB hit ratio is 98%.  It takes 20 nanoseconds to search the TLB and 100 nanoseconds to access memory. What will be the effective memory access time ?

(A) 100 nanoseconds

(B) 122 nanoseconds

(C) 130 nanoseconds

(D) 140 nanoseconds

Answer: (B)

96. A computer system has 6 identical resources. There are n processes competing for them. Each process may need 2 resources. What will be the maximum value of n so that the system is deadlock free ?

(A) 2

(B) 3

(C) 4

(D) 5

Answer: (D)

97. A critical region is :

(A) One which is enclosed by a pair of P and V operations on semaphores.

(B) A program segment that has not been proved bug-free.

(C) A program segment that often causes unexpected system crashes.

(D) A program segment where shared resources are accessed.

Answer: (D)

98. A virus that mutates with every infection is :

(A) Stealth virus

(B) Metamorphic virus

(C) Polymorphic virus

(D) Ultramorphic virus

Answer: (C)

99. The represents a commonly used group of codes in a source programming language.

(A) Loop

(B) Branch Statements

(C) Macro

(D) Functions

Answer: (D)

100. A system uses paging and segmentation, the virtual address space consists of up to 8 segments where each segment can be up to 2^9 bytes long. The hardware page each segment into 256-byte pages. How many bits in the virtual address are needed for page numbers ?

(A) 3

(B) 8

(C) 32

(D) 21

Answer: (D)