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. |
In public key and private key cryptography, host ‘A’ has PuA and PrA, host ‘B’ has PuB and PrB as public and private keys respectively. Now, if ‘A’ wants to send a message to ‘B’ securely, which key will be used by ‘A’ for encryption ?(A) PuA(B) PuB(C) PrA(D) PrB |
| Answer» | |
| 2. |
A broadcast channel has 10 nodes and total capacity of 12 Mbps. It uses polling for medium access. Once a node finishes transmission, there is a polling delay of 50 μseconds to poll the next node. Whenever a node is polled, it is allowed to transmit a maximum of 1000 Bytes. The maximum throughput of broadcast channel is:(A) 9.16 Mbps(B) 11.16 Mbps(C) 10Mbps(D) 10.33 Mbps |
| Answer» | |
| 3. |
Match the protocol with the characteristics:1. Mails are stored on the computer client use.2. Stateless protocol3. Converts MAC address to IP address.4. Used to send error messages(A) 1: POP3, 2: HTTP, 3: ARP, 4: SMTP(B) 1: IMAP, 2: HTTP, 3: RARP, 4: SMTP(C) 1: POP3, 2: HTTP, 3: RARP, 4: ICMP(D) 1: IMAP, 2: HTTP, 3: ARP, 4: ICMP |
| Answer» | |
| 4. |
Consider the following CFG S -> AaAb | Bb A -> ԑ B -> ԑThe above grammar is:(A) Ambiguous(B) Left recursive(C) Left factored(D) None of these |
| Answer» | |
| 5. |
Consider the following grammarS -> Aa | bAc | dc | bdaA -> dThe above grammar is:(A) Not LALR(1) but SLR(1)(B) Both LALR(1) and SLR(1)(C) LALR(1) but not SLR(1)(D) Neither LALR(1) nor SLR(1) |
| Answer» | |
| 6. |
A directed acyclic graph represents one form of intermediate representation. The number of non terminal nodes in DAG of a = (b+c)*(b+c) expression is:(A) 2(B) 3(C) 4(D) 5 |
| Answer» | |
| 7. |
Using the EMPLOYEE table, the following query is issued to generate the name, salary and the salary increased after an appraisal by 25 %. The increased salary for all the employee should be above 25000.SELECT fname, salary, salary + (salary *0.25) AS "INCREASED_SALARY" FROM employee WHERE increased_salary > 25000; The above query throws an error. What is the reason for the error ?(A) The parenthesis is missing in the expression used in SELECT statement.(B) Single quotes must be used to define a column alias.(C) Column alias cannot be used in the WHERE clause.(D) Column alias in the WHERE clause must be enclosed within double quotation marks. |
| Answer» | |
| 8. |
Let 5 stations are connected to CSMA/CD network . Every station wants to transmit data with probability p = 0.6. It is given that there will be no collision if only one station will transmit. What is the probability of successful transmission ?(A) 1(B) 0(C) 0.0768(D) 0.768 |
| Answer» | |
| 9. |
A counting semaphore was initialized to 0, then 20 V operations were successfully completed on this semaphore, followed with 18 P operations, the resulting value of the semaphore is:(A) 18(B) 20(C) 0(D) 2 |
| Answer» | |
| 10. |
The following graph shows the schedule of five transactions. The schedule is:(A) View Serializable(B) Conflict Serializable(C) Both (A) and (B)(D) Not serializable |
| Answer» | |
| 11. |
Consider all the processes are arriving at large time intervals. Let t be the time interval between two processes Pi and Pi+1 for any i and service time of Pi is Si. If t > Si for every i then, what should be the strategy to schedule the processes ?(A) FCFS(B) Shortest Job First(C) Round Robin(D) Shortest Remaining Time First |
| Answer» | |
| 12. |
Consider the following SDT S -> 1A23 {print “GA”} A -> 4S {print “TE”} A -> 5 {print “C”} A -> B {print “SE”} B -> 6B {print “TE”} B -> 2 {print “ST”}What will be output by the SDT for the input string “14122323”?(A) GATEGASEST(B) STSEGATEGA(C) STGASETEGA(D) GASTSEGATE |
| Answer» | |
| 13. |
A student relation with 4 attributes is defines as R(ABCD). Which of the following query will execute without error if all attributes are numeric.A) ∏B,C(σA>20)B) σA>20(∏B,C)(A) Only A(B) Only B(C) Both(D) None |
| Answer» | |
| 14. |
On a system using round-robin scheduling let ‘s’ represent the time needed to perform a process switch, ‘q’ represents the round-robin time quantum, and ‘r’ represents the average time a process runs before blocking on I/O. The CPU efficiency when s = q < r is:(A) r/(r+s)(B) q/(q+s)(C) 1/2(D) 0 |
| Answer» | |
| 15. |
There are 5 brothers in a family. All were born at a gap of 3 years. If the sum total of ages of 5 brothers is 100. What is the age of 2nd most elder brother ?(A) 13(B) 15(C) 23(D) 26 |
| Answer» | |
| 16. |
The sum of the digits in the unit place of all the 4 digit numbers formed with the help of 3, 4, 5 and 6 taken all at a time is:(A) 18(B) 108(C) 432(D) 144 |
| Answer» | |
| 17. |
The following is the AB flip flop:What are values of A, B when change in the flip flop state is from 0 to 1 ?Note: x in the options below represents that it can have any value out of 0 and 1.(A) 1, x(B) 0, x(C) 1, 0(D) x, 1 |
| Answer» | |
| 18. |
Using the data from Question 49, How many blocks can cache accommodate ?(A) 512(B) 1024(C) 256(D) 128 |
| Answer» | |
| 19. |
Identify the circuit shown below:(A) Bidirectional Buffer(B) De-multiplexer(C) Multiplexer(D) Encoder |
| Answer» | |
| 20. |
An instruction pipeline has 4 stages Instruction Fetch(IF), Instruction Decode(ID), Execute instruction (Ex), Write Back(WB). All instructions take all stages and takes 4 clock cycles. Branch instructions are not overlapped, i.e. the instructions after the branch are not fetched till branch is known. Branch is known in the execute phase. Suppose 20 % instructions are conditional and 80 % unconditional. Calculate speed up for 100 instructions (upto 2 decimal place). Ignore the case that the branch may not be taken.(A) 2.86(B) 3.21(C) 1.65(D) 2.57 |
| Answer» | |
| 21. |
Which of the following languages are closed under complementation ?A) Context freeB) RecursiveC) Recursive Enumerable(A) A only(B) B only(C) A and B only(D) All |
| Answer» | |
| 22. |
The language L = {WbcWR | W ∈ (a+b)*} is _____.(A) DCFL(B) CFL but not DCFL(C) Non-CFL(D) None of the above |
| Answer» | |
| 23. |
Which of the following is not a CFL?A)L = {albmcn where l=m or l=n}B)L = {albmcn where l=m and l=n}C)L = {albmcn where l = m + n}(A) Only A(B) Only B(C) B and C(D) All |
| Answer» | |
| 24. |
Which of the following statements is incorrect ?(A) Union of two DCFL is a CFL.(B) Complementation of a regular language is a regular language.(C) Turing recognizable languages are closed under intersection.(D) None. |
| Answer» | |
| 25. |
The 32 bit floating point representation of (-12) is ___(A) 11000000010000000000000000000000(B) 11000001010000000000000000000000(C) 01000001110000000000000000000000(D) 11000000110000000000000000000000 |
| Answer» | |
| 26. |
Linked Questions 49-50A digital computer has a memory unit of 256k x 16 and a cache memory of 4k words. The cache uses direct mapping with a block size of 16 words.How many bits are there in index, tag, block and words fields of address format ?(A) 10, 6, 8, 2(B) 12, 6, 8, 4(C) 12, 8, 6, 4(D) 10, 6, 8, 4 |
| Answer» | |
| 27. |
Consider a DFA accepting all strings over {a, b} where the number of a’s mod 3 = 2 and number of b’s are odd.What is the minimum number of states of such DFA ?(A) 4(B) 2(C) 6(D) 8 |
| Answer» | |
| 28. |
If P, Q are the roots of the quadratic equation x2 + ax + b. Find the value of P3 +Q3.(A) 3ab – a3(B) 3ab – b3(C) 3(a2)(b2) – a3(D) 3(a2)(b2) – b3 |
| Answer» | |
| 29. |
Which of the following languages are regular over ∑ = {a, b} ?L1 = { anbn | 0 < n ≤ 10}L2 = { a2n | n ≥ 1}L3 = { an! | n > 0}(A) L2 only.(B) L1 only.(C) L1 and L2.(D) None of L1, L2 and L3. |
| Answer» | |
| 30. |
(A) 5(B) 7(C) 8(D) 0 |
| Answer» | |
| 31. |
In a random experiment, suppose 3 unbiased coins are tossed simultaneously, what is the probability of getting at least 2 Heads ?(A) 1/2(B) 3/4(C) 7/8(D) 1/8 |
| Answer» | |
| 32. |
Given F is an expression of P,Q. Derive the expression F(P,Q) from the truth table given below.(A) (PQ)’(B) P + Q’(C) P + Q(D) (P + Q)’ |
| Answer» | |
| 33. |
(A) e(B) e2(C) e1/2(D) 1 |
| Answer» | |
| 34. |
(A) 1(B) 2(C) 3(D) 4 |
| Answer» | |
| 35. |
The value of the following Integral is:(A) π(B) aπ(C) π/2(D) 2π |
| Answer» | |
| 36. |
Which Of the following statements are true ?S1: Every Distributive lattice has unique complement.S2: In Complemented lattice every element has at least one complement.S3: Boolean lattice is both complemented and distributive.S4: In Boolean lattice every lattice has exactly one complement.(A) S1 & S4(B) S1, S2 & S3(C) S2, S3 & S4(D) All of these statements |
| Answer» | |
| 37. |
Given a hash table with n keys and m slots with simple uniform hashing. If collisions are resolved by chaining then what is the probability that the first slot ends up empty ?(A) (1 / m)n(B) [1 – (1/m)]n(C) (1/n)m(D) [1 – (1/n)]m |
| Answer» | |
| 38. |
Let f(n) = Σ [(log(n/2i) +100] where i limits from 0 to k, and n = 2k.Find the time complexity of f(n).(A) θ(n)(B) θ(nlogn)2(C) θ(logn)(D) θ(logn)2 |
| Answer» | |
| 39. |
Given a graph G (V, E) is Bipartite, what is the chromatic number of G ?(A) 2(B) 3(C) ∞(D) Can’t be decided |
| Answer» | |
| 40. |
Which of the following argument is invalid ?(A) (p→(q⋁r) )⟺((p⋀~q)→r)(B) ((p→r)⋀(q→r)⟺((p⋁q)→r)(C) p→(q→r)⟺q→(p→r)(D) (p↔q)⟺(p⋁q)⋁(p⋀q) |
| Answer» | |
| 41. |
Considering the data given in the previous question, if the stack A had 4 entries, then the number of possible permutations that can be printed will be:(A) 24(B) 12(C) 21(D) 14 |
| Answer» | |
| 42. |
Linked Questions 22-23Stack A has the entries as following sequence a, b, c (with ‘a’ on top), stack B is empty, as shown in the diagram below.An entry popped out of stack A can be printed or pushed to stack B. An entry popped out of stack B can only be printed.In this arrangement which of the following permutation of a, b, c are not possible to print?(i) bac(ii) bca(iii) cab(iv) abc(A) (i), (ii) and (iii)(B) (iv) Only(C) (iii) Only(D) (ii) and (iii) Only |
| Answer» | |
| 43. |
(A) tanx(B) sec2x(C) 2sinx(D) 2cosx |
| Answer» | |
| 44. |
Which data structure would be the most appropriate to implement a collection of values with the following three characteristics?i) Items are retrieved and removed from the collection in FIFO order.ii) There is no priori limit to the number of items in the collection.iii) The size of an item is large relative to storage required for a memory address.(A) Singly linked list with head and tail pointers(B) Doubly linked list with only a head pointer(C) Binary tree(D) Hash table |
| Answer» | |
| 45. |
Consider the following statements:S1 : DFS of a directed graph always produces the same number of edges in the traversal, irrespective of the starting vertex.S2 : If all of the back edges that are found while DFS traversal on directed graph are removed, the resulting graph is acyclic.Which of the following statements above are valid ?(A) Both S1 and S2 are valid(B) Only S1 is valid(C) Only S2 is valid(D) Neither s1 nor S2 is valid |
| Answer» | |
| 46. |
Consider the following pseudo code.x = 0;for (i = 1 to n) for (j = 1 to 4i – 3) x = x + 1Find the value of x, when the above code is executed in a function.(A) n(B) 2n2 – n(C) 2n2 – 1(D) 2n |
| Answer» | |
| 47. |
Let X and Y be the integers representing the number of simple graphs possible with 3 labeled vertices and 3 unlabeled vertices respectively. Let X – Y = N. Then, find the number of spanning trees possible with N labeled vertices complete graph.(A) 4(B) 8(C) 16(D) 32 |
| Answer» | |
| 48. |
Consider the case: f(n) = O(g(n)).Then, following two statements are claimed to be inferred from the above case.Statement I: 2f(n) = O(2g(n))Statement II: 2g(n) = O(2f(n))Choose the correct option from the given.(A) Both statements are true(B) Both statements are false(C) Statement I is true and Statement II is false(D) Statement I is false and Statement II is true |
| Answer» | |
| 49. |
Consider the following statements about Bellman ford algorithm for finding shortest path in a directed connected graph G having integral edge weights.Statement I: It will always find out negative edge weight cycle in G reachable from source.Statement II: It will always give correct answer for the graph G.Choose from the options given below.(A) Both statements are true(B) Both statements are false(C) Statement I is true and Statement II is false(D) Statement II is true and Statement I is false |
| Answer» | |
| 50. |
Consider a sorted array of n elements. Let k inversions (swapping) have been performed on the sorted array and we want to sort it again to reverse effect of inversions. If K is very small in comparison to n, then which sorting technique will prove efficient for making again the list in sorted increasing order array.(A) Selection Sort(B) Insertion Sort(C) Bubble Sort(D) Quick Sort |
| Answer» | |