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

Welcome to Scribd!

  • 65 views

    CS C363

    Uploaded by

    Aravind Kondamudi
    The document provides details for the course "Data Structures and Algorithms" including the course objectives to introduce data structures and algorithm design techniques, a schedule of topics covering data structures, sorting algorithms, graph algorithms and complexity analysis, and evaluation components weighting exams, labs, and a comprehensive assessment.

    Copyright:

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

    CS C363

    Uploaded by

    Aravind Kondamudi
    65 views3 pages
    The document provides details for the course "Data Structures and Algorithms" including the course objectives to introduce data structures and algorithm design techniques, a schedule of topics covering data structures, sorting algorithms, graph algorithms and complexity analysis, and evaluation components weighting exams, labs, and a comprehensive assessment.

    Original Description:

    handout

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document provides details for the course "Data Structures and Algorithms" including the course objectives to introduce data structures and algorithm design techniques, a schedule of topics covering data structures, sorting algorithms, graph algorithms and complexity analysis, and evaluation components weighting exams, labs, and a comprehensive assessment.

    Copyright:

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

    CS C363

    Uploaded by

    Aravind Kondamudi
    The document provides details for the course "Data Structures and Algorithms" including the course objectives to introduce data structures and algorithm design techniques, a schedule of topics covering data structures, sorting algorithms, graph algorithms and complexity analysis, and evaluation components weighting exams, labs, and a comprehensive assessment.

    Copyright:

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

    BIRLA INSTITUTE OF TECHNOLOGY & SCIENCE, PILANI-HYDERABAD CAMPUS,

    INSTRUCTION DIVISION, FIRST SEMESTER 2012 2013


    COURSE HANDOUT (PART II)
    Date : 03.08.2012

    In addition to part I (General Handout for all courses appended to the time table), this portion
    gives specific details regarding the course.

    Course Number : CS C363 / IS C363


    Course Title : Data Structures and Algorithms
    Instructor- in - Charge : Dr. N.L.BHANU MURTHY
    Instructors : Ms. Kavita Kariyam
    Mr. Digambar Povar
    Mr. Surender Singh Samant
    Mr. Sada Siva

    1. Course Objective
    The main objective of this course is to introduce structures for storing, retrieving and
    manipulating data. The techniques for designing data structures and their appropriateness to a
    given scenario will be discussed in this course. It aims to discuss the algorithmic techniques
    to solve numerous problems and also introduces the application of mathematical and
    experimental techniques for analyzing the complexity of algorithms and techniques for using
    such analysis in design. It also provides insight into graph search methods, graph algorithms
    and complexity theory.

    2. Course Pre-requisites
    This course assumes familiarity with basic programming skills.

    3. Course Scope
    The course covers design, implementation and applications of data structures including
    stacks, queues, priority queues, linked lists, hash table, heap, binary search tree, balanced
    binary search tree. The course covers algorithm design techniques like Divide and Conquer,
    Greedy Approach, Dynamic Programming, Backtracking, Branch & Bound for designing
    algorithms using examples from sorting, searching, graph theory and real life problems as
    well as techniques for analyzing the complexity of such algorithms.

    4. Text Books
    T1. Micheal T. Goodrich and Roberto Tamassia: Algorithm Design:
    Foundations, Analysis and Internet examples (John Wiley &Sons, Inc., 2002)

    5. Reference Books
    R1. Cormen T.H., Leiserson, C.E., Rivest, R.L., and C. Stein. Introduction to
    Algorithms, MIT Press, Second Edition (Indian reprint: Prentice-Hall).
    R2. Jon Kleinberg and Eva Tardos. Algorithm Design. Pearson Education. (2007)
    R3. Sanjoy Das Gupta, Christos Papadimitriou, Umesh Vazirani, AlgorithmsTata
    McGraw-Hill Publishers
    R4. Alfred V. Aho, John E. Hopcroft, Jeffery D.Ulman. Data Structures and
    Algorithms
    R5. Ellis Horowitz, Sartaj Sahni, Sanguthevar Rajasekaran. Computer
    Algorithms

    1
    6. Lecture Schedule:

    Lect. Topics Reading


    12 Course Introduction & Motivation. -
    T1 1.1 to 1.4 /
    34 Growth of Functions & Asymptotic Notation
    R1 2 to 3
    5 10 Sorting Algorithms Bubble Sort, Quick Sort, Insertion T1 4.1, 4.3, 4.4, 4.5 /
    Sort, Merge Sort, Heap Sort, Radix Sort and Bucket Sort R1 2.1, 6 to 8
    Lower bound for comparison based sorting algorithms
    11 Selection Algorithm T1 4.7

    12 16 Data Structures Stacks, Queues, Priority Queues, T1 2 /


    Sets, Heaps, Hash Tables R1 10 to 11
    (Approaches, Implementation Issues, Complexity
    & Efficiency)
    17 19 Data Structures Binary Search Tree, Red-Black R1 - 12 to 13
    Trees (Approaches, Implementation Issues,
    Complexity & Efficiency)
    20 Amortized Analysis T1 1.5 /
    R1 - 17

    21 22 Graph Search Methods: BFS, DFS R1 22.1 to


    22.3
    23 25 Divide and Conquer and its application to Computational T1 5.2
    Geometry problems, Matrix Multiplication and other R1 4
    problems, Master Method
    26 -29 Dynamic Programming (Fibonacci , LCS, Matrix T1 5.3
    Multiplication, Stamp and Knapsack problems) R1 15
    30 32 Greedy Algorithms (Huffman Code, Task Selection, R1 16
    Fractional Knapsack Problems etc.) T1 5.1
    33 35 Back Tracking, Branch & Bounding R5

    36 38 Graph Algorithms T1 6 to 7
    Shortest Path Algorithms: Dijkstras, Floyd-Warshalls etc R1 23 to 25
    MST Algoirthms : Borvka, Kruskal, Prim

    39 40 Complexity Class - P, NP, NP Complete, NP Hard R1 34


    Is P = NP? and Reductions.
    41 Summary and Conclusion -

    2
    Evaluation Components
    Component Weightage (out of Duration Date Mode
    300)
    Test 1 60 60 minutes 22/09/2012 Closed Book
    8 TO 9AM
    Test 2 60 60 minutes 03/11/2012 Closed Book
    8 TO 9AM
    Lab 60 Every lab Open Book
    Continuous (Continuous will be
    Evaluation & Evaluation - 40 & evaluated.
    Final Test Final Lab Test 20) Final lab
    examination
    will be of
    two hours
    Comprehensive 120 3 hours 08/12/2012 Part Open
    AN

    7. Make-up Policy:
    No makeup will be given for the quizzes and online test. For tests, however, make-up will be granted
    strictly on prior permission and on justifiable grounds only.

    8. Course Notices
    All notices pertaining to this course will be displayed on the LTC Notice Board as well as the
    CS & IS Notice Board.

    9. Chamber Consultation: Thursday 1500Hrs to 1600Hrs @ B219

    Instructor-in-Charge
    CS C363& IS C363

    You might also like