computer officer exam

With the help of a numerical example explain the Depth First Traversal of a tree

by Suresh Khanal

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.

Write a program using C++ to create a payroll system of any organization. Use functions for updating, displaying and deleting the record of given payroll system

by Suresh Khanal

This question was asked in Computer Officer Examination 2010 conducted by Public Service Commission. The question carried 10 mark. Following is the program for this question. I’ve tried to make it simpler and included most essential components only. The program was created using C++ on Visual Studio 2005 with Service Pack 1 on Windows 7 [...]

Draw a graph and illustrate how depth-first search and breadth-first search differ

by Suresh Khanal

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 [...]