CP 213

WEEK 10 LAB and TUTORIAL WORK

Programs: 2nd Year 2020/2021

1. With the aid of well diagrams, discuss and write short notes on graphs data structures
2. With at least three examples on each, discuss and write short notes on graph searching
algorithms. For each one write a clear algorithm.
3. With at least three examples to support your discussion, discuss on infix to postfix conversion.
4. Discuss at least three examples on postfix expression evaluation.
5. With the aid of well diagrams and a compiled C++ program, discuss how bubble sort algorithm is
working.

Regulations:

i. A group of four or five students.

ii. Discussion start this Monday 08/02/2021 and ends on Thursday 11/02/2021
iii. Report submission is on Friday 12/02/2021
iv. Everyone should attend Lab for implementation.
v. Lab attendance will support your report marks.

****** Nice 10th Week ********