Technical preparation

CSE MCQ

141. A partitioned data set is most used for

142. The allocation map

143. Path's name are

144. The activity of a file

145. Which structure prohibits the sharing of flies and directories ?

146. The most efficient data set organization is a/an

147. The file structure that redefines its first record at a base of zero uses the term

148. A system has 3 processes sharing 4 resources. If each process needs a maximum of 2 units, then

149. The methods for dealing with the deadlock problem is

150. Consider a system having 'm' resources of the same type. These resources are shared by 3 processes A, B, C, which have peak time demands of 3, 4, 6 respectively. The minimum value of 'm' that ensures that deadlock will never occur is

151. 'm' processes share 'n' resources of the same type. The maximum need of each process doesn't exceed 'n' and the sum all the their maximum needs is always less than m + n. In this set up

152. A computer system has 6 tape drives, with 'n' processes competing for them. Each process may need 3 tape drives. The maximum value of 'n' for which the system is guaranteed to be deadlock free is

153. A state is safe if the system can allocate resources to each process (up to its maximum) in some order and still avoid deadlock. Then

154. With a single resource, deadlock occurs

155. নিচের কোনটি মুগুরী ভাষা শব্দ? (GOVT. Bank.General Officer: 2019)

156. The web standard allows programmers on many different computer platforms to dispersed format and display the information server. These programs are called

157. Which of the following is a Valid Name?

158. Symbol used at the beginning of the HREF text is

159. The body tag usually used after

160. What i s the correct HTML for adding a background color?