Shape Shape Shape Shape
Subject

Data Structure and Algorithm

Data Structures and Algorithms introduces both foundational and advanced concepts critical to computer science and information technology. Key topics include fundamental data structures like arrays, linked lists, stacks, queues, trees, graphs, and hash tables, as well as algorithms for sorting, searching, recursion, and complexity analysis using Big O notation. Students engage in lectures and hands-on programming labs to apply these concepts, focusing on developing strong problem-solving and coding skills. Activities involve implementing various data structures, designing and optimizing algorithms, analyzing algorithm efficiency, and collaborating on projects that address real-world ICT challenges. The course emphasizes best practices and explores current trends in algorithm development and data management within the ICT industry.

Tribhuvan University

Faculty of Education

Course Title: Data Structure and Algorithm

Course no: ICT Ed. 435

Nature of course: Theory+Pratical

Full Marks: 100

Pass Marks: 40

Credit Hours: 3

Course Description : Data Structures and Algorithms introduces both foundational and advanced concepts critical to computer science and information technology. Key topics include fundamental data structures like arrays, linked lists, stacks, queues, trees, graphs, and hash tables, as well as algorithms for sorting, searching, recursion, and complexity analysis using Big O notation. Students engage in lectures and hands-on programming labs to apply these concepts, focusing on developing strong problem-solving and coding skills. Activities involve implementing various data structures, designing and optimizing algorithms, analyzing algorithm efficiency, and collaborating on projects that address real-world ICT challenges. The course emphasizes best practices and explores current trends in algorithm development and data management within the ICT industry.

Course Objective : This module aims to impart the basic management knowledge, and skills to the students so as to enhance their managerial capabilities and enable them to apply in the practical field

Course Contents:
Unit 1. Introduction to Data Structures & Algorithms 3 Hrs.

Data types, Data structure and Abstract date type, Dynamic memory allocation in C, Introduction to Algorithms, Asymptotic notations and common functions.
Unit 2. Stacks 3 Hrs.

Definition, Stack as an ADT, Stack operation, Stack application: Conversion from infix to postfix/prefix expression, Evaluation of postfix/ prefix expressions.
Unit 3. Queues 3 Hrs.

Definition, Queue as an ADT, Primitive operations in queue: Enqueue and Dequeue, Linear Queue, Circular Queue, Priority Queue.
Unit 4. Lists 3 Hrs.

List and ADT, Array Implementation of Lists, Linked List, Types of Linked List: Singly Linked List, Doubly Linked List, Circular Linked List. Basic operations in Linked List: creation, node insertion and deletion from beginning, end and specified position, Stack and Queue as a Linked List.
Unit 5. Recursion 3 Hrs.

Principle of recursion, Comparison between recursion and iteration, Factorial, Fibonacci sequence, GCD, Tower of Hanoi(TOH), Applications and Efficiency of recursion.
Unit 6. Trees 3 Hrs.

Concept and definitions, Basic operations in binary tree, Tree height, level and depth, Binary Search Tree, Insertion, Deletion, Traversals (pre-order, post-order and in-order ), Search in BST, AVL tree and Balancing algorithm, Applications of tree.
Unit 7. Sorting 3 Hrs.

Introduction and Types of sorting: Internal and External sort, Comparison Sorting Algorithms: Bubble, Selection and Insertion Sort, Divide and Conquer Sorting: Merge, Quick and Heap Sort, Efficiency of Sorting Algorithms.
Unit 8. Searching 3 Hrs.

Introduction to searching, Search Algorithms: Sequential search, Binary search, Efficiency of search algorithms, Hashing : Hash function and hash tables, Collision resolution technique,
Unit 9. Graphs 3 Hrs.

Definition and Representation, Graph Traversal: BFS and DFS, Minimum Spanning Trees: Kruskal and Prims Algorithm, Shortest Path Algorithms: Dijksrtra Algorithm.
Reference Books: