Lecture # | Date | Lecture Quiz | Notes | Recording | Pages | Lab | HW | Keywords |
---|---|---|---|---|---|---|---|---|
WEEK 1 | ||||||||
Introduction, course policies and motivations
Watch Chapter 1 Recordings |
||||||||
Chapter 2: Structure of a C program, Commenting, Identifiers. | ||||||||
WEEK 2 | ||||||||
Chapter 2: Identifiers, Data types, Variables, Literal Constants, Symbolic/Defined Constants | ||||||||
Chapter 2 cont.: Formatted I/O, Width and precision modifiers | ||||||||
WEEK 3 | ||||||||
Chapter 2 cont.: Scanf, Errors and debugging with examples Chapter #3: Expressions(Operators and operands). Operator precedence. Assignment expressions. Simple & Compound assignments. |
||||||||
Chapter #3 cont.:
|
||||||||
WEEK 4 | ||||||||
Chapter #3 cont.: Selection via calculation explained with 2 examples. Chapter#4: Purpose of functions. Motivation: |
||||||||
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. 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.: Scope. Structure Charts. How to read a structure chart.
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 introduction. |
||||||||
Chapter #5 cont.: Short circuit method with example.
Relational operators (<, <=, >, >=). Comparative operators (==, !=). Compound statements. Examples illustrating compound statements with short circuit method. |
Midterm Exam #1 - Date: Thursday, September 26 *** Time: 6:30pm - 7:30pm *** Location: ELLT 116 | |||||||
WEEK 7 | ||||||||
Complements: (1) Relational and comparative operators. (2) Logical operators. examples on Complements. Two way selection: (1) if-else with examples. Nested selection. Dangling else. |
||||||||
Chapter #5 cont.:
Two way selection: (2) Conditional expressions. Multiway selection: (1) if / else if / else with examples compared to if if structure. |
||||||||
WEEK 8 | ||||||||
  🍁 FALL / OCTOBER BREAK 🍁 | ||||||||
Chapter #5 cont.: Multiway selection: (2) switch construct. |
||||||||
WEEK 9 | ||||||||
Chapter #6: Repetition using loops. looping basics and terminology.
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. |
||||||||
Chapter #6 cont.: 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. while vs do-while loops with example(factorial example). Nesting concept. Nested loops with example (range of factorials example). The infinite loop. |
||||||||
WEEK 10 | ||||||||
Chapter #6 cont. : The for loop.
Converting while loops to for loops examples. Rearranging digits in a number example. |
||||||||
Chapter #6 cont. :
Rearranging digits in a number example explained with structure and flow charts.
Recursion: concepts with examples (Restaurant waiting line & factorial examples). |
Midterm Exam #2 - Date: Monday, October 28 *** Time: 8:00pm - 9:30pm *** Location: ELLT 116 | |||||||
WEEK 11 | ||||||||
Chapter #8:
|
||||||||
|
Chapter 8 cont.:
|
|||||||
WEEK 12 | ||||||||
Chapter 8 cont.:
Arrays and Measures of Efficiency with examples. Exchanging values appropriately. Sorting terminology (list, pass and swap). The 4 possible ways to sort a list. |
||||||||
133 - 134 |
Chapter 8 cont.:Bubble & Selection Sort: Example on selection sort demonstrating the 4 different configurations of sorting. | |||||||
WEEK 13 | ||||||||
135 147 - 148 |
Chapter 8 cont.: Sorting algorithms: (3) Insertion sort with examples.Summary thoughts of sorting algorithms. Previous exam sorting algorithm questions.
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). |
|||||||
Chapters 9 & 10 cont.: Example on Pointers and Variables addresses. Arrays and Pointers with an example. | ||||||||
WEEK 14 | ||||||||
Chapters 9 & 10 cont.: 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. |
||||||||
Revision and previous exams questions. | ||||||||
WEEK 15 | ||||||||
Lecture is posted online only - No in-person meeting Chapter 8 cont.: Searching: (1) Sequential search: Assumptions. How it works. Implementation of a sequential search. Best and worst case scenario with Examples (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. (3) Multidimensional Arrays: Declaration and Definition. 1D, 2D, 3D and 4D arrays. 2D arrays example. |
||||||||
  THANKSGIVING | ||||||||
WEEK 16 | ||||||||
  NO LECTURE - Lecture is canceled to compensate for evening midterm exam 1 | ||||||||
  NO LECTURE - Lecture is canceled to compensate for evening midterm exam 2 | Final Exam - Date: Thursday, December 12 *** Time: 7:00pm - 9:00pm *** Location: ELLT 116 |
❤ I will miss you All ❤ |
---|