HSST Computer Science Model Questions and Answers – Part 6
Code: 188/2006
Exam: HSST Computer Science
HSST Computer Science Model Questions and Answers – Part 1
HSST Computer Science Model Questions and Answers – Part 2
PSC HSST Computer Science Model Questions and Answers – Part 3
PSC HSST Computer Science Model Questions and Answers – Part 4
PSC HSST Computer Science Model Questions and Answers – Part 5
1
Which one of the following regular expressions is NOT equivalent to the regular expression (a+b+c)*
Answer
C. ((ab)*+c*)*
2
The relation R defined on the set A={1,2,3,4} by {(1,1),(2,2),(3,3),(4,4)} is
Answer
D. All of the above
3
Suppose that P(x,y) means ‘x is parent of y’ and M(x) means ‘x is male’. If (v,w) equals M(v)Ù$x$yP(x,y) Ù P(x,v) Ù (y¹v) Ù P(y,w))
What is the meaning of expression F(v,w)?
What is the meaning of expression F(v,w)?
Answer
C. v is an uncle of w
4
Context Sensitive Grammar can be recognized by a
Answer
D. Linearly bounded memory machine
5
The Boolean function x’y’+xy+x’y
Answer
C. x’+y
6
A register organized to allow moving left or right operations is called a
Answer
A. Shift register
7
De Morgan’s theorem states that NAND gate is equivalent to a bubbled ............. gate.
Answer
D. OR
8
Standard TTL has a multiple emitter input transistor and a .............. output.
Answer
A. Totem-pole
9
What is the 2’s complement of –24 in a 16-bit microcomputer?
Answer
B. 1111 1111 1110 1000
10
Which of the following logic families has the highest noise immunity?
Answer
D. HTL
11
Overload function in C++
Answer
A. A group of function with the same name
12
A constructor is called whenever
Answer
B. An object is declared
13
The differences between constructor and destructor are
Answer
C. both (A) and (B)
14
A class having no name
Answer
B. can’t have a destructor
15
In C++ a function contained within a class is called
Answer
A. A member function
16
Which one of the following are essential features of an object oriented programming language?
(i) Abstraction and encapsulation
(ii) Strictly-typed ness
(iii) Type-safe property coupled with sub-type rule
(iv) Polymorphism in the presence of inheritance
(i) Abstraction and encapsulation
(ii) Strictly-typed ness
(iii) Type-safe property coupled with sub-type rule
(iv) Polymorphism in the presence of inheritance
Answer
B. (i) and (iv) only
17
Which of the following is not a logical database structure?
Answer
D. Chain
18
Which of the following SQL statement is not a Data Manipulation Language statement?
Answer
A. CREATE
19
The way an application views the data from the database that the application uses is a
Answer
C. Sub schema
20
Which of the following is not a characteristic of a relational database model?
Answer
D. Complex logical relationships
21
Which normal form is considered adequate for normal relational database design?
Answer
C. 3 NF
22
In write-locks-all distributed database concurrency control strategy
Answer
C. A transaction is said to have write-lock on item A whenever it has a write lock on any copy of A
23
Which of the following algorithms has running time q(n2) in the worst case but q(n logn) on average?
Answer
B. Quick sort
24
A binary search tree contains the numbers 1,2,3,4,5,6,7,8. When the tree is traversed in pre-order and the values in each node printed out, the sequence of values obtained is 5,3,1,2,4,6,8,7. If the tree is traversed in post-order, the sequence obtained would be
Answer
D. 2,1,4,3,7,8,6,5
25
In a depth-first traversal of a graph G with n vertices, k edges as marked as tree edges. The number of connected components in G is
Answer
B. n-k-1
Discussion
Ask a doubt or share a tip.
No comments yet — start the discussion.