Programming Concepts Quiz

Programming Concepts

• Programming languages are sets of keywords and grammar rules for creating computer instructions
• A computer program is a set of instructions telling the computer how to perform a task
• A programmer is a person who writes program instructions, otherwise known as source code

Terminologies

• Keyword/Command: A word with a pre-defined meaning, reserved for a program, defining commands and specific parameters. The number of keywords can differ between languages.
• Executable vs. Non-Executable Statements: Executable statements usually begin with a keyword and initiate actions (e.g., calculations ), while non-executable statements provide information about data or processing without causing any action.
• Syntax vs. Semantics: Syntax refers to the grammar rules used in programming, similar to grammar in natural language. Semantics describes the function of a command, its meaning, like meaning in a natural language.
• Variable vs. Constant: Variables are memory locations holding values that can change during program execution. Constants hold values that shouldn't change.
• Variable Declaration: This specifies a variable's name and characteristics.
• Variable Datatype: A set of possible values and allowed operations on a variable. It guides the compiler on how to use the data.
• Variable/constant name should be descriptive
• File name vs. filename extension: File name provides context and relation to other files by describing the file's contents. Filename extension describes characteristics or intended use of the file (e.g., .exe, .obj).
• File types: Common file types for source codes, objects, executables and data are used.

Terminologies (continued)

• Interpreter: A program translating source code into intermediate representation for execution, executing one statement at a time.
• Compiler: A program that translates high-level language into machine language, executing the entire source code at once.
• Assembler: Translates assembly language to machine code.

Programming Languages Types & Generations

• Low-level Language: Includes commands specific to a particular CPU or microprocessor, easily understood by the machine.
  • Machine Language: Uses binary code (0s and 1s).
  • Assembly Language: Uses symbolic code representing instructions.
• High-level Language: Employing command words and grammar similar to human language, easy to understand and write by humans. Example languages: Java, C#, C and C++.
• First Generation: Machine Language; binary instructions understood directly by computer. Example: 0101110110111001
• Second Generation: Assembly Language; low-level language with human-readable instructions used in kernels and hardware drivers. Example: Sub, Add, Mov.
• Third Generation: Easy-to-remember command words and structured steps. These are high-level languages like C, Fortran, and Basic.
• Fourth Generation: Object-oriented language with human-like language structures in database programming and scripting. Example: Java, Python.
• Fifth Generation: Declarative programming using visual tools. Example: Prolog.
  • Programming paradigm: A way to conceptualize and structure tasks performed by a computer. Languages are categorized by a paradigm.

Programming Tools

• SDK (Software Development Kit): Collection of tools for a specific platform to create applications.
• IDE (Integrated Development Environment): Collection of development tools often used in SDKs; provides a sleek programming interface.
• Component: Pre-written module designed for a specific action.
• API (Application Programming Interface): Collection of functions/programs that programmers can use from within their programs.
• VDE (Visual Development Environment): Tools supporting the development of substantial sections/parts of a program visually.

Solving Problems Using Programming Language

• Identify and Understand the Problem: Clearly define the task
• State/outline the solution; break down the problem into steps.
• Program planning:
  • Algorithm: Set of steps for performing a task, recorded manually. Defines steps to manipulate info and produce the desired output. Use flowchart to convey algorithmic steps or pseudocode.
  • Flowchart: Graphical representation of algorithm/solution steps using unique symbols, showing the order of events.
  • Pseudocode: Step-by-step description of an algorithm using simple English.
• Write the program source code: Use the appropriate programming language to provide instructions for the computer.
• Program testing and documentation: Correct errors, comments, documentation for clarity and maintenance.

Programm Planning (continued)

• Problem statement determines elements to manipulate for the goal.
• Assumptions are accepted as true.
• Known information helps computer solve problems.
• Variables & constants need to be determined.

Algorithms (continued)

• Set of steps to execute the task, often written down.
• Implementing steps to solve the problem manually.
• Specifying how information will be manipulated.
• How to display the result/solution.
• Expressing the algorithm through flowchart or pseudocode.

Flowchart (continued)

• A flowchart is a graphical representation of an algorithm or process.
• It uses various symbols to represent actions/steps, and flow patterns, e.g.:
  • Start/Stop
  • Input/Output
  • Processing
  • Decision
  • On-page/Off-page connectors
  • Predefined Processes

Pseudocode (continued)

• A step-by-step explanation of an algorithm in plain English, not specific to any programming language, for humans to understand.
• A pseudocode can be represented for a task/ problem, like finding the largest of two numbers (A and B).

Writing the program source code (continued)

• Appropriate language should be chosen.
• Example of C++ code (from the presentation) is provided for finding the largest of two numbers.

Program Testing and Documentation (continued)

• Programs must be tested to ensure correctness.
• Errors might include syntax, runtime, or logic errors.
• A debugger can help in finding and correcting errors.
• Comments and documentation clarify the code for programmers.

Program Structures

• Sequence Structure: Instructions are executed in the order they appear.
• Selection Structure: Enables the selection of one path among multiple alternate paths based on conditions, offering choices among different program flows.
• Repetition Structure: Allows set of instructions to be executed multiple times (loops) based on conditions (pre or post conditions).

Sequence Structure (continued)

• Instructions are executed in the order they are written.
• Example: Simple steps to read two numbers and print them.

Selection Structure (continued)

• Select one path among given paths or choices based on conditions.
• Example: Finding the largest of two numbers.

Repetition Structure (continued)

• Instructions are repeated.
• Example: Finding the largest number in a list of numbers

References & Additional Resources

• New Perspectives on Computer Concepts by Dan Oja
• Introduction To The Concepts Of Computer Programming
• Computer Programming Tutorial
• Introduction to Programming and Computer Science (Full Course Video) (likely online)