InterviewSolution
Saved Bookmarks
InterviewSolution
This section includes InterviewSolutions, each offering curated multiple-choice questions to sharpen your ISRO knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
Using public key cryptography, X adds a digital signature σ to a message M, encrypts (M,σ) and sends it to Y, where it is decrypted. Which one of the following sequence of keys is used for operations?(A) Encryption : X’s private key followed by Y’s private key. Decryption : X’s public key followed by Y’s public key.(B) Encryption : X’s private key followed by Y’s public key; Decryption : X’s public key followed by Y’s private key(C) Encryption : X’s private key followed by Y’s public key; Decryption : Y’s private key followed by X’s public key.(D) Encryption : X’s public key followed by Y’s private key; Decryption : Y’s public key followed by X’s private key. |
| Answer» | |
| 2. |
Which of the following are used to generate a message digest by the network security protocols?(P) SHA-256(Q) AES(R) DES(S) MD5(A) P and S only(B) P and Q only(C) R and S only(D) P and R only |
| Answer» | |
| 3. |
In a compact one dimensional array representation for lower triangular matrix (all elements above diagonal are zero) of size n x n, non zero elements of each row are stored one after another, starting from first row, the index of (i, j)th element in this new representation is(A) i+j(B) j+i(i-1)/2(C) i+j-1(D) i+j(j-1)/2 |
| Answer» | |
| 4. |
Which of the following related to snowflake schema is true?(A) Each dimension is represented by a single dimensional table(B) Maintenance efforts are less(C) Dimension tables are normalised(D) It is not an extension of star schema |
| Answer» | |
| 5. |
Suppose the numbers 7, 5, 1, 8, 3, 6, 0, 9, 4, 2 are inserted in that order into an initially empty binary search tree. The binary search tree uses the reversal ordering on natural numbers i.e. 9 is assumed to be smallest and 0 is assumed to be largest. The in-order traversal of the resultant binary search tree is(A) 9, 8, 6, 4, 2, 3, 0, 1, 5, 7(B) 0, 1, 2, 3, 4, 5, 6, 7, 8, 9(C) 0, 2, 4, 3, 1, 6, 5, 9, 8, 7(D) 9, 8, 7, 6, 5, 4, 3, 2, 1, 0 |
| Answer» | |
| 6. |
Station A uses 32 byte packets to transmit messages to Station B using a sliding window protocol. The round trip time delay between A and B is 40 ms and the bottleneck bandwidth on the path A and B is 64 kbps. What is the optimal window size that A should use?(A) 5(B) 10(C) 40(D) 80 |
| Answer» | |
| 7. |
A strictly binary tree with 10 leaves(A) cannot have more than 19 nodes(B) has exactly 19 nodes(C) has exactly 17 nodes(D) has exactly 20 nodes |
| Answer» | |
| 8. |
The in-order and pre-order traversal of a binary tree are d b e a f c g and a b d e c f g respectively. The post order traversal of a binary tree is(A) e d b g f c a(B) e d b f g c a(C) d e b f g c a(D) d e f g b c a |
| Answer» | |
| 9. |
Consider the following schema :Sailors (sid, sname, rating, age)Boats (bid, bname, colour)Reserves (sid, bid, day)Two boats can have the same name but the colour differentiates them. The two relationsρ (Tempsids, (Ⲡ sid, bid Reserves)/(Ⲡ bid ( σ bname ='Ganga' Boats))),Ⲡ sname (Tempsids ⋈ Sailors)If / is division operation, the above set of relations represents the query(A) Names of sailors who have reserved all boats called Ganga(B) Names of sailors who have not reserved any Gangaboat(C) Names of sailors who have reserved at least one Gangaboat(D) Names of sailors who have reserved at most one Ganga boat |
| Answer» | |
| 10. |
A priority queue is implemented as a Max-heap. Initially it has 5 elements. The level order traversal of the heap is 10, 8, 5, 3, 2. Two new elements ‘1’ and ‘7’ are inserted into the heap in that order. The level order traversal of the heap after the insertion of the elements is(A) 10, 8, 7, 5, 3, 2, 1(B) 10, 8, 7, 2, 3, 1, 5(C) 10, 8, 7, 1, 2, 3, 5(D) 10, 8, 7, 3, 2, 1, 5 |
| Answer» | |
| 11. |
The minimum number of stacks needed to implement a queue is(A) 3(B) 1(C) 2(D) 4 |
| Answer» | |
| 12. |
What is the maximum height of any AVL tree with 7 nodes? Assume that height of tree with single node is 0.(A) 2(B) 3(C) 4(D) 5 |
| Answer» | |
| 13. |
Generally TCP is reliable and UDP is not reliable. DNS which has to be reliable uses UDP because(A) UDP is slower(B) DNS servers has to keep connections(C) DNS requests are generally very small and fit well within UDP segments(D) None of these |
| Answer» | |
| 14. |
Which one of the following property is correct for a red-black tree?(A) Every simple path from a node to a descendant leaf contains the same number of black nodes(B) If a node is red, then one children is red and another is black(C) If a node is red, then both its children are red(D) Every leaf node (sentinel node) is red |
| Answer» | |
| 15. |
For Σ={a,b} the regular expression r = (aa)*(bb)*b denotes(A) Set of strings with 2 a’s and 2 b’s(B) Set of strings with 2 a’s 2 b’s followed by b(C) Set of strings with 2 a’s followed by b’s which is a multiple of 3(D) Set of strings with even number of a’s followed by odd number of b’s |
| Answer» | |
| 16. |
Match the following and choose the correct answer for the order A, B, C, DA. Strassen matrix multiplicationp. Decrease and ConquerB. Insertion sortq. Dynamic ProgrammingC. Guassian Eliminationr. Divide and ConquerD. Floyd shortest path algorithms. Transform and Conquer(A) r, s, p, q(B) r, p, s, q(C) q, s, p, r(D) s, p, q, r |
| Answer» | |
| 17. |
Consider the programvoid function(int n) {int i, j, count=0;for (i=n/2; i <= n; i++)for (j = 1; j <= n; j = j*2)count++;}The complexity of the program is(A) O(log n)(B) O(n2)(C) O(n2 log n)(D) O(n log n) |
| Answer» | |
| 18. |
If vectors and are perpendicular to each other, then value of λ is(A) 2/5(B) 2(C) 3(D) 5/2 |
| Answer» | |
| 19. |
Consider the following :A. Condition Coveragep. Black box testingB. Equivalence Class partitioningq. System testingC. Volume Testingr. White box testingD. Beta Testings. Performance testingMatching A, B, C, D in the same order gives.(A) r, p, s, q(B) p, r, q, s(C) s, r, q, p(D) q, r, s, p |
| Answer» | |
| 20. |
A CPU has a 32 KB direct mapped cache with 128 byte block size. Suppose A is a 2 dimensional array of size 512×512 with elements that occupy 8 bytes each. Consider the code segmentfor (i =0; i < 512; i++) { for (j =0; j < 512; j++) { x += A[i][j]; }} Assuming that array is stored in order A[0][0], A[0][1], A[0][2]……, the number of cache misses is(A) 16384(B) 512(C) 2048(D) 1024 |
| Answer» None | |
| 21. |
Which of the following set of components is sufficient to implement any arbitrary Boolean function?a) XOR gates, NOT gatesb) 2 to 1 multiplexersc) AND gates, XOR gates, 1d) Three-input gates that output (A.B)+C for the inputs A, B and C.(A) a and d(B) b and c(C) c(D) All a, b, c and d |
| Answer» | |
| 22. |
Consider the results of a medical experiment that aims to predict whether someone is going to develop myopia based on some physical measurements and heredity. In this case, the input dataset consists of the person’s medical characteristics and the target variable is binary: 1 for those who are likely to develop myopia and 0 for those who aren’t. This can be best classified as(A) Regression(B) Decision Tree(C) Clustering(D) Association Rules |
| Answer» | |
| 23. |
An Internet Service Provider (ISP) has the following chunk of CIDR-based IP addresses available with it: 245.248.128.0/20. The ISP wants to give half of this chunk of addresses to Organization A, and a quarter to Organization B, while retaining the remaining with itself. Which of the following is a valid allocation of addresses to A and B?(A) 245.248.136.0/21 and 245.248.128.0/22(B) 245.248.128.0/21 and 245.248.128.0/22(C) 245.248.132.0/22 and 245.248.132.0/21(D) 245.248.136.0/24 and 245.248.132.0/21 |
| Answer» | |
| 24. |
In the IPv4 addressing format, the number of networks allowed under Class C addresses is(A) 220(B) 224(C) 214(D) 221 |
| Answer» | |
| 25. |
Let M = 11111010 and N = 00001010 be two 8 bit two’s compliment number. Their product in two’s complement is(A) 11000100(B) 10011100(C) 10100101(D) 11010101 |
| Answer» | |
| 26. |
Let L = {ap | p is a prime}. Then which of the following is true?(A) It is not accepted by a Turing Machine(B) It is regular but not context free(C) It is context free but not regular(D) It is neither regular nor context free, but accepted by a Turing Machine |
| Answer» | |
| 27. |
Consider the following query :SELECT E.eno, COUNT(*)FROM Employees EGROUP BY E.enoIf an index on eno is available, the query can be answered by scanning only the index if(A) the index is only hash and clustered(B) the index is only B+tree and clustered(C) index can be hash or B+ tree and clustered or non-clustered(D) index can be hash or B+ tree and clustered |
| Answer» | |
| 28. |
Consider the following table : Faculty (facName, dept, office, rank, dateHired)facNamedeptofficerankdateHiredRaviArtA101Professor1975MuraliMathM201Assistant2000NarayananArtA101Associate1992LakshmiMathM201Professor1982MohanCSCC101Professor1980LakshmiMathM201Professor1982SreeniMathM203Associate1990TanujaCSCC101Instructor2001GaneshCSCC105Associate1995(Assume that no faculty member within a single department has same name. Each faculty member has only one office identified in office). 3NF refers to third normal form and BCNF refers to Boyee-Codd Normal FormThen Faculty is(A) Not in 3NF, in BCNF(B) In 3NF, not in BCNF(C) In 3NF, in BCNF(D) Not in 3NF, not in BCNF |
| Answer» None | |
| 29. |
A counting semaphore was initialized to 7. Then 20 P (wait) operations and x V (signal) operations were completed on this semaphore. If the final value of semaphore is 5, then the value x will be(A) 0(B) 13(C) 18(D) 5 |
| Answer» | |