What are you looking for?
Send in My Email
Categories
- Algorithms and Data Structures (9)
- Arrays Text DSA (1)
- List Data Structure Text DSA (2)
- Queues Text DSA (1)
- Stacks Text DSA (1)
- Trees (1)
- Blogging and Bloggers (65)
- Blogger (11)
- Create Blogs (12)
- Domain Names (1)
- How To (27)
- ICT Trends (2)
- Internet (1)
- Monetize Blogs (10)
- Promote Blogs (22)
- SEO (24)
- Social Netowrks (2)
- Digg (2)
- Tips and Tricks (45)
- WordPress (14)
- C++ (10)
- Examples (5)
- Source Codes (4)
- Computer Operator Exam Preparation (15)
- Downloads (16)
- From the desk of Admin (8)
- IT and Law (3)
- MCQ Bank (8)
- Bank PO (1)
- Microsoft Word (27)
- MS Word 2003 (20)
- MS Word 2010 (7)
- MS Access (1)
- MS Excel (3)
- Off Topics (28)
- Online MCQ Test (9)
- Practical Questions (3)
- Preparation (9)
- Question Papers (8)
- Questions and Answers (11)
- Computer Officer (5)
- References (7)
- System Analysis and Design (2)
- Trainings and Tutorials (8)
- MS Excel (1)
- Tutorials & How Tos (13)
- Algorithms and Data Structures (9)
Friends from Facebook
ICT Trends on FacebookTwitter Friends
Sponsors
UserOnline
Users: 3 Guests, 2 Bots
Tag Archives: Graphs
Draw a graph and illustrate how depth-first search and breadth-first search differ
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 graph. They can also be used to find out whether a node is reachable from given node or not.
Posted in Algorithms and Data Structures, Computer Officer, Question Papers, Questions and Answers
Tagged BFS, Breadth-First Search, computer officer exam, Data Structures and Algorithms, Depth-First Search, DFS, Graphs, Lok Sewa Aayog, Public Service Commission, Solved Question of Computer Officer
2 Comments

