Scribd
Upload
5 views2 pages

CS 2103 Algorithm Design Analysis

Uploaded by

justin.liu042
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
5 views2 pages

CS 2103 Algorithm Design Analysis

Uploaded by

justin.liu042
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

COURSE TITLE: Algorithm Design & Analysis TERM & YEAR:

COURSE NUMBER: CS 2103 TIME:

INSTRUCTOR: ROOM:

OFFICE HOURS: OFFICE LOCATION:

EMAIL: PRE-REQUISITE: CS 1123

PHONE: NUMBER OF CREDIT HOURS: 3

COURSE DESCRIPTION: The theory of programming, reinforced with practical


activities. Students will: analyze algorithms for asymptotic required memory
and time; implement stacks, queues, dictionaries, priority queues using arrays
and linked lists; apply recursion, backtracking, and dynamic programming; use
classic strategies like greedy search and branch-and-bound; use trees and
graphs to solve problems; explain theory of computation (automata and Turing
machines); explain complexity classes like P and NP.

REQUIRED TEXT: Introduction to Algorithms, 3rd edition, T. Cormen, C.


Leiserson, R. Rivest & C. Stein, The MIT Press, ISBN: 978-0-262-03384-8.
Data Structure and Other Objects Using C++, 4th edition, Michael Main & Walter
Savitch, Pearson, ISBN: 978-0-13-212948-0.

COURSE LEARNING OUTCOMES: Upon completion of this course, the student should
be able to:
• Analyze algorithms for asymptotic required memory and time. (E)
• Implement stacks, queues, dictionaries, priority queues using arrays and
linked lists. (B)
• Use trees and graphs to solve problems. (A)
• Explain theory of computation (automata and Turing machines). (D)

COURSE REQUIREMENTS:

ATTENDANCE/PARTICIPATION: Indicate your class attendance policy. (Remember


that for Trine University to receive federal financial aid for its students,
faculty are expected to take roll and be able to verify when students are and
are not attending class.)

GRADING/EVALUATION: Indicate your grading procedure and the type of


evaluations you plan to use.

OTHER POLICIES: You may wish to indicate polices such as the consequences of
academic misconduct, methods of communication, student expectations, instructor
expectations and any other policy that needs to be clarified at the beginning
of the course.
STANDARD UNIVERSITY POLICIES:

ACADEMIC MISCONDUCT
The University prohibits all forms of academic misconduct. Academic
misconduct refers to dishonesty in examinations (cheating), presenting the
ideas or the writing of someone else as one’s own (plagiarism) or knowingly
furnishing false information to the University by forgery, alteration, or
misuse of University documents, records, or identification. Academic
dishonesty includes, but is not limited to, the following examples:
permitting another student to plagiarize or cheat from one’s own work,
submitting an academic exercise (written work, printing, design, computer
program) that has been prepared totally or in part by another, acquiring
improper knowledge of the contents of an exam, using unauthorized material
during an exam, submitting the same paper in two different courses without
knowledge and consent of professors, or submitting a forged grade change slip
or computer tampering. The faculty member has the authority to grant a
failing grade in cases of academic misconduct as well as referring the case
to Student Life.

PLAGIARISM
You are expected to submit your own work and to identify any portion of work
that has been borrowed from others in any form. An ignorant act of plagiarism
on final versions and minor projects, such as attributing or citing
inadequately, will be considered a failure to master an essential course skill
and will result in an F for that assignment. A deliberate act of plagiarism,
such as having someone else do your work, or submitting someone else’s work as
your own (e.g., from the Internet, fraternity file, etc., including homework
and in-class exercises), will at least result in an F for that assignment and
could result in an F for the course.

E-DEVICE POLICY
Use of electronic devices including smart watches and cell phones is
prohibited during exams or quizzes unless directly allowed by the instructor.

COURSE CALENDAR/SCHEDULE:

ADDITIONAL INFORMATION: You may wish to include other information here.


Include information that you would repeat in lessons, practices, policies, etc.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy