| Lecture # | Date | Lecture Quiz | Notes | Recording | Pages | Lab | HW | Keywords |
|---|---|---|---|---|---|---|---|---|
| WEEK 1 | ||||||||
| Introduction, course policies and motivations | ||||||||
| Chapter 2: Structure of a C program, Commenting, Identifiers, Data types. | ||||||||
| WEEK 2 | ||||||||
| Chapter 2: Data types, Variables, Literal Constants, Symbolic/Defined Constants, Formatted I/O | ||||||||
| Chapter 2 cont.: Formatted I/O, Width and precision modifiers, Errors and debugging with examples | ||||||||
| WEEK 3 | ||||||||
| Chapter #3: Expressions(Operators and operands). Operator precedence. Assignment expressions. Simple & Compound assignments. Prefix and postfix (Undefined vs. Well-defined behavior example). | ||||||||
| Chapter #3 cont.: Single and mixed data type expressions. implicit, explicit (type casting), and assignment data type conversions. Rounding, truncation using floor(), type casting to int, truncation in printing using precision modifiers. A brief overview of "Selection via calculation". | ||||||||
| WEEK 4 | ||||||||
| Chapter #3 cont.: Selection via calculation explained with 2 examples. Chapter#4: Purpose of functions. Motivation - why? Factor – smaller is easier. Reuse - by you or others. Remove redundancy. Protect data – using the variable doesn't change its value. | ||||||||
| Chapter# 4: cont. Top-Down design. Factoring: Each function does a single task (functionally cohesive). Functions terminology. Call / calling / called / Return. Parameter passing. Types of functions. 1- No parameters - no return value: ex. welcome() , menu_options(). 2- No parameters - with return value: ex. get_input(). | ||||||||
| WEEK 5 | ||||||||
| Chapter#4 cont. Types of functions. 1- No parameters - no return value - welcome() , menu_options() 2- No parameters - with return value - get_input(). 3- With parameters - with return value - Many math.h fx, sin(). 4- With parameters - no return value - printf(), display_results(). What is permitted in main() Function - only local variable definitions, function calls and limited selection or repetition (to call functions). | ||||||||
| Chapter#4 cont. Parameter passing: 1- Pass by address.2- Pass by address. Pointer operations. | ||||||||
| WEEK 6 | ||||||||
| Chapter#4 cont. Parameter passing: Pass by address. Pointer operations. Scope. Structure Charts. How to read a structure chart. | ||||||||
| Chapter #4 cont. Problem-solving method (specify, analyze, design, code, test and debug, refine). Chapter #5: Selection. Logical data. logical operators (NOT, AND, OR). Logical operators truth table. Logical expressions evaluation. Short circuit method with example. | ||||||||
| WEEK 7 | ||||||||
| Chapter#5 cont. : Relational operators (<, <=, >, >=).
Comparative operators (==, !=). Compound statements.
Examples illustrating compound statements with short circuit method. |
||||||||
| Chapter #5 cont.: Compound statements revisited with examples.
Complements: (1) Relational and comparative operators. (2) Logical operators. examples on Complements. Two way selection: (1) if-else with examples. Nested selection. Dangling else. |
||||||||
| WEEK 8 | ||||||||
| 🍁 FALL / OCTOBER BREAK 🍁 | ||||||||
| Chapter #5 cont.:
Two way selection: (1) if-else. Nested selection (if/if else) . Dangling else. (2) Conditional expressions. Multiway selection: (1) if / else if / else with examples compared to if if structure. |
Midterm Exam #1 - Date: Thursday, October 12 *** Time: 8:00pm - 9:00pm *** Location: ELLT 116 | |||||||
| WEEK 9 | ||||||||
| Chapter #5 cont.: Multiway selection (2) switch construct.
|
||||||||
| Chapter #6 cont.: Repetition Flow chart example (calc avg, min and max of exam scores).
Pretest and post-test loops. How to choose the right construct. Factorial example. Event-controlled vs. Counter-controlled processes. Input validation. Basic syntax of while and do while loops. Revisiting Factorial example to demonstrate another variation of the factorial example using while and do while loops. |
||||||||
| WEEK 10 | ||||||||
| Chapter #6 cont. : while vs do-while loops with example(factorial example).
Nesting concept. Nested loops with example (range of factorials example). The infinite loop. The for loop. |
||||||||
| Chapter #6 cont. :
Converting while loops to for loops examples. Rearranging digits in a number example. |
||||||||
| WEEK 11 | ||||||||
| Chapter #6 cont.:
|
||||||||
Chapter 8 cont.:
|
||||||||
| WEEK 12 | ||||||||
133 - 134 |
Chapter 8 cont.: Objects learned till now (Variables, Array elements, Whole Arrays). Arrays and Measures of Efficiency with examples. Exchanging values appropriately. Sorting terminology (list, pass and swap). The 4 possible ways to sort a list. Bubble & Selection Sort: |
|||||||
| Chapter 8 cont.: Sorting algorithms: (3) Insertion sort with examples.Summary thoughts of sorting algorithms. Previous exams' questions. Previous exam sorting algorithm questions. | ||||||||
| WEEK 13 | Midterm Exam #2 - Date: Monday, November 13 *** Time: 8:00pm - 9:30pm *** Location: ELLT 116 | |||||||
| Chapters 9 & 10: Pointers and pointer applications. What is a pointer?
How to store an address in a pointer? and how to print the address stored in a pointer? Declaration of a pointer. Pointer initialization (Between functions & within the same function). Example on Pointers and Variables addresses. |
||||||||
| Chapters 9 & 10 cont.: Arrays and Pointers with an example. Pointer Arithmetic and Arrays example.
(1) Values stored in the array and (2) The addresses of each single element of the array. Memory Allocation Function - malloc How to use this relationship to get a dynamic memory allocation during the runtime (malloc). Example on an array defined using malloc function. |
||||||||
| WEEK 14 | ||||||||
| NO LECTURE - Lecture is canceled to compensate for evening midterm exam 1 | ||||||||
| THANKSGIVING | ||||||||
| WEEK 15 | ||||||||
| Chapter 8 cont.: Multidimensional Arrays: Declaration and Definition. 1D, 2D, 3D and 4D arrays. 2D arrays example.
Searching: (1) Sequential search: Assumptions. How it works. Implementation of a sequential search. Best and worst case scenario. Examples |
||||||||
| Chapter 8 cont. (2) Binary search: Assumptions. How it works. Implementation of a sequential search. Best and worst case scenario.
Examples Binary search examples: (1) Target is found in the list. (2) Target is not found. Implementation of Binary search. |
||||||||
| WEEK 16 | ||||||||
| Revision and previous exams questions. | ||||||||
| NO LECTURE - Lecture is canceled to compensate for evening midterm exam 2 | Final Exam - Date: Tuesday, December 12 *** Time: 3:30 - 5:30 pm *** Location: ELLT 116 | |||||||
|
❤ I will miss you All ❤ |
|---|