Tentative Class Schedule

CSE 1320-007 Intermediate Programming

Lecture Time: Mo We 7:00pm-8:20pm; ERB 129

Reference: C By Discovery (4th Edition), Foster and Foster. ISBN-13: 978-1576761700 ISBN-10: 1576761703

Programming concepts beyond basic control and data structures. Emphasis is given to data structures including linked-lists and trees as well as modular design consistent with software engineering principles.

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, CSE@UTA

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

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

TA Information :

Name: Subharag Sarkar

E-Mail: subharag.sarkar@mavs.uta.edu

Office Location: ERB 541

Office Hours: Tu Th 10:00 a.m. - 12:00 p.m.


Week Date Covered Topics Related Comments
1-We 01/17 Syllabus, Overview, Introduction
2-Mo 01/22 Working with Omega server Variables, Statements, Operators
2-We 01/24 Variables, Statements, Operators, continued.
Binary and Hexadecimal Numbers
3-Mo 01/29 Condition if-else, nested if-else, Conditional switch, loop-while
3-We 01/31 Loop do-while, loop-for Arrays
4-Mo 02/05 Arrays, Search and Sort
4-We 02/07 Search, Sort and Strings
5-Mo 02/12 String functions
5-We 02/14 Function & Recursion
6-Mo 02/19 Recursion
Review for Exam 1
6-We 02/21 Exam 1
7-Mo 02/26 Exam 1 - solutions
Pointers
7-We 02/28 Pointers
8-Mo 03/05 Pointers
8-We 03/07 Pointers
9-Mo 03/12 Spring Vacation No Class
9-We 03/14 Spring Vacation No Class
10-Mo 03/19 Dynamic memory
10-We 03/21 Dynamic memory
11-Mo 03/26 General Input/output
11-We 03/28 Files
12-Mo 04/02 Structure
Review for Exam 2
12-We 04/04 Exam 2
13-Mo 04/09 Structure
13-We 04/11 Linked list
14-Mo 04/16 Linked list
14-We 04/18 Linked list
15-Mo 04/23 Stack
15-We 04/25 Queue
16-Mo 04/30 Tree
16-We 05/02 Tree
Review for Final Exam
Last day of class
17-Mo 05/07 No Class University Schedule
17-We 05/09 Final Exam - 8:30 p.m. 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 Number of hours
Syllabus 1.5
Introduction 1.5
Condition and Loop 3
Variable types 1.5
Function 3
Array and String 3
Pointers 3
Array and Pointers 1.5
I/O 3
Structure 1.5
Dynamic Memory 3
Linked List 3
Memory Stack vs Heap 3
Recursion 1.5
Binary Tree 3
Advanced topics 3

General Policies:


Description of Course Content:

Programming concepts beyond basic control and data structures. Emphasis is given to data structures including linked-lists and trees as well as modular design consistent with software engineering principles. Prerequisite: ENGR 1300, CSE 1105, CSE 1310 or CSE 1312, and MATH 1421 or MATH 1426 (or concurrently)

Course Objectives:


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