NBA-SAR|CSE CRITERION 2

Dr.G.U.POPE COLLEGE OF ENGINEERING

POPE NAGAR, SAWYERPURAM
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

Academic Year : 2022 - 2023

Semester : III
Staff Name : Mrs. A. ANANTHAKUMARI
Designation : Assistant Professor
Department : CSE

COURSE FILE

CS3311-DATA STRUCTURES LABORATORY

PREPARED BY VERIFIED BY APPROVED BY

Mrs.A.ANANTHAKUMARI HOD PRINCIPAL

VISION
NBA-SAR|CSE CRITERION 2

To take an anchoring position as one of the prime departments of the College in moulding
rural students to face the demands of the software industry and to create young
engineers/Entrepreneurs by nurturing them with high quality technical education and ethics to serve
the nation.

MISSION

1. To create young engineers and entrepreneurs by providing cutting-edge engineering education

as well as ethical ideals.
2. To transform the rural students into technically competent and socially responsible

PROGRAM EDUCATIONAL OBJECTIVES

PEO1: Graduates will have the ability to innovate new technologies in the key
domains of Computer Science and Engineering
PEO2: Graduates will be ethically and socially responsible solution providers and
entrepreneurs

PEO3: Graduates will be competent to meet the challenges of the industry

PROGRAM SPECIFIC OUTCOMES (PSO):

PSO 1. Exhibit design and programming skills to real life and automate
computer based solutions using cutting edge technologies.

PSO 2. To apply knowledge in various domains to identify research gaps

and to provide solution to new ideas and innovation
NBA-SAR|CSE CRITERION 2

PROGRAM OUTCOMES:
ENGINEERING GRADUATES WILL BE ABLE TO:
1. Engineering knowledge: Apply the knowledge of mathematics, science,
engineering fundamentals and an engineering specialization to the solution
of complex engineering problems.

2. Problem analysis: Identify, formulate, review research literature, and

analyze complex engineering problems reaching substantiated conclusions
using first principles of mathematics, natural sciences, and engineering
sciences.

3. Design/development of solutions: Design solutions for complex

engineering problems and design system components or processes that meet
the specified needs with appropriate consideration for the public health and
safety, and the cultural, societal, and environmental considerations.

4. Conduct investigations of complex problems: Use research-based

knowledge and research methods including design of experiments, analysis
and interpretation of data, and synthesis of the information to provide valid
conclusions.

5. Modern tool usage: Create, select, and apply appropriate techniques,

resources, and modern engineering and IT tools including prediction and
modeling to complex engineering activities with an understanding of the
limitations.

6. The engineer and society: Apply reasoning informed by the contextual

knowledge to assess societal, health, safety, legal and cultural issues and the
consequent responsibilities relevant to the professional engineering practice.

7. Environment and sustainability: Understand the impact of the professional

engineering solutions in societal and environmental contexts, and
demonstrate the knowledge of, and need for sustainable development.

8. Ethics: Apply ethical principles and commit to professional ethics and

responsibilities and norms of the engineering practice.

9. Individual and team work: Function effectively as an individual, and as a

member or leader in diverse teams, and in multidisciplinary settings.

10. Communication: Communicate effectively on complex engineering

activities with the engineering community and with society at large, such as,
being able to comprehend and write effective reports and design

3
NBA-SAR|CSE CRITERION 2

documentation, make effective presentations, and give and receive clear

instructions.
11. Project management and finance: Demonstrate knowledge and
understanding of the engineering and management principles and apply
these to one‘s own work, as a member and leader in a team, to manage
projects and in multidisciplinary environments.

12. Life-long learning: Recognize the need for, and have the preparation and
ability to engage in independent and life-long learning in the broadest
context of technological change.

I. NAME LIST

S.NO REGISTER NUMBER NAME OF THE STUDENT

1. 950421104003 Abisneka. M
2. 950421104005 AloyciousJames.I
3. 950421104006 AnandhaSushma. P
4. 950421104007 Antony Jeris. S
5. 950421104008 Aquila Blessy. J
6. 950421104009 Archana. K
7. 950421104010 ArockiaJerin. J
8. 950421104011 Athisaya Michael Paraloga Raj. M
9. 950421104012 Bharat Sanjay Lordwin. D. J
10. 950421104013 Brighton Raja Singh. E
11. 950421104014 BrijithKeran
12. 950421104016 Guru Sankaran. K
13. 950421104017 Harishraj. P
14. 950421104018 Hema. P
15. 950421104019 Ida SelvamMagdeline
16. 950421104020 Inbaraj. G
17. 950421104021 Jasmine NesaThrisha. J
18. 950421104023 Karthick. S

4
NBA-SAR|CSE CRITERION 2

19. 950421104025 Kavitha. M

