Thanks to visit codestin.com
Credit goes to www.scribd.com

0% found this document useful (0 votes)
5 views1 page

Outline

Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
5 views1 page

Outline

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

UNILAG_CSC106 Introduction to Algorithms and data Structures (3 Units C LH 30;

PH45)

Learning Outcomes
1. Explain the key properties (structure and methods) of several data structures including
lists, stacks, queues, trees, priority queues, heaps, hash tables and graphs
2. Analyze step by step and develop algorithms to solve real world problems.
3. Implementing various data structures viz. Stacks, Queues, Linked Lists, Trees and Graphs.
4. Understanding various searching & sorting techniques
5. Creating traversal algorithms using trees and graphs and identify shortest paths and
minimum spanning trees in graphs

Course Contents
1. Introduction To Data Structure: Data Management concepts, Data types – primitive and non-primitive.
2. Introduction to Algorithms
3. Linear Data Structure (Array: Representation of arrays, Applications of arrays, sparse matrix and its
representation.
4. Stack: Stack-Definitions & Concepts, Operations on Stacks, Applications of Stacks, Polish Expression,
Reverse Polish Expression and Their Compilation. Recursion. Tower of Hanoi.
5. Queue: Representation Of Queue, Operations on Queue, Circular Queue, Priority Queue, Array
representation of Priority Queue, Double Ended Queue, Applications of Queue.
6. Linked List: Singly Linked List, Doubly Linked list, Circular linked list, Linked implementation of Stack,
Linked implementation of Queue, Applications of linked list.
7. Sorting and Searching: Insertion Sort, Quick Sort, Merge Sort,
8. Nonlinear Data Structure : Tree-Definitions and Concepts, Representation of binary tree, Binary tree
traversal (Inorder, postorder, preorder), Threaded binary tree, Binary search trees,Conversion of
General Trees To Binary Trees,
9. Applications Of Trees- Some balanced tree mechanism, eg. AVL trees, 2-3 trees, Height Balanced, Weight
Balance ,
10. Graph-Matrix Representation Of Graphs, Elementary Graph operations,(Breadth First Search, Depth First
Search, Spanning Trees, Shortest path, Minimal spanning tree ).
11. Sorting and Searching: Heap Sort, Sorting on Several Keys, List and Table Sort Linear Search, Binary
Search.

You might also like