Savitribai Phule Pune University

S.Y.B.Sc. Computer Science Practical Examination

Semester -II
Lab Course 243: Practical course on CS 241 and CS 242

Duration : 3 Hours Maximum Marks :35

Subject- Data Structures and Algorithms – II

Q-1) Implement a Binary Search Tree(BST) library with operations-inorder,preorder and postorder.
Write a menu driven program that performs the above operations. [15 marks]

Q-2) Write a program to sort n randomly generated elements using Heapsort method.
[15 marks]

OR
Q-2) Write a C program for the implementation of Prim’s Minimum spanning tree algorithm.
[15 Marks]

Q-3) Viva [5 Marks]

Savitribai Phule Pune University

S.Y.B.Sc. Computer Science Practical Examination
Semester I I
Lab Course 243: Practical course on CS 241 and CS 242

Duration : 3 Hours Maximum Marks :35

Subject- Data Structures and Algorithms – II

Q-1) Write a C program that accepts the vertices and edges of a graph.Create adjacency list
[15 Marks]

Q-2)Write a C Program which uses binary search tree and count total nodes and total leaf nodes in the
tree.
[15 Marks]

OR

Q-2) Write a C program for the implementation of topological sorting. [15 Marks]

Q-3) Viva [5 Marks]

 Savitribai Phule Pune University
S.Y.B.Sc. Computer Science Practical Examination
Semester I I
Lab Course 243: Practical course on CS 241 and CS 242

Duration : 3 Hours Maximum Marks :35

Subject- Data Structures and Algorithms – II

Q-1)Write a C program that accepts the vertices and edges of a graph and store it an adjacency matrix.
Implement function to traverse the graph using Depth First Search(DFS) traversal. [15 Marks]

Q-2) Write a C Program to sort Randomly generated elements using Heapsort method [15 Marks]

OR
Q-2) Write a C Program for the implementation of Kruskal’s Minimun Spanning tree algorithm.
[15 Marks]

Q-3) Viva [5 Marks]

Savitribai Phule Pune University

S.Y.B.Sc. Computer Science Practical Examination
Semester I I
Lab Course 243: Practical course on CS 241 and CS 242

Duration : 3 Hours Maximum Marks :35

Subject- Data Structures and Algorithms – II

Q-1) Write a C program to calculate Indegree and Outdegree of a vertices. [15 Marks]

Q-2) Write a C Program to count total nodes and leaf nodes in a Binary Search Tree(BST)
[15 Marks]

OR
Q-2) Write a C program for the implementation of static hash table with linear probing. [15 Marks]
Q-3) Viva
 Savitribai Phule Pune University
S.Y.B.Sc. Computer Science Practical Examination
Semester I I
Lab Course 243: Practical course on CS 241 and CS 242

Duration : 3 Hours Maximum Marks :35

Subject- Data Structures and Algorithms – II

Q-1)Write a C program that accepts the vertices and edges of a graph and store it an adjacency matrix.
Implement function to traverse the graph using Depth First Search(DFS) traversal. [15 Marks]

Q-2) Write a C Program to sort Randomly generated elements using Heapsort method [15 Marks]

OR
Q-2) Write a C Program for the implementation of Kruskal’s Minimun Spanning tree algorithm.
[15 Marks]

Q-3) Viva [5 Marks]

Savitribai Phule Pune University

S.Y.B.Sc. Computer Science Practical Examination
Semester I I
Lab Course 243: Practical course on CS 241 and CS 242

Duration : 3 Hours Maximum Marks :35

Subject- Data Structures and Algorithms – II

Q-1) Write a C program to implement Binary Serach Tree(BST)to perform following operations on
BST-Inorder,Preorder and Postorder. [15 Marks]

Q-2) Write a C Program to count total nodes and leaf nodes in a Binary Search Tree(BST)
[15 Marks]

OR
Q-2) Write a C program for the implementation of static hash table with linear probing. [15 Marks]

Q-3) Viva [5 Marks]

 Savitribai Phule Pune University
S.Y.B.Sc. Computer Science Practical Examination
Semester I I
Lab Course 243: Practical course on CS 241 and CS 242

Duration : 3 Hours Maximum Marks :35

Subject- Data Structures and Algorithms – II

Q-1)Write a C program for Level order traversal of binary search tree using queue. [15Marks]

Q-2) Write a C Program to sort Randomly generated elements using Heapsort method [15 Marks]

OR
Q-2) Write a C Program for the implementation of Kruskal’s Minimun Spanning tree algorithm.
[15 Marks]

Q-3) Viva [5Marks]

Savitribai Phule Pune University

S.Y.B.Sc. Computer Science Practical Examination
Semester I I
Lab Course 243: Practical course on CS 241 and CS 242

Duration : 3 Hours Maximum Marks :35

Subject- Data Structures and Algorithms – II

Q-1) Write a C program calculate Indegree and Outdegree of a vertices. [15 Marks]

Q-2) Write a C Program to count total nodes and leaf nodes in a Binary Search Tree(BST)
[15 Marks]

OR
Q-2) Write a C program for the implementation of static hash table with linear probing. [15 Marks]

Q-3) Viva [5 Marks]

 Savitribai Phule Pune University
S.Y.B.Sc. Computer Science Practical Examination
Semester I I
Lab Course 243: Practical course on CS 241 and CS 242

Duration : 3 Hours Maximum Marks :35

Subject- Data Structures and Algorithms – II

Q-1)Write a C program that accepts the vertices and edges of a graph and store it an adjacency matrix.
Implement function to traverse the graph using Depth First Search(DFS) traversal. [15 Marks]

Q-2) Write a C Program to sort Randomly generated elements using Heapsort method [15 Marks]

OR
Q-2) Write a C Program for the implementation of Kruskal’s Minimun Spanning tree algorithm.
[15 Marks]

Q-3) Viva [5Marks]

Savitribai Phule Pune University

S.Y.B.Sc. Computer Science Practical Examination
Semester I I
Lab Course 243: Practical course on CS 241 and CS 242

Duration : 3 Hours Maximum Marks :35

Subject- Data Structures and Algorithms – II

Q-1) Write a C program to calculate Indegree and Outdegree of a vertices.

Q-2) Write a C Program to count total nodes and leaf nodes in a Binary Search Tree(BST)
[15 Marks]

OR
Q-2) Write a C program for the implementation of static hash table with linear probing. [15 Marks]

Q-3) Viva [5 Marks]