Databases and Data Structures

Group Assignment

Page 1 of 5

ASSIGNMENT REQUIREMENTS:
You are required to submit a hardcopy as well as a soft copy of your source code. All team
members are required to collectively put in effort to integrate the required modules to build
a single unit. If these programs are not integrated, it will be considered as lack of co-ordination
among members that may result in reduction of the marks awarded. You may use your own PC
or a computer in the college for completing this work. You are required to present when you have
submitted your assignment. However your system must work on college PCs. Each member
should divide the work and should present their own part.
Referencing code
If you use some code or ideas for code which have been taken or adapted from another source
(book, magazine, internet, forum etc.) then this must be cited and referenced using the Harvard
Name convention within your source code. Failure to reference code properly is considered as
plagiarism.

PART A: LINKED LIST

Write a C program that asks the user to enter items until the user chooses to stop, stores them
into list nodes, and chains the nodes together into a linked list. You will need to make the
following changes:

Your linked list should store information about Students that contain the following fields:
Student name (alphabetic), Student Intake (alpha numeric), and Students Branch (string),
Students Level_no (int) [i.e. Level 0or Level 1 or Level 2 or Level 3].

Information of students (all the nodes) should be arranged in alphabetical order of their
Student names then they should be arranged in ascending order of Level_no while inserting a
node. (You will not sort the list after insertion, but node should automatically take its position
while inserting.)

Instead of simply asking the user if they want to add a new node, your main program should
offer the user a menu of options:
o Add a new node
o Print out the entire list
o Remove a node from the list
o Quit the program

Diploma Part 2

Asia Pacific Institute of Information Technology

2014

Databases and Data Structures

PART B:

Group Assignment

Page 2 of 5

STACK

Write a program for an automated stockroom. The retailer is stored and retrieved from the
stockroom using a computerized robotics system. The procedure for storing and retrieving from
the stockroom is as follows:

1. A truck with retailer pulls up to loading dock.

2. A robot called Stacker, retrieves the retailer from the truck and stacks the
3.
4.
5.
6.

boxed retailer onto itself.

Once Stacker has reached its capacity or empties the truck, Stacker moves into the
stockroom with retailer.
In the stockroom, another robot takes ALL the retailer from Stacker, starting with the box on
top, and loads it in the back of the appropriate storage bin based on the bar code on each box
identifying the type of retailer in the box.
Once Stacker is empty and if the truck is not empty, Stacker returns back to the
truck to get another load. If the truck is empty Stacker's job is done.
As retailer is needed from the stockroom, a robot retrieves the retailer
from the top of the appropriate bin.

Write your program to simulate this procedure using the following guidelines.

Stacker can hold up to 5 boxes.

There are 5 different types of retailer, thus 5 different storage bins.
Each bin can hold up to 5 products. If a new product needs to go into a bin that is full, the
product that is on top of the bin is removed and thrown away using the stack concept.
Each box has a bin id number and an product id number. Bin id numbers are 0 through 4.
Input: product id and bin id for each box on truck (The input order is the order in which
boxes are taken off the truck.)
Output: product ids (The output shows the order the stockroom would be emptied if we start
at bin 0, then bin 1, then bin 2, etc....)
The object stacker and storage bins are stacks.

Sample: Input:

Diploma Part 2

product id
134
450
356
289
390
576
987
457
123
456

bin id
0
3
1
2
2
4
3
3
2
0

Asia Pacific Institute of Information Technology

2014

Databases and Data Structures

Output:

Group Assignment

980
743
211
666
999
888

1
3
3
3
4
3

456
134
356
123
289
390
743
888
987
457
450
999
576

0
0
1
2

Page 3 of 5

2
2
3
3
3
3
3
4
4

DELIVERABLES
You are required to submit:
Documentation (hardcopy)
1.
2.
3.
4.
5.
6.
7.
8.
9.

Cover page
Member contribution report
Table of content
Introduction
Explanations of data structure concepts implemented (with code snippet)
Sample outputs when program is executed with some explanation
Additional features (optional)
Conclusion
References

CD Content (softcopy)
1.
2.
3.
4.

Documentation report (.docx/.doc/.rtf)

Source file (.c file)
Executable file (.exe file)
Header files (.h files) optional

Diploma Part 2

Asia Pacific Institute of Information Technology

2014

Databases and Data Structures

Group Assignment

Page 4 of 5

Marking Scheme
The breakdown of marks for this assignment is as defined below:
Implementation (17 marks)

General - program logic, validation checks, accuracy of results, workable system

Efficiency of code efficient memory utilisation, modular/compact program, no use of

unnecessary global variables, goto statements etc.

Demonstration (9 marks)

Explanation of code, ability to debug errors, logic justification.

Assignment contribution (4 marks)

Workload distribution, initiative taken
Performance Criteria
Grades would be awarded as follows:

Distinction
(75% -100%)

Credit
(65% - 74%)

Pass
(50% - 64%)

Diploma Part 2

An executable system which covers all functionalities stated in the

specifications. Data validations in place and efficient code writing style.
Student demonstrates full understanding of the code (debugging of code
during presentation) and is able to answer all questions regarding the
algorithm and the effective use of data structures used in the program.
Substantial contribution to the work for the assignment is evident.
An executable system which covers almost all functionalities stated in the
specifications. Data validations in place and efficient code writing style with
minor issues. Student can explain the source code and is able to demonstrate
the choice of data structures used in the program. Fair amount of
contribution to the work for the assignment.
An executable system with a few execution issues. Average data validations
in place and not very efficient code writing style. Student demonstrates some
knowledge of the algorithm used but is unable to convincingly justify the
logic of the program code or the choice of data structure. Average
contribution to the work for the assignment.

Asia Pacific Institute of Information Technology

2014

Databases and Data Structures

Fail
(0% - 49%)

Diploma Part 2

Group Assignment

Page 5 of 5

A system which does not work as per the specifications. Absence of or

minimal data validation in the source code. Inefficient coding style with
inability to comprehend and demonstrate knowledge of the program logic or
use of data structures. Negligible contribution to the work for the
assignment.

Asia Pacific Institute of Information Technology

2014