Scribd
Upload
138 views3 pages

Dsa Syllabus

This document outlines the syllabus for a course on data structures and algorithms. The syllabus covers 5 units: (1) data structures and basic algorithms like searching and sorting, (2) linked lists, (3) queues and stacks, (4) trees, and (5) graphs. Key data structures covered include arrays, linked lists, stacks, queues, trees, and graphs. Common operations on each are also discussed like insertion, deletion, traversal. Textbooks and online references are provided.

Uploaded by

amaravathi R
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
138 views3 pages

Dsa Syllabus

This document outlines the syllabus for a course on data structures and algorithms. The syllabus covers 5 units: (1) data structures and basic algorithms like searching and sorting, (2) linked lists, (3) queues and stacks, (4) trees, and (5) graphs. Key data structures covered include arrays, linked lists, stacks, queues, trees, and graphs. Common operations on each are also discussed like insertion, deletion, traversal. Textbooks and online references are provided.

Uploaded by

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

DATA STRUCTURES AND ALGORITHMS

SYLLABUS

UNIT-1
Data Structures - Definition, Classification of Data Structures, Operations on Data Structures,
Abstract Data Type (ADT), Preliminaries of algorithms. Time and Space complexity.
Searching - Linear search, Binary search, Fibonacci search.
Sorting- Insertion sort, Selection sort, Exchange (Bubble sort, quick sort), distribution (radix
sort), merging (Merge sort) algorithms.
UNIT -2
Linked List: Introduction, Single linked list, Representation of Linked list in memory,
Operations on Single Linked list-Insertion, Deletion, Search and Traversal ,Reversing Single
Linked list, Applications on Single Linked list, Polynomial Expression Representation, Addition
and Multiplication, Sparse Matrix Representation using Linked List, Advantages and
Disadvantages of Single Linked list, Double Linked list-Insertion, Deletion, Circular Linked list-
Insertion, Deletion.
UNIT – 3:
Queues: Introduction to Queues, Representation of Queues-using Arrays and using Linked list,
Implementation of Queues-using Arrays and using Linked list, Application of Queues- Circular
Queues, Deques, Priority Queues, Multiple Queues.
Stacks: Introduction to Stacks, Array Representation of Stacks, Operations on Stacks, Linked list
Representation of Stacks, Operations on Linked Stack, Applications-Reversing list, Factorial
Calculation, Infix to Postfix Conversion, Evaluating Postfix Expressions.
UNIT – 4
Trees: Basic Terminology in Trees, Binary Trees-Properties, Representation of Binary Trees
using Arrays and Linked lists. Binary Search Trees- Basic Concepts, BST Operations: Insertion,
Deletion, Tree Traversals.
UNIT – 5
Graphs: Basic Concepts, Representations of Graphs-Adjacency Matrix and using Linked list,
Graph Traversals (BFT & DFT), Applications- Minimum Spanning Tree Using Prims &
Kruskals Algorithm, Dijkstra’s shortest path
Text(T) / Reference(R) Books:
T1 Data Structures Using C. 2nd Edition.Reema Thareja,Oxford.
T2 Data Structures and algorithm analysis in C, 2nded, Mark AllenWeiss.
R1 Fundamentals of Data Structures in C, 2nd Edition, Horowitz, Sahni, Universities Press.
R2 Data Structures: A PseudoCode Approach, 2/e, Richard F.Gilberg, Behrouz A.
Forouzon,Cengage.
R3 Data Structures with C, Seymour LipschutzTMH
W1 http://algs4.cs.princeton.edu/home/
Data Structures
Definition:
A data structure is basically a group of data elements that are put together under one name, and which
defines a particular way of storing and organizing data in a computer so that it can be used efficiently.

BASIC TERMINOLOGY

 Data − Data are values or set of values.


 Data Item − Data item refers to single unit of values.
 Group Items − Data items that are divided into sub items are called as Group Items.
 Elementary Items − Data items that cannot be divided are called as Elementary Items.
 Attribute and Entity − An entity is that which contains certain attributes or properties, which
may be assigned values.
 Entity Set − Entities of similar attributes form an entity set.
 Field − Field is a single elementary unit of information representing an attribute of an entity.
 Record − Record is a collection of field values of a given entity.
 File − File is a collection of records of the entities in a given entity set.

CLASSIFICATION OF DATA STRUCTURES:

Data structures are generally categorized into two classes: primitive and non-primitive data structures.

Primitive and Non-primitive Data Structures

Types of Data Structures

There are two types of data structures:

o Primitive data structure


o Non-primitive data structure

Primitive Data structure

The primitive data structures are primitive data types. The int, char, float, double, and pointer are the
primitive data structures that can hold a single value.

Non-Primitive Data structure

The non-primitive data structure is divided into two types:

o Linear data structure


o Non-linear data structure

Linear Data Structure


The arrangement of data in a sequential manner is known as a linear data structure. The data structures
used for this purpose are Arrays, Linked list, Stacks, and Queues. In these data structures, one element is
connected to only one another element in a linear form.

When one element is connected to the 'n' number of elements known as a non-linear data structure.
The best example is trees and graphs. In this case, the elements are arranged in a random manner.

We will discuss the above data structures in brief in the coming topics. Now, we will see the common
operations that we can perform on these data structures.

Data structures can also be classified as:

o Static data structure: It is a type of data structure where the size is allocated at the compile
time. Therefore, the maximum size is fixed.
o Dynamic data structure: It is a type of data structure where the size is allocated at the run time.
Therefore, the maximum size is flexible.

You might also like