Scribd Logo
Upload

Welcome to Scribd!

  • UT Dallas Syllabus For Cs4349.581.07u Taught by Ramaswamy Chandrasekaran (Chandra)

    Uploaded by

    UT Dallas Provost's Technology Group
    80 views2 pages
    This syllabus is for the course CS 4349: Advanced Data Structures and Algorithms. The course will be taught in the summer of 2007 by Professor R. Chandrasekaran and TA Mehmet Baysan. Students will study efficient algorithms for fundamental problems using techniques like divide and conquer, greedy methods, and dynamic programming. Topics include graph algorithms, recurrence relations, and order notation. Students will be evaluated based on assignments (20%) and two exams (40% each). Regular attendance is expected.

    Original Description:

    UT Dallas syllabus for taught by

    Original Title

    UT Dallas Syllabus for cs4349.581.07u taught by Ramaswamy Chandrasekaran (chandra)

    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 syllabus is for the course CS 4349: Advanced Data Structures and Algorithms. The course will be taught in the summer of 2007 by Professor R. Chandrasekaran and TA Mehmet Baysan. Students will study efficient algorithms for fundamental problems using techniques like divide and conquer, greedy methods, and dynamic programming. Topics include graph algorithms, recurrence relations, and order notation. Students will be evaluated based on assignments (20%) and two exams (40% each). Regular attendance is expected.

    Copyright:

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

    UT Dallas Syllabus For Cs4349.581.07u Taught by Ramaswamy Chandrasekaran (Chandra)

    Uploaded by

    UT Dallas Provost's Technology Group
    This syllabus is for the course CS 4349: Advanced Data Structures and Algorithms. The course will be taught in the summer of 2007 by Professor R. Chandrasekaran and TA Mehmet Baysan. Students will study efficient algorithms for fundamental problems using techniques like divide and conquer, greedy methods, and dynamic programming. Topics include graph algorithms, recurrence relations, and order notation. Students will be evaluated based on assignments (20%) and two exams (40% each). Regular attendance is expected.

    Copyright:

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

    Syllabus for CS 4349: Advanced Data Structures and Algorithms

    CS 4349: 581: Advanced Algorithms Design and Analysis


    ECSS 2.203 ...... Summer 2007..... MW: 5:00 -- 7:45

    Instructor: R. Chandrasekaran
    Office: ECSN 4.622 (Please Note that this is the OLD building!!!)

    Phone: (972) 883-2032

    Office Hours: M: 3:00 -- 4:00 p.m. & T: 4:00 -- 5:00 p.m.


    URL: http://www.utdallas.edu/~chandra

    Teaching Assistant: Mr. Mehmet Baysan

    Office & Hours: T: 11:00 -- 1:00 @ECSS 2.104 (Open Lab) & W: 3:00 -- 5:00 p.m. @ECSS 4.102

    email: baysan AT utdallas PERIOD edu

    Textbook: ``Introduction to Algorithms,'' T.H. Cormen, C.E. Leiserson ,R.L. Rivest, and C. Stein,
    Second Edition.

    Prerequisites: CS 3345 (Data structures and algorithms): Abstract data types: lists, stacks, queues, trees,
    search trees. Hashing. Priority queues: heaps. Sorting and searching. Graphs: representation and
    algorithms. Running-time analysis of algorithms and order notation.

    Course Objectives: Study efficient algorithms for a number of fundamental problems, learn techniques
    for designing algorithms using appropriate data structures, prove correctness and analyze running times
    of algorithms, .

    Topics: Recurrence relations, Order notation. Divide and conquer, greedy methods, dynamic
    programming, and inductive algorithms. Graph algorithms: Minimum spanning trees, Shortest path
    problems, Maximum flow problems.

    Grades: Assignments - 20%; Exam I - 40% (June 20); Exam II - 40% (July 18)
    There will be no programming assignments.

    ● Lecture #1
    ● Lecture #2
    ● Lecture #3
    ● Lecture #4

    file:///W|/submissions-web/syllabus-tool/[email protected] (1 of 2)6/20/2007 7:52:08 AM


    Syllabus for CS 4349: Advanced Data Structures and Algorithms

    ● Lecture #5
    ● Sample-Graph
    ● Sample-Exam
    ● Cheat-Sheet
    ● Lecture #6
    ● Lecture #7
    ● Lecture #8
    ● Lecture #9
    ● Lecture #10
    ● Lecture #11
    ● Lecture #12
    ● Assignment #1
    ● Assignment #2
    ● Assignment #3
    ● Assignment #4
    ● Assignment #5
    ● Assignment #6
    ● Solution #1
    ● Solution #2
    ● Solution #3
    ● Solution #4
    ● Solution #5
    ● Solution #6

    Student Responsibilities:

    ● Assignments are due in class on the specified date. Turn in what is completed by the deadline for
    partial credit. No late submissions will be accepted.
    ● All submissions must be your own work. Identical assignments will not be accepted.
    ● Regular class attendance and participation is expected and is the responsibility of each individual.
    There is a strong correlation between regular class attendance and good performance. If a student
    should elect not to attend a class, (s)he is responsible for any handouts, announcements, reading
    material and contents of missed lectures.
    ● You are subject to all rules pertaining to integrity of the University -- see http://www.utdallas.edu/
    judicialaffairs/UTDJudicialAffairs-AcademicIntegrity.html
    ●

    file:///W|/submissions-web/syllabus-tool/[email protected] (2 of 2)6/20/2007 7:52:08 AM

    You might also like