Related InterviewSolutions

• 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.
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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