PSC Mock Test LGS Quiz

PSC HSST Computer Science Model Questions & Answers : Part 2

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

Part 1 : PSC HSST Computer Science Model Questions & Answers

Part 3: PSC HSST Computer Science Model Questions & Answers

HSST Computer Science Model Questions and Answers – Part 4

PSC HSST Computer Science Model Questions and Answers – Part 5

PSC HSST Computer Science Model Questions and Answers – Part 6

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:
(A) Preorder (B) Inorder
(C) Postorder (D) None of the above
Answer: B

2. The contrapositive of the statement, “You win the game if you know the rules but are not overconfident” is :
(A) If you lose the game then you don’t know the rules or you are overconfident.
(B) If you know the rules and are overconfident then you win the game.
(C) A necessary condition that you know the rules or you are not overconfident is that you win the game.
(D) If you dont’t know the rules or are overconfident you lose the game.
Answer: A

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,
(A) L1 ∩ L2 = Φ (B) L2 ⊆ L1
(C) L1 ⊂ L2 (D) L1 = L2
Answer: D

4. In which one of the following models can requirements be redefined
(A) Spiral Model (B) Prototyping Model
(C) Waterfall Model (D) Evolutionary Model
Answer: B

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
(A) Dynamic Memory Allocation (B) Garbage Collection
(C) Concatenation (D) Collision
Answer: B

6. Among the following statements about binary trees which one is NOT true ?
(A) Every non-empty tree has exactly one root node.
(B) Every non-root node has exactly one parent.
(C) Every binary tree has at least one node.
(D) Every node has at most two children.
Answer: C

7. DRAM is used as main memory in a computer system because it
(A) needs refreshing circuitry (B) consumes less power
(C) has higher speed (D) has lower cell density
Answer: C

8. 8251 is a
(C) Programmable interval timer/counter
(D) Programmable Interrupt Controller
Answer: B

9. A public key encryption system
(A) Allows only the correct receiver to decode the data
(B) Does not encode the data before transmitting it
(C) Allows only the correct sender to decode the data
(D) Allows only one to decode the transmission
Answer: A

10. Environment variables can be accessed by
(A) System programs (B) C programs
(C) Shell scripts (D) All of these
Answer: D

11. DML is used for
(A) Addition of new structures in the database system
(B) Manipulation and processing of database
(C) Definition of physical structure of database system
(D) Description of logical structure of database
Answer: B

12. Suppose that N = {1, 2, 3, …} be ordered by divisibility, which one of the following subset is totally ordered?
(A) (2, 6, 24) (B) (4, 15, 30)
(C) (3,5,15) (D) (2,9,16)
Answer: A

13. Which among the following searching technique takes O(1) time to locate a data ?
(A) Binary Search (B) Tree Search
(C) Hashing (D) Linear Search
Answer: C

14. The cause for poor response time is
(A) High I/O rates (B) High paging rates
(C) Process busy (D) Any of the above
Answer: D

15. Which among the following statements is false ?
(A) The data dictionary contains the name and description of each data element
(B) Data elements in the database can be modified by changing the data dictionary
(C) The data dictionary is a tool used exclusively by the database administrator
(D) Database administrator normally maintains the data dictionary
Answer: B

16. The infix expression for the postfix expression x 12 + z 17 y + 42 * / + is :-
(A) x + 12 + z / 17 + y * 42
(B) x + 12 + z / (17 + y) * 42
(C) (x + 12 + z) / (17 + y * 42)
(D) x + 12 + z / ((17 + y) * 42)
Answer: D

17. The basic types of programmable arrays are made of ………………..
(A) AND gates (B) AND gates and OR gates
(C) OR gates (D) NAND and NOR gates
Answer: B

18. A COCOMO model is
(A) Complete Cost Estimation Model
(B) Constructive Cost Estimation Model
(C) Common Cost Estimation Model
(D) Comprehensive Cost Estimation Model
Answer: B

19. The interval between the time of submission and completion of a job is called as ………………
(A) Turnaround time (B) Waiting time
(C) Response time (D) Throughput
Answer: A

20. An assembler is
(A) data dependent (B) programming language dependent
(C) machine dependent (D) syntax dependent
Answer: C

21. The expansion of nested macro calls follows …………… rule
(C) FIFO (D) priority
Answer: B

22. Von Neumann architecture is
Answer: A

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

24. Which among the following is the most general phrase structured grammar ?
(A) Context – Sensitive (B) Context – Free
(C) Regular (D) None of the above
Answer: A

25. When the following instructions have been executed, what will be the contents of register AL ?
(A) 0A and carry flag is reset
(B) 0A and carry flag is set
(C) 6A and carry flag is reset
(D) 6A and carry flag is set
Answer: B

You may also like...

Leave a Reply

Your email address will not be published. Required fields are marked *