Data Structures and Applications BCS304

Data Structures and Applications BCS304

Data Structures and Applications BCS304

Course Code: BCS304

Credits: 03

CIE Marks: 50

SEE Marks: 50

Total Marks: 100

Exam Hours: 03

Total Hours of Pedagogy: 40H

Teaching Hours/Weeks: [L:T:P:S] 3:0:0:0

Introduction to Data Structures: Data Structures, Classifications (Primitive & Non-Primitive), Data structure Operations Review of pointers and dynamic Memory Allocation.

Arrays and Structures: Arrays, Dynamic Allocated Arrays, Structures and Unions, Polynomials, Sparse Matrices, representation of Multidimensional Arrays.

Strings Stacks: Stacks, Stacks Using Dynamic Arrays, Evaluation and conversion of Expressions.

Queues: Queues, Circular Queues, Using Dynamic Arrays, Multiple Stacks and queues.

Linked Lists: Singly Linked, Lists and Chains, Representing Chains in C, Linked Stacks and Queues, Polynomials.

Linked Lists: Additional List Operations, Sparse Matrices, Doubly Linked List.

Trees: Introduction, Binary Trees, Binary Tree Traversals, Threaded Binary Trees.

Trees(Cont..): Binary Search trees, Selection Trees, Forests, Representation of Disjoint sets, Counting Binary Trees.

Graphs: The Graph Abstract Data Types, Elementary Graph Operations.

Hashing: Introduction, Static Hashing, Dynamic Hashing.

Priority Queues: Single and double ended Priority Queues, Leftist Trees.

Introduction to Efficient Binary Search Trees: Optimal Binary Search Trees.

2022 SCHEME QUESTION PAPER

Model Set 1 Paper

Model Set 1 Paper Solution

Regular Paper

2021 SCHEME QUESTION PAPER

Regular Paper

Back Paper

2018 SCHEME QUESTION PAPER

Previous Year Paper 1

Previous Year Paper 1 Solution

Previous Year Paper 2

Previous Year Paper 2 Solution

Leave a Reply

Your email address will not be published. Required fields are marked *