Page 51 - Microsoft Word - B.Tech. Course Structure (R20) WITH 163 CREDITS

JNTUA College of Engineering (Autonomous), Ananthapuramu
Department of Computer Science & Engineering
DATA STRUCTURES
Course Code: Semester III(R20) L T P C : 3 0 0 3
Course Objectives:
• To impart the basic concepts of data structures and algorithms
• To understand the concepts about searching and sorting techniques
• To understanding about writing algorithms and step by step approach in solving problems with the
help of fundamental data structures
• To Understand basic concepts about stacks, queues, lists, trees and graphs

Course Outcomes:
CO1: Ability to analyze the efficiency of program based on time complexity.
CO2: Implement Abstract data types using arrays and linked list.
CO3: Apply the different linear data structures like stack and queue to various computing problems.
CO4: Describe the hash function and concepts of collision and its resolution methods.
CO5: Able to apply principles and concepts of graph theory in practical situations.

UNIT – I: Introduction
Introduction and Overview: Definitions, Algorithms, Algorithm efficiency: Linear loops, logarithmic
loops, Nested loops, Big-O notation, Standard measures of Efficiency, Big-O Analysis Examples, Abstract
Data Types – Advantages of ADT, Concept of Data Structure, Over view of Data Structures,
Implementation of Data Structures.
Sequential Storage Representation: Arrays, operations on Arrays – insertion, deletion, Traversing,
Applications of Arrays - Linear Search, Binary Search, Insertion Sort, Merging of Arrays

UNIT – II: Linked Lists
Linked Lists: Definition, Single lined list: Representation of list in memory, Operations of single linked
list, Circular linked list; Double Linked List: Operations of Double linked list; Applications of linked list:
Sparse Matrix Manipulations, Polynomial representation.

UNIT – III: Stacks & Queues
Stacks: Introduction, Definition, Representation of stack: Array representation, Linked representation,
Operations of stack, Applications of Stack: Evaluations of Arithmetic Expressions, Expression Conversion,
Towers of Hanoi Problem.
Queues: Introduction, Definition, Representation of Queues: Array representation, Linked representation,
Operations of Queues.

UNIT – IV: Queues & Hash Tables
Various Queue Structures: Circular Queue, Dequeue, Priority Queue, Applications of Queues.
Hash Tables: Hashing Techniques, Collision Resolution Techniques, Closed Hashing, Open Hashing,
Comparison of Collision Resolution Techniques.

UNIT – V: Trees
Trees: Basic Terminologies, Definition and Concepts, Binary Tree, Properties of Binary Tree,
Representation of Binary Tree, Binary Tree Traversals. Binary Search Tree: Binary Search Tree Properties,
Binary Search Trees Operations, AVL Search Trees.

Mdv
Mdv