 |
Assignment No. 02 (Graded)
SEMESTER Spring 2015 CS301- Data Structures |
Total Marks: 20
Due Date:09-06-2015
|
|||||||||||||||||||||||||||||||||||||||||
|
Instructions
Please read the
following instructions carefully before solving & submitting assignment:
It should be clear that your assignment will not get any
credit (zero marks) if:
o
The
assignment is submitted after due date.
o
The
submitted assignment is other than .cpp file.
o
The
submitted assignment does NOT open or file is corrupted.
o
The
assignment is copied (from other student or ditto copy from handouts or
internet).
Note: you are required to write C++
code only in dev-C++ IDE.
Uploading instructions
o
For
clarity and simplicity, you are required to Upload/Submit only .cpp file.
Objective
The objective of this assignment is:
o
To give
you the practical implementation of Binary Search Tree.
GOOD LUCK
|
|||||||||||||||||||||||||||||||||||||||||||
|
|
Marks: 20
|
||||||||||||||||||||||||||||||||||||||||||
|
Problem Statement:
ICC - International Cricket
Council is an international governing body for the game of cricket.ICC is
fully responsible for the governance and organization of all major
international cricket tournaments.
One of the major
responsibilities of ICC is to award ranking to different teams of cricket
based on their performance in a specific format of cricket in a calendar
year.
Following is a sample
performance table of different teams constituted by ICC for year 2014:
You have studied Binary Search Tree (BST)
for strings in this course. Keeping in mind the property of Binary Search
Tree (BST) for string, write a program in C++ which performs the following
operations:
1. Store BST
for the above teams in computer memory along with rating of each team.
2. Display
names of all teams alphabetically along with rating points.
3. Find and
display the team having maximum rating.
Solution Guidelines:
Ø Prompt the
user to input rating for a team,
rating score should be in the range from 1
to 200.
Ø You are
required only to process (consider) rating
from the above table. Ignore Matches
and Points.
Ø Implement
the tree as a tree of strings.
Ø A single
node must contain two values: a team name and it’s rating.
Ø Use strcmp () functionto compare strings
while implementing the tree of strings.
Ø Use inorder traversal to display the tree
in alphabetic order.
Ø Use a
function named topRating ()to find
and display the top one team having highest rating.
|
|||||||||||||||||||||||||||||||||||||||||||
|
Sample Output: The output of your solution should look like:
Lectures Covered:This assignment covers Lecture # 13-16
Deadline:Your assignment must be
uploaded/submitted at or before June 9, 2015.
|
|||||||||||||||||||||||||||||||||||||||||||
Wednesday, June 10, 2015
cs301 assignment 2 solution
|
|
Assignment No. 02 (Graded)
SEMESTER Spring 2015 CS301- Data Structures |
Total Marks: 20
Due Date:09-06-2015
|
|||||||||||||||||||||||||||||||||||||||||
|
Instructions
Please read the
following instructions carefully before solving & submitting assignment:
It should be clear that your assignment will not get any
credit (zero marks) if:
o
The
assignment is submitted after due date.
o
The
submitted assignment is other than .cpp file.
o
The
submitted assignment does NOT open or file is corrupted.
o
The
assignment is copied (from other student or ditto copy from handouts or
internet).
Note: you are required to write C++
code only in dev-C++ IDE.
Uploading instructions
o
For
clarity and simplicity, you are required to Upload/Submit only .cpp file.
Objective
The objective of this assignment is:
o
To give
you the practical implementation of Binary Search Tree.
GOOD LUCK
|
|||||||||||||||||||||||||||||||||||||||||||
|
|
Marks: 20
|
||||||||||||||||||||||||||||||||||||||||||
|
Problem Statement:
ICC - International Cricket
Council is an international governing body for the game of cricket.ICC is
fully responsible for the governance and organization of all major
international cricket tournaments.
One of the major
responsibilities of ICC is to award ranking to different teams of cricket
based on their performance in a specific format of cricket in a calendar
year.
Following is a sample
performance table of different teams constituted by ICC for year 2014:
You have studied Binary Search Tree (BST)
for strings in this course. Keeping in mind the property of Binary Search
Tree (BST) for string, write a program in C++ which performs the following
operations:
1. Store BST
for the above teams in computer memory along with rating of each team.
2. Display
names of all teams alphabetically along with rating points.
3. Find and
display the team having maximum rating.
Solution Guidelines:
Ø Prompt the
user to input rating for a team,
rating score should be in the range from 1
to 200.
Ø You are
required only to process (consider) rating
from the above table. Ignore Matches
and Points.
Ø Implement
the tree as a tree of strings.
Ø A single
node must contain two values: a team name and it’s rating.
Ø Use strcmp () functionto compare strings
while implementing the tree of strings.
Ø Use inorder traversal to display the tree
in alphabetic order.
Ø Use a
function named topRating ()to find
and display the top one team having highest rating.
|
|||||||||||||||||||||||||||||||||||||||||||
|
Sample Output: The output of your solution should look like:
Lectures Covered:This assignment covers Lecture # 13-16
Deadline:Your assignment must be
uploaded/submitted at or before June 9, 2015.
|
|||||||||||||||||||||||||||||||||||||||||||
Subscribe to:
Post Comments (Atom)
Post a Comment
0 comments
Dear readers, after reading the Content please ask for advice and to provide constructive feedback Please Write Relevant Comment with Polite Language.Your comments inspired me to continue blogging. Your opinion much more valuable to me. Thank you.