Multiple Choice Questions are asked in most of the competitive job exams. We are presenting MCQs and answers from Fundamentals of Computers and in this series there are more than 600 solved questions. I hope the compilation will be helpful to anybody prepar...
Read More
Tagged As: fundamentals of computers, MCQ Bank, MCQ sets, Objective Questions
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 ...
Read More
Tagged As: Algorithms and Data Structures, BFS, computer officer exam, Depth-First Search, Lok Sewa Aayog, Public Service Commission, Tree, Tree Data Structure
Breadth First Search (BFS) Breadth-first-search is a graph search algorithm that begins at the root node (or arbitrarily selected vertex in graph) and explores all the neighboring nodes. Then for each of those nearest nodes it explores their unexplored neighbo...
Read More
Tagged As: Algorithm, BFS, Breadth-First Search, Complexity of BFS, example
I’ve got some questions from C++ and other topics and due to the time constraints I am unable to answer all of them in time. But I will always try to solve as many as possible and keep publishing in this blog. This post is in response to Kigozi Ronald from M...
Read More
Tagged As: Array, C++ Program
Are you looking to download the C++ source code of Insertion Sort? Here is the code you can copy and paste on your IDE to run, learn and understand it. I tried to make it as simple as possible to read the code and to grasp the output. You can find the screensh...
Read More
Tagged As: c++ source code, Data Structures and Algorithms, example, insertion sort
I wish to share a great video tutorial for insertion sort and this post is about that. Hey friends! Computer officer examination date is scheduled and I guess you have intensified your preparation. My previous post Development of Computers–Funny Predictions ...
Read More
Tagged As: computer officer exam preparation, Data Structures, insertion sort, video tutorial
Let x be the node that has to be deleted from a binary search tree T. So, to delete the node x, we can have three cases: x has no children x has one child x has two children
...
Read More
Tagged As: Algorithms and Data Structures, Binary Search Tree, Delete Node in BSD
This is a sample question in Syllabus of Computer Officer Exam of Public Service Commission (Lok Sewa Ayog). The pre-order and post-order traversal of a binary tree is given as below, obtain the binary tree that resemble with traversal. Preorder : u1 &nbs...
Read More
Tagged As: Binary Tree, post-order traversal, pre-order traversal, tree construction
After going through Pointers and Memory eBook on Stanford CS Education Library, I feel it worth going through for you all. The eBook is concise; covering everything is bit greater speed but I hope it is sufficient for you to get started and sharpen your unders...
Read More
Tagged As: C++ Tutorial, Class Notes, Data Structures and Algorithms, Download eBook, Lecture Notes, Linked Lists