DATA STRUCTURE USING C Course Code : 313301

: Cloud Computing and Big Data/ Computer Technology/ Computer Engineering/

Computer Science & Engineering/
Programme Name/s
Computer Hardware & Maintenance/ Information Technology/ Computer Science &
Information Technology
Programme Code : BD/ CM/ CO/ CW/ HA/ IF/ IH
Semester : Third
Course Title : DATA STRUCTURE USING C
Course Code : 313301

I. 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.

II. INDUSTRY / EMPLOYER EXPECTED OUTCOME

Implement algorithm using relevant Data Structures.

III. COURSE LEVEL LEARNING OUTCOMES (COS)

Students will be able to achieve & demonstrate the following COs on completion of course based learning

CO1 - Perform basic operations on Arrays.

CO2 - Apply different Searching and Sorting methods.
CO3 - Implement basic operations on Linked List.
CO4 - Perform operations on Stack using Array and Linked List Implementations.
CO5 - Perform operations on Queue using Array and Linked List Implementations.
CO6 - Create and Traverse Tree to solve problems.

IV. TEACHING-LEARNING & ASSESSMENT SCHEME

Learning Scheme Assessment Scheme
Actual
Contact Based on LL & TL Based
Theory
Course Course Hrs./Week on SL
Course Title Abbr Credits Paper Total
Code Category/s SLH NLH Practical
Duration Marks
FA- SA-
CL TL LL Total FA-PR SA-PR SLA
TH TH
Max Max Max Min Max Min Max Min Max Min
DATA STRUCTURE
313301 DSU DSC 3 1 4 - 8 4 3 30 70 100 40 50 20 25# 10 - - 175
USING C
Total IKS Hrs for Sem. : 0 Hrs
Abbreviations: CL- ClassRoom Learning , TL- Tutorial Learning, LL-Laboratory Learning, SLH-Self Learning
Hours, NLH-Notional Learning Hours, FA - Formative Assessment, SA -Summative assessment, IKS - Indian
Knowledge System, SLA - Self Learning Assessment
Legends: @ Internal Assessment, # External Assessment, *# On Line Examination , @$ Internal Online
Examination
Note :

1. FA-TH represents average of two class tests of 30 marks each conducted during the semester.
2. If candidate is not securing minimum passing marks in FA-PR of any course then the candidate shall be
declared as "Detained" in that semester.
3. If candidate is not securing minimum passing marks in SLA of any course then the candidate shall be
declared as fail and will have to repeat and resubmit SLA work.
4. Notional Learning hours for the semester are (CL+LL+TL+SL)hrs.* 15 Weeks
5. 1 credit is equivalent to 30 Notional hrs.
6. * Self learning hours shall not be reflected in the Time Table.
7. * Self learning includes micro project / assignment / other activities.

MSBTE Approval Dt. 02/07/2024 Semester - 3, K Scheme

DATA STRUCTURE USING C Course Code : 313301

V. THEORY LEARNING OUTCOMES AND ALIGNED COURSE CONTENT

