Scribd Logo
Upload

Welcome to Scribd!

  • Data Struc Algo Esc

    Uploaded by

    idforig32
    8 views1 page
    This document provides information about an Introduction to Automata Theory course offered by the Computer Science and Engineering department at IIT Roorkee. The course is a 4-credit subject that will be taught over 3 lecture hours and 1 tutorial hour per week in the specified semester. It aims to introduce students to the basics of algorithms and data structures. The course content will cover topics like divide-and-conquer algorithms, sorting algorithms, elementary data structures, hash tables, binary search trees, dynamic programming, and greedy algorithms over 42 contact hours. Suggested textbooks for the course are also listed.

    Original Description:

    Original Title

    Data Struc Algo Esc (2)

    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
    This document provides information about an Introduction to Automata Theory course offered by the Computer Science and Engineering department at IIT Roorkee. The course is a 4-credit subject that will be taught over 3 lecture hours and 1 tutorial hour per week in the specified semester. It aims to introduce students to the basics of algorithms and data structures. The course content will cover topics like divide-and-conquer algorithms, sorting algorithms, elementary data structures, hash tables, binary search trees, dynamic programming, and greedy algorithms over 42 contact hours. Suggested textbooks for the course are also listed.

    Copyright:

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

    Data Struc Algo Esc

    Uploaded by

    idforig32
    This document provides information about an Introduction to Automata Theory course offered by the Computer Science and Engineering department at IIT Roorkee. The course is a 4-credit subject that will be taught over 3 lecture hours and 1 tutorial hour per week in the specified semester. It aims to introduce students to the basics of algorithms and data structures. The course content will cover topics like divide-and-conquer algorithms, sorting algorithms, elementary data structures, hash tables, binary search trees, dynamic programming, and greedy algorithms over 42 contact hours. Suggested textbooks for the course are also listed.

    Copyright:

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

    INDIAN INSTITUTE OF TECHNOLOGY ROORKEE

    NAME OF DEPARTMENT/CENTRE/SCHOOL: CSE

    1. Subject Code: Course Title: Introduction to Automata Theory


    2. Contact Hours: L: 3 T: 1 P: 0
    3. Examination Duration(Hrs.): Theory: 3 Practical: 0
    4. Relative Weightage: CWS: 25 PRS: 0 MTE: 25 ETE: 50 PRE: 0
    5. Credits: 4 6. Semester: 7. Subject Area:
    8. Pre-requisite: Nil
    9. Objective: Introducing the students to the basics of Algorithms and Data Structures.

    10. Details of the Course

    S.No. Contents Contact


    hours
    1. Introduction: Asymptotic notation 2
    2. Divide-and-Conquer algorithms. Maximum-subarray problem. Strassen’s 6
    algorithm for matrix multiplication, Solving recurrences.
    3. Sorting algorithms: insertion sort, merge sort. heap sort, quick sort. 8
    4. Elementary data structures: stacks, queues, linked lists 6
    5. Hash tables: hash functions, open addressing, perfect hashing 8
    6. Binary Search Trees 4
    7. Dynamic programming 4
    8. Greedy algorithms 4
    Total 42

    11. Suggested Books:

    S.No. Name of Authors/Book/Publisher Year of


    Publication / Reprint
    1. Thomas H. Cormen, Charles E. Leiserson, Ronal L. Rivest, Clifford 2009
    Stein. Introduction to Algorithms (Third Edition) PHI
    2. Sartaj Sahni. Data Structures, Algorithms and Applications in C++. 2005
    Universities Press. (Second Edition)
    3. Sanjoy Dasgupta, Christos Papadimitriou, Umesh Vazirani. 2008
    Algorithms. McGrawHill.

    You might also like