Schedule (Tentative)

CSE 1310 - Introduction to Computers and Programming

Lecture Time : Mo We 2:30pm - 3:50pm; NH 111

Textbook: Cay Horstmann, Big Java: Late Objects (1st Edition), 2012. ISBN-13: 978-1-118-08788-6

This course introduces students to computers, to the algorithmic process, and to programming using basic control and data structures. The programming language used in this course is Java.

Note: Some sections of certain chapters may be omitted or modified as the course progresses. The lists of excluded sections will be specified during lectures, if any. Lecture material and due dates may be adjusted.

Instructor: Ali Sharifara

E-Mail: ali.sharifara@uta.edu

Website: https://heracleia.uta.edu/~sharifara

Office Location: ERB 321

Office Hours: Mo & We 4:00 p.m. - 5:30 p.m. or by Appointment

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

TA Information :

Name: Atharv Mangesh Kashyap

E-Mail: atharvmangesh.kashyap@mavs.uta.edu


Lab hours :
Please click here to see the schedule.
Depending on the day and time, we will be using ERB 124, ERB 125, or ERB 132. Please check the schedule to see which lab is used when. Lab doors are closed, but if you knock, the TA will let you in. Send us an e-mail if you have any trouble getting in a lab.

Week Date Covered Topics Related Comments
1-Mo 08/28 Overview
Syllabus
Introduction to Computers and Programming
n/a
1-We 08/30 How to run a java program
First Programs
Chapters 1, 2
2-Mo 09/04 Labor Day holiday No Class
2-We 09/06 First Programs, continued Chapter 2
3-Mo 09/11 Variable Types
Formatted Output
Chapter 2
3-We 09/13 Formatted Output, continued
Strings
Chapter 2
4-Mo 09/18 Boolean Expressions and Conditionals (If Statements) Chapter 3
4-We 09/20 Boolean Expressions and Conditionals (If Statements), continued Chapter 3
5-Mo 09/25 Loops Chapters 3,4
5-We 09/27 Loops, continued Chapter 4
6-Mo 10/02 Loops (continued), Exceptions and Input Validation Chapter 4
6-We 10/04 Prep. Midterm 1 (Review Chapters 1, 2, 3 and 4) n/a
7-Mo 10/09 Midterm Exam (1) n/a
7-We 10/11 Methods (functions) Chapter 5
8-Mo 10/16 Methods (functions), continued Chapter 5
8-We 10/18 Midterm solutions n/a
9-Mo 10/23 Maximization/minimization problems, binary numbers, hexadecimal numbers. Appendix I
9-We 10/25 Binary numbers, hexadecimal numbers, continued Appendix I
10-Mo 10/30 Arrays and array lists Chapter 6
10-We 11/01 Arrays and array lists, continued. Chapter 6
11-Mo 11/06 Prep. Midterm 2 (Review Chapters 5, 6, and Appendix I) n/a
11-We 11/08 Midterm Exam (2) n/a
12-Mo 11/13 Midterm solutions n/a
12-We 11/15 File input/output Chapter 7
13-Mo 11/20 File input/output (continued) Chapter 7
13-We 11/22 CLASS CANCELLED n/a
14-Mo 11/27 File input/output (continued) Chapter 7
14-We 11/29 File input/output (continued)
More examples
Chapter 7
15-Mo 12/04 Prep. Final Exam (Review Chapters 1, 2, 3, and 4) n/a
15-We 12/06 Prep. Final Exam (Review Chapters 5, 6, and 7) Last day of class
16-Mo 12/11 Final Exam - Time : 2:30 p.m. - 4:00 p.m. - ERB-228 University Schedule

Grading Policy:

Make-up Exams: No make-up exam will be given.

Grading Distribution:

A >= 90%, B >= 80%, C >= 70%, D >= 60%, F < 60%

Syllabus (Tentative)

Topic Covered # of Lectures
Syllabus n/a
Introduction n/a
First Programs: Output, Arithmetic, Variables, User Input n/a
Variables, types, operations on numbers, formatted output (printf). n/a
Strings n/a
If statements n/a
Loops n/a
Methods (functions) n/a
Maximization/minimization problems, binary numbers, hexadecimal numbers n/a
Arrays and array lists n/a
File input/output n/a

General Policies:


Description of Course Content:

This course introduces students to computers, to the algorithmic process, and to programming using basic control and data structures. The programming language used in this course is Java. Prerequisite: MATH 1302

Course Objectives:

Student Learning Outcomes: After successfully taking this course, a student should be able to write simple programs in Java, for processing numbers and text data. The student will know how to use conditionals, loops, strings, arrays, methods, and file input and output. The student will also have some understanding of principles of code design, and of good programming practices.

Assignments

There will be several programming assignments in this course, typically assigned on a weekly basis. All assignments will have equal weight. No assignment scores will be dropped. The following class policies regarding assignments will be followed:
Back to previous page