Solved MCQ Set 24 – Fundamentals of Computers (Mixed)

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: , , ,

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

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: , , , , , , ,

With your own example explain breadth first traversal technique, and analyze its complexity

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: , , , ,

Define array. Write a program to store 10 salesmen’s amount in an array and find out total sale & best sales amount.

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: ,

Download Insertion Sort C++ Source Code

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: , , ,

Insertion Sort Video Tutorial

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: , , ,

Delete the node with value 12 in following binary search tree

  ...

Read More

Tagged As: , , ,

How can you delete a node in Binary Search Tree?

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: , ,

Given Pre-Order Traversal and Post-Order Traversal of a binary tree draw the tree

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: , , ,

Download Linked Lists Basics – C++ Lecture Notes

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: , , , , ,

  • "An expert is a man who has made all the mistakes which can be made, in a narrow field." - Niels Bohr (1885-1962)
  • "Good teachers are those who know how little they know. Bad teachers are those who think they know more than they don't know." -- R. Verdi
  • "The main part of intellectual education is not the acquisition of facts but learning how to make facts live." -- Oliver Wendell Holmes