CS 202, Spring 2012
Homework Assignment 2
Due: 18:00, April 2, 2012
In this homework assignment, you are supposed to implement a C+ program for a movie database by
using binary search trees.
In this movie database, for each movie, you will have an entry i
CS 202 Fundamental Structures of Computer Science II
Assignment 2 Trees
Due Date: 31 October 2013 (Friday)
Q1) [10 pts]
Give the prefix, infix, and postfix expressions obtained by preorder, inorder, and postorder traversals,
respectively, for the expressi
CS 202 Fundamental Structures of Computer Science II
Assignment 3 Tables and Priority Queues
Due Date: 24 November 2013 (Monday)
Q1) [10 pts]
Suppose we wish to create a binary heap containing the keys
F S C S T W O R O C K S. (All comparisons use alphabe
CS 202 Fundamental Structures of Computer Science II
Assignment 1 Algorithm Efficiency and Sorting
Due Date: 15 October 2014 (Wednesday)
Question-1 (30 points)
Trace the following sorting algorithms to so
CS 202 Fundamental Structures of Computer Science II
Assignment 4 Advanced Implementations of Tables
Due Date: 11 December 2014 (Thursday)
Q1) [30 pts]
Starting with an empty balanced-search tree, insert the following keys into the tree in the given order
CS 202 Fundamental Structures of Computer Science II
Assignment 1 Algorithm Efficiency and Sorting
Assigned on: 22 February 2017 (Wednesday)
Due Date: 8 March 2017 (Wednesday)
Question-1: Tracing (30 points)
Trace the following sorting algorithms to sort
CS202
Section 1
Quiz No. 5: Heap Construction by One by One Addition & Heap Sort
November 6, 2015
Solutions
Q-1) Construct a (binary) max-heap by inserting the following numbers one by one
5, 22, 8, 12, 47, 16, 93
A-1)
Trickle
Adding 5
Adding 8
Adding 22
CS202
Section 1
Quiz No. 6: AVL Trees, 2-3 Trees
November 27, 2015
Solutions
Q-1) For the given AVL Tree apply these:
a) Add 13
b) Delete 8
A-1)
a) Adding 13
13
Initial tree
1
b) Deleting 8
Q-2) Add 17, 40, 41 to the given 2-3 tree.
A-2) First we insert e
CS 202 Fundamental Structures of Computer Science II
Assignment 5
Date Assigned: December 11, 2015
Due Date: December 25, 2015 - 23:55 (sharp)
Question-1 (20 points)
For the graph given below, give the sequence of vertices when they are traversed starting
CS 202, Spring 2012
Homework Assignment 4
Due: 23:59, April 30, 2012
In this homework assignment, you are supposed to implement a binary search tree (BST) and a 2-3
tree with simple insert and retrieve methods. Your program will first read the contents fr
CS 202 Fundamental Structures of Computer Sciences II
Assignment 3 Heaps
Due Date: 16 April, 2012
In this programming assignment, you will estimate minimum number of computers needed in a
web hosting firm so that
CS 202 Fundamental Structures of Computer Sciences II
Assignment 1 Algorithm Analysis and Sorting
Due Date: March 12, 2012 (Monday), 18:00
In this homework, you are given a software program that is available
CS 202 Fundamental Structures of Computer Science II
Assignment 5 Graphs
Due Date: 26 December 2014 (Friday)
Question-1 (20 points)
For the graph given below, give the sequence of vertices when they ar