20. 950421104026 Kingslin. P
21. 950421104027 Manish Kumar Joshi
22. 950421104029 Mohit Kumar Arun
23. 950421104030 Mukentharan. V
24. 950421104031 Muthusamy.M
25. 950421104033 Nantha Kumar. S
26. 950421104035 PavithaSherin. C
27. 950421104036 PonSivalinga Raj. S
28. 950421104037 Prasanna Golda. J
29. 950421104038 RathnaSree.K
30. 950421104040 Sangeetha. M
31. 950421104041 Sanjay. K
32. 950421104042 Santhana Mari. M
33. 950421104043 Saranya. M
34. 950421104044 Saravana Kumar. M
35. 950421104046 Sasitha. K
36. 950421104047 Sathish Kumar. T
37. 950421104048 Selva Kumar. S
38. 950421104050 Shamser Kumar
39. 950421104051 Sindhu. S
40. 950421104052 Siva. S
41. 950421104053 Suresh. M
42. 950421104054 Suresh. S
43. 950421104055 Varsha Ibrahim. K
44. 950421104057 Vinoth Kumar. C
45. 950421104301 Bellyabas. T
46. 950421104302 Deepak

5
NBA-SAR|CSE CRITERION 2

47. 950421104303 Jeyaprakash

48. 950421104304 Ram kumar

II. TIME TABLE

DAYS 1 2 3 4 5 6 7

MON

TUE CS3311

WED

THU CS3311

FRI

III. LESSON PLAN

Lectures Tutorial Practical

Subject Code Subject Name
(Periods) (Periods) (Periods)
CLOUD COMPUTING
C445/CS8711 0 0 4
LABORATORY

CS3311 DATA STRUCTURES LABORARORY LTPC

0 0 3 1.5

Course Objectives:
 To demonstrate array implementation of linear data structure algorithms.
 To implement the applications using Stack.
 To implement the applications using Linked list
 To implement Binary search tree and AVL tree algorithms.
 To implement the Heap algorithm.
 To implement Dijkstras algorithm.
 To implement Prims algorithm
 To implement Sorting, Searching and Hashing algorithms.

List of Exercises:
1. Array implementation of Stack, Queue and Circular Queue ADTs
2. Implementation of Singly Linked List
3. Linked list implementation of Stack and Linear Queue ADTs

6
NBA-SAR|CSE CRITERION 2

4. Implementation of Polynomial Manipulation using Linked list

5. Implementation of Evaluating Postfix Expressions, Infix to Postfix conversion
6. Implementation of Binary Search Trees
7. Implementation of AVL Trees
8. Implementation of Heaps using Priority Queues
9. Implementation of Dijkstras Algorithm
10. Implementation of Prims Algorithm
11. Implementation of Linear Search and Binary Search
12. Implementation of Insertion Sort and Selection Sort
13. Implementation of Merge Sort
14. Implementation of Open Addressing (Linear Probing and Quadratic Probing)

Course Outcomes:

At the end of this course, the students will be able to:

1. Implement Linear data structure algorithms.

2. Implement applications using Stacks and Linked lists
3. Implement Binary Search tree and AVL tree operations.
4. Implement graph algorithms.
5. Analyze the various searching and sorting algorithms.

TOTAL: 45 PERIODS

LESSON PLAN

Sl.
WEEK Topics to be covered No of Hours
No.

1 WEEK I Array implementation of Stack, Queue and 3

Circular Queue ADTs

2 WEEK II Implementation of Singly Linked List 3

3 WEEK III Linked list implementation of Stack and Linear 3

Queue ADTs

4 WEEK IV Implementation of Polynomial Manipulation 3

using Linked list

7
NBA-SAR|CSE CRITERION 2

Sl.
WEEK Topics to be covered No of Hours
No.

5 WEEK V Implementation of Evaluating Postfix 3

Expressions, Infix to Postfix conversion
6 WEEK VI Implementation of Binary Search Trees 3

7 WEEK VII Implementation of AVL Trees 3

Implementation of Heaps using Priority

8 WEEK VIII 3
Queues

9 WEEK IX Implementation of Dijkstras Algorithm 3

10 WEEK X Implementation of Prims Algorithm 3

11 WEEK XI Implementation of Linear Search and Binary 3

Search

12 WEEK XII Implementation of Insertion Sort and Selection 3

Sort

13 WEEK XIII Implementation of Merge Sort 3

14 WEEK XIV Implementation of Open Addressing (Linear 3

Probing and Quadratic Probing)

15 WEEK XV 3
Revision

V. MAPPING OF COURSE OUTCOME WITH PROGRAM OUTCOMES

PO PO PO PO
PO 1 PO 2 PO 3 PO 4 PO 5 PO 6 PO 7 PO 8 PO 9
10 11 12
co

CO 1 1 2 2 1 3 - - - 2 1 2 2
CO 2 3 3 1 1 2 - - - 1 1 1 3
CO 3 2 1 3 1 2 - - - 1 1 2 3

8
NBA-SAR|CSE CRITERION 2

CO 4 3 1 1 3 3 - - - 1 2 3 3
CO 5 3 2 1 1 3 2 - - 3 3 3 1

VI. MAPPING OF COURSE OUTCOME WITH PROGRAM SPECIFIC OUTCOMES

PSO
PSO 1 PSO 2
co

CO 1 2 1
CO 2 2 2
CO 3 3 1
CO 4 3 2
CO 5 2 -