🇵🇰 CSS Computer Science · flashcards
CSS Computer Science Fundamentals of Computing & Programming Flashcards
51 question-and-answer cards covering Fundamentals of Computing & Programming as it is examined in CSS Computer Science. 24 of them are printed below, taken from across the deck — no signup, no paywall on the preview.
24 sample cards from the Fundamentals of Computing & Programming deck
Sampled from the end of the deck, so these are different cards from the ones shown on the syllabus page.
What are the four main categories of productivity (application) software?
Word processors, spreadsheets, presentation software, and database management systems (e.g., MS Word, Excel, PowerPoint, Access).
Distinguish system software from application software.
System software manages and operates the hardware (e.g., operating systems, device drivers, utilities); application software performs specific user tasks (e.g., word processors, browsers).
What is the difference between the Internet and the World Wide Web?
The Internet is the global network of interconnected computers and infrastructure; the WWW is a service running on the Internet consisting of interlinked hypertext documents accessed via HTTP.
Define a protocol and name the protocol pair foundational to the Internet.
A protocol is a set of rules governing data communication; the foundational suite is TCP/IP (Transmission Control Protocol / Internet Protocol).
What does a URL contain and what does HTTP stand for?
A URL (Uniform Resource Locator) contains the protocol, domain name, and resource path of a web resource; HTTP stands for HyperText Transfer Protocol.
List the five computing disciplines defined by the IEEE/ACM Computing Curricula.
Computer Engineering, Computer Science, Information Systems, Information Technology, and Software Engineering.
How does Computer Science differ from Information Technology as computing disciplines?
Computer Science focuses on theory, algorithms, and the design of computing systems and software; Information Technology focuses on selecting, deploying, integrating, and maintaining technology to meet organizational needs.
What does an algorithm mean, and name two ways to represent one.
An algorithm is a finite, ordered, step-by-step procedure to solve a problem; it can be represented using flowcharts or pseudocode.
List the basic steps of the problem-solving/program development cycle.
Define/analyze the problem, design the solution (algorithm), code/implement, test and debug, and maintain/document.
Name the four basic flowchart symbols and their meanings.
Oval = start/end (terminal), Parallelogram = input/output, Rectangle = process, Diamond = decision.
What is the difference between a compiler and an interpreter?
A compiler translates the entire source program into machine code at once before execution; an interpreter translates and executes the program line by line at runtime.
Differentiate syntax errors, logic errors, and runtime errors.
Syntax errors violate the language's grammar (caught at compile time); logic errors produce wrong results despite valid syntax; runtime errors occur during execution (e.g., division by zero).
What is the difference between a variable and a constant?
A variable is a named storage location whose value can change during execution; a constant is a named value that remains fixed throughout the program.
Distinguish primitive data types from derived/user-defined data types in C/C++.
Primitive (built-in) types include int, char, float, double, bool; derived/user-defined types include arrays, pointers, structures, unions, and classes built from primitives.
What is the difference between cin/cout and the stream insertion (<<) and extraction (>>) operators in C++?
cin is the standard input stream and cout the standard output stream; >> is the extraction operator (reads from input into a variable) and << is the insertion operator (sends data to output).
Name the three categories of control structures in structured programming.
Sequence, Selection (decision: if, if-else, switch), and Iteration (loops: for, while, do-while).
What is the key difference between a while loop and a do-while loop?
A while loop checks the condition before executing (may run zero times); a do-while loop executes the body first and then checks the condition (always runs at least once).
Differentiate break and continue statements in a loop.
break terminates the loop entirely and transfers control past it; continue skips the rest of the current iteration and proceeds to the next iteration.
What is the difference between call by value and call by reference in functions?
Call by value passes a copy of the argument, so changes inside the function do not affect the original; call by reference passes the actual variable's address/alias, so changes affect the original.
What is the difference between a function's parameters and arguments?
Parameters are the variables listed in the function's definition (formal parameters); arguments are the actual values passed to the function when it is called (actual parameters).
How is an array indexed in C/C++, and what is the index of the first element?
Arrays are zero-indexed, so the first element is at index 0 and the last element of an n-sized array is at index n-1.
How is a string represented in C, and what marks its end?
A C string is a one-dimensional array of characters terminated by the null character '\0', which marks the end of the string.
What is a pointer, and which operators are used to declare and dereference it?
A pointer is a variable that stores the memory address of another variable; the asterisk (*) declares and dereferences the pointer, and the ampersand (&) yields the address of a variable.
What is dynamic memory allocation, and which operators/functions perform it in C++ and C?
Dynamic memory allocation reserves memory at runtime from the heap; in C++ the new and delete operators are used, and in C the functions malloc()/calloc() allocate and free() releases memory.
What this deck covers
The Fundamentals of Computing & Programming deck follows the CSS Computer Science Fundamentals of Computing & Programming syllabus — 4 chapters and 18 topics — so questions land on material that is genuinely examinable rather than trivia around it. That works out to roughly 12.8 cards per chapter.
Answers are written to be recallable, not just readable — averaging about 157 characters, which is long enough to carry the reasoning and short enough to say out loud.
A deck like this earns its keep on the second and third pass. Read the syllabus first so you know the shape of the subject, then use the cards to find the specific facts that have not stuck.
Fundamentals of Computing & Programming flashcards FAQ
How many Fundamentals of Computing & Programming flashcards are in this CSS Computer Science deck?
51 cards. This page previews 24 of them, sampled evenly across the deck so you can judge the difficulty before installing anything.
Are these CSS Computer Science flashcards free?
Yes. The preview here is free to read with no signup, and the full 51-card deck is free inside the Examius app.
What do the Fundamentals of Computing & Programming cards cover?
They follow the CSS Computer Science Fundamentals of Computing & Programming syllabus — 4 chapters and 18 topics — so the questions track what is actually examinable.
How should I use these flashcards?
Read the syllabus first so you know the shape of the subject, then drill the deck. Examius schedules each card with spaced repetition, so cards you keep missing come back sooner and ones you know drift further apart.