GOVERNMENT POLYTECHNIC, AMRAVATI

(AN AUTONOMOUS INSTITUTE OF GOVT. OF MAHARASHTRA)

CURRICULUM DEVELOPMENT CELL

CURRICULUM 2023 (FIFTH REVISION)

PROGRAMME TITLE: DIPLOMA IN CM / IF ENGG

COURSE CODE: FC4503
COURSE TITLE: DATA STRUCTURE USING C

LEARNING SCHEME:

LEVEL PRERE- Total WEEKLY WEEKLY TOTAL TOTAL TOTAL

OF QUISITE IKS CONTACT HRS. SL HRS. CREDIT WEEK CONTACT
COURSE HRS S S HOURS
CL TL LL C TL LL
L
IV FC2503 - 04 00 04 02 05 15 60 00 60

ASSESSMENT SCHEME:

PAPER THEORY-CL PRACTICAL-LL SELF

DURATION (Marks) (Marks) LEARNIN TOTAL
(HRS) G- SLA (Marks)
TH- TH- TH -FA TH-SA TOTAL PR- PR-SA (Marks)
FA SA FA^
MAX 30 70 100 25 50# 25 200
1.30 Hrs 3 Hrs
MIN. --- --- 40 10 20 10 -
Abbreviations: CC—Common Course, FC – Fractional Course, ME – Mechanical Engineering (Programme Specific
Course), IKS- Indian Knowledge System, CL – Classroom Learning, TL –Tutorial Learning, LL – Laboratory Learning,
SL – Self Learning, FA – Formative Assessment, SA – Summative Assessment, TH – Theory, PR – Practical, SLA –
Self Learning Assessment. Legends: @ - Internal Assessment, # - Internal & External Assessment, $ - Online MCQ
Examination, * - FA-TH 30 Mark constitutes two parts one is 20 marks for Formative Assessment Test and other is 10
marks for Tutorial Learning Assessment. ^ - Under practical FA, Continuous Assessment of Practical Work is to be
done by Course Teacher as per CDC norms and rubrics.
Note: 1. Under the Theory FA, final marks are the Average of Two FA Tests to be conducted as per academic
calender of the term.
2. Question paper for TH-FA and TH-SA shall be set as per CDC norms and specification table.
Under the head SL Assessment, Assignment, Micro Activity, Presentation, Seminar, related to course is to be assessed
by course teacher as per CDC norms and rubrics.
3. PR-SA to be conducted with practical based individual performance and related viva.

1. RATIONALE:

One of the most important courses in information and communication technology is data
structures. Data organization or structuring is essential for developing effective algorithms
and programs. Students will get the ability to develop logic to solve problem using principles
of data structure with the aid of this course.
2. COURSE OUTCOMES (COs):
At the end of this course, student will be able to: -
CO1 - Perform basic operations on Arrays.
CO2 - Apply Different Searching and Sorting techniques.
CO3 - Implement basic operations on stack and queue using array representation.
CO4 - Perform operations on Queue using Array.
CO5 - Implement basic operations on Linked List
CO6 - Implement techniques of Tree Traversal and Searching in Graph

3. DETAILED CONTENTS: THEORY-CL

Unit / CO No Major Learning Unit Topics and Sub-topics Hr Mark

