[go: up one dir, main page]
Scribd
Upload
10 views2 pages

CSC-200 Data Structures and Algorithms v1.1

The CSC-200 Data Structures and Algorithms course at the University of Engineering and Technology Lahore covers the theoretical foundation of data structures and algorithms, focusing on their design, analysis, and efficiency evaluation. Key learning outcomes include understanding fundamental data structures, analyzing their performance, and designing efficient solutions for complex problems. The course includes a detailed weekly plan covering various topics such as recursion, trees, graphs, and algorithm complexity.

Uploaded by

mubashratariq66
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
10 views2 pages

CSC-200 Data Structures and Algorithms v1.1

The CSC-200 Data Structures and Algorithms course at the University of Engineering and Technology Lahore covers the theoretical foundation of data structures and algorithms, focusing on their design, analysis, and efficiency evaluation. Key learning outcomes include understanding fundamental data structures, analyzing their performance, and designing efficient solutions for complex problems. The course includes a detailed weekly plan covering various topics such as recursion, trees, graphs, and algorithm complexity.

Uploaded by

mubashratariq66
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/ 2

University of Engineering and Technology Lahore

Course Outline Report


Subject: CSC-200 Data Structures and Algorithms
Course Description

This course provides a theoretical foundation in data structures and algorithms, focusing on
their design, analysis, and mathematical modeling. Students will learn to evaluate the
efficiency of algorithms using asymptotic notation, explore fundamental abstract data types
(ADTs), and understand how different data structures optimize computational tasks. Students
will explore abstract data types (ADT), recursion, algorithm complexity, and the
implementation of key structures like stacks, queues, trees, graphs, and hash tables. This
course also emphasizes problem-solving techniques and complexity analysis for classical
algorithms.

Course Learning Outcomes (CLOs)

CLO Domain Domain


Description PLOs
No. Level

CLO1 Describe and explain fundamental data structures PLO1 Cognitive Understand
(arrays, lists, stacks, queues, trees, graphs, hash
tables), their operations and applications.

CLO2 Analyze the performance of data structures to PLO3 Cognitive Analyze


determine their time and space complexity.

CLO3 Design efficient solutions for complex problems by PLO4 Cognitive Create
selecting suitable data structures and algorithms
based on specific requirements.

Tentative Weekly Lecture Plan

Week Topics Mapped CLOs

Week 1 Introduction to Data Structures and Algorithms CLO1


ADTs, need for structured data

Week 2 Overview of time/space complexity (Big-O, Big-Ω, Big-Θ), CLO2


Searching (Linear, Binary) and Sorting Algorithms (Bubble,
Insertion, Selection)

Week 3 Arrays and Strings CLO1, CLO2,


Operations, limitations, applications CLO3
Week 4- Linked Lists CLO1, CLO2,
5 Singly, Doubly, Circular, memory model, use cases CLO3

Week 6 Stacks CLO1, CLO2,


Array vs. linked-list implementation, applications (expression CLO3
evaluation and conversion, undo)

Week 7 Queues and Priority Queues CLO1, CLO2,


Circular queue, dequeue, priority concepts CLO3

Week 8 Recursion CLO1, CLO2


Stack frame model, recursion vs. iteration,
Merge Sort, Quick Sort; comparative analysis

Week 9 Trees CLO1, CLO2,


Binary Tree, Binary Search Tree (BST), traversal algorithms CLO3

Week Balanced Trees CLO1, CLO2,


10 AVL Trees, rotations, balance factor CLO3

Week Heaps and Heap Sort CLO1, CLO2,


11 Min/max heaps, heap-based priority queues CLO3

Week Hash Tables CLO1, CLO2,


12 Hash functions, collision handling (chaining, open addressing) CLO3

Week Graphs I CLO1


13 Representations (adjacency list/matrix), BFS/DFS

Week Graphs II CLO1


14 Shortest Path Algorithms (Dijkstra), connected components

Week Algorithms comparative analysis CLO2


15

Week Course Wrap-Up + Final Review CLO1, CLO2,


16 Applied case studies, complexity comparisons CLO3

You might also like