Syllabus Data Structures R13 Regulation Btech JNTUK-kakinada Syllabus download

Syllabus , Data Structures, R13 Regulation, Btech , JNTUK,Syllabus, download,

DATA STRUCTURES Syllabus R13 Regulation

Unit - I

Data structure- Definition, types of data structures Recursion: Definition, Design Methodology and Implementation of recursive algorithms, Linear and binary recursion, recursive algorithms for factorial function, GCD computation, Fibonacci sequence, Towers of Hanoi, Tail recursion.

List Searches using Linear Search, Binary Search, Fibonacci Search Sorting Techniques: Basic concepts, Sorting by : insertion (Insertion sort), selection (heap sort), exchange (bubble sort, quick sort), distribution (radix sort ) and merging (merge sort ) Algorithms.

Unit - II

Stacks and Queues: Basic Stack Operations, Representation of a Stack using Arrays, Stack Applications: Reversing list, Factorial Calculation, Infix to postfix Transformation, Evaluating Arithmetic Expressions.

Queues: Basic Queues Operations, Representation of a Queue using array, Implementation of Queue Operations using Stack, Applications of Queues- Round robin Algorithm, Circular Queues, Priority Queues.

Unit - III

Linked Lists: Introduction, single linked list, representation of a linked list in memory, Operations on a single linked list, Reversing a single linked list, applications of single linked list to represent polynomial expressions and sparse matrix manipulation, Advantages and disadvantages of single linked list, Circular linked list, Double linked list

Unit - IV

Trees: Basic tree concepts, Binary Trees: Properties, Representation of Binary Trees using arrays and linked lists, operations on a Binary tree , Binary Tree Traversals (recursive), Creation of binary tree from in, pre and post order traversals

Unit - V

Advanced concepts of Trees: Tree Travels using stack (non recursive), Threaded Binary Trees. Binary search tree, Basic concepts, BST operations: insertion, deletion, Balanced binary trees – need, basics and applications in computer science (No operations).

Unit - VI

Graphs: Basic concepts, Representations of Graphs: using Linked list and adjacency matrix, Graph algorithms. Graph Traversals (BFS & DFS), applications: Dijkstra’s shortest path, Transitive closure, Minimum Spanning Tree using Prim’s Algorithm, warshall’s Algorithm (Algorithemic Concepts Only, No Programs required).

Text Books

1. Data Structure with C, Seymour Lipschutz, TMH
2. Data Structures using C,Reema Thareja, Oxford
3. Data Structures, 2/e, Richard F, Gilberg , Forouzan, Cengage
4. Data structures and algorithm analysis in C, 2nd ed, mark allen weiss

Reference Books

1. Data Structures and Algorithms, 2008,G.A.V.Pai, TMH
2. Classic Data Structures, 2/e, Debasis ,Samanta,PHI,2009
3. Fundamentals of Data Structure in C, 2/e, Horowitz,Sahni, Anderson Freed,University Prees.

For other Subject Syllabus Click here

IF you don't find something you are searching for contact us

Plzz Like us