Array and Linked List Operations

Arrays and linked lists are two fundamental data structures in computer science. An array is a collection of elements of the same type stored at contiguous memory locations, while a linked list is a sequence of nodes, each node containing a value and a reference to the next node in the sequence. The basic operations that can be performed on arrays include traversal, insertion, and deletion. Similarly, linked lists can also perform creation, insertion, testing for emptiness, and traversal. This assignment requires students to write C programs to perform these operations on both arrays and linked lists.

ASSIGNMENT SUBMISSION AND ASSESSMENT
_________________________________________________________________________
CDDS 2103
Introduction to Data Structure
MAY 2016
_________________________________________________________________________
INSTRUCTIONS TO STUDENTS
1. This assignment contains only TWO (2) question that is set in both Malay and English.
2. Answer in Malay or English.
3. Learners are to submit assignment only in MsWord format unless specified otherwise. Please
refrain from converting text/phrases into picture format such as .gif / .jpeg / print screen / etc.
4. Download the language version of the assignment template concerned from the myINSPIRE for
preparation and submission of your assignment. Your assignment should be typed using 12
point Times New Roman font and 1.5 line spacing.
5. You must submit your assignment ONLINE via the myINSPIRE. Refer to the portal for instructions
on the procedures to submit your assignment online. You are advised to keep a copy of your
submitted assignment for personal reference.
6. You can submit your assignment ONCE only in a MULTIPLE FILE as per requirement of the
assignment (1 main file and attachment/supporting files).
7. / Your assignment must be submitted between 27th June until 17th July 2016. Submission after
17th July 2016 will NOT be accepted
.
8. You are required to present your assignment task to your F2F tutor. Both F2F and OL students
should attend this presentation. Please refer to your Learning Center Administrator to confirm
on the date for the presentation.
9. Your assignment should be prepared individually. You should not copy another person’s
assignment. You should also not plagiarise another person’s work as your own.
10. Please take note that PENALTY will be imposed on late submission of assignment as specified in
the Registrar’s Office circular 6/2012 (Refer to Registrar’s Announcement in myINSPIRE)
11. Please ensure that you keep the RECEIPT issued upon submisson of your assignment as proof of
submission. Your assignment is considered as NOT submitted if you fail to produce the
submission receipt in any dispute arises concerning assignment submission.
PENILAIAN / EVALUATION

This assignment accounts for 50% of the total marks for the course and shall be assessed based on
the Rubrics attached .
You would be given feedback on the assignment before the Final Semester Examination commences.
PLAGIARISME: POTONGAN MARKAH / PLAGIARISM: MARKS DEDUCTION
Warning: The submitted assignment will automatically undergo a similarity check. If plagiarism is
detected, marks would be deducted as follows:
No. % Similarity (from) % Similarity (To) % of Mark Deduction
1 0 30 0
2 30.01 50 5
3 50.01 70 10
4 70.01 100 100

ASSIGNMENT QUESTION / SOALAN TUGASAN
PURPOSE
The purpose of this assignment is to test learner’s understanding on the concepts of data
structures such as basic operations of arrays and linked lists.
QUESTION 1
REQUIREMENT / ASSIGNMENT QUESTION
Arrays are used to store data of the same type. There are two main concepts of understanding an
array: element, each item stored in an array is called an element, and index, each location of an
element in an array has a numerical index which is used to identify the element. There are several
ways to declare an array. For example:
int Arr[5] = {1,3,5,7,8};
An illustration of the array declared:
elements 1 3 5 7 8
index 0 1 2 3 4
Size: 5
There are many ways to use or manipulate an array, these are some of the basic array operations:
i) Traverse – print all array elements one by one.
ii) Insertion – add an element at a given index.
iii) Deletion – delete an element at a given index.
Examples of Insertion and Deletion operations are given:
Insertion Operation
The original array elements are :
Arr[0]=1
Arr[1]=3
Arr[2]=5
Arr[3]=7
Arr[4]=8
The array elements after insertion at index 3 :
Arr[0]=1

Arr[1]=3
Arr[2]=5
Arr[3]=10
Arr[4]=7
Arr[5]=8
Deletion Operation
The original array elements are :
Arr[0]=1
Arr[1]=3
Arr[2]=5
Arr[3]=7
Arr[4]=8
The array elements after deletion at index 2:
Arr[0]=1
Arr[1]=3
Arr[2]=7
Arr[3]=8
Write a C program that will be able to do the 3 basic array operations. The documentation must
include a short introduction to the problem given, the program codes, and several output screens
(screenshots). You must submit the documentation file and the .c program file.
(20)
The assessment will be done based on the following criteria:
i. A proper writing of C codes and its structure
ii. The ability of program to be compiled and executed
iii. Implementation of correct programming techniques
iv. Complete documentation and correct submission
Note: You must write C programming codes for this assignment.

