Scribd
Upload
27 views1 page

Boe306/ Boe406/Boe306H/ Boe406H Basics Data Structures and Algorithm

The document outlines the course outcomes and detailed syllabus for a course on basic data structures and algorithms. Students will learn about various data structures, their representations, computational efficiency, and implementations, including arrays, linked lists, stacks, queues, trees, and graphs. The course also covers sorting and searching algorithms, recursion, and performance analysis of data structures.

Uploaded by

sniperdevil786
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
27 views1 page

Boe306/ Boe406/Boe306H/ Boe406H Basics Data Structures and Algorithm

The document outlines the course outcomes and detailed syllabus for a course on basic data structures and algorithms. Students will learn about various data structures, their representations, computational efficiency, and implementations, including arrays, linked lists, stacks, queues, trees, and graphs. The course also covers sorting and searching algorithms, recursion, and performance analysis of data structures.

Uploaded by

sniperdevil786
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

BOE306/ BOE406/BOE306H/ BOE406H BASICS DATA STRUCTURES AND ALGORITHM

Course Outcome ( CO) Bloom’s Level (KL)


At the end of course , the student will be able to understand
CO 1 Describe how arrays, linked lists, stacks, queues, trees, and graphs are represented in memory, used by K1, K2
the algorithms and their common applications.

CO 2 Discuss the computational efficiency of the sorting and searching algorithms. K2

CO 3 Implementation of Trees and Graphs and perform various operations on these data structure. K3

CO 4 Understanding the concept of recursion, application of recursion and its implementation and removal of K4
recursion.
CO 5 Identify the alternative implementations of data structures with respect to its performance to solve a real K5, K6
world problem.

DETAILED SYLLABUS
Unit Topic Lecture
I Introduction: Basic Terminology, Elementary Data Organization, Built in Data Types in C, 08
Efficiency of an Algorithm, Asymptotic notations, Abstract Data Types (ADT)
Arrays: Definition, Single and Multidimensional Arrays, Representation of Arrays: Row Major
Order, and Column Major Order.

Linked lists: Array Implementation and Pointer Implementation of Singly Linked Lists, Doubly
Linked List, Circularly Linked List, Operations on a Linked List. Insertion, Deletion, Traversal,
Polynomial Representation and Addition Subtraction & Multiplications of Single variable & Two
variables Polynomial.

II Stacks: Abstract Data Type, Primitive Stack operations: Push & Pop, Array and Linked 08
Implementation of Stack in C, Application of stack: Prefix and Postfix Expressions, Evaluation of
postfix expression, Iteration and Recursion- Principles of recursion, Tail recursion, Fibonacci
numbers, and Hanoi towers, Tradeoffs between iteration and recursion.

Queues: Operations on Queue: Create, Add, Delete, Full and Empty, Circular queues, Array and
linked implementation of queues in C, Dequeue and Priority Queue.

III Searching: Concept of Searching, Sequential search, Index Sequential Search, Binary Search. 08
Concept of Hashing & Collision resolution Techniques used in Hashing.

Sorting: Insertion Sort, Selection, Bubble Sort, Quick Sort, Merge Sort, Heap Sort and Radix Sort.

IV Trees: Basic terminology used with Tree, Binary Trees, Binary Tree Representation: Binary Search 08
Tree, Strictly Binary Tree, Complete Binary Tree, Extended Binary Trees, Tree Traversal
algorithms: Inorder, Preorder and Postorder, Constructing Binary Tree from given Tree Traversal,
Insertion , Deletion, Searching & Modification of data in Binary Search tree.

V Graphs: Terminology used with Graph, Data Structure for Graph Representations: Adjacency 08
Matrices, Adjacency List, Graph Traversal: Depth First Search and Breadth First Search, Minimum
Spanning Trees, Prims and Kruskal algorithm.

You might also like