Outcomes s s
(in cognitive domain)
Unit I / CO1 1.1 Classify the given 1.1 Concept and need of DS,
type of Data Structures Abstract Data Type
based on their 1.2 Types of Data Structures: (i)
Introduction to characteristics and space. Linear Data Structures (ii) Non-
Data Structures 1.2 1b. Explain Linear Data Structures
complexity of the given 1.3 Basics of Algorithm:
algorithm in terms of Definition, Characteristics,
time and space. Algorithm Complexity: (i)Time 08 08
1.3 Perform operations Complexity – Definition,
on the given type of Data Asymptotic Notations (ii)Space
Structure. Complexity
1.4 Operations on Data
Structures: Traversing,
Searching, Insertion, Deletion,
Sorting
Unit II / CO2 2.1 Develop algorithm to 2.1 Searching: Searching for an
Searching and search the given key item in a data set using the
Sorting using different Searching following methods:
(i) Linear Search
Techniques.
(ii) Binary Search
2.2 Create algorithm to 2.2 Sorting: Sorting of data set
in an order using the following 10 12
sort data using a given
methods:
method. (i) Bubble Sort
(ii) Selection Sort
(iii) Insertion Sort
(iv) Quick Sort
(v) Radix Sort
Unit - III / CO3 3.1 Differentiate 3.1 Static and Dynamic Memory
Linked List between Static and Allocation.
Dynamic Memory 3.2 Introduction to Linked List, 14 14
Allocation. Terminologies: Node, Address,
3.2 Create a relevant Pointer, Information field / Data
 structure using a Linked field, Next pointer, Null Pointer,
List to represent a Empty List.
Node. 3.3 Type of Lists: Linear List,
3.3 Develop algorithms Circular List, Doubly Linked
to add or remove a List.
specified item from a 3.4 Operations on a singly
Linear Linked List. linked list: Traversing a linked
3.4 Develop algorithm list, Searching a key in linked
to traverse a singly list, Inserting a new node in a
linked list. linked list (at the Beginning, at
the End, at any given position) ,
Deleting a node from a linked
list (at the Beginning, at the
End, at any given position)
3.5 Applications of Linked List.
Unit - IV / CO4 4.1 Represent Stack 4.1 Introduction to Stack:
Stack using Array and Linked Definition, Stack representation
List. in memory using array, Stack as
4.2 Develop algorithms an ADT, Operations on Stack-
to carry out the PUSH PUSH, POP, Stack Operation
and POP operations in a Conditions – Stack Full / Stack
Stack. Overflow, Stack Empty /Stack
4.3 Convert the given Underflow.
expression from Infix to 4.2 Stack Implementation using
10 12
Postfix using Stack. Linked List.
4.4 Evaluate Postfix 4.3 Applications of Stack:
Expression. Reversing a List, Polish
Notations, Conversion of Infix
to Postfix Expression,
Evaluation of Postfix
Expression.
4.4 Recursion: Definition and
Applications.
Unit - V / CO5 5.1 Represent Queue 5.1 Introduction to Queue:
Queue using Array and Linked Queue representation in
List. memory using array, Queue as
an ADT, Queue Operations:
5.2 Compare INSERT, DELETE, Queue
characteristics of Operation Conditions: Queue
different types of Queue. Full, Queue Empty.
10 12
5.3 Create Algorithm to 5.2 Types of Queues: Linear
carry out the INSERT Queue, Circular Queue, Concept
and DELETE Operations of Priority Queue, Double-
on a Queue. Ended Queue.
5.3 Queue representation in
memory using Linked List.
5.4 Applications of Queue.
 Unit - VI / CO6 6.1 Create Binary Search 6.1 Introduction to Trees,
Trees and Tree for the given data Terminologies: tree, degree of a
Graphs set. node, degree of a tree, level of a
node, leaf node, Depth / Height
6.2 Develop algorithms of a tree, In‐degree & Out‐
to traverse the tree using Degree, Path, Ancestor &
the given method. descendant nodes
6.2 Tree Types and Traversal
6.3 Represent the given
methods
Graph using adjacency
Types of Trees: General tree,
matrix and adjacency list
Binary tree, Binary search tree
6.4 Develop algorithms (BST).
to search the Graph using Binary tree traversal : In order
the given method. traversal, Preorder traversal, 12 12
Post order traversal
6.3 Introduction to Graph
terminologies: graph, node
(Vertices), arcs (edge), directed
graph, undirected graph, in‐
degree, out‐degree, adjacent,
successor, predecessor, relation,
path, sink, articulation point.
6.4 Adjacency List, Adjacency
Matrix of directed / undirected
graph.
6.5 Elementary Graph
Operations : Breadth_first
Search, Depth_first Search

