GATE CSE 2014 SET-3
Q22.
Consider the basic block given below. a= b + c c =a + d d =b + c e =d - b a =e + b The minimum number of nodes and edges present in the DAG representation of the above basic block respectively areQ23.
The minimum number of arithmetic operations required to evaluate the polynomial P(x)=x^{5}+4x^{3}+6x+5 for a given value of x, using only one temporary variable is _____.Q24.
Let A be a square matrix size n x n. Consider the following pseudocode. What is the expected output? C = 100; for i = 1 to n do for j = 1 to n do { Temp = A[ i ] [ j ] + C ; A [ i ] [ j ] = A [ j ] [ i ] ; A [ j ] [ i ] = Temp - C ; } for i = 1 to n do for j = 1 to n do output (A[ i ] [ j ]);Q25.
Which one of the following statements is TRUE about every n x n matrix with only real eigenvalues?Q26.
If V1 and V2 are 4-dimensional subspaces of a 6-dimensional vector space V, then the smallest possible dimension of V1\capV2 is _______.Q27.
A system uses 3 page frames for storing process pages in main memory. It uses the Least Recently Used (LRU) page replacement policy. Assume that all the page frames are initially empty. What is the total number of page faults that will occur while processing the page reference string given below? 4, 7, 6, 1, 7, 6, 1, 2, 7, 2Q28.
Consider a paging hardware with a TLB. Assume that the entire page table and all the pages are in the physical memory. It takes 10 milliseconds to search the TLB and 80 milliseconds to access the physical memory. If the TLB hit ratio is 0.6, the effective memory access time (in milliseconds) is _________.Q29.
Consider the following rooted tree with the vertex labelled P as the root The order in which the nodes are visited during an in-order traversal of the tree is