Scribd Logo
Upload

Welcome to Scribd!

  • Obe Reports Hec - Report Section Outline

    Uploaded by

    FAHAD KARIM KHAN
    10 views2 pages
    The document provides a course outline for CS-272 Design and Analysis of Algorithms being offered in the Spring 2023 semester by the Computer Science Department at the University of Engineering and Technology Lahore. The course will cover topics like sorting algorithms, hashing, dynamic programming, greedy algorithms, minimum cuts, and max-flow algorithms over 16 weeks. It lists 3 measurable student learning outcomes focusing on classifying algorithms, analyzing time/space complexity, and applying algorithms to problems. The grading policy and class timings are also included.

    Original Description:

    Original Title

    obe_reports_hec.report_section_outline

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document provides a course outline for CS-272 Design and Analysis of Algorithms being offered in the Spring 2023 semester by the Computer Science Department at the University of Engineering and Technology Lahore. The course will cover topics like sorting algorithms, hashing, dynamic programming, greedy algorithms, minimum cuts, and max-flow algorithms over 16 weeks. It lists 3 measurable student learning outcomes focusing on classifying algorithms, analyzing time/space complexity, and applying algorithms to problems. The grading policy and class timings are also included.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    10 views2 pages

    Obe Reports Hec - Report Section Outline

    Uploaded by

    FAHAD KARIM KHAN
    The document provides a course outline for CS-272 Design and Analysis of Algorithms being offered in the Spring 2023 semester by the Computer Science Department at the University of Engineering and Technology Lahore. The course will cover topics like sorting algorithms, hashing, dynamic programming, greedy algorithms, minimum cuts, and max-flow algorithms over 16 weeks. It lists 3 measurable student learning outcomes focusing on classifying algorithms, analyzing time/space complexity, and applying algorithms to problems. The grading policy and class timings are also included.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    of 2

    University of Engineering and Technology Lahore

    Section Course Outline Report

    Department: Computer Science Printed Date: 18-Mar-2023

    Section Course Detail

    Semester SPRING 2023

    Department Computer Science

    Section A

    Subject Title CS-272 Design and Analysis of Algorithms

    Contact tehseen.hasan56@gmail.com

    M easureable Student Learning Outcomes

    CLOs Description PLOs Level

    CLO1 Classify algorithms according to their complexity PLO01 Medium

    CLO2 Solve time and space complexity of algorithms using algorithm analysis PLO02 Medium
    techniques

    CLO3 Apply the algorithms and design techniques to solve problems, and PLO03 High
    mathematically evaluate the quality of the solutions, typically using the
    taught algorithms

    Grading Policy

    Class Timings

    Section Content

    Week Topics
    (Lec)

    week1 Course Introduction


    Introduction to Algorithms
    Analysis of Iterative Algorithms

    week2 Asymptotic & Sorting

    week3 Solving Recurrence

    week4 Randomized Algorithms

    week5 Sorting Algorithms and O(n)

    week6 Hashing, BST, RB Trees

    week7 Graph Representation and Analysis


    week8 Midterm
    Revision of concepts

    week9 Dijkstra & Bellman Ford

    week10 Dynamic Programming


    Unbounded Knapsack
    0/1 Knapsack

    week11 More Dynamic Programming


    LONGEST COMMON SUBSEQUENCE (LCS)

    week12 Greedy Algorithms


    Activity Selection
    Scheduling
    Huffman Coding

    week13 Even More Greedy Algorithms


    Minimum Spanning Tree
    Prim’s
    Kruskal

    week14 Minimum Cuts


    Karger’s Algorithm

    week15 s–t Min-Cuts & Max-Flows


    The Ford-Fulkerson Algorithm

    week16 Course Overview

    Chairman Signature: _________________

    You might also like