Scribd
Upload
18 views

102840402_Data Structures IT

The document outlines the curriculum for the Diploma in Engineering (Computer Engineering) course on Data Structures for the academic batch 2023-24. It includes course objectives, a detailed syllabus covering various data structures, practical assignments, reference materials, and evaluation methods. The course aims to equip students with the understanding and application of data structures to solve real-world problems.

Uploaded by

smitramraje2210
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
18 views

102840402_Data Structures IT

The document outlines the curriculum for the Diploma in Engineering (Computer Engineering) course on Data Structures for the academic batch 2023-24. It includes course objectives, a detailed syllabus covering various data structures, practical assignments, reference materials, and evaluation methods. The course aims to equip students with the understanding and application of data structures to solve real-world problems.

Uploaded by

smitramraje2210
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

FACULTY OF ENGINEERING & TECHNOLOGY

Effective from Academic Batch: 2023-24

Programme: Diploma in Engineering (Computer Engineering)

Semester: IV

Course Code: 102840402

Course Title: Data Structures

Course Group: Program Core Course

Course Objectives: This subject helps to understand fundamental concepts of the data structure. By
understanding various data structures and their applications, students can identify solutions to real time
problems by applying the appropriate data structure to represent the data.

Teaching & Examination Scheme:


Contact hours per week Course Examination Marks (Maximum / Passing)
Credits Internal External
Lecture Tutorial Practical Total
Theory J/V/P* Theory J/V/P*
3 0 2 4 50/18 25/9 50/17 25/9 150/53
* J: Jury; V: Viva; P: Practical

Detailed Syllabus:

Sr. Contents
1 Introduction to Data Structures:
Introduction, Importance of Data Structures, Type of Data Structures: Primitive & Non-
Primitive Data Structures, Linear and Non-Linear Data Structures; Algorithm, 5
Efficiency of an Algorithm, Introduction to Time and Space Complexity, and Asymptotic
notation.
2 Array:
Basic concepts of Array, Single and Multidimensional Arrays, operations on array like
5
insert, delete, search; Representation of Arrays: Row Major Order, and Column Major
Order, Application of arrays.
3 Stack and Queue:
Stack: Definition, Concepts, Operations on Stack: Push, Pop, Peep, Implementation of
stack using array, Applications of Stack, Infix, Prefix, Postfix notations, Infix to Postfix 10
conversion, Evaluation of postfix expression, Recursion
Queue:
Definition, Concepts, Array implementation of Queue, Operations on Queue: Insert,
Delete; Limitations of Simple Queue, Circular queue, Priority Queue, Applications of
Queue.
4 Linked List:
Definition, Concepts, Types of linked lists, Basic operations on singly linked list: Insert,
6
Delete, Search, Count the number of nodes in linked list, Implementing a linked list
using pointers, Stack and Queue using Linked List
5 Sorting and Searching:
Introduction to Sorting, Bubble Sort, Insertion Sort, Selection Sort, and Quick Sort.
8
Linear search, binary search.
Introduction to hashing, Hash functions, and Hash Collision.
6 Non-Linear Data Structures:
Introduction to Trees: Binary Trees and traversal; Basic concepts of Graphs and 6
Traversal, Applications of Trees and Graphs.
Total 40

List of Practicals / Tutorials:


1 Write a program to search maximum and minimum elements from the array.
2 Write a program to perform matrix multiplication using 2-Dimensional Arrays.
3 Write a program to insert/delete an element in a linear array at a specific position.
4 Write a program to implement stack using array for the following operations:
Push, Pop, Peek, IsEmpty, IsFull, Display.
5 Write a program to evaluate a postfix expression.
6 Write a recursive program to find the factorial of a given number.
Write a recursive program to generate a fibonacci series.
7 Write a program to implement a simple queue using array for the following operations:
1. Insert, Delete, IsEmpty, IsFull, Display.
8 Write a program to implement singly linked list for the following operations:
1. Create a Singly linked list and traverse it.
2. Count the number of nodes in a given linked list.
9 Write a program to perform following operations on singly linked list:
1. Insert a new node in the beginning and at the end of the linked list.
2. Delete first and last node from the linked list.
10 Write a program to implement the following sorting algorithms:
1. Bubble Sort
2. Selection Sort
11 Write a program to search an element from an array using linear and binary search methods.
12 Implement a binary tree using arrays.
Reference Books:
1 Data and File Structures using C, Reema Thareja.
2 Data Structures using C & C++ -By Tanenbaum Publisher – Prentice-Hall International.
3 Data Structures by Seymour Lipchutz, Tata McGraw Hill.

Supplementary learning Material:


1 NPTEL courses
2 Coursera courses

Pedagogy:
● Direct classroom teaching
● Audio Visual presentations/demonstrations
● Assignments/Quiz
● Continuous assessment
● Seminar/Poster Presentation

Internal Evaluation
The internal evaluation includes a combination of various components such as Certification courses,
Assignments, Mini Project, Simulation, Model making, Case study, Group activity, Seminar, Poster
Presentation, Unit test, Quiz, Class Participation, Attendance, Achievements etc. where individual
component weightage should not exceed 20%.

Suggested Specification table with Marks (Theory) (Revised Bloom’s Taxonomy):


Distribution of Theory Marks R: Remembering; U: Understanding; A: Application,
R U A N E C N: Analyze; E: Evaluate; C: Create
10% 30% 40% 20% - -
Note: This specification table shall be treated as a general guideline for students and teachers. The actual distribution of
marks in the question paper may vary slightly from above table.

Course Outcomes (CO):


Sr. Course Outcome Statements %
No. Weightage
CO-1 Demonstrate an understanding of various data structures, including their
30
types, and their importance in programming.
CO-2 Understand and apply linear data structures for different applications. 30
CO-3 Apply and compare various sorting and searching algorithms. 20
CO-4 Implement fundamental data structures with essential operations. 20
Curriculum Revision:

Version: 1.0

Drafted on (Month-Year): Jan-2024

Last Reviewed on (Month-Year): --

Next Review on (Month-Year): Jan-2027

You might also like