4. LIST OF PRACTICALS-LL

S. N CO
PRACTICAL LEARNING OUTCOMES (PLOs)
NO.
1.
* Write a ‘C’ program to perform following Operations on Array: Create, Insert, CO1
Delete, Display.

2. Write a ‘C’ Program to Search a particular data from the given Array of numbers CO2
using: Linear Search Method.

3. * Write a ‘C’ Program to Search a particular data from the given Array of Strings CO2
using Linear Search Method.

4. * Write a ‘C’ program to Search a particular data from the given Array of numbers CO2
using Binary Search Method.
5. Write a ‘C’ Program to Search a particular data from the given Array of Strings CO2
using Binary Search Method

6. * Write a ‘C’ Program to Sort an Array of numbers using Bubble Sort Method. CO2

7. Write a ‘C’ Program to Sort an Array of Strings using Bubble Sort Method. CO2

8. * Write a ‘C’ Program to Sort an Array of numbers using Selection Sort Method. CO2

9. Write a ‘C’ Program to Sort an Array of numbers using Insertion Sort Method. CO2

10. * Write a 'C' Program to Implement Singly Linked List with Operations: (i) Insert CO3
at beginning, (ii) Search, (iii) Display

11. * Write a C Program to Implement Singly Linked List with Operations: (i) Insert at CO3
end, (ii) Insert After, (iii) Delete (iv) Delete from given place (v) Delete at End (vi)
Display

12. *Write a C Program to Create Two Polynomials using a Linked List. CO3

13. CO3
Write a 'C' Program to add Two Polynomials using a Linked List.

14. * Write a 'C' Program to perform PUSH and POP Operations on Stack using an CO4
Array.

15. * Write a 'C' Program to perform PUSH and POP Operations on a Stack using a CO4
Linked List.

16. * Write a 'C' program to perform multiplication of two numbers using recursion. CO4

17. 9 Write a 'C' program to print given string in reverse using recursion. CO4

18. Write a 'C' program to create a Singly Linked List and traverse in reverse order CO3/
using recursion. CO4

19. * Write a 'C' Program to perform INSERT and DELETE Operations on Linear CO5
Queue using an Array.

20. * Write a 'C' Program to perform INSERT and DELETE operations on Linear CO5
Queue using a Linked List.

21. Write a 'C' Program to perform INSERT and DELETE operations on Circular CO5
Queue using an Array.
22. Write a 'C' Program to perform INSERT and DELETE operations on Circular CO5
Queue using a Linked List.

23. Write a 'C' Program to Create a Priority Queue using a Linked List. CO5

24. *Write C program to Implement BST (Binary Search Tree) and traverse the tree CO6
(Inorder, Preorder, Post order).

25. Write C program to calculate height of the given Binary Tree. CO6

26. *Write C program to find out largest nodes in a Binary Search Tree CO6

27. *Write C program to implement the Breadth First Search algorithm CO6

28. Write C program to implement the Depth First Search algorithm CO6

(Practicals marked as * are compulsory)

Note :
i. A suggestive list of PLOs is given in the above table. More such PLOs can be added to attain
the COs and competency. A judicial mix of minimum 12 or more practical need to be
performed, so that the student reaches the 'Precision Level' of Dave's 'Psychomotor Domain
Taxonomy' as generally required by the industry.
ii. The 'Process ' and 'Product ' related skills associated with each PLO is to be assessed according
to CDC norms and rubrics.
iii.The above PLOs also comprise of the following social skills/attitudes which are Affective
Domain Outcomes (ADOs) that are best developed through the laboratory /field based
experiences:
a. Follow safety practices.
b. Practice good housekeeping.
c. Practice energy conservation.
d. Handle equipments carefully.
e. Plan for development of a program.
f. Demonstrate working as a leader / a team member.
g. Maintain hardware, tools and equipment.
h. Follow ethical practices.

