index

MAD 3512 - Theory of Algorithms - On Campus Class

Prof. Ram's Zoom Meeting ID: 722 280 1561 - Passcode was sent to your official FIU e-mail.

Syllabus
Contains the name of the textbook, prerequisites for the course, relevant sections of the textbook,
exam policy, schedule of exams, grading scheme, and other pertinent information.

Homework - (7th edition & 6th edition)
      Contains the list of Homework Problems for the 7th ed. including the assigned supplementary problems.
      You can find solution to most of the assigned problems in the textbook & in the supplementary HW
       just below under Solutions to Homework Problems. The Selected 7th ed. & 6th ed. HW are the same.

Solutions to Homework Problems - 7th edition & 6th edition
       Chapters 1&2&3                     Chapters 4&5             Chapters 9&11&13
       Contains the solutions or hints to most of the assigned problems in the textbook (4th ed).

       Supplementary HW Problems                    Solutions to Supplementary Problems
       Contains the Homework problems that are not from the textbook (Problems E1 - E14)
       and the solutions to the HW problems that are not from the textbook (Solutions E1 - E14)

A CSG for the language L = {abc, aabbcc, aaabbbccc, aaaabbbbcccc, . . . }

-----------------------------------------------------------------------------------------------

Homework (5th edition - very old)

Solutions to Homework Problems - 5th edition
Chapter 1&2 Chapter 3 Chapter 4&5 Chapter 9&11&13
Contains the solutions or hints to most of the assigned problems in the textbook (5th ed).

        Supplementary HW Problems                    Solution to Supplementary Problems
        Contains the Homework problems that are not from the textbook (Problems E1 - E14)
        and the solutions to the HW problems that are not from the textbook (Solutions E1 - E14)

A CSG for the language L = {abc, aabbcc, aaabbbccc, aaaabbbbcccc, . . . }

Modified Class notes

Ch.0 - Table of Contents & Preliminaries

Ch.1 - Languages & Regular Expressions

Ch.2 - Phrase-Structure Grammars

Ch.3 - Finite State Machines

Ch.4 - Regular & Non-Reg. Languages

Ch.5 - Turing Machines & Computations

Ch.6 - Recursive Functions & Relations

Ch.7 - Computational Complexity

Ch.8 - Pushdown Automata & CFGs (not included in the course)

Review Sheets. Most of the questions in the exams usually come from the topics in the Review

but this cannot always be so because everything we cover cannot always fit on one page.

            Test #1   Review ,                                                     Test #2    Review
The Review for the Final Exam just consists of the reviews for Test#1 and Test #2

Past Exams. The future exams cannot always be very similar to past exams for things have to change.
      Spring 2008 Quiz #1                   Spring 2008 Test #1                        Spring 2008 Test #2
     Spring 2009 Quiz #1                Spring 2009 Test #1                        Spring 2009 Test #2
     Fall 2009 Quiz #1                    Fall 2009 Test #1                             Fall 2009 Test #2