Understanding Algorithms and Computer Functions

Lecture 1: Fundamental Of Structured Programming

• The lecture covers fundamental structured programming concepts and algorithmic problem-solving.
• This includes primitive data types, control structures, functions, parameter passing, top-down design, arrays, files, and the processes of compiling, running, testing, and debugging programs.

Assessment

• Final Term Examination: 50%
• Quiz_1: 5%
• Quiz_2: 5%
• Midterm Exam: 15%
• Attendance: 5%
• Sections: 20%

Grading Scale

• A+ : ≥ 90%, GPA ≥ 3.7
• A: 85% - 89%, GPA = 3-3.69
• B+: 80%-84%, GPA = 2.7-2.99
• B : 75% - 79%, GPA = 2.4 - 2.69
• C+: 70% - 74%, GPA = 2 - 2.39
• C : 65% - 69%, GPA = 1.7 - 1.99
• D+ : 60% - 64%, GPA = 1.4 - 1.69
• D: 50%-59% , GPA = 1 - 1.39
• F : < 50%, GPA = 0

Textbook References

• Starting out with C++: From Control Structures through Objects, Ninth Edition, by Tony Gaddis.

Course Materials

• Course materials are available on Google Drive.
• The link to the Google Drive folder is: https://drive.google.com/drive/folders/1tPM-3Xj4whtwlWia_tA0GaZVx_FTvJoC?usp=sharing

Topics Covered

• Chapter 1: Introduction to Computers and Programming
• Why Program?
  • Computer: A programmable machine that follows instructions.
  • Computers are programmable; can do many jobs.
  • Program: Instructions in computer memory that make it do something (referred to as software).
  • Programmer: Writes instructions (programs) to make computers perform tasks.
• Computer Systems: Hardware and Software
  • All computer systems consist of similar hardware devices and software components. (Examples of hardware devices and software are shown in the lecture)
• Main Hardware Component Categories
  • Central Processing Unit (CPU): Retrieves and decodes instructions and coordinates activities of other parts of the computer.
    • Arithmetic & Logic Unit (ALU): Optimizes for high-speed numeric calculations and true/false decisions.
  • Main Memory (RAM): Volatile memory; erased when the program terminates or the computer is turned off.
    • Byte: Basic memory unit sufficient for a letter or small number.
    • Bit: The smallest piece of memory. Can have values 0 (off, false) or 1 (on, true). Bytes have unique addresses.
  • Secondary Storage Devices: Data can be held for extended periods of time, even if there is no power to the computer. Non-volatile.
    • Magnetic: Traditional hard drives
    • Solid-state Memory/Storage
    • Optical: CD-ROM, DVD
    • Flash drives
  • Input Devices: Send information to the computer from outside.
    • Keyboard, mouse, touchscreen, scanner, digital camera, microphone, disk drives, CD drives, DVD drives
  • Output Devices: Send information from the computer to the outside world.
    • Screens, printers, and speakers
• Software
  • Two general categories: system software and application software
    • System software: Controls and manages basic computer operations.
    • Application software: Makes computers useful for everyday tasks
    • Examples of system and application software shown (images of logos)
• Programs and Programming Languages
  • Program: A set of instructions a computer follows to perform a task.
  • Algorithm: Instructions that tell the computer how to solve a problem or perform a task (these instructions are the 'steps' or actions to be carried out).
  • Programming Languages: A special language used to write computer programs.
• Types of Programming Languages
  • Low-level: Used to directly communicate with computer hardware. Often written in binary machine code (0's/1's).
  • High-level: Closer to human language.
• Machine Language
  • The computer only executes machine language instructions, which are binary numbers.
• Some Well-Known Programming Languages (List of languages shown)
• Algorithms and Flowcharts
  • Tools to represent a program’s processes.
  • A typical programming task divides into problem-solving and implementation phases, with algorithms being the ordered sequence of steps to solve problems and the implementation phase bringing the algorithm to life in a language.
• Algorithm
  • A set of well-defined steps to perform a task or solve a problem with steps sequentially ordered
• Pseudocode
  • An artificial yet informal language similar to everyday English used to develop algorithms, examples given in lecture.
• Flowchart
  • A visual representation of the program’s steps, using standard geometric shapes connected by arrows.
  • Displays the logic of an algorithm with a focus on individual steps and their interconnection.
• Standard Symbols used in Flowcharts
  • Terminal: Start/Stop/End represented by rounded rectangles.
  • Input/Output: Obtaining data/recording results represented by parallelograms.
  • Process: Instructions represented by rectangles.
  • Decision: Branching represented by diamonds. Shows a choice between two paths.
  • Flow Direction Lines: Indicate the order of execution.
  • Comments: Used to describe processes (represented by a dashed line and description box).
  • Connector: Used to link elements on the same page. Represented by a small circle.
  • Off-page Connector: Used to connect items to be joined that are on different pages.
  • Predefined Process: The symbol represents a predefined process when the flowchart that defines the process itself is not included in the current set of flowcharts.
• Flowchart Structures: (Sequence, Decision, Repetition or loop, Case structures and an example shown for each)

Exercises

• Several exercises are provided for designing flowcharts, including those for converting temperatures, calculating sums, differences, products, quotients (on various inputs), and converting units. Additional exercises include writing algorithms to find the largest number/smallest number from varying amounts of inputs and more complex calculations.

Assignment

• Students are given assignment to create flowcharts that meet specific criteria. The assigned tasks include algorithm design for various calculations (summing numbers, identifying largest/smallest of various inputs, etc.).

This quiz explores fundamental concepts of algorithms and their roles in computer programming. Questions will test your understanding of how computers work as programmable machines and the characteristics that define their functionality. Get ready to enhance your knowledge on algorithms, functions, and the various aspects that allow computers to perform diverse tasks.