1. In SQL, which of the following is not a DDL command
A.RENAME
B. GRANT
C. REVOKE
D. UPDATE
2. A page replacement policy is not necessary for
A. Fully associative caches
B. Set associative caches
C. Directly mapped caches
D. Write- through caches
3. Start and Stop bits do not contain any ‘information’ but are used in serial communication for the following
A. Error detection
B. Synchronization
C. Error Correction
D. Slowing down the communication
4. Which of the following features cannot be captured by CFGs
A. Syntax of if -then-else statement
B. Variable names of arbitrary length
C. Whether a variable has been declared before its use
D. Syntax of recursive procedures
5. The number of select input lines in a 8- to -1 multiplexer is
A.1
B.8
C.256
D. None of these
B. Intermediate Code
C. Lexical Analyzer
D. Symbol Table
7. In a heap with n elements with the highest element at the root, the 7th highest element can be found in time
A. O (nlog n)
B. O(log n)
C. O (n)
D. O(1)
8. Which one of the following permutations can obtained in the output ( in the same order) using a stack assuming that the input is the sequence 1,2,3,4,5, in that order?
A. 3,4,5,1,2,
B. 3,4,5,2,1
C. 1,5,2,3,4
D.5,4,3,1,2
A.RENAME
B. GRANT
C. REVOKE
D. UPDATE
2. A page replacement policy is not necessary for
A. Fully associative caches
B. Set associative caches
C. Directly mapped caches
D. Write- through caches
3. Start and Stop bits do not contain any ‘information’ but are used in serial communication for the following
A. Error detection
B. Synchronization
C. Error Correction
D. Slowing down the communication
A. Syntax of if -then-else statement
B. Variable names of arbitrary length
C. Whether a variable has been declared before its use
D. Syntax of recursive procedures
5. The number of select input lines in a 8- to -1 multiplexer is
A.1
B.8
C.256
D. None of these
6. Part of a compiler that keeps record of names of variable and their associated attributes /values is known as
A. ParserB. Intermediate Code
C. Lexical Analyzer
D. Symbol Table
7. In a heap with n elements with the highest element at the root, the 7th highest element can be found in time
A. O (nlog n)
B. O(log n)
C. O (n)
D. O(1)
8. Which one of the following permutations can obtained in the output ( in the same order) using a stack assuming that the input is the sequence 1,2,3,4,5, in that order?
A. 3,4,5,1,2,
B. 3,4,5,2,1
C. 1,5,2,3,4
D.5,4,3,1,2
Comments
Post a Comment