Sunday, 16 October 2016

Computer Programmer - Engineering Colleges - Solved Paper 18.04.2015 - Part 4

61.       The principle of locality of reference is applied in the use of:
(A) Virtual memory      (B) Random access memory
(C) Cache memory      (D) Optical memory
Answer: C
62.       Parser is also known as:
(A) Lexical analyzer    (B) Code optimizer
(C) Syntax analyzer    (D) Linear analyzer
Answer: C
63.       The operation in relational algebra for viewing a set of tuples is:
(A) Select          (B) Project
(C) Union          (D) Join
Answer: A
64.       The average case complexity of linear search algorithm is:
(A) O(n)                         (B) O(log n)
(C) O(n2)            (D) O(n log n)
Answer: A
65.       Data Encryption standard is a:
(A) Stream cipher                    (B) Block cipher
(C) Substitution cipher           (D) None of these
Answer: B
66.       Data about data is:
(A) Database    (B) Mega-data
(C) Metadata     (D) Schema
Answer: C
67.       No. of layers in OSI reference model:
(A) Four             (B) Five
(C) Six               (D) Seven
Answer: D
68.       Routers are components of .............. layer in OSI reference layer.
(A) Physical layer        (B) Network layer
(C) Transport layer      (D) Data link layer
Answer: B
69.       mov al, [bx]. Which addressing mode does this instruction use?
(A) Register indirect                            (B) Base index
(C) Base index plus displacement   (D) Register
Answer: A
70.    The number of attributes in a relation is called its:
(A) Cardinality (B) Size
(C) Schema      (D) Degree
Answer: D

71.    The operator used to concatenate two strings in ORACLE is:
(A) ||       (B) $
(C) #       (D) %
Answer: A
72.    A full-adder has a Cin = 0. What are the SUM and the Cout when A = 1 and B = 1?
(A) SUM = 0 Cout = O               (B) SUM = 0 Cout = 1
(C) SUM = 1 Cout = 0              (D) SUM= 1 Cout = 1
Answer: B
73.    For which inputs the output of an exclusive-NOR gate is 1?
(A) A=0, B=1     (B) A=1, B=1
(C) A=0, B=0     (D) None of these
Answer: X
74.    The depth of a complete binary tree is given by:
(A) Dn = n log10n          (B) Dn = n log2n+1
(C) Dn = log2n               (D) Dn = log2n+1
Answer: D
75.    Which of the following data structure is not linear data structure?
(A) Arrays                      (B) Linked lists
(C) Both of the above             (D) None of the above
Answer: D
76.    A binary tree whose every node has either zero or two children is called:
(A) Complete binary tree        (B) Binary search tree
(C) Extended binary tree        (D) None of the above
Answer: D
77.    The WORST-CASE complexity of Bubble sort algorithm is:
(A) O(n)             (B) O(log n)
(C) O(n2)            (D) O(n log n)
Answer: C
78.    Which of the following is a web server?
(A) Apache       (B) IIS
(C) Tomcat        (D) All the above
Answer: D
79.    Grammar recognized by a FSM is:
(A) Only context free grammar
(B) Only context sensitive grammar
(C) Only regular grammar
(D) All of these
Answer: C
80.    For efficient searching compilers use .............. search tables.
(A) Linear search tables         (B) Binary search tables
(C) Hash tables                        (D) Binary search trees
Answer: C

Pages   2   3   4   5 


Post a Comment