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

Welcome to Scribd!

  • 63 views

    DSA Course Breakdown

    Uploaded by

    Manzar Abbas
    This document outlines a course on data structures and algorithms. The course is designed to teach students how to efficiently store and manipulate data using various data structures like arrays, stacks, queues, linked lists, trees, and graphs. Over the 16-week course, students will learn about common algorithms and their time complexities, and will complete programming exercises applying data structures to problems like expression evaluation, searching, and sorting. Student evaluation will include assignments, quizzes, midterm and final exams assessing both theoretical knowledge and practical programming skills.

    Copyright:

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

    DSA Course Breakdown

    Uploaded by

    Manzar Abbas
    63 views4 pages
    This document outlines a course on data structures and algorithms. The course is designed to teach students how to efficiently store and manipulate data using various data structures like arrays, stacks, queues, linked lists, trees, and graphs. Over the 16-week course, students will learn about common algorithms and their time complexities, and will complete programming exercises applying data structures to problems like expression evaluation, searching, and sorting. Student evaluation will include assignments, quizzes, midterm and final exams assessing both theoretical knowledge and practical programming skills.

    Copyright

    © © All Rights Reserved

    Available Formats

    DOC, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document outlines a course on data structures and algorithms. The course is designed to teach students how to efficiently store and manipulate data using various data structures like arrays, stacks, queues, linked lists, trees, and graphs. Over the 16-week course, students will learn about common algorithms and their time complexities, and will complete programming exercises applying data structures to problems like expression evaluation, searching, and sorting. Student evaluation will include assignments, quizzes, midterm and final exams assessing both theoretical knowledge and practical programming skills.

    Copyright:

    © All Rights Reserved
    Download as DOC, PDF, TXT or read online from Scribd
    Download as doc, pdf, or txt
    63 views4 pages

    DSA Course Breakdown

    Uploaded by

    Manzar Abbas
    This document outlines a course on data structures and algorithms. The course is designed to teach students how to efficiently store and manipulate data using various data structures like arrays, stacks, queues, linked lists, trees, and graphs. Over the 16-week course, students will learn about common algorithms and their time complexities, and will complete programming exercises applying data structures to problems like expression evaluation, searching, and sorting. Student evaluation will include assignments, quizzes, midterm and final exams assessing both theoretical knowledge and practical programming skills.

    Copyright:

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

    BSIT 3rd Course Data Structures & Algorithms Department of Dated: 05/10/2020

    Breakdown Credit Hours : 4(3-2) Computer Science,


    Course Code: CS-443 BIMS

    Course Objectives:
    The course is designed to teach students structures and schemes which enable them to write
    programmes to efficiently manipulate, store, and retrieve data. Students are exposed to the concepts
    of time and space complexity of computer programmes.

    Description of Course:
    Introduction to data structures and algorithms, arrays, stacks, infix, postfix and prefix notations,
    recursion, backtracking, binary search, queues, linked lists, trees, graphs and operations, algorithm
    performance, complexity issues, sorting algorithms, searching algorithms, hashing, dynamic memory
    management

    Text Books: 1. Data Structures Using C and C++ by A. Tenenbaum


    https://www.academia.edu/8205017/Data_Structures_Using_C_And_C_Y._Langsam_M._Augenstei
    n_And_A._M._Tenenbaum

    Pre-requisite: Programming Fundamentals

    Office Hours: Tuesday 10:00 A.M to 11:00 AM

    Grading Policy:
    There will be an evaluation from theory and practical separately. Students are required to qualify both
    (theory & practical) independently to pass the course.

    Marks Distribution: Total Subject Marks: 80

    Theory Marks: 60
    Quizzes/Assignments : 12 marks
    Mid Term : 18 marks
    Final Term (Theory) : 30 marks

    Practical Marks: 20
    Lab. Reports : 10 marks
    Final Project : 10 marks
    Assignments and quizzes: Approximately 3 assignments and 4 quizzes shall be given during the
    semester. The quizzes shall preferably be unannounced. The duration of each quiz shall be about 10
    minutes. No make-ups will be offered for missed quizzes. The graded quizzes shall be returned in the
    next lecture and the graded assignments shall be returned within a week. The assignments shall clearly
    reflect the indigenous work of the student. Plagiarism is not allowed which may result in cancellation of
    an assignment, in addition to reporting the matter to the management for appropriate action.

    Mid-Term Examination: A midterm exam of minimum 1-hour duration will be held that will cover
    all material covered till the midterm.

    Attendance Policy: 80% attendance is mandatory; deficient students will not be allowed to appear in
    the final examination.
    Page 1 of 4
    BSIT 3rd Course Data Structures & Algorithms Department of Dated: 05/10/2020
    Breakdown Credit Hours : 4(3-2) Computer Science,
    Course Code: CS-443 BIMS

    INSTRUCTOR’S INFORMATION:
    Ms. Kiran Saeed
    Email: kiransaeed60@gmail.com
    Mobile: +92-342-5478635

    LECTURE BREAKDOWN

    Week No. Lecture No. Description

    Lect. 1 Introduction to Data Structures

    Lect. 2 Program Efficiency & Time Complexity

    Week 1 Lab. 1 Programming Exercise

    Lect. 3 Time Complexity of an Algorithm

    Lect. 4 Techniques of Algorithm Analysis

    Week 2 Lab. 2 Programming Exercise

    Lect. 5 Data Types (ADT Abstract)


    Lect. 6 Arrays as ADT
    Week 3 Lab. 3 Programming Exercise
    Lect. 7 Lists and Linked Lists (LL)
    Lect. 8 Pointers
    Week 4 Lab. 4 Programming Exercise
    Operation on Linked Lists

    Linked List: Node insertion in the Beginning and End of


    Lect. 9 LL
    Linked List: Node insertion in the Middle of LL

    Lect. 10 Linked List: Traversing the nodes of a Linked List (LL)


    Week 5 Lab. 5 Programming Exercise
    Doubly Linked List Data Structure
    Lect. 11 Operations on Doubly Linked List
    Sorting Techniques
    Selection Sort
    Insertion Sort
    Week 6 Lect. 12 Merge Sort
    Page 2 of 4
    BSIT 3rd Course Data Structures & Algorithms Department of Dated: 05/10/2020
    Breakdown Credit Hours : 4(3-2) Computer Science,
    Course Code: CS-443 BIMS

    Lab. 6 Programming Exercise


    Searching Techniques
    Linear Search

    Lect. 13 Binary Search


    Stack Data Structures
    Operations on Stack
    Stack application: Infix, Pre-Fix, Post-Fix (Polish)
    Notations
    Lect. 14
    Week 7 Lab. 7 Programming Exercise

    Lect. 15 Evaluation of expressions using stack


    Queue Data Structure

    Lect. 16 Operations on queues

    Week 8 Lab. 8 Programming Exercise

    Week 9 – 10 Mid Term  


    Double-Ended Queues

    Lect. 17 Priority Queues


    Tree Data Structures
    Binary Trees
    Binary Tree traversal algorithms

    Lect. 18 Other operations on binary trees

    Week 11 Lab. 9 Programming Exercise


    Binary Search Trees (BSTs)
    Divide and Conquer – Merge sort
    Heap Sort
    Quick Sort
    Radix Sort
    Lect. 19 Shell Sort
    Lect. 20 Balancing of Binary Search Trees – AVL Trees

    Week 12 Lab. 10 Programming Exercise

    Lect. 21 Operations on AVL trees

    Lect. 22 Hashing algorithms

    Week 13 Lab. 11 Programming Exercise

    Week 14 Lect. 23 Skip lists

    Page 3 of 4
    BSIT 3rd Course Data Structures & Algorithms Department of Dated: 05/10/2020
    Breakdown Credit Hours : 4(3-2) Computer Science,
    Course Code: CS-443 BIMS

    Lect. 24 Graph data structure

    Lab. 12 Programming Exercise

    Lect. 25 Operations on graphs


    Depth-First Search and Breadth-First Search algorithms

    Lect. 26
    Week 15 Lab. 13 Programming Exercise

    Lect. 27 Minimum Spanning Trees

    Lect. 28 Huffman encoding

    Week 16 Lab. 14 Programming Exercise

    Page 4 of 4

    You might also like