30.08.

2023

Data Structures using C++

Course Code 21EC584 CIE Marks 50
Teaching Hours/Week 0:0:2:0 SEE Marks 50
Credits 1 Exam Hours 3
Course Objectives

• To write and execute programs in C++ to solve problems using data structures such
as arrays, linked lists, stacks, queues, trees, graphsand search trees.
• To learn to write C++programs to implement various sorting and searching algorithms

Sl. No. Experiments

Write a C++ program that uses functions to perform the following:
a) Create a singly linked list of integers.
01 b) Delete a given integer from the above linked list.
c) Display the contents of the above list after deletion.
Write a template-based C++ program that uses functions to perform the
following:
02 a) Create a doubly linked list of elements.
b) Delete a given element from the above doubly linked list.
c) Display the contents of the above list after deletion.
Write a C++ program that uses stack operations to convert a given infix
03
expression into its postfix equivalent, Implement the stack using an array.
Write a C++ program to implement a double ended queue ADT using an array,
04
using a doubly linked list.
Write a C++ program that uses function templates to perform the following:
05 a) Search for a key element in a list of elements using linear search.
b) Search for a key element in a list of sorted elements using binary search.
Write a C++ program that implements Insertion sort algorithm to arrange a list
06
of integers in ascending order.
Write a template-based C++ program that implements selection sort algorithm
07
to arrange a list of elements in descending order.
Write a template-based C++ program that implements Quick sort algorithm to
08
arrange a list of elements in ascending order.
Write a C++ program that implements Heap sort algorithm for sorting a list of
09
integers in ascending order.
Write a C++ program that implements Radix sort algorithm for sorting a list of
10
integers in ascending order.

19.09.2023
 30.08.2023

Write a C++ program that uses functions to perform the following:

11 a) Create a binary search tree of integers.
b) Traverse the above Binary search tree non recursively in Inorder.
Write a C++ program that uses functions to perform the following:
a) Create a binary search tree of integers.
12 b) Search for an integer key in the above binary search tree non recursively.
c) Search for an integer key in the above binary search tree recursively.
Course Outcomes: At the end of the course the students will be able to:

• identify the appropriate data structures and algorithms for solving real world problems.
• implement various kinds of searching and sorting techniques.
• implement data structures such as stacks, queues and Search treesto solve various
computing problems.

Assessment Details (both CIE and SEE):

The weightage of Continuous Internal Evaluation (CIE) is 50% and for Semester End Exam
(SEE) is 50%. The minimum passing mark for the CIE is 40% of the maximum marks (20
marks). A student shall be deemed to have satisfied the academic requirements and earned
the credits allotted to each course. The student has to secure not less than 35% (18 Marks out
of 50) in the semester-end examination (SEE).
Continuous Internal Evaluation (CIE):
CIE marks for the practical course is 50 Marks. The split-up of CIE marks for record/ journal and test
are in the ratio 60:40.
• Each experiment to be evaluated for conduction with observation sheet and record write-up.
• Rubrics for the evaluation of the journal/write-up for hardware/software experiments
designed by the faculty who is handling the laboratory session and is made known to students
at the beginning of the practical session.
• Record should contain all the specified experiments in the syllabus and each experiment
write-up will be evaluated for 10 marks.
• Total marks scored by the students are scaled downed to 30 marks (60% of maximum marks).
• Weightage to be given for neatness and submission of record/write-up on time.
• Department shall conduct 02 tests for 100 marks, the first test shall be conducted after the
8th week of the semester and the second test shall be conducted after the 14th week of the
semester.
• In each test, test write-up, conduction of experiment, acceptable result, and procedural
knowledge will carry a weightage of 60% and the rest 40% for viva-voce.
• The suitable rubrics can be designed to evaluate each student’s performance and learning
ability. Rubrics suggested in Annexure-II of Regulation book.
• The average of 02 tests is scaled down to 20 marks (40% of the maximum marks).
The Sum of scaled-down marks scored in the report write-up/journal and average marks of two tests
is the total CIE marks scored by the student.

Semester End Evaluation (SEE):

19.09.2023
 30.08.2023

SEE marks for the practical course is 50 Marks. SEE shall be conducted jointly by the two
examiners of the same institute, examiners are appointed by the University
• All laboratory experiments are to be included for practical examination.
• (Rubrics) Breakup of marks and the instructions printed on the cover page of the answer
script to be strictly adhered to by the examiners. OR based on the course requirement
evaluation rubrics shall be decided jointly by examiners.
• Students can pick one question (experiment) from the questions lot prepared by the internal
/external examiners jointly.
• Evaluation of test write-up/ conduction procedure and result/viva will be conducted jointly
by examiners
General rubrics suggested for SEE are mentioned here, writeup-20%, Conduction procedure
and result in -60%, Viva-voce 20% of maximum marks. SEE for practical shall be evaluated for
100 marks and scored marks shall be scaled down to 50 marks (however, based on course
type, rubrics shall be decided by the examiners). Change of experiment is allowed only once
and 15% Marks allotted to the procedure part to be made zero. The duration of SEE is 03
hours Rubrics suggested in Annexure-II of Regulation book.
Suggested Learning Resources:

1. Data Structures using C++, D. S. Malik, 2nd edition, Cengage learning.

2. Data structures, Algorithms, and applications in C++, Sartaj Sahni, Universities Press,
2nd Edition, 2005.

19.09.2023