PSC HSST Computer Science Model Questions and Answers: Here are the model questions and answers for HSST Computer Science PSC examination. These are the previous asked questions for the PSC HSST Computer Science Examination.
PSC HSST Computer Science Model Questions & Answers : Part 2
Question Paper Code: 144/2013 Exam: HSST Computer Science – SR FOR ST ONLY Date of Test: 29-08-2014 Alpha code: A
1
In a BST, the traversal type which would print the values in the nodes in sorted order is:
Answer
B. Inorder
2
The contrapositive of the statement, "You win the game if you know the rules but are not overconfident" is :
Answer
A. If you lose the game then you don't know the rules or you are overconfident.
3
If L1 be the class of languages accepted by finite state machines and L2 be the class of languages represented by regular expressions then,
Answer
D. L1 = L2
4
In which one of the following models can requirements be redefined
Answer
B. Prototyping Model
5
The method adopted by the memory management module of an OS of a computer to periodically collect all the free memory space to form contiguous block of free space is called
Answer
B. Garbage Collection
6
Among the following statements about binary trees which one is NOT true ?
Answer
C. Every binary tree has at least one node.
7
DRAM is used as main memory in a computer system because it
Answer
C. has higher speed
8
8251 is a
Answer
B. USART
9
A public key encryption system
Answer
A. Allows only the correct receiver to decode the data
10
Environment variables can be accessed by
Answer
D. All of these
11
DML is used for
Answer
B. Manipulation and processing of database
12
Suppose that N = {1, 2, 3, ...} be ordered by divisibility, which one of the following subset is totally ordered?
Answer
A. (2, 6, 24)
13
Which among the following searching technique takes O(1) time to locate a data ?
Answer
C. Hashing
14
The cause for poor response time is
Answer
D. Any of the above
15
Which among the following statements is false ?
Answer
B. Data elements in the database can be modified by changing the data dictionary
16
The infix expression for the postfix expression x 12 + z 17 y + 42 * / + is :-
Answer
D. x + 12 + z / ((17 + y) * 42)
17
The basic types of programmable arrays are made of ....................
Answer
B. AND gates and OR gates
18
A COCOMO model is
Answer
B. Constructive Cost Estimation Model
19
The interval between the time of submission and completion of a job is called as ..................
Answer
A. Turnaround time
20
An assembler is
Answer
C. machine dependent
21
The expansion of nested macro calls follows ............... rule
Answer
B. LIFO
22
Von Neumann architecture is
Answer
A. SISD
23
The device that is used to forward data packets from one network to another is called a .....................
Answer
C. Switch
24
Which among the following is the most general phrase structured grammar ?
Answer
A. Context – Sensitive
25
When the following instructions have been executed, what will be the contents of register AL ? MOV BL, 8C MOV AL, 7E ADD AL, BL
51. The ……………….. sort relatively passes through a list to exchange the first element with any element less than it and then repeats with a new first element
(A) selection sort (B) quick sort
(C) insertion sort (D) heap sort
Answer: B
The correct answer is Selection Sort. i.e, Option A
R
Renetha J B
Selection sort replaces ith element with ith smallest element (not any element smaller than it)
P
Pooja
85. Quick sort algorithm belongs to the ………………… design technique.
(A) Backtracking (B) Dynamic programming
(C) Greedy (D) Divide and Conquer
Answer: C
It is D) Divide and Conquer 🙂
R
Remya
PLEASE give me the logic of qn no56..
P
PRANAV
23. The device that is used to forward data packets from one network to another is called a …………………
(A) Bridge (B) Hub
(C) Switch (D) Gateway
Answer: C
Correct answer is D(Gateway/Router)
Pooja
51. The ……………….. sort relatively passes through a list to exchange the first element with any element less than it and then repeats with a new first element
(A) selection sort (B) quick sort
(C) insertion sort (D) heap sort
Answer: B
The correct answer is Selection Sort. i.e, Option A
Renetha J B
Selection sort replaces ith element with ith smallest element (not any element smaller than it)
Pooja
85. Quick sort algorithm belongs to the ………………… design technique.
(A) Backtracking (B) Dynamic programming
(C) Greedy (D) Divide and Conquer
Answer: C
It is D) Divide and Conquer 🙂
Remya
PLEASE give me the logic of qn no56..
PRANAV
23. The device that is used to forward data packets from one network to another is called a …………………
(A) Bridge (B) Hub
(C) Switch (D) Gateway
Answer: C
Correct answer is D(Gateway/Router)