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. |
If pqr ≠ 0 and , what is the value of the product xyz ?(A) -1(B) 1 / pqr(C) 1(D) pqr |
| Answer» None | |
| 2. |
In appreciative of social improvement completed in a town, a wealthy philanthropist decided to give gift of Rs. 750 to each male senior citizen and Rs. 1000 for female senior citizens. There are total 300 senior citizens and th 8/9th of total men and 2/3rd of total women claimed the gift. What is amount of money philanthropist paid?(A) 15000(B) 200000(C) 115000(D) 151000 |
| Answer» None | |
| 3. |
A six sided unbiased die with four green faces and two red faces is rolled seven times. Which of the following combinations is the most likely outcome of the experiment?(A) Three green faces and four red faces.(B) Four green faces and three red faces.(C) Five green faces and two red faces.(D) Six green faces and one red face |
| Answer» | |
| 4. |
The area of a square is ‘d’. What is the area of the circle which has the diagonal of the square as its diameter?(A) πd(B) πd2(C) (1/4) πd2(D) (1/2)πd |
| Answer» None | |
| 5. |
In a party, 60% of the invited guests are male and 40% are female. If 80% of the invited guests attended the party and if all the invited female guests attended, what would be the ratio of males to females among the attendees in the party?(A) 2:3(B) 1:1(C) 3:2(D) 2:1 |
| Answer» None | |
| 6. |
In the figure below, ∠DEC+∠BFC is equal to _______ .(A) ∠ BCD – ∠ BAD(B) ∠ BAD + ∠ BCF(C) ∠ BAD + ∠ BCD(D) ∠ CBA + ∠ ADC |
| Answer» | |
| 7. |
A __________ investigation can sometimes yield new facts, but typically organized once are more successful.(A) Meandering(B) Timely(C) Consistent(D) Systematic |
| Answer» | |
| 8. |
Consider the following C code. Assume that unsigned long int type length is 64 bits.unsigned long int fun(unsigned long int n) {unsigned long int i, j = 0, sum = 0;for( i = n; i > 1; i = i/2) j++;for( ; j > 1; j = j/2) sum++;return sum;}The value returned when we call fun with the input 240 is(A) 4(B) 5(C) 6(D) 40 |
| Answer» None | |
| 9. |
What is the missing number in the following sequence?2, 12, 60, 240, 720, 1440, …. 0(A) 2880(B) 1440(C) 720(D) 0 |
| Answer» | |
| 10. |
What would be the smallest natural number which when divided either by 20 or by 42 or by 76 leaves a remainder ‘7’ in each case is_(A) 3047(B) 6047(C) 7987(D) 63847 |
| Answer» | |
| 11. |
Consider the following C program.#include <stdio.h>struct Ournode {char x, y, z;};int main() {struct Ournode p = {'1', '0', 'a' + 2};struct Ournode *q = &p;printf("%c, %c", *((char *)q + 1), *((char *)q + 2));return 0;}The output of this program is:(A) 0, c(B) 0, a+2(C) ‘0’, ‘a+2’(D) ‘0’, ‘c’ |
| Answer» | |
| 12. |
The postorder traversal of a binary tree is 8, 9, 6, 7, 4, 5, 2, 3, 1. The inorder traversal of the same tree is 8, 6, 9, 4, 7, 2, 5, 1, 3. The height of a tree is the length of the longest path from the root to any leaf. The height of the binary tree above is ________ .Note –This was Numerical Type question.(A) 2(B) 3(C) 4(D) 5 |
| Answer» | |
| 13. |
A lexical analyzer uses the following patterns to recognize three tokens T1, T2, and T3 over the alphabet {a,b,c}.T1: a?(b∣c)*aT2: b?(a∣c)*bT3: c?(b∣a)*cNote that ‘x?’ means 0 or 1 occurrence of the symbol x. Note also that the analyzer outputs the token that matches the longest possible prefix.If the string bbaacabc is processes by the analyzer, which one of the following is the sequence of tokens it outputs?(A) T1T2T3(B) T1T1T3(C) T2T1T3(D) T3T3 |
| Answer» | |
| 14. |
Consider an IP packet with a length of 4,500 bytes that includes a 20-byte IPv4 header ans 40-byte TCP header. The packet is forwarded to an IPv4 router that supports a Maximum Transmission Unit (MTU) of 600 bytes. Assume that the length of the IP header in all the outgoing fragments of this packet is 20 bytes. Assume that the fragmentation offset value stored in the first fragment is 0.The fragmentation offset value stored in the third fragment is ______ .Note –This was Numerical Type question.(A) 0(B) 72(C) 144(D) 216 |
| Answer» | |
| 15. |
Consider a simple communication system where multiple nodes are connected by a shared broadcast medium (like Ethernet or wireless). The nodes in the system use the following carrier-sense the medium access protocol. A node that receives a packet to transmit will carrier-sense the medium for 5 units of time. If the node does not detect any other transmission in this duration, it starts transmitting its packet in the next time unit. If the node detects another transmission, it waits until this other transmission finishes, and then begins to carrier-sense for 5 time units again. Once they start to transmit, nodes do not perform any collision detection and continue transmission even if a collision occurs. All transmissions last for 20 units of time. Assume that the transmission signal travels at the speed of 10 meters per unit time in the medium.Assume that the system has two nodes P and Q, located at a distance d meters from each other. P starts transmitting a packet at time t = 0 after successfully completing its carrier-sense phase. Node Q has a packet to transmit at time t = 0 and begins to carrier-sense the medium.The maximum distance d (in meters, rounded to the closest integer) that allows Q to successfully avoid a collision between its proposed transmission and P’s on going transmission is _______ .Note –This was Numerical Type question.(A) 50(B) 150(C) 20(D) 60 |
| Answer» | |
| 16. |
A processor has 16 integer registers (R0, R1, … , R15) and 64 floating point registers (F0, F1, … , F63). It uses a 2-byte instruction format. There are four categories of instructions: Type-1, Type-2, Type-3, and Type 4. Type-1 category consists of four instructions, each with 3 integer register operands (3Rs). Type-2 category consists of eight instructions, each with 2 floating point register operands (2Fs). Type-3 category consists of fourteen instructions, each with one integer register operand and one floating point register operand (1R+1F). Type-4 category consists of N instructions, each with a floating point register operand (1F).The maximum value of N is _______ .Note –This was Numerical Type question.(A) 32(B) 64(C) 256(D) 512 |
| Answer» | |
| 17. |
The instruction pipeline of a RISC processor has the following stages: Instruction Fetch (IF), Instruction Decode (ID), Operand Fetch (OF), Perform Operation (PO) and Writeback (WB), The IF, ID, OF and WB stages take 1 clock cycle each for every instruction. Consider a sequence of 100 instructions. In the PO stage, 40 instructions take 3 clock cycles each, 35 instructions take 2 clock cycles each, and the remaining 25 instructions take 1 clock cycle each. Assume that there are no data hazards and no control hazards.The number of clock cycles required for completion of execution of the sequence of instruction is ______ .Note – This was Numerical Type question.(A) 219(B) 104(C) 115(D) 220 |
| Answer» None | |
| 18. |
Consider a process executing on an operating system that uses demand paging. The average time for a memory access in the system is M units if the corresponding memory page is available in memory, and D units if the memory access causes a page fault. It has been experimental measured that the average time taken for a memory access in the process is X units.Which one of the following is the correct expression for the page fault rate experienced by the process?(A) (D – M) / (X – M)(B) (X – M) / (D – M)(C) (D – X) / (D – M)(D) (X – M) / (D – X) |
| Answer» | |
| 19. |
Consider the weights and values of items listed below. Note that there is only one unit of each item.The task is to pick a subset of these items such that their total weight is no more than 11 Kgs and their total value is maximized. Moreover, no item may be split. The total value of items picked by an optimal algorithm is denoted by Vopt. A greedy algorithm sorts the items by their value-to-weight ratios in descending order and packs them greedily, starting from the first item in the ordered list. The total value of items picked by the greedy algorithm is denoted by Vgreedy.The value of Vopt − Vgreedy is ______ .Note –This was Numerical Type question.(A) 16(B) 8(C) 44(D) 60 |
| Answer» | |
| 20. |
Consider a matrix P whose only eigenvectors are the multiples of .Consider the following statements.(I) P does not have an inverse(II) P has a repeated eigenvalue(III) P cannot be diagonalizedWhich one of the following options is correct?(A) Only I and III are necessarily true(B) Only II is necessarily true(C) Only I and II are necessarily true(D) Only II and III are necessarily true |
| Answer» | |
| 21. |
The size of the physical address space of a processor is 2P bytes. The word length is 2W bytes. The capacity of cache memory is 2N bytes. The size of each cache block is 2M words. For a K-way set-associative cache memory, the length (in number of bits) of the tag field is(A) P − N − log2K(B) P − N + log2K(C) P − N − M − W − log2K(D) P − N − M − W + log2K |
| Answer» | |
| 22. |
Consider the unsigned 8-bit fixed point binary number representation, below, b7b6b5b4b3 ⋅ b2b1b0where the position of the binary point is between b3 and b2 . Assume b7 is the most significant bit. Some of the decimal numbers listed below cannot be represented exactly in the above representation: (i) 31.500 (ii) 0.875 (iii) 12.100 (iv) 3.001Which one of the following statements is true?(A) None of (i), (ii), (iii), (iv) can be exactly represented(B) Only (ii) cannot be exactly represented(C) Only (iii) and (iv) cannot be exactly represented(D) Only (i) and (ii) cannot be exactly represented |
| Answer» None | |