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

Welcome to Scribd!

  • 142 views

    CS 202-Data Structures-Dr - Ihsan Ayyub Qazi

    Uploaded by

    Zia Azam
    This document provides information about the CS 202 - Data Structures course offered at Lahore University of Management Sciences. The course is taught by Dr. Ihsan Ayyub Qazi and covers fundamental data structures and algorithms. It is a 3-credit hour course that meets twice per week for lectures and once per week for tutorials. Grading is based on programming assignments, quizzes, a midterm exam, and a final exam. The course introduces students to common data structures like arrays, lists, stacks, queues, trees, hashing, and graphs and teaches how to analyze their time and space complexities.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd

    CS 202-Data Structures-Dr - Ihsan Ayyub Qazi

    Uploaded by

    Zia Azam
    142 views2 pages
    This document provides information about the CS 202 - Data Structures course offered at Lahore University of Management Sciences. The course is taught by Dr. Ihsan Ayyub Qazi and covers fundamental data structures and algorithms. It is a 3-credit hour course that meets twice per week for lectures and once per week for tutorials. Grading is based on programming assignments, quizzes, a midterm exam, and a final exam. The course introduces students to common data structures like arrays, lists, stacks, queues, trees, hashing, and graphs and teaches how to analyze their time and space complexities.

    Original Description:

    Course Outline

    Original Title

    CS 202-Data Structures-Dr.ihsan Ayyub Qazi

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document provides information about the CS 202 - Data Structures course offered at Lahore University of Management Sciences. The course is taught by Dr. Ihsan Ayyub Qazi and covers fundamental data structures and algorithms. It is a 3-credit hour course that meets twice per week for lectures and once per week for tutorials. Grading is based on programming assignments, quizzes, a midterm exam, and a final exam. The course introduces students to common data structures like arrays, lists, stacks, queues, trees, hashing, and graphs and teaches how to analyze their time and space complexities.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    142 views2 pages

    CS 202-Data Structures-Dr - Ihsan Ayyub Qazi

    Uploaded by

    Zia Azam
    This document provides information about the CS 202 - Data Structures course offered at Lahore University of Management Sciences. The course is taught by Dr. Ihsan Ayyub Qazi and covers fundamental data structures and algorithms. It is a 3-credit hour course that meets twice per week for lectures and once per week for tutorials. Grading is based on programming assignments, quizzes, a midterm exam, and a final exam. The course introduces students to common data structures like arrays, lists, stacks, queues, trees, hashing, and graphs and teaches how to analyze their time and space complexities.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    You are on page 1of 2

    Lahore University of Management Sciences CS

    202 Data Structures


    Instructor Dr. Ihsan Ayyub Qazi Room No. SSE 9-114A Office Hours 9:15am-10:15am Email ihsan.qazi@lums.edu.pk Telephone +92 42 3560 8368 TAs Muhammad Hasnain Lakhani (13100019@lums.edu.pk) + Uzair Mahmood (13100098@lums.edu.pk) TA Office Hours TBA Course URL (if any) LMS (https://lms.lums.edu.pk) Course Basics Credit Hours 3 Lecture(s) 2 Per Week Duration 75 mins Tutorial (per week) 1 Per Week Duration 60 mins Course Distribution Core Computer Science Majors Elective Computer Engineering Majors Open for Student Category All Close for Student Category None COURSE DESCRIPTION Data structures play a central role in modern computer science, as they are the essential building blocks for efficient algorithms. This course will introduce the fundamentals of data structures. It will provide a thorough understanding of ways to efficiently organize data in a computer. Students will be introduced to a variety of data structures and algorithms and will be able to compare them based on their time and space complexities. In addition, students will appreciate that the right programming structures, abstractions and algorithms are necessary for improving the efficiency and complexity of a computer program. COURSE PREREQUISITE(S) CS 200 Introduction to Programming COURSE OBJECTIVES To teach students the fundamentals of data structures and algorithms To provide hands-on experience with implementing different data structures To equip students with tools for comparing the time and space complexity of different data structures Learning Outcomes Students would be able to compare the time and space efficiency of different data structures Students will be able to write programs to efficiently manipulate, store, and retrieve data Students will become aware of several commonly used data structures and algorithms used in real-world applications Grading Breakup and Policy Programming Assignment(s): 30% Quiz(s): 15% Midterm Examination: 25% Final Examination: 30% Examination Detail

    Spring 2012

    Lahore University of Management Sciences


    Midterm Exam Yes/No: Yes Duration: 3 hrs Preferred Date: TBA Exam Specifications: TBA Yes/No: Yes Duration: 3 hrs Exam Specifications: TBA

    Final Exam

    Textbook(s)/Supplementary Readings Required Text (Selected Readings) nd (GTM) Data Structures and Algorithms in C++ by Michael T. Goodrich, Roberto Tamassia, and David Mount (2 Edition) rd (Weiss) Data Structures and Algorithm Analysis in C++ by Mark Allen Weiss (3 Edition) Session 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 Topics Course Overview, Analysis Tools Algorithms Analysis, Asymptotic Notation, Arrays Lists (Singly, Doubly, Circularly Linked Lists) Lists (continued), Stacks Stacks, Queues Introduction to Trees, Tree Traversals Tree Traversals (continued), Binary Trees Binary Trees (continued) Binary Search Trees (BST), BST Analysis AVL Trees AVL Trees, Red-Black Trees (optional) Hashing Hash Tables Midterm Exam Priority Queues, Binary Heaps Binary Heaps, HeapSort Sorting (Insertion Sort, Mergesort) Sorting (Quicksort, Radix-Sort [optional], Bucket-Sort [optional]) Data Compression (Huffman Coding) Tries (Standard, Compressed, Suffix) Graphs, Data Structures for Graphs Graph Traversals (Depth First Search, Breadth First Search) Directed Graphs, Topological Sort Shortest-Path Algorithms Network Flow Problems, Minimum Spanning Trees Adv. Data Structures: Distributed Hash Tables and Bloom Filters Adv. Data Structures: Distributed Hash Tables and Bloom Filters Adv. Data Structures + Review Recommended Readings (GTM) Chapter 4 + (Weiss) Chapters 1.1, 1.2, 2 (GTM) Chapters 3.1, 4 + (Weiss) Chapters 1.2, 2 (GTM) Chapters 3.2, 3.3, 3.4 + (Weiss) Chapters 3.2, 3.5 Above + (GTM) Chapters 5.1 + (Weiss) Chapter 3.6 (GTM) Chapters 5.1-5.3 + (Weiss) Chapter 3.7 (GTM) Chapters 7.1, 7.2 + (Weiss) Chapter 4.1, 4.6 Above + (GTM) Chapters 7.3 + (Weiss) Chapter 4.2 (GTM) Chapters 7.3 + (Weiss) Chapter 4.2 (GTM) Chapters 10.1 + (Weiss) Chapter 4.3 (GTM) Chapters 10.2 + (Weiss) Chapter 4.4 Above + (GTM) Chapters 10.5 + (Weiss) Chapter 12.2 (GTM) Chapters 9.2 + (Weiss) Chapter 5.1-5.3 (GTM) Chapters 9.2 + (Weiss) Chapter 5.4-5.6 (GTM) Chapters 8.1-8.3 + (Weiss) Chapter 6.1, 6.2 (GTM) Chapters 8.3 + (Weiss) Chapter 6.3, 7.5 (GTM) Chapters 11.1 + (Weiss) Chapter 7.2, 7.6 (GTM) Chapters 11.2, 11.3 + (Weiss) Chapter 7.7 (GTM) Chapters 12.4 + (Weiss) Chapter 10.1.2 + Notes (GTM) Chapters 12.5 + (Weiss) Chapter 10.1.2 (GTM) Chapters 13.1, 13.2 + (Weiss) Chapter 9.1 (GTM) Chapters 13.3 + (Weiss) Chapter 9.3.1, 9.6 (GTM) Chapters 13.4 + (Weiss) Chapter 9.2 (GTM) Chapters 13.5 + (Weiss) Chapter 9.3 (GTM) Chapters 13.6 + (Weiss) Chapter 9.4, 9.5 Notes Notes Notes

    You might also like