Scribd
Upload
983 views1 page

Data Structure

This document outlines the aim and objectives of a course on data structures. The aim is to provide in-depth knowledge of problem solving techniques and data structures. The objectives are to learn systematic problem solving, organizing large amounts of data, programming in C, implementing various data structures efficiently, and solving specific problems efficiently. The course covers topics like problem solving, lists, stacks, queues, trees, sorting, and graphs through 5 units. It lists 2 textbooks and 3 references for the course.

Uploaded by

prayog8
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
983 views1 page

Data Structure

This document outlines the aim and objectives of a course on data structures. The aim is to provide in-depth knowledge of problem solving techniques and data structures. The objectives are to learn systematic problem solving, organizing large amounts of data, programming in C, implementing various data structures efficiently, and solving specific problems efficiently. The course covers topics like problem solving, lists, stacks, queues, trees, sorting, and graphs through 5 units. It lists 2 textbooks and 3 references for the course.

Uploaded by

prayog8
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 1

DATA STRUCTURE

AIM

To provide an in-depth knowledge in problem solving techniques and data structures.


OBJECTIVE

* To learn the systematic way of solving problems


* To understand the different methods of organizing large amounts of data
* To learn to program in C
* To efficiently implement the different data structures
* To efficiently implement solutions for specific problems
UNIT - 1 : PROBLEM SOLVING
Problem solving - Top-down Design - Implementation - Verification - Efficiency - Analysis -
Sample algorithms.
UNIT - 2 : LISTS, STACKS AND QUEUES
Abstract Data Type (ADT) - The List ADT - The Stack ADT - The Queue ADT
UNIT - 3 : TREES
Preliminaries - Binary Trees - The Search Tree ADT - Binary Search Trees - AVL Trees - Tree
Traversals - Hashing - General Idea - Hash Function - Separate Chaining - Open Addressing -
Linear Probing - Priority Queues (Heaps) - Model - Simple implementations - Binary Heap
UNIT - 4 : SORTING
Preliminaries - Insertion Sort - Shellsort - Heapsort - Mergesort - Quicksort - External Sorting
UNIT - 5 : GRAPHS
Definitions - Topological Sort - Shortest-Path Algorithms - Unweighted Shortest Paths -
Dijkstra's Algorithm - Minimum Spanning Tree - Prim's Algorithm - Applications of Depth-
First Search - Undirected Graphs - Biconnectivity - Introduction to NP-Completeness
TEXT BOOKS

1. R. G. Dromey, "How to Solve it by Computer" (Chaps 1-2), Prentice-Hall of India, 2002.


2. M. A. Weiss, "Data Structures and Algorithm Analysis in C", 2nd ed, Pearson Education
Asia, 2002. (chaps 3, 4.1-4.4 (except 4.3.6), 4.6, 5.1-5.4.1, 6.1-6.3.3, 7.1-7.7 (except 7.2.2,
7.4.1, 7.5.1, 7.6.1, 7.7.5, 7.7.6), 7.11, 9.1-9.3.2, 9.5-9.5.1, 9.6-9.6.2, 9.7)
REFERENCES

1. Y. Langsam, M. J. Augenstein and A. M. Tenenbaum, "Data Structures using C", Pearson


Education Asia, 2004
2. Richard F. Gilberg, Behrouz A. Forouzan, "Data Structures - A Pseudocode Approach with
C", Thomson Brooks / COLE, 1998.
3. Aho, J. E. Hopcroft and J. D. Ullman, "Data Structures and Algorithms", Pearson education
Asia, 1983.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy