CS 201 – Data Structures and Discrete Mathematics I

Slides:



Advertisements
Similar presentations
1 Math 140 Data Structures and Algorithms Course Overview Lecture # 00 01/20/15.
Advertisements

CS583 – Data Mining and Text Mining
5/19/2015CS 2011 CS 201 – Data Structures and Discrete Mathematics I Syllabus Spring 2014.
CS 46101–600/CS Design and Analysis of Algorithms Dr. Angela Guercio Spring 2010.
CS583 – Data Mining and Text Mining
CS/CMPE 535 – Machine Learning Outline. CS Machine Learning (Wi ) - Asim LUMS2 Description A course on the fundamentals of machine.
CSIS-385: Analysis of Algorithms Dr. Eric Breimer.
CSc 160 Overview of Fundamentals of Computer Programming II Spring (SO1) 2004.
CS – 600 Discrete Structures for Computer Science Prof. Angela Guercio Spring 2008.
COMP171 Data Structures and Algorithm Qiang Yang Lecture 1 ( Fall 2006)
Course Introduction Computer Science Department CS141:Computer Programming 1 Fall 2014 Dr. Hamid Al-Hamadi.
CS 5941 CS583 – Data Mining and Text Mining Course Web Page 05/cs583.html.
Computer Science 102 Data Structures and Algorithms V Fall 2009 Lecture 1: administrative details Professor: Evan Korth New York University 1.
© 2004 Goodrich, Tamassia CS2210 Data Structures and Algorithms Lecture 1: Course Overview Instructor: Olga Veksler.
CSCI 347 – Data Mining Lecture 01 – Course Overview.
CSc 2310 Principles of Programming (Java) Dr. Xiaolin Hu.
Course Introduction Software Engineering
COMPE 226 Data Structures 2015 Fall Murat KARAKAYA Department of Computer Engineering.
MAT 3724 Applied Analysis Fall 2012
Introduction to Discrete Mathematics J. H. Wang Sep. 14, 2010.
CSC Discrete Mathematical Structures Dr. Karl Ricanek Jr.
Introduction to Databases Computer Science 557 September 2007 Instructor: Joe Bockhorst University of Wisconsin - Milwaukee.
Computer Science 102 Data Structures and Algorithms CSCI-UA.0102 Fall 2012 Lecture 1: administrative details Professor: Evan Korth New York University.
Discrete Mathematics CS204 Spring CS204 Discrete Mathematics Instructor: Professor Chin-Wan Chung (Office: Rm 3406, Tel:3537) 1.Lecture 1)Time:
Course Introduction Andy Wang COP 4530 / CGS 5425 Fall 2003, Section 4.
CS-2851 Dr. Mark L. Hornick 1 CS-2852 Data Structures Dr. Mark L. Hornick Office: L341 Phone: web: people.msoe.edu/hornick/
Software Development CSCI-1302 Lakshmish Ramaswamy.
Introduction to ECE 2401 Data Structure Fall 2005 Chapter 0 Chen, Chang-Sheng
Welcome to CIS 2168 ! Data Structures and Algorithms
CS511: Artificial Intelligence II
Welcome to COMP 250 Introduction to Computer Science! Mathieu Blanchette.
ICS202 Data Structures King Fahd University of Petroleum & Minerals College of Computer Science & Engineering Information & Computer Science Department.
Fall 2010 ICS321 Data Storage & Retrieval Mon & Wed 12-1:15 PM Asst. Prof. Lipyeow Lim Information & Computer Science Department University of Hawaii at.
Course Info Instructor U.T. Nguyen Office: CSEB Office hours: Tuesday, 14:30-15:30 Thursday, 12:00-12:45 By.
Data Structures and Algorithms in Java AlaaEddin 2012.
COP4020 INTRODUCTION FALL COURSE DESCRIPTION Programming Languages introduces the fundamentals of the design and implementation of programming languages.
CSC4320/6320 Operating Systems.  Instructor: Xiaolin Hu   Phone:  Office: 25 Park Place Building,
CMPT 238 Data Structures Instructor: Tina Tian. General Information Office: RLC 203A Office Hour: Tue and Fri 12:30 - 2:00PM.
1 CENG 707 Data Structures and Algorithms Nihan Kesim Çiçekli Department of Computer Engineering Middle East Technical University Fall 2013.
COMP9024: Data Structures and Algorithms Course Outline Hui Wu Session 1, 2016
CS583 – Data Mining and Text Mining
RAIK 283 Data Structures and Algorithms
CENG 707 Data Structures and Algorithms
Computer Network Fundamentals CNT4007C
ICS 6D Discrete Mathematics for Computer Science Fall 2014
CSE 111 Introduction to Computer Applications
Computer Engineering Department Islamic University of Gaza
CSCE 121, Sec 200 Fall 2012 Prof. Jennifer L. Welch.
COMP9024: Data Structures and Algorithms
CSc 1302 Principles of Computer Science II
COMP 283 Discrete Structures
Computer Networks CNT5106C
CS583 – Data Mining and Text Mining
CENG 213 Data Structures Nihan Kesim Çiçekli
CS583 – Data Mining and Text Mining
CMPT 238 Data Structures Instructor: Tina Tian.
Computer Science 102 Data Structures CSCI-UA
CS 201 – Data Structures and Discrete Mathematics I
CS583 – Data Mining and Text Mining
MA Fall 2016 Instructor: Matt Weaver Office: MATH 615
INTRODUCTION TO INFORMATION SYSTEMS AND TECHNOLOGY (NET 201)
Jeremy Bolton, PhD Assistant Teaching Professor
CENG 213 Data Structures Nihan Kesim Çiçekli
CS583 – Data Mining and Text Mining
CS 281: Discrete Mathematics for Computer Science
CS583 – Data Mining and Text Mining
Computer Engineering Department Islamic University of Gaza
Administrative Issues
Computer Engineering Department Islamic University of Gaza
CMPT 238 Data Structures Instructor: Tina Tian.
Presentation transcript:

