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 m
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, a
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 key
CS 202 Fundamental Structures of Computer Science II
Assignment 1 Algorithm Efficiency and Sorting
Due Date: 15 October 2014 (Wednesday)
Question-1 (30 points)
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, ins
CS 202 Fundamental Structures of Computer Science II
Assignment 1 Algorithm Efficiency and Sorting
Assigned on: 20 June 2017 (Tuesday)
Due Date: 30 June 2017 (Friday) by 23:55
Question-1: Tracing (30
CS 202, Spring 2017
Homework 3 Balanced Search Trees
Assigned: April 3, 2017
Due: 23:59, April 21, 2017
Question 1 (30 points)
Assume that we have the following balanced-searched tree implementations:
CS 202, Spring 2017
Homework #2 Binary Search Trees
Due Date: March 26, 2017
Important Notes
Please do not start the assignment before reading these notes.
Before 23:59 on the due date, upload your s
CS 202 Fundamental Structures of Computer Science II
Assignment 4 Hash Tables, Graphs
Assigned on: 27 April 2017 (Thursday)
Due Date: 14 May 2017 (Sunday) 23:59
Question-1 (18 Points)
Insert the keys
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
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, 1
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 1
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 th
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 retriev
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
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
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 be