Scribd
Upload
12 views

CA202 Data Structures and Algorithms

This document provides an overview of the CA202 Data structures and Algorithms course, which covers: 1) Abstract data types, data representation, and primitive data structures like arrays, stacks, queues, and multidimensional arrays. 2) Linked lists, memory allocation strategies, and trees including binary trees, binary search trees, and graph representations. 3) Sorting algorithms like insertion sort, selection sort, merge sort, and hashing schemes. 4) Reference books on data structures and algorithms.

Uploaded by

હિરેનપ્રફુલચંદ્રજોષી
Copyright
© © All Rights Reserved
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
12 views

CA202 Data Structures and Algorithms

This document provides an overview of the CA202 Data structures and Algorithms course, which covers: 1) Abstract data types, data representation, and primitive data structures like arrays, stacks, queues, and multidimensional arrays. 2) Linked lists, memory allocation strategies, and trees including binary trees, binary search trees, and graph representations. 3) Sorting algorithms like insertion sort, selection sort, merge sort, and hashing schemes. 4) Reference books on data structures and algorithms.

Uploaded by

હિરેનપ્રફુલચંદ્રજોષી
Copyright
© © All Rights Reserved
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 1

CA202 Data structures and Algorithms

[CREDITS – 3]

1. Abstract data types (ADT) and system defined data types, Data representation and
primitive data structures.

Design and analysis of algorithm: Top-down and Bottom-up approaches to algorithm


design, Algorithm analysis – the need for algorithm analysis, asymptotic notations,
frequency count, complexity measures in terms of time and space.

Arrays: implementation of an arrays class, representation of Stakes and queues using


arrays, circular queues, applications of stakes – conversion from infix to postfix
expressions, evaluation of postfix expressions, recursion. Representation of
multidimensional arrays.

2. Linked lists: Singly linked list, circular linked list, doubly linked list, generalized lists.
Implementing operations on lists as member functions/ operators.

Memory allocation strategies – First fit and best fit approaches, boundary tag method;
memory freeing algorithm in each case.

3. Trees: binary trees, representation of trees, binary tree traversal method, threaded binary
tress, Applications of trees – binary search trees, Sets, decision and game trees.

Symbol tables: Static symbol tree, Hash tables, dynamic tree tables.

Graphs: Graph representations – adjacency matrix, adjacency list, and adjacency


multilists. Traversal schemes – Depth first search and breadth first search, Application of
graph traversals- connected components, spanning trees.

4. Sorting: Internal sorting – Insertion sort, selection sort, bubble sort, merge sort, quick
sort, Heap sort, sorting on multiple keys; External sorting – Sorting with disks,
overlapping I/O operations and processing.

Searching: Sequential and binary searches, indexed search, Hashing schemes – Hash
functions, Open hashing and closed hashing.

Reference books:

1. Easwarakumar, K. S.: Object oriented data structures using C++, Vikas Publishing House,
2000.
2 Tremblay and Sarenson (1984): An introduction to data structures with algorithm, McGraw
Hill.
3. Rober L. Kruse (1987): Data structures and program design, Prentice Hall.
4. A.M.Tennenbaum et. Al. (1992): Data structure using C, Prentice Hall.
5. Knuth Donald E (1975): The art of computer programming, Addison Wesley.

You might also like