CS 201 – Data Structures and Discrete Mathematics I Syllabus Fall 2004 11/8/2018 CS 201

General Information Time: 11:00am - 12:15pm, Tue & Thu 12:00 noon - 12:50pm, Wed Location: C6 LC Instructor: Bing Liu Web: http://www.cs.uic.edu/~liub Email: liub@cs.uic.edu Office: 931 SEO Office hours: 3:00-5:00pm Tue & Thu (or by appointment) TA: Hosung Leo Kim Email: hkim@cs.uic.edu Office: See course Web page Office hours: 12:20-1:50pm Mon and Wed (or by appointment) Course Webpage: http://www.cs.uic.edu/~liub/teach/cs201-fall-04/cs201.html Prerequisites: MATH 180, C or better in CS 102 or C or better in CS 107 Req. texts: Data Structures and Algorithms in Java, Third edition, by Michael T. Goodrich and Roberto Tamassia Discrete Mathematics with Applications, Second Edition, by Susanna S. Epp, 11/8/2018 CS 201

Course description This course is a blend of theory and practice. You will study some of the fundamental theoretical topics in Computer Science. These include mathematical induction, set and function theory, run time analysis, and logic. You will also learn some basic data structures and algorithms, and do programming projects to strengthen your programming skills and to apply theory in practice. In addition, you will also study the basics of object-oriented programming using Java. 11/8/2018 CS 201

Topics Propositional logic Predicate logic Mathematical induction Set theory Relation and function theory Recursion Java programming topics Run time analysis Linked lists, stacks and queues Introduction to trees and graphs 11/8/2018 CS 201

Grading Final Exam: 40% Midterm (1): 20% Quizes (2): 20% Java programming assignments (2-3) 20% You MUST pass the final to pass the course. 11/8/2018 CS 201

Rules and Policies Statute of limitations: No grading questions or complaints – no matter how justified – will be listened to one week after the item in question has been returned. Cheating: Cheating will not be tolerated. All work you submitted must be entirely your own. Any suspicious similarities between students’ work (this includes homework, exams and program) will be recorded and brought to the attention of the Dean. The MINIMUM penalty for any student found cheating will be to receive a 0 for the item in question, and dropping your final course grade one letter. The MAXIMUM penalty will be expulsion from the University. MOSS: Sharing code with your classmates is not acceptable!!! All programs will be screened using the Moss (“Measure of Software Similarity”) system. 11/8/2018 CS 201

Rules and Policies Late assignments: Late assignments will not, in general, be accepted. They will never be accepted if the student has not made special arrangements with me at least one day before the assignment is due. If a late assignment is accepted it is subject to a reduction in score as a late penalty. Classroom Conduct: Classroom discussions and questions are a valuable part of the learning process and are encouraged. However, students who repeatedly talk among themselves disrupting the class lecture will be asked to leave. 11/8/2018 CS 201