Home/Degree/CS3301
Back to Degree
CS3301Actively Used

Data Structures

This course is part of the B.E. Computer Science Engineering curriculum under Anna University Regulation 2021. The knowledge from this course continues to be actively applied in professional software development.

Semester 3 (Second Year)
3 Credits
45 Lecture Hours

Course Overview

  • UniversityAnna University
  • Regulation2021
  • Semester3
  • Credits3
  • TypeCore
  • Units5

Course Objectives

1

To understand the concepts of ADTs

2

To learn linear data structures – lists, stacks, and queues

3

To understand non-linear data structures – trees and graphs

4

To understand sorting, searching, and hashing algorithms

5

To apply Tree and Graph structures

Syllabus

Detailed unit-wise breakdown of the course curriculum as per Anna University Regulation 2021.

1

LISTS

9 Hours
Abstract Data Types (ADTs)List ADT – Array-based implementationLinked list implementationSingly linked listsCircularly linked listsDoubly-linked listsApplications of listsPolynomial ADTRadix SortMultilists
2

STACKS AND QUEUES

9 Hours
Stack ADT – OperationsApplications – Balancing SymbolsEvaluating arithmetic expressionsInfix to Postfix conversionFunction CallsQueue ADT – OperationsCircular QueueDeQueueApplications of Queues
3

TREES

9 Hours
Tree ADT – Tree TraversalsBinary Tree ADTExpression treesBinary Search Tree ADTAVL TreesPriority Queue (Heaps)Binary Heap
4

MULTIWAY SEARCH TREES AND GRAPHS

9 Hours
B-TreeB+ TreeGraph DefinitionRepresentation of GraphsTypes of GraphBreadth-first traversalDepth-first traversalBi-connectivityEuler circuitsTopological SortDijkstra's algorithmMinimum Spanning TreePrim's algorithmKruskal's algorithm
5

SEARCHING, SORTING AND HASHING

9 Hours
Searching – Linear SearchBinary SearchSorting – Bubble sortSelection sortInsertion sortShell sortMerge SortHashing – Hash FunctionsSeparate ChainingOpen AddressingRehashingExtendible Hashing

Course Outcomes

Upon completion of this course, students will be able to:

CO1

Define linear and non-linear data structures

CO2

Implement linear and non–linear data structure operations

CO3

Use appropriate linear/non–linear data structure operations for solving a given problem

CO4

Apply appropriate graph algorithms for graph applications

CO5

Analyze the various searching and sorting algorithms

Industry Application & Relevance

How the concepts learned in this course are applied in real-world software development projects across Banking, Healthcare, and Enterprise domains over 20+ years of experience.

Professional Application

Core of all software development - Arrays, Trees, Graphs, HashMaps

Textbooks & References

Textbooks

  • Mark Allen Weiss, 'Data Structures and Algorithm Analysis in C', Pearson Education
  • Reema Thareja, 'Data Structures Using C', Oxford University Press

Reference Books

  • Thomas H. Cormen et al., 'Introduction to Algorithms', PHI Learning
  • Aho, Hopcroft and Ullman, 'Data Structures and Algorithms', Pearson Education

Related Courses from Semester 3

Other courses from the same semester that are actively used in professional work.

MA3354Discrete Mathematics

Algorithm analysis, cryptography, database theory

CS3351Digital Principles and Computer Organization

Hardware-software interface, performance optimization

CS3352Foundations of Data Science

Big data analytics, business intelligence, data-driven decisions

CS3391Object Oriented Programming

Java, Spring Boot, enterprise application development