PSC Computer Programmer Engineering Colleges Model Questions and Answers

Last Updated On: 30/04/2018

51. To prevent ………….., we can timestamp the packets.
(A) Error (B) Jitter
(C) Loss (D) None of these
Answer: B

52. The complexity of Binary search algorithm is:
(A) O(n) (B) O(log n)
(C) O(n/2) (D) O(n log n)
Answer: B

53. If every node u in G is adjacent to every other node v in G, a graph is said to be:
(A) Isolated (B) Complete
(C) Finite (D) Strongly connected
Answer: B

54. To extend the connectivity of the processor bus we use:
(A) PCI bus (B) SCSI bus
(C) Controllers (D) Multiple bus
Answer: A

55. If 110011002 is divided by 1102 the quotient is:
(A) 11011 (B) 1111
(C) 100010 (D) 100001
Answer: C

56. Which data structure allows deleting data elements from front and inserting at rear?
(A) Stacks (B) Queues
(C) Deques (D) Binary search tree
Answer: B

57. Which of the following data structure is linear type?
(A) Strings (B) Lists
(C) Queues (D) All of above
Answer: D

58. Speed of a microprocessor is determined by:
(A) Address bus width (B) Data bus width
(C) Clock (D) None of the above
Answer: C

59. How many gates would be required to implement the following Boolean expression after simplification?
(A) 1 (B) 2
(C) 3 (D) 4
Answer: B

60. With a 200 kHz clock frequency, 16 bits can be serially entered into a shift register in ………….. time.
(A) 4 μs (B) 80 μs
(C) 80 ms (D) 8 ms
Answer: B

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

Sharing is caring
Notify of
Inline Feedbacks
View all comments
Would love your thoughts, please comment.x