A huge thanks to Subarna Jung Shahi who sent me this question paper. Because Lok Sewa Aayog does not allow you to take question paper, he composed the following paper based on how much he remembered. The following practical question paper will give you some idea of the type of questions asked and the difficulty [...]
ICT Trends eCourse is a free online Computer Operator Exam preparation sessions. ICT Trends is running these sessions so that anybody who plans to compete in 2012 Computer Operator Exam to be conducted by Lok Sewa Ayog (PSC) could get better support and assist in their preparation efforts. Public Service Commission (Lok Sewa Ayog) prescribes [...]
Old Question Papers of Computer Officer Subjective Exams for Public Service Commission (Lok Sewa Aayog)
Year: 2063 Full Marks: 50 Time 1 hr 30 mins Answer the following questions 1. Write the recursive version of the binary search algorithm  2. What is normalization in DBMS? Describe the different normal forms.  3. Give the advantages of distributed operating systems over centralized one and single user PC. What are the [...]
Depth traversal of a tree systematically visits all of its child nodes before visiting any siblings. In case of binary trees, we perform pre-order, in-order or post-order traversal as depth first traversal techniques. Talking about general trees, follow the procedure below to traverse the nodes in depth first fashion.
Public Service Commission (Lok Sewa Ayog) has already published the result of written examination for Computer Operator posts. I hope you’re already working hard to prepare yourself for practical and interview tests. The date and time for practical exams as well as interview sessions are already announced. I wished to publish lot more articles with [...]
This was the first question in Computer Officer Examination in 2010 conducted by Public Service Commission (Lok Sewa Aayog). This question is from the section ‘Data Structures and Algorithms’. The question carries 10 marks. Answer Breadth-first search (BFS) and depth-first search (DFS) are the two algorithms used for traversing and searching a node in a [...]