Kerala PSC Previous Years Question Paper & Answer

Title : RANGE FOREST OFFICER
Question Code : A

Page:1


Below are the scanned copy of Kerala Public Service Commission (KPSC) Question Paper with answer keys of Exam Name 'RANGE FOREST OFFICER ' And exam conducted in the year 21. And Question paper code was '049/21'. Medium of question paper was in Malayalam or English . Booklet Alphacode was 'A'. Answer keys are given at the bottom, but we suggest you to try answering the questions yourself and compare the key along wih to check your performance. Because we would like you to do and practice by yourself.

page: 1 out of 3
Excerpt of Question Code: 049/21

550

+ वु 049/21

Total Number of Questions : 32

Time : 3.00 Hours Max. Marks : 200
1. Write a pseudocode for interchanging the values of two numeric variables a and b without using any

auxiliary (temporary) variables, (2 Marks)

2. Show the result obtained in doing preorder traversal of the following binary tree : (2 Marks)

©

9 0
91
0 (5)
(५) (४) (८)

3. Whatis meant by primary key of a database table ? Is name of person, a good attribute to be a primary

key ? (2 Marks)

4. What is the octal representation of the hexadecimal number (3೯42, ? (2 Marks)

5. Is the class of regular languages closed under complementation ? Justify your answer. (2 Marks)

6. Briefly describe any two advantages of a linear linked list over a single dimensional array. (4 Marks)

7, Briefly explain what is context switching in an Operating System. (4 Marks)

8. Explain the difference between response time and turn around time in an Operating System. (4 Marks)
9. Briefly explain how programmers benefit from functional abstraction provided by high level

Programming languages like C. (4 Marks)

10. List any four features of an algorithm. (4 Marks)

11. LetSbe the source code of a correct program for solving a computational problem P and |, and 1 be two
instances (input values) of P Compare the Process of obtaining the output values 0 1 and 0) respectively
for the input values |, and ‏برا‎ when we use the following language translators for 5: (5 Marks)
1. Compiler
2. Interpreter

12. Show the postfix expression equivalent to the infix expression A + (8 - CVE * ‏ع‎ - 6. Use a to
represent the power operator. (5 Marks)

13. Show the worst-case asymptotic time complexities of the following sorting algorithms.
Bubble sort, Selection Sort, Merge sort, Quick sort and Heap sort. (5 Marks)

14. Suppose a processor has 32-bit virtual address, 26-bit physical address and 1 Kb Pages. Show how
many bits are required for the virtual and physical page numbers ? (5 Marks)

20.

Similar Question Papers

Ask Question

(Press Ctrl+g to toggle between English and the chosen language)


Questions & Answers

RANGE FOREST OFFICER : Video