The ADOs are not specific to any one PLOs, but are embedded in many PLOs. Hence, the
acquisition of the ADOs takes place gradually in the student when s/he undertakes a series of
practical experiences over a period of time. Moreover, the level of achievement of the ADOs
according to Krathwohl’s ‘Affective Domain Taxonomy’ should gradually increase as planned
below:
● ‘Valuing Level’ in 1st year
● ‘Organizing Level’ in 2nd year and
● ‘Characterizing Level’ in 3rd year
5. SUGGESTED STUDENT SELF LEARNING ACTIVITIES:
Other than the classroom and laboratory learning, following are the suggested student-related co-
curricular activities which can be undertaken to accelerate the attainment of the various outcomes
in this course: Students should conduct at least 01 group activity and 01 individual activities (to be
continued throughout the term). For the following suggested activities prepare reports of about 5
pages for each activity, also collect/record physical evidences for student's portfolio which will be
useful for their placement interviews:
a. Students should prepare report on any micro activity related to course on different units
as per the guidance of course teacher.
b. Prepare assignments on different units as per the guidance of course teacher
c. Prepare lab manual based on practical performed in laboratory.
d. Give seminar on relevant topic.
e. Library/E-Book survey regarding related course and prepare assignments on it for the
course.
f. Prepare power point presentation or animation for demonstrating emerging
activities/technology in the course.
g. Visit to institute/industry and prepare report.
h. Develop learning materials, models, charts related to topic, course.
i. Develop applications/ activities related to course which may be useful to society.
j. Learning through various online platforms such as SWAYAM, Infosys Springboard,
Spokentutorials etc. related to course.

6. SUGGESTED INSTRUCTIONAL STRATEGIES

These are sample strategies, which the teacher can use to accelerate (if required), the
attainment of the various outcomes in this course:
a. About 10-15% of the topics/sub-topics which is relatively simpler or descriptive in
nature is to be given to the students for self-directed learning and assess
the attainment of COs through classroom presentations.
b. Use the proper equivalent analogy to explain different concepts.
c. Use simulators/Animation/Online Videos/Field Visits/ Expert Lectures for the
understanding of concept.

7. MAJOR EQUIPMENTS / INSTRUMENTS REQUIRED

Sr Equipment Name with Broad Specification Practical No.

No.
1. Computer System with all necessary Peripherals and Internet ALL
Connectivity. ‘C’ Compiler / GCC Compiler/ Online ‘C’ Compiler
 8. SUGGESTED SPECIFICATION TABLE FOR QUESTION PAPER DESIGN

Unit Unit Title Marks Distribution of Theory Marks

No. per R U A
Unit
Level Level Level
1 Introduction to Data Structures 08 2 4 2
2 Searching and Sorting 12 2 4 6
3 Linked List 14 4 4 6
4 Stack 12 2 4 6
5 Queue 12 2 4 6
6 Tree 12 2 6 4
Total 70 14 26 30

9. QUESTION PAPER PROFILE

Course Outcomes/ Sub-Question Marks allotted with level (R,U,A) TOTAL

Q. No./ UNIT (Marks) MARKS
A b c d

CO1 / Q.1/UNIT 1 / (08) (Any Two) 2(R)+ 4(U) 4(U) -- 08

2(A)

CO2 / Q.2/UNIT 2 / (12) A(Any Two) 2(R) 2(U) 2(U) -- 04

B (Any Two) 4(U) 4(A) 4(A) -- 08

CO3 / Q.3/UNIT 3 / (14) A (Any One) 2(R) 2(R) -- 02

B(Any Three) 4(U) 4(A) 4(A) 4(A) 12

CO4 / Q.4/UNIT 4 / (12) A(Any Two) 2(R) 2(U) 2(U) -- 04

B (Any Two) 4(U) 4(A) 4(A) -- 08

CO5 / Q.5/UNIT 5 / (12) A(Any Two) 2(R) 2(U) 2(U) -- 04

B (Any Two) 4(U) 4(A) 4(A) -- 08

CO6 / Q.6/UNIT 6/ (12) A(Any Two) 2(R) 2(U) 2(U) -- 04

B (Any Two) 4(U) 4(A) 4(A) -- 08

Total (70) 70(34)

(Marks in bracket are
Optional )
 10. SUGGESTED LEARNING RESOURCES
SR.NO. TITLE AUTHOR PUBLISHER
1. Data Structures with ‘C’ Lipschutz McGraw Hill Education,
(SIE) (Schaum’s Outline New Delhi ISBN: 978-
Series) 0070701984
2. Data Structures using ‘C’ Balgurusamy, E. McGraw Hill Education,
New Delhi 2013, ISBN: 978-
1259029547

3. Data Structures using ‘C’ ISRD Group McGraw Hill Education,

New Delhi 2013, ISBN: 978-
12590006401
4. Understanding Pointers in C Yashwant BPB ISBN 8170298911
Kanetkar

11. SOFTWARE/LEARNING WEBSITES.

Sr.No Website QR code Content

.
1 https://www.javat For All Content
point.com/data-
structure-
introduction

2 https://www.geeks For All Content

forgeeks.org/intro
duction-to-data-
structure s/

3 https://studytonigh For All Content

t.com/data-
structures/
4 https://www.tutori For All Content
alspoint.com/data_
structures_algorith
ms/

5 https://www.w3sc For All Content

hools.in/data-
structures/

6 https://www.mygr For All Content

eatlearning.com/bl
og/data-structure-
tutorial -for-
beginners/

7 https://byjus.com/ For All Content

gate/introduction-
to-data-structure-
notes/
12. CO-PO MAPPING

CO PO1 PO2 PO3 PO4 PO5 PO6 PO7

Basic Proble design engineerin The Project Lifelong
and m and g tools Engineer manageme learning
Discip analysi develop and practices nt
line s ment of experimen for
knowl solution tal and Society
edge testing
Mark ‘3’ for high, ‘2’ for medium, ‘1’ for low & ‘0’ for the relevant
correlation of each CO, PO
CO 1 2 - - 1 - - 1

CO 2 2 2 2 1 - - 1

CO 3 2 2 2 1 1 1 3

CO 4 2 2 2 1 - 1 3

CO 5 2 2 2 1 - 1 3

CO 6 2 2 2 1 - 1 3

13. PERFORMANCE INDICATOR FOR LL

Sr
. Allocated
Performance indicator
N Weightage in %
o
1 Use of correct syntax/tools/ equipment 20
2 Correctness of algorithm/ logic/ Operating Equipment Skillfully 20
3 Debugging ability/observations/methodology 10
4 Coding standards)/safety measures/standard practices 10
5 Quality of' input and output 10
6 Answer to sample questions 20
7 On time submission 10
Total 100%

14. PERFORMANCE INDICATOR FOR TL

N/A

15. PERFORMANCE INDICATOR FOR SL

Note: Refer Rubrics for evaluation of practicals provided by CDC.
16. COURSE CURRICULUM DEVELOPMENT COMMITTEE:

SR. NO. NAME DESIGNATION INDUSTRY/INSTITUTE

1 Smt V.M.Aswar Lecturer in Computer Government Polytechnic
Engineering Amravati
2 Smt.R.J.Rangari Lecturer in Information Government Polytechnic
Technology Amravati
3 Mr.M.S.Rathod Lecturer in Information Government Polytechnic
Technology Amravati
4 Smt.S.S.Chavhan Lecturer in Computer Government Polytechnic
Engineering Amravati

Programme Board of Studies (Computer Engineering), Government Polytechnic, Amravati has

approved the above course curriculum on --------- and is adopted for Computer Engineering
Programme.

CHAIRMAN
PROGRAMME BOARD OF STUDIES,
COMPUTER ENGINEERING
GOVERNMENT POLYTECHNIC,
AMRAVATI.

The Board of Studies has approved the above course curriculum on --------
The Governing Body has approved the above course curriculum on ---------