Syllabus

Data Structure

Unit I: Introduction to Data Structure & Arrays

(8 Hours | 8 Marks)

Data Structure

• Introduction to Data Structure
• Types of Data Structure:
  • Primitive and Non-Primitive
  • Linear and Non-Linear
• Data Structure Operations

Array

• Definition and Concepts
• Memory Representation
• Operations:
  • Traversing
  • Insertion
  • Deletion

📌 Note: Use any suitable pedagogical technique for teaching.

Unit II: Stacks and Queues

(7 Hours | 7 Marks)

Stacks

• Definition and Concepts
• Memory Representation
• Operations:
  • Traversing
  • Insertion
  • Deletion

Queues

• Definition and Concepts
• Memory Representation
• Operations:
  • Traversing
  • Insertion
  • Deletion
• Types of Queues

Unit III: Linked List and Trees

(8 Hours | 8 Marks)

Linked List

• Definition and Concepts
• Memory Representation
• Types of Linked List
• Operations:
  • Traversing
  • Insertion
  • Deletion

Tree

• Definition and Terminologies
• Memory Representation of Trees
• Types of Trees:
  • Binary Trees
  • Complete Binary Trees
  • Binary Search Trees
• Tree Traversals:
  • Preorder
  • Inorder
  • Postorder
• Operations:
  • Insertion
  • Deletion

Unit IV: Searching and Sorting

Searching and Sorting

• Definition and Concepts

Searching Techniques

• Linear Search
• Binary Search
• Indexed Sequential Search

Sorting Techniques

• Bubble Sort
• Selection Sort
• Insertion Sort
• Radix Sort
• Merge Sort
• Quick Sort

Students will be able to -

1. Learn the basic types for data structure, implementation and application.

2. Know the strength and weakness of different data structures.

3. Use the appropriate data structure in context of solution of given problem.

4. Develop programming skills which require to solve given problem.