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

Welcome to Scribd!

  • 1 views

    CSC211 Ds&a CDF V3.0

    Uploaded by

    freelancehassan4
    Cui cdf 2024

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    CSC211 Ds&a CDF V3.0

    Uploaded by

    freelancehassan4
    1 views2 pages
    Cui cdf 2024

    Original Title

    CSC211_DS&A_CDF_V3.0

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Cui cdf 2024

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    1 views2 pages

    CSC211 Ds&a CDF V3.0

    Uploaded by

    freelancehassan4
    Cui cdf 2024

    Copyright:

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

    COMSATS University Islamabad

    Department of Computer Science


    Course Description Form (CDF)
    Course Information
    Course Code: CSC211 Course Title: Data Structures and Algorithms
    Credit Hours: 4(3,1) Lecture Hours/Week: 3
    Lab Hours/Week: 3 Pre-Requisites: CSC103-Programming Fundamentals
    Catalogue Description:
    This course provides fundamental knowledge of data organization. The topics include Overview of Data
    Structures; Static & Dynamic List; Stack; Queue, Tree & its Algorithms. Graph & its Algorithms; Sorting;
    Searching; Hashing. Time Complexity of an Algorithm.
    Unit wise Major Topics:
    No. of teaching
    Unit Topics
    hours
    Data Structure: Overview, Importance, Classification, Operations,
    1. 1.5
    Abstract Data Types.
    Static List; Dynamic List: Single Linked Lists, Circular Linked List,
    2. 9
    Doubly Linked List, Applications.
    3. Stack: Concept, and Applications. 4.5
    4. Queue: Concept, Types and Applications. 4.5
    Tree: Concept & Terminology, Traversal Algorithms; Binary Search
    5. 9
    Trees & its Various Operations; AVL Tree and Min & Max Heaps.
    Graph: Basic Concepts & Terminology; Representation, Types; Graph
    Traversal Techniques: Breadth First Search, Depth First Search;
    6. 6
    Minimum Spanning Trees: Kruskal Algorithm, Prims Algorithm;
    Shortest Path Problem: Dijkstra’s Algorithm.
    Sorting algorithms: Bubble, Selection and Insertion Sort, Searching
    7. Algorithms: Linear & Binary Search; Hashing: Hash Functions, Hash 7.5
    Tables, Strategies for Avoiding & Resolving Collisions.

    Complexity Analysis: Growth Rate of Function; Asymptotic Notation;


    8. 3
    Time Complexity of Searching and Sorting Algorithms.

    Total Contact Hours 45


    Mapping of CLOs and SOs
    Blooms
    Sr.# Unit # Course Learning Outcomes Taxonomy SO
    Learning Level
    CLO’s for Theory
    Employ linear data structures to solve computing
    CLO-1 1-4 Applying 1,2
    problems.
    Use non-linear data structures to solve computing
    CLO-2 5-6 Applying 1,2
    problems.

    1
    CLO-3 7-8Analyze the time complexity of various algorithms. Analyzing 2
    CLO’s for Lab
    Implement linear & non-linear data structures, sorting
    CLO-4 1-7 Applying 2,3,4
    & searching algorithms and hashing.
    Develop a project in a team environment using
    CLO-5 1-8 Creating 2-5
    appropriate data structures.
    CLO Assessment Mechanism
    Assessment
    CLO-1 CLO-2 CLO-3 CLO-4 CLO-5
    Tools

    Quizzes Quiz 1 &2 Quiz 3 Quiz 4 - -

    Assignment
    Assignments Assignment 3 Assignment 4 Lab Assignments -
    1&2
    Mid Term Mid Term Mid Term
    - - -
    Exam Exam Exam
    Final Term
    Final Term Exam
    Exam
    Project - - - - Lab Project
    Text and Reference Books
    Textbook:
    1. A Common-Sense Guide to Data Structures and Algorithms, Jay Wengrow, Pragmatic
    Bookshelf,2020.

    Reference Books:
    1. Data Structures and Algorithm Analysis in C++, Mark Allen Weiss, Addison-Wesley, 2014.

    You might also like