InterviewSolution
Saved Bookmarks
InterviewSolution
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. |
There are exactly __________ different finite automata with three states x, y and z over the alphabet {a, b} where x is always the start state.(A) 64(B) 56(C) 1024(D) 5832 |
| Answer» | |
| 2. |
The language of all non-null strings of a’s can be defined by a context free grammar as follow:S → aS|Sa|aThe word a3 can be generated by __________ different trees.(A) two(B) three(C) four(D) five |
| Answer» | |
| 3. |
What will be the output at PORT1 if the following program is executed ?MVI B, 82HMOV A, BMOV C, AMVI D, 37HOUT PORT1HLT(A) 37H(B) 82H(C) B9H(D) 00H |
| Answer» | |
| 4. |
Match the following:(A) (1)(B) (2)(C) (3)(D) (4) |
| Answer» | |
| 5. |
Given two sequences X and Y :X = &lt a, b, c, b, d, a, b &gtY = &lt b, d, c, a, b, a &gt .The longest common subsequence of X and Y is :(A) &lt b, c, a&gt(B) &lt c, a, b&gt(C) &lt b, c, a, a&gt(D) &lt b, c, b, a&gt |
| Answer» | |
| 6. |
If there are n integers to sort, each integer has d digits and each digit is in the set {1, 2, …, k}, radix sort can sort the numbers in :(A) O(d n k)(B) O(d nk)(C) O((d +n) k)(D) O(d (n + k)) |
| Answer» | |
| 7. |
Floyd-Warshall algorithm utilizes __________ to solve the all-pairs shortest paths problem on a directed graph in __________ time.(A) Greedy algorithm, θ (V3)(B) Greedy algorithm, θ (V2 lgn)(C) Dynamic programming, θ (V3)(D) Dynamic programming, θ (V2 lgn) |
| Answer» | |
| 8. |
The three outputs x1x2x3 from the 8 X 3 priority encoder are used to provide a vector address of the form 101x1x2x300. What is the second highest priority vector address in hexadecimal if the vector addresses are starting from the one with the highest priority ?(A) BC(B) A4(C) BD(D) AC |
| Answer» None | |
| 9. |
The family of context sensitive languages is __________ under union and __________ under reversal.(A) closed, not closed(B) not closed, not closed(C) closed, closed(D) not closed, closed |
| Answer» | |
| 10. |
The solution of the recurrence relationT(n) ≤ { θ(1) if n ≤ 80T(n) ≤ { T(n / s) + T((7n / 10) + 6) + O(n) if n ≥ 80is :(A) O(lg n)(B) O(n)(C) O(n lg n)(D) None of the above |
| Answer» | |
| 11. |
Let n = 4 and (a1, a2, a3, a4) = (do, if, int, while).Let p(1 : 4) = (3 / 8, 3 / 8, 1 /8, 1 / 8) and Let q(1 : 4) = (2 / 8, 3 / 8, 1 / 8, 1 / 8, 1 / 8) where p(i) and q(i) denotes the probability with which we search a and the identifier x being searched satisfy ai < x < ai + 1 respectively. The optimal search tree is given by:(1)(2)(3)(4)(A) (1)(B) (2)(C) (3)(D) (3) |
| Answer» | |
| 12. |
Javascript and Java has similar name because __________ is/are true.(a)Javascripts syntax is loosely based on Java’s syntax(b)Javascript is stripped down version of Java(c)Java and Javascript are originated from Island of JavaCodes:(A) (a) only(B) (a), (b) and (c)(C) (a) and (b)(D) (a) and (c) |
| Answer» | |
| 13. |
Consider the following transportation problem:The transportation cost in the initial basic feasible solution of the above transportation problem using Vogel’s Approximation method is:(A) 1450(B) 1465(C) 1480(D) 1520 |
| Answer» | |
| 14. |
Consider the following conditions:(a)The solution must be feasible, i.e. it must satisfy all the supply and demand constraints.(b)The number of positive allocations must be equal to m1n21, where m is the number of rows and n is the number of columns.(c)All the positive allocations must be in independent positions.The initial solution of a transportation problem is said to be non-degenerate basic feasible solution if it satisfies:Codes:(A) (a) and (b) only(B) (a) and (c) only(C) (b) and (c) only(D) (a), (b) and (c) |
| Answer» | |
| 15. |
In Unix, the command to enable execution permission for file “mylife” by all is ____________.(A) Chmod ugo + X myfile(B) Chmod a + X myfile(C) Chmod + X myfile(D) All of the above |
| Answer» | |
| 16. |
What will be the output of the following Unix command ?$rm chap0\[1 – 3\](A) Remove file chap0[1 – 3](B) Remove file chap01, chap02, chap03(C) Remove file chap\[1 – 3\](D) None of the above |
| Answer» | |
| 17. |
A device is sending out data at the rate of 2000 bps. How long does it take to send a file of 1,00,000 characters ?(A) 50(B) 200(C) 400(D) 800 |
| Answer» | |
| 18. |
Consider a subnet with 720 routers. If a three-level hierarchy is chosen with eight clusters, each containing 9 regions of 10 routers, then total number of entries in the routing table is __________.(A) 25(B) 27(C) 53(D) 72 |
| Answer» | |
| 19. |
A network with bandwidth of 10 Mbps can pass only an average of 15,000 frames per minute with each frame carrying an average of 8,000 bits. What is the throughput of this network?(A) 2 Mbps(B) 60 Mbps(C) 120 Mbps(D) 10 Mbps |
| Answer» | |
| 20. |
Given the following set of prolog clauses :father(X, Y) :parent(X, Y),male(X),parent(Sally, Bob),parent(Jim, Bob),parent(Alice, Jane),parent(Thomas, Jane),male(Bob),male(Jim),female(Salley),female(Alice).How many atoms are matched to the variable ‘X’ before the queryfather(X, Jane) reports a Result ?(A) 1(B) 2(C) 3(D) No option is correct. |
| Answer» | |
| 21. |
A CPU handles interrupt by executing interrupt service subroutine __________.(A) by checking interrupt register after execution of each instruction(B) by checking interrupt register at the end of the fetch cycle(C) whenever an interrupt is registered(D) by checking interrupt register at regular time interval |
| Answer» | |
| 22. |
Forward chaining systems are __________ where as backward chaining systems are __________.(A) Data driven, Data driven(B) Goal driven, Data driven(C) Data driven, Goal driven(D) Goal driven, Goal driven |
| Answer» | |
| 23. |
Match the following w.r.t. programming language:(A) (1)(B) (2)(C) (3)(D) (4)(E) No option is correct. |
| Answer» | |
| 24. |
The combination of an IP address and a port number is known as ___________.(A) network number(B) socket address(C) subnet mask number(D) MAC address |
| Answer» | |