Explore topic-wise InterviewSolutions in .

This section includes InterviewSolutions, each offering curated multiple-choice questions to sharpen your knowledge and support exam preparation. Choose a topic below to get started.

1.

Software validation mainly checks for inconsistencies between(A) Use cases and user requirements(B) Implementation and system design blueprints(C) Detailed specifications and user requirements(D) Function specifications and use cases

Answer»
2.

At a particular time of computation, the value of a counting semaphore is 7. Then 20 P(wait) operations and 15 V(signal) operations are completed on this semaphore. What is the resulting value of the semaphore?(A) 28(B) 12(C) 2(D) 42

Answer»
3.

Consider double hashing of the formh(k,i)=(h​ 1​ (k)+ih​ 2​ (k)) mod mWhere h​ 1​ (k)=k mod mh​ 2​ (k)=1+(k mod n)Where n=m-1and m=701for k=123456, what is the difference between first and second probes in terms of slots?(A) 255(B) 256(C) 257(D) 258

Answer»
4.

In the TCP/IP model, encryption and decryption are functions of ____ layer.(A) Datalink layer(B) Network layer(C) Transport layer(D) Application layer

Answer»
5.

Consider a disk system with 100 cylinders. The requests to access the cylinders occur in the following sequence:4,34,10,7,19,73,2,15,6,20Assuming that the head is current at cylinder 50, what is the time taken to satisfy all requests if it takes 1ms to move from the cylinder to adjacent one and the shortest seek time first policy is used?(A) 375ms(B) 238ms(C) 276ms(D) 119ms

Answer»
6.

Which of the following statements are DML statements?(a) Update [tablename] Set [ columnname] = VALUE(b) Delete [tablename](c) Select * from [tablename](A) a and b(B) a and d(C) a, b, and c(D) b and c

Answer»
7.

Consider the Euler’s phi function given byϕ(n)=nΠp/n(1–1p)where p runs over all the primes dividing n. What is the value of ϕ(45)?(A) 3(B) 12(C) 6(D) 24

Answer»
8.

Suppose that a connected planar graph has six vertices, each of degrees four. Into how many regions is the plane divided by a planar representation of this graph?(A) 6(B) 8(C) 12(D) 10

Answer»
9.

Software Reuse is(A) The process of analyzing software with the objective of recovering its design and specification.(B) The process of existing software artifacts and knowledge to build new software.(C) Concerned with reimplementing legacy systems to make them more maintainable.(D) The process of analyzing software to create a representation of a higher level of abstraction and breaking software down into its parts to see how it works.

Answer»
10.

Match List-I with List-IIList-I List-II(a) p → q (i) ¬(q → ¬p)(b) p v q (ii) p ∧ ¬q(c) p ∧ q (iii) ¬p → q(d) ¬(p → q) (iv) ¬p v qChoose the correct option from those given below:(A) a-ii,b-iii,c-i,d-iv(B) a-ii,b-i,c-iii,d-iv(C) a-iv,b-i,c-iii,d-ii(D) a-iv,b-iii,c-i,d-ii

Answer»
11.

Consider the equation (146)​ b​ + (313)​ b-2​ = (246)​ 8​ . Which of the following is the value of b?(A) 8(B) 7(C) 10(D) 16

Answer»
12.

How many different Boolean functions of degree n are there?(A) 22n(B) (2^2)^n(C) 2^2^n-1(D) 2^n

Answer»
13.

Which type of addressing mode, less number of memory references are required?(A) Immediate(B) Implied(C) Register(D) Indexed(E) None of the above

Answer»
14.

A computer has six tape drives with n processes competing for them. Each process may need two drives. What is the maximum value of n for the system to be deadlock-free?(A) 5(B) 4(C) 3(D) 6

Answer»
15.

Which data structure is used by the compiler for managing variables and their attributes?(A) Binary tree(B) Link lIst(C) Symbol table(D) Parse table

Answer»
16.

Match List-I with List-II:List-I List-II(Software process Models) (Software System)(a) Waterfall model (i) e-business that starts with only the basic functionality and then moves on to more advanced features.(b) Incremental development (ii) An inventory control system for a supermarket to be developed on a highway(c) Prototyping (iii) A virtual reality system for simulating vehicle navigation on a highway.(d) RAD (iv) Automate the manual system for student record maintenance in a schoolChoose the correct option from those given below:(A) a-ii,b-iv,c-i,d-iii(B) a-i,b-iii,c-iv,d-ii(C) a-iii,b-ii,c-iv,d-i(D) a-iv,b-i,c-iii,d-ii

Answer»
17.

A fuzzy conjunction operator denoted as t(x,y) and a fuzzy disjunction operator denoted as s(x, y) form a dual pair if they satisfy the condition:(A) t(x,y)=1−s(x,y)(B) t(x,y)=s(1−x,1−y)(C) t(x,y)=1−s(1−x,1−y)(D) t(x,y)=s(1+x,1+y)

Answer»
18.

How many are there to place 8 indistinguishable balls into four distinguishable bins?(A) 70(B) 165(C) 8 C 4(D) 8P 4T

Answer»
19.

In relational database management, which of the following is/are property/properties of candidate key?P: UniquenessQ: Irreducibility(A) P only(B) Q only(C) Both P and Q(D) Neither P nor Q

Answer»
20.

Consider three intensive processes, which requires 10,20 and 30 units of time and arrive at times 0,2 and 6 respectively. how many context switches are needed if the operating system implements a shortest remaining time first scheduling algorithm? Do not count the context switches at time zero ad at the end(A)1(B)3(C)4(D)2(E)1(F)3(G)4(H)2

Answer» Answer: (D) (H)
Explanation:

Let three process be P0, P1 and P2 with arrival times 0, 2 and 6 respectively and CPU burst times 10, 20 and 30 respectively. At time 0, P0 is the only available process so it runs. At time 2, P1 arrives, but P0 has the shortest remaining time, so it continues. At time 6, P2 arrives, but P0 has the shortest remaining time, so it continues. At time 10, P1 is scheduled as it is the shortest remaining time process. At time 30, P2 is scheduled. Only two context switches are needed. P0 to P1 and P1 to P2.

21.

Which of the following statements is/are true?P: In a scripting language like javaScript, types are typically associated with values, not variables.Q: It is not possible to show images on a web page without the tag of HTMLSelect the correct answer from the given below:(A) P only(B) Q only(C) Both P and Q(D) Neither P nor Q

Answer»
22.

Match List-I with List-II:List-I List-II(a) Prims’s algorithm (i) O(V3 logV)(b) Dijkstra’s algorithm (ii) O(VE2)(c) Faster all pairs shortest path (iii) O(ElogV)(d) Edmonds-karp algorithm (iv) O(V2)(A) (a) – (ii); (b)-(iv); (c)-(i); (d)-(iii)(B) (a) – (iii); (b)-(iv); (c)-(i); (d)-(ii)(C) (a) – (ii); (b)-(i); (c)-(iv); (d)-(iii)(D) (a) – (iii); (b)-(i); (c)-(iv); (d)-(ii)

Answer»