Savitribai Phule Pune University, Maharashtra (SPPU), Information Technology Semester 3, Data Structure & Algorithms Syllabus

Data Structure & Algorithms Lecture notes | Videos | Free pdf Download | Previous years solved question papers | MCQs | Question Banks| Syllabus
Get access to 100s of MCQs, Question banks, notes and videos as per your syllabus.
Try Now for free

Unit - 1 Introduction to Data Structures

Unit 1

Introduction

1.1 Introduction to Data Structures Concept of data

1.2 Data object

1.3 Data structure

1.4 Concept of Primitive and nonprimitive

1.5 Linear and Nonlinear

1.6 Static and dynamic

1.7 Persistent and ephemeral data structures

1.8 Definition of ADT

1.9 Analysis of algorithm Frequency count and its importance in analysis of an algorithm

1.10 Time complexity Space complexity of an algorithm Big O ‘Ω and Θ notations

1.11 Sequential Organization Single and multidimensional array and address calculation

1.12 Linked Organization Concept of linked organization

1.13 Singly Linked List Operations Create Display Search Insert Delete

1.14 Doubly Linked List Operations Create Display Search Insert Delete

1.15 Circular Linked List Operations Create Display Search Insert Delete

Unit - 2 Searching and Sorting

Unit 2

Searching and Sorting

2.1 Need of searching and sorting

2.2 Concept of internal and external sorting

2.3 Sort stability

2.4 Searching methods Linear and binary search algorithms Fibonacci Series

2.5 Sorting methods Bubble insertion Quick Merge shell and comparison of all sorting methods

2.6 Analyze Insertion sort Quick Sort binary search hashing for Best Worst and Average case

Unit - 3 Stack &Queue

Unit 3

Stack Queue

3.1 Stack Concept of stack

3.2 Concept of implicit and explicit stack

3.3 Stack as an ADT using sequential and linked organization

3.4 Applications of stack recursion

3.5 Converting expressions from infix to postfix or prefix form

3.6 Evaluating postfix or prefix form

3.7 Queue Concept of queues as ADT

3.8 Implementation of queue using array and linked organization

3.9 Concept of circular queue

3.10 Double ended queue

3.11 Applications of queue priority queue

Unit - 4 Trees

Unit 4

Trees

4.1 Tree Trees and binary treesconcept and terminology

4.2 Expression tree

4.3 Binary tree as an ADT

4.4 Binary search tree

4.5 Recursive and Non recursive algorithms for binary tree traversals

4.6 Binary search tree as ADT Insert Search Delete level wise Display

4.7 Threaded binary tree Concept of threaded binary tree in order preorder and post order

4.8 Preorder and Inorder traversals of inorder threaded binary tree

4.9 Applications of trees

Unit 4

Trees

4.1 Tree Trees and binary treesconcept and terminology

4.2 Expression tree

4.3 Binary tree as an ADT

4.4 Binary search tree

4.5 Recursive and Non recursive algorithms for binary tree traversals

4.6 Binary search tree as ADT Insert Search Delete level wise Display

4.7 Threaded binary tree Concept of threaded binary tree in order preorder and post order

4.8 Preorder and Inorder traversals of inorder threaded binary tree

4.9 Applications of trees

Unit - 6 Hashing and File Organization

Unit 6

Hashing and File Organization

6.1 Hashing Hash tables and scattered tables Basic concepts

6.2 Hash Function

6.3 Characteristics of good hash function

6.4 Different keytoaddress transformations techniques

6.5 Synonyms or Collisions

6.6 Collision resolution techniques linear probing

6.7 Quadratic probing

6.8 RehashingHow hashing works

6.9 Chaining with and without replacement

6.10 File Concept of File

6.11 File types and file organization sequential index sequential and Direct Access

6.12 Comparison of different file organizations

Download IT Sem 3 syllabus pdf
Get access to 100s of MCQs, Question banks, notes and videos as per your syllabus.
Try Now for free
Other Subjects of Semester-1
Discrete mathematics
Basics of computer network
Object-oriented programming
Logic design & computer organization
Popular posts
Top 10 free online resources to learn coding
What is machine learning
Top 10 jobs in information technology
An overview of object oriented programming
What is sorting algorithm
Share  
Link Copied
More than 1 Million students use Goseeko! Join them to feel the power of smart learning.
Spot anything incorrect? Contact us