Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd
Upload
423 views

Data Structures and Algorithms Syllabus

This 3-unit course covers fundamental data structures and algorithms concepts over 18 weeks. Topics include stacks, queues, lists, trees, graphs, sorting, searching, and hashing. The course introduces abstract data types, dynamic memory allocation, asymptotic analysis, and common algorithms like recursion, binary search trees, and shortest path algorithms. Assignments include implementing data structures like linked lists and performing operations such as insertion and deletion.

Uploaded by

Joseph Mazo
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
423 views

Data Structures and Algorithms Syllabus

This 3-unit course covers fundamental data structures and algorithms concepts over 18 weeks. Topics include stacks, queues, lists, trees, graphs, sorting, searching, and hashing. The course introduces abstract data types, dynamic memory allocation, asymptotic analysis, and common algorithms like recursion, binary search trees, and shortest path algorithms. Assignments include implementing data structures like linked lists and performing operations such as insertion and deletion.

Uploaded by

Joseph Mazo
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

Data Structures and Algorithms Syllabus

Course Title : Data Structures and Algorithms


Course Credit : 3 units or 54 hours
Pre-requisite : None
Course Description :
This course includes the basic foundations in of data structures and algorithms. This course
covers concepts of various data structures like stack, queue, list, tree and graph.
Additionally, the course includes idea of sorting and searching.

Course Topics
Week Topics
1-2 1. Introduction to Data Structures & Algorithms
1.1 Data types, Data structure and Abstract date type
1.2 Dynamic memory allocation in C
1.3 Introduction to Algorithms
1.4 Asymptotic notations and common functions
3-4 2 Stack
2.1 Basic Concept of Stack, Stack as an ADT, Stack Operations, Stack Applications
2.2 Conversion from infix to postfix/prefix expression, Evaluation of postfix/ prefix
expressions
5-6 3 Queue
3.1 Basic Concept of Queue, Queue as an ADT, Primitive Operations in Queue
3.2 Linear Queue, Circular Queue, Priority Queue, Queue Applications
7-8 4 Recursion
4.1 Principle of Recursion, Comparison between Recursion and Iteration, Tail Recursion
4.2 Factorial, Fibonacci Sequence, GCD, Tower of Hanoi(TOH)
4.3 Applications and Efficiency of Recursion
9-11 5. Lists
5.1 Basic Concept, List and ADT, Array Implementation of Lists, Linked List
5.2 Types of Linked List: Singly Linked List, Doubly Linked List, Circular Linked List.
5.3 Basic operations in Linked List: Node Creation, Node Insertion and Deletion from
Beginning, End and Specified Position
5.4 Stack and Queue as Linked List
12-14 6. Sorting
6.1 Introduction and Types of sorting: Internal and External sort
6.2 Comparison Sorting Algorithms: Bubble, Selection and Insertion Sort, Shell Sort
6.3 Divide and Conquer Sorting: Merge, Quick and Heap Sort
6.4 Efficiency of Sorting Algorithms
15-16 7. Searching and Hashing
7.1 Introduction to Searching, Search Algorithms: Sequential Search, Binary Search
7.2 Efficiency of Search Algorithms
7.3 Hashing : Hash Function and Hash Tables, Collision Resolution Techniques
17-18 8. Trees and Graphs
8.1 Concept and Definitions, Basic Operations in Binary Tree, Tree Height, Level and Depth
8.2 Binary Search Tree, Insertion, Deletion, Traversals, Search in BST
8.3 AVL tree and Balancing algorithm, Applications of Trees
8.4 Definition and Representation of Graphs, Graph Traversal, Minimum Spanning
Trees: Kruskal and Prims Algorithm
8.5 Shortest Path Algorithms: Dijksrtra Algorithm

References :

Text Books:
1. Y Langsam , MJ Augenstein and A.M , Tanenbaum Data Structures using C and C++ ,Prentice Hall India, Second
Edition 2015

Date Developed Developed for Developed by Approved by


January 2022 Informatics Philippines Program and Development Head of the Program and
Department Development Department
Reference Books:
1. Leen Ammeral, Programmes and Data Structures in C, Wiley Professional Computing
2. G.W Rowe, Introduction to Data Structure and Algroithms with C and C++ , Prentice Hall India
3. R.L Kruse, B.P. Leung, C.L. Tondo, Data Structure and Program Design in C Prentice-Hall India

Date Developed Developed for Developed by Approved by


January 2022 Informatics Philippines Program and Development Head of the Program and
Department Development Department

You might also like