Scribd
Upload
2 views2 pages

Flashcards IntroToProgramming

The document provides key concepts for quick revision in programming, including definitions of algorithms, flowcharts, loops, arrays, pointers, functions, compilers, interpreters, data types, conditional statements, and object-oriented programming. It also includes specific examples such as prime checking and summing numbers. These concepts are essential for understanding programming fundamentals.

Uploaded by

sinuchan7272
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
2 views2 pages

Flashcards IntroToProgramming

The document provides key concepts for quick revision in programming, including definitions of algorithms, flowcharts, loops, arrays, pointers, functions, compilers, interpreters, data types, conditional statements, and object-oriented programming. It also includes specific examples such as prime checking and summing numbers. These concepts are essential for understanding programming fundamentals.

Uploaded by

sinuchan7272
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Flashcards - Key Concepts for Quick Revision

Algorithm:

A finite sequence of instructions to solve a problem.

Flowchart:

Diagrammatic representation of an algorithm.

For Loop:

for(init; cond; update) { statements; }

Array:

Collection of elements of same type in contiguous memory.

Pointer:

Variable that stores address of another variable.

Function:

Reusable block of code performing specific task.

Compiler:

Translates full code into machine code before execution.

Interpreter:

Executes code line-by-line at runtime.

Data Types:

Defines type and size of data a variable can hold.

If Statement:

Executes block only if condition is true.

Switch Case:

Multi-branch control structure using case labels.


Prime Check:

Loop from 2 to n-1, if n divisible then not prime.

Sum of N:

Loop from 1 to n adding to sum variable.

2D Array:

Array with rows and columns like a matrix.

Object-Oriented:

Programming model using classes and objects.

You might also like