QUESTION 2
REQUIREMENT / ASSIGNMENT QUESTION
Arrays are not practical for modification or inserting or deleting data. This weakness can be
overcome by using linked lists. Linked lists are collections of data items in a row – insertions and
deletions are made anywhere in a linked list. Linked lists consists of sequential items known as
nodes. Each node is made up of two parts: data, the elements in the list, and link, the link to the
next node in the list.
The linked list data structure can be defined as follows:
typedef int ELEMENT;
typedef struct node;
{
ELEMENT data;
struct node *next;
} NODE;
An illustration of the linked list declared:
In linked lists, there are several basic operations that can be performed:
i) Create an empty linked list
ii) Insert new nodes
iii) Test whether a linked list is empty or not
iv) Traverse a linked list
1 3 5 7 8
Linked
List
NULL

Examples of Insertion operation is given:
The original linked list
The linked list after inserting element 10, in between element 5 and 7
Write a C program that will be able to do the 4 basic linked list operations. The documentation
must include a short introduction to the problem given, the program codes, and output screens
(screen shots). You must submit the documentation file and the .c program file.
(30)
The assessment will be done based on the following criteria:
i. A proper writing of C codes and its structure
ii. The ability of program to be compiled and executed
iii. Implementation of correct programming techniques
iv. Complete documentation and correct submission
Note: You must write C programming codes for this assignment.
(TOTAL 50 marks)
MUKA SURAT TAMAT / END OF PAGE
Linked
List
1
NULL
3 5 7
0
8
0
10
1 3 5 7 8
Linked
List
NULL

ATTACHMENT
ASSIGNMENT RUBRICS
CDDS 2103 INTRODUCTION TO DATA STRUCTURE / MAY 2016
QUESTION 1
Criteria Weight
age
Low Fair Above average Excellent
Max
Marks
0 1 2 3 4
Program Completion
for Task
Basic array operations:
i) Traverse
ii) Insertion
iii) Deletion
2.0
No
implementation
of the tasks
Implemented only a small
chunk of this task
Moderate implementation
of the task correctly
Most of the task was
implemented correctly
The task was implemented
successfully
8
Coding Standards
0.5
Wrong coding Codes were not well
organised
Codes were organised in
moderate manner
Codes were organised
properly
Codes written were very
well structured and
creatively organised
2
Runtime 1.0 The program
could not be
executed at all
 The program was not
executed due to errors
 OR the program was
executed with the
correct output but the
written coding did not
fulfil all the question’s
requirements
 The program was
executed but mostly
with incorrect output
 OR the program was
executed with the
correct output but the
written coding did not
fulfil few of the
question’s requirements
The program was
executed mostly with the
correct output
 The program was
executed with all the
correct output
 AND the program was
executed by fulfilling all
the requirements as
stated in the question
4

Efficiency
1.0
Wrong solution A difficult and inefficient
solution
A logical solution that is
easy to follow but it is not
the most efficient
Solution is efficient and
easy to follow
Solution is efficient,
understandable and easy to
maintain
4
Requirement of
Documentation (Source
Code files & Document
file. Document file has
copy of codes,
screenshots of the
program output and
program comments)
0.5
No
documentation
& source code
file
Incomplete documentation
& without source code file
Brief documentation with
source code file
Good documentation
together with source
code file
Excellent documentation
and complete with source
code file
2
Total 5 20

QUESTION 2
Criteria Weight
age
Low Fair Above average Excellent
Max
Marks
0 1 2 3 4

Program Completion for Task
Basic Linked List Operations:
i) Create empty linked list
ii) Insert new nodes
iii) Test whether list is empty
or not
iv) Traverse linked list
2.0
No
implementation
of the tasks
Implemented only a
small chunk of this task
Moderate implementation
of the task correctly
Most of the task was
implemented correctly
The task was
implemented
successfully
8
Coding Standards
1.5
Wrong coding Codes were not well
organised
Codes were organised in
moderate manner
Codes were organised
properly
Codes written were very
well structured and
creatively organised
6
Runtime 2.0 The program
could not be
executed at all
 The program was not
executed due to
errors
 OR the program was
executed with the
correct output but the
written coding did not
fulfil all the question’s
requirements
 The program was
executed but mostly
with incorrect output
 OR the program was
executed with the
correct output but the
written coding did not
fulfil few of the
question’s requirements
The program was
executed mostly with the
correct output
 The program was
executed with all the
correct output
 AND the program
was executed by
fulfilling all the
requirements as
stated in the
question
8

Efficiency
1.0
Wrong solution A difficult and inefficient
solution
A logical solution that is
easy to follow but it is not
the most efficient
Solution is efficient and
easy to follow
Solution is efficient,
understandable and
easy to maintain
4
Requirement of
Documentation (Source Code
files & Document file.
Document file has copy of
codes, screenshots of the
program output and program
comments) 1.0
No
documentation
& source code
file
Incomplete
documentation &
without source code file
Brief documentation with
source code file
Good documentation
together with source
code file
Excellent
documentation and
complete with source
code file
4
)
Total 7.5 30