COLLEGE OF ENGINEERING ROORKEE

B. Tech VI Semester
2nd Test Series Session (2014-15)
Data Structures Using C++(TCS-607)
Branch: ET,AEI,EN
Time: 1Hr

Section: J, K
MM: 15

Q1- Describe Graph Traversal methods with proper example.

Q2- Consider the network given below. Find the minimum spanning tree using
krushkals algorithm?

Q3- a) Convert the following infix expression to postfix using stack:

1) (A+(B*C-(D/E^F)*G))
2) (A-B)*X+Y/(F-C*E)+D
b) Convert the following infix to prefix expression using stack:
1) (A+(B*C-(D/E^F)*G))
2) ((A+B)/D)^((E-F)*G)
Q4-