In eduladder you can Ask,Answer,Listen,Earn and Download Questions and Question papers.

Watch related videos of your favorite subject.

Connect with students from different parts of the world.

Apply or Post Jobs, Courses ,Internships and Volunteering opportunity. For FREE

See Our team

Wondering how we keep quality?

Got unsolved questions? Ask Questions

You are here:Open notes-->VTU-->Data-StructuresDS-10CS35

**Data StructuresDS 10CS35**

# How to study this subject

# Usefull vedios

** DATA STRUCTURES WITH C**

(Common to CSE & ISE)

Subject Code: 10CS35

Hours/Week : 04

Total Hours : 52

I.A. Marks : 25

Exam Hours: 03

Exam Marks: 100

PART � A

UNIT - 1

8 Hours**BASIC CONCEPTS**: Pointers and Dynamic Memory Allocation,

Algorithm Specification, Data Abstraction, Performance Analysis,

Performance Measurement

UNIT - 2

6 Hours**ARRAYS and STRUCTURES: **Arrays, Dynamically Allocated Arrays,

Structures and Unions, Polynomials, Sparse Matrices, Representation of

Multidimensional Arrays

UNIT - 3

6 Hours**STACKS AND QUEUES:** Stacks, Stacks Using Dynamic Arrays, Queues,

Circular Queues Using Dynamic Arrays, Evaluation of Expressions,

Multiple Stacks and Queues.

UNIT - 4

6 Hours**LINKED LISTS: **Singly Linked lists and Chains, Representing Chains in

C, Linked Stacks and Queues, Polynomials, Additional List operations,

Sparse Matrices, Doubly Linked Lists

PART - B

UNIT - 5

6 Hours**TREES � 1: **Introduction, Binary Trees, Binary Tree Traversals, Threaded

Binary Trees, Heaps.

UNIT - 6

6 Hours**TREES � 2, GRAPHS**: Binary Search Trees, Selection Trees, Forests,

Representation of Disjoint Sets, Counting Binary Trees, The Graph Abstract

Data Type.

UNIT - 7

6 Hours

PRIORITY QUEUES Single- and Double-Ended Priority Queues, LeftistUNIT - 8

8 Hours**EFFICIENT BINARY SEARCH TREES:** Optimal Binary Search Trees,

AVL Trees, Red-Black Trees, Splay Trees.

Text Book:

1. Horowitz, Sahni, Anderson-Freed: Fundamentals of Data Structures

in C, 2 nd Edition, Universities Press, 2007.

(Chapters 1, 2.1 to 2.6, 3, 4, 5.1 to 5.3, 5.5 to 5.11, 6.1, 9.1 to 9.5,

10)**Reference Books:**

1. Yedidyah, Augenstein, Tannenbaum: Data Structures Using C and

C++, 2 nd Edition, Pearson Education, 2003.

2. Debasis Samanta: Classic Data Structures, 2 nd Edition, PHI, 2009.

3. Richard F. Gilberg and Behrouz A. Forouzan: Data Structures A

Pseudocode Approach with C, Cengage Learning, 2005.