Suggested
Theory Learning Outcomes Learning content mapped with Theory Learning
Sr.No Learning
(TLO's)aligned to CO's. Outcomes (TLO's) and CO's.
Pedagogies.
TLO 1.1 Classify the given Unit - I Introduction to Data Structures
type of Data Structures based 1.1 Introduction: Concept and Need of Data Structure,
on their characteristics and Definition, Abstract Data Type Lecture Using
1 space. 1.2 Types of Data Structures: (i) Linear Data Chalk-Board
TLO 1.2 Perform operations Structures (ii) Non-Linear Data Structures Presentations
on the given type of Data 1.3 Operations on Data Structures: (i) Traversing (ii)
Structure. Insertion (iii) Deletion
TLO 2.1 Develop algorithm to Unit - II Searching and Sorting
search the given key using 2.1 Searching: Searching for an item in a data set Lecture Using
different Searching using the following methods: (i) Linear Search (ii) Chalk-Board
2 Techniques. Binary Search Demonstration
TLO 2.2 Create algorithm to 2.2 Sorting: Sorting of data set in an order using the Presentations
sort data using a given following methods: (i) Bubble Sort (ii) Selection Sort Hands-on
method. (iii) Insertion Sort (iv) Quick Sort (v) Merge Sort
Unit - III Linked List
3.1 Difference between Static and Dynamic Memory
TLO 3.1 Differentiate between
Allocation.
Static and Dynamic Memory
3.2 Introduction to Linked List, Terminologies: Node,
Allocation.
Address, Pointer, Information field / Data field, Next Lecture Using
TLO 3.2 Create a suitable
pointer, Null Pointer, Empty List. Chalk-Board
structure using a Linked List
3 3.3 Type of Lists: Linear List, Circular List, Demonstration
to represent a Node.
Representation of Doubly Linked List. Presentations
TLO 3.3 Create Algorithm to
3.4 Operations on a Singly Linked List: Creating a Hands-on
add or remove a specified
Linked List, Inserting a new node in a Linked List,
item from a Linear Linked
Deleting a node from a Linked List, Searching a key
List.
in Linked List, Traversing a Singly Linked List.
3.5 Applications of Linked List.
TLO 4.1 Represent Stack using Unit - IV Stack
Array and Linked List. 4.1 Introduction to Stack: Definition, Stack as an ADT,
TLO 4.2 Create Algorithm to Operations on Stack-(Push, Pop), Stack Operation
carry out the PUSH and POP Conditions – Stack Full / Stack Overflow, Stack Empty Lecture Using
operations in a Stack. /Stack Underflow. Chalk-Board
4 TLO 4.3 Use Stack to 4.2 Stack Implementation using Array and Demonstration
transform the given representation using Linked List. Presentations
expression from Infix to 4.3 Applications of Stack: Reversing a List, Polish Hands-on
Postfix. Notations, Conversion of Infix to Postfix Expression,
TLO 4.4 Evaluate Postfix Evaluation of Postfix Expression.
Expression. 4.4 Recursion: Definition and Applications.
TLO 5.1 Represent Queue Unit - V Queue
using Array and Linked List. 5.1 Introduction to Queue: Queue as an ADT, Queue
TLO 5.2 Explain the representation in memory using Array and Lecture Using
characteristics of different representation using a Linked List. Chalk-Board
5 types of Queue. 5.2 Types of Queues: Linear Queue, Circular Queue, Demonstration
TLO 5.3 Create Algorithm to Concept of Priority Queue, Double-Ended Queue. Presentations
carry out the INSERT and 5.3 Queue Operations: INSERT, DELETE, Queue Hands-on
DELETE Operations on a Operation Conditions: Queue Full, Queue Empty.
Queue. 5.4 Applications of Queue.

MSBTE Approval Dt. 02/07/2024 Semester - 3, K Scheme

DATA STRUCTURE USING C Course Code : 313301
Suggested
Theory Learning Outcomes Learning content mapped with Theory Learning
Sr.No Learning
(TLO's)aligned to CO's. Outcomes (TLO's) and CO's.
Pedagogies.
TLO 6.1 Describe the given
Unit - VI Tree
Tree Terminology.
6.1 Introduction to Trees Terminologies: Tree, Degree
TLO 6.2 Create a Binary
of a Node, Degree of a Tree, Level of a node, Leaf
Search Tree based on the Lecture Using
Node, Depth / Height of a Tree, In-Degree and Out-
provided data. Chalk-Board
Degree, Path, Ancestor and Descendant Nodes.
6 TLO 6.3 Create Algorithms to Demonstration
6.2 Tree Types and Traversal methods, Types of
Traverse the Tree using the Presentations
Trees: General Tree, Binary Tree, Binary Search Tree
given method. Hands-on
(BST). Binary Tree Traversal: In-Order Traversal,
TLO 6.4 Create an Expression
Preorder Traversal, Post-Order Traversal.
Tree.
6.3 Expression Tree, Heap
TLO 6.5 Create Heap.

VI. LABORATORY LEARNING OUTCOME AND ALIGNED PRACTICAL / TUTORIAL EXPERIENCES.

Practical / Tutorial /
Sr Laboratory Experiment / Practical Titles / Number Relevant
Laboratory Learning Outcome
No Tutorial Titles of hrs. COs
(LLO)
LLO 1.1 Implement Array * Write a ‘C’ program to perform following
1 4 CO1
Operations. Operations on Array: Create, Insert, Delete, Display.
Write a ‘C’ Program to Search a particular data
LLO 2.1 Implement Linear
2 from the given Array of numbers using: Linear 2 CO2
Search Method on Numbers.
Search Method.
* Write a ‘C’ Program to Search a particular data
LLO 3.1 Implement Linear
3 from the given Array of Strings using Linear 2 CO2
Search Method on Strings.
Search Method.
* Write a ‘C’ program to Search a particular data
LLO 4.1 Implement Binary
4 from the given Array of numbers using Binary 2 CO2
Search Method on Numbers.
Search Method.
Write a ‘C’ Program to Search a particular data
LLO 5.1 Implement Binary
5 from the given Array of Strings using Binary 2 CO2
Search Method on Strings.
Search Method.
LLO 6.1 Apply Bubble Sort * Write a ‘C’ Program to Sort an Array of numbers
6 2 CO2
method for Sorting Numbers. using Bubble Sort Method.
LLO 7.1 Apply Bubble Sort Write a ‘C’ Program to Sort an Array of Strings
7 2 CO2
method for Sorting Strings. using Bubble Sort Method.
LLO 8.1 Apply Selection Sort for * Write a ‘C’ Program to Sort an Array of numbers
8 2 CO2
Sorting Numbers. using Selection Sort Method.
LLO 9.1 Apply Selection Sort for Write a ‘C’ Program to Sort an Array of Strings
9 2 CO2
Sorting Strings. using Selection Sort Method.
LLO 10.1 Apply Insertion Sort * Write a ‘C’ Program to Sort an Array of numbers
10 2 CO2
for Sorting Numbers. using Insertion Sort Method.
LLO 11.1 Apply Insertion Sort Write a ‘C’ Program to Sort an Array of Strings
11 2 CO2
for Sorting Strings. using Insertion Sort Method.
* Write a 'C' Program to Implement Singly Linked
LLO 12.1 Create Singly Linked
12 List with Operations: (i) Insert at beginning, (ii) 2 CO3
List.
Search, (iii) Display
LLO 13.1 Perform given * Write a C Program to Implement Singly Linked
Operations on Singly Linked 13 List with Operations: (i) Insert at end, (ii) Insert 2 CO3
List. After, (iii) Delete (iv) Display
LLO 14.1 Create Polynomials Write a C Program to Create Two Polynomials
14 2 CO3
using Linked List. using a Linked List.

MSBTE Approval Dt. 02/07/2024 Semester - 3, K Scheme

DATA STRUCTURE USING C Course Code : 313301
Practical / Tutorial /
Sr Laboratory Experiment / Practical Titles / Number Relevant
Laboratory Learning Outcome
No Tutorial Titles of hrs. COs
(LLO)
LLO 15.1 Perform the Addition
* Write a 'C' Program to add Two Polynomials
of Two Polynomials using a 15 2 CO3
using a Linked List.
Linked List.
LLO 16.1 Perform Operations * Write a 'C' Program to perform PUSH and POP
16 2 CO4
on the Stack using the Array. Operations on Stack using an Array.
LLO 17.1 Perform Operations
* Write a 'C' Program to perform PUSH and POP
on the Stack using a Linked 17 2 CO4
Operations on a Stack using a Linked List.
List.
LLO 18.1 Apply recursive
* Write a 'C' program to perform multiplication of
procedure to multiply two 18 2 CO4
two numbers using recursion.
numbers.
LLO 19.1 Apply recursive Write a 'C' program to print given string in reverse
19 2 CO4
procedure to reverse the string. using recursion.
LLO 20.1 Apply recursive
Write a 'C' program to create a Singly Linked List CO3
procedure to display linked list 20 4
and traverse in reverse order using recursion. CO4
in reverse.
* Write a 'C' Program to perform INSERT and
LLO 21.1 Perform Operations
21 DELETE Operations on Linear Queue using an 2 CO5
on Linear Queue using Array.
Array.
LLO 22.1 Perform Operations * Write a 'C' Program to perform INSERT and
on Linear Queue using Linked 22 DELETE operations on Linear Queue using a 2 CO5
List. Linked List.
* Write a 'C' Program to perform INSERT and
LLO 23.1 Perform Operations
23 DELETE operations on Circular Queue using an 2 CO5
on Circular Queue using Array.
Array.
LLO 24.1 Perform Operations Write a 'C' Program to perform INSERT and
on Circular Queue using a 24 DELETE operations on Circular Queue using a 2 CO5
Linked List. Linked List.
LLO 25.1 Implement Priority Write a 'C' Program to Create a Priority Queue
25 4 CO5
Queue using Linked List. using a Linked List.
LLO 26.1 Implement Binary
* Write a 'C' Program to Implement BST (Binary
Search Tree and perform In- 26 2 CO6
Search Tree) and Traverse in In-Order.
Order Traversal.
LLO 27.1 Implement Tree Write a 'C' Program to Traverse BST in Preorder,
27 2 CO6
Traversal Operations. and Post-Order.
Note : Out of above suggestive LLOs -
'*' Marked Practicals (LLOs) Are mandatory.
Minimum 80% of above list of lab experiment are to be performed.
Judicial mix of LLOs are to be performed to achieve desired outcomes.

VII. SUGGESTED MICRO PROJECT / ASSIGNMENT/ ACTIVITIES FOR SPECIFIC LEARNING / SKILLS
DEVELOPMENT (SELF LEARNING) : NOT APPLICABLE

VIII. LABORATORY EQUIPMENT / INSTRUMENTS / TOOLS / SOFTWARE REQUIRED

Sr.No Equipment Name with Broad Specifications Relevant LLO Number
Computer System with all necessary Peripherals and Internet Connectivity.
1 All
‘C’ Compiler / GCC Compiler/ Online ‘C’ Compiler

IX. SUGGESTED WEIGHTAGE TO LEARNING EFFORTS & ASSESSMENT PURPOSE (Specification Table)
Sr.No Unit Unit Title Aligned COs Learning Hours R-Level U-Level A-Level Total Marks

MSBTE Approval Dt. 02/07/2024 Semester - 3, K Scheme

DATA STRUCTURE USING C Course Code : 313301
Sr.No Unit Unit Title Aligned COs Learning Hours R-Level U-Level A-Level Total Marks
1 I Introduction to Data Structures CO1 2 2 2 0 4
2 II Searching and Sorting CO2 8 2 2 8 12
3 III Linked List CO3 12 2 4 10 16
4 IV Stack CO4 8 2 4 6 12
5 V Queue CO5 6 2 2 6 10
6 VI Tree CO6 9 2 4 10 16
Grand Total 45 12 18 40 70

X. ASSESSMENT METHODOLOGIES/TOOLS

Formative assessment (Assessment for Learning)

Continuous Assessment based on Process and Product related Performance Indicators. Each practical will be
assessed considering 60% weightage to Process and 40% weightage to Product

Summative Assessment (Assessment of Learning)

End semester Examination, Lab performance, Viva-Voce

XI. SUGGESTED COS - POS MATRIX FORM

Programme
Specific
Programme Outcomes (POs)
Outcomes*
(PSOs)
Course PO-5
Outcomes PO-1 Basic Engineering
(COs) and PO-2 PO-3 Design/ PO-4 Practices for PO-7 Life
PO-6 Project PSO- PSO- PSO-
Discipline Problem Development Engineering Society, Long
Management 1 2 3
Specific Analysis of Solutions Tools Sustainability Learning
Knowledge and
Environment
CO1 2 - - 1 - - 1
CO2 2 2 2 1 - - 1
CO3 2 2 2 1 1 1 1
CO4 2 2 2 1 - 1 1
CO5 2 2 2 1 - 1 1
CO6 2 2 2 1 - 1 1
Legends :- High:03, Medium:02,Low:01, No Mapping: -
*PSOs are to be formulated at institute level

XII. SUGGESTED LEARNING MATERIALS / BOOKS

Sr.No Author Title Publisher with ISBN Number
Data Structures with ‘C’ (SIE) (Schaum’s McGraw Hill Education, New Delhi ISBN:
1 Lipschutz
Outline Series) 978-0070701984
McGraw Hill Education, New Delhi 2013,
2 Balgurusamy, E. Data Structures using ‘C’
ISBN: 978-1259029547
McGraw Hill Education, New Delhi 2013,
3 ISRD Group Data Structures using ‘C’
ISBN: 978-12590006401
Yashwant
4 Understanding Pointers in C BPB ISBN 8170298911
Kanetkar

XIII . LEARNING WEBSITES & PORTALS

Sr.No Link / Portal Description
MSBTE Approval Dt. 02/07/2024 Semester - 3, K Scheme
DATA STRUCTURE USING C Course Code : 313301
Sr.No Link / Portal Description
1 https://www.javatpoint.com/data-structure-introduction For All Content
https://www.geeksforgeeks.org/introduction-to-data-structure
2 For All Content
s/
3 https://studytonight.com/data-structures/ For All Content
4 https://www.tutorialspoint.com/data_structures_algorithms/ For All Content
5 https://www.w3schools.in/data-structures/ For All Content
https://www.mygreatlearning.com/blog/data-structure-tutorial
6 For All Content
-for-beginners/
7 https://byjus.com/gate/introduction-to-data-structure-notes/ For All Content
Note :

Teachers are requested to check the creative common license status/financial implications of the suggested
online educational resources before use by the students

MSBTE Approval Dt. 02/07/2024 Semester - 3, K Scheme