S1: If the load factor of a hash table is less than 1, then there is no collision.
S2 : In a breadth first search of an undirected graph there exist no cross edges but there may be back edge.
Which of the above statements is/are correct?
Question 2
Consider the following grammar:
S→S×E | E
E→F + E | F
F→id
Which of the following is true?
Question 3
Consider the following statements with respect to application layer: S1 : Datagram uses PDU (Protocol data unit).
S2: There is a fixed limit on the maximum size of data that it can pass on the TCP layer. Which of the following options is correct?
Question 4
Consider a 16-bit hypothetical Processor which supports 8-bit opcode and 8-bit address field formatted instruction. Instruction is stored in the memory with a starting address of 742 in decimal. During its execution, the target will be transferred to the memory location (702)10. When the opcode is designated with PC-Relative JUMP instruction, what is the relative value in decimal____________.
Question 5
Consider the following C code:
int getNextGap(int gap)
The array A = {9, 4, –1, 3, 5, 7, 99, –33, 104} is passed to the above function mystery, with n equal to the number of integers in A. The final contents of the array after the function has been executed is
Question 6
Consider the following schedule due to three transactions (indicated by the subscript) using read and write on data item a, b, c and d.
Which of the following is correct for above schedule?
Question 7
Anu implements a function f(A,B,C,D) (1,2,3,4,7,8,9,10,12,13,15) using 4X1 MUX and required logic gates and taking A,B as select lines. Suppose she implements this with only basic logic gates. Find the minimum number of total logic gates required by Anu to implement this function on a MUX.
Question 8Multiple Correct Options
The height of a rooted tree is the maximum height of any leaf. The length of the unique path from a leaf of the tree to the root is, by definition, the height of that leaf. A rooted tree in which each non-leaf vertex has at most two children is called a binary tree. If each non-leaf vertex has exactly two children, the tree is called a full binary tree.
Consider the following statements. Which of the following is true ? . [Multiple Select Question]
(1,2,3,4,7,8,9,10,12,13,15) using 4X1 MUX and required logic gates and taking A,B as select lines. Suppose she implements this with only basic logic gates. Find the minimum number of total logic gates required by Anu to implement this function on a MUX.
