Computer Science Basics Quiz

An operating system acts as an interface between the user and the computer hardware.

Windows, Linux, and MacOS.

A flowchart is a diagrammatic representation of the logic paths to solve a given problem. A visual or graphical representation of an algorithm.

<p>An algorithm is a set of sequential steps, written in ordinary language, to solve a given problem.</p> Signup and view all the answers

<ol> <li>Read the numbers a, b, c. 2. Compute the sum of a, b, and c. 3. Divide the sum by 3.</li> </ol> Signup and view all the answers

<p>An algorithm is a step-by-step description, while a flowchart is a diagrammatic representation of an algorithm.</p> Signup and view all the answers

<p>International Standard Organization (ISO).</p> Signup and view all the answers

<p>An oval (rectangle with rounded sides).</p> Signup and view all the answers

<p>Multiplication (<code>b * c</code>) is performed before addition.</p> Signup and view all the answers

<p>Arithmetic operators in C have left-to-right associativity. Thus, the expression is evaluated as <code>(10 - 5) + 2</code>.</p> Signup and view all the answers

<p>High priority: <code>*</code>, <code>/</code>, <code>%</code>. Low priority: <code>+</code>, <code>-</code>.</p> Signup and view all the answers

<p>Function definition, function call, and function declaration (or prototype).</p> Signup and view all the answers

<p>First, <code>3 * 2</code> and <code>9 / 3</code> are evaluated, then the addition and subtraction from left to right.</p> Signup and view all the answers

<p>The function head and the function body.</p> Signup and view all the answers

<p><code>a</code> and <code>b</code> represent formal parameters.</p> Signup and view all the answers

<p>Control structures dictate the order in which code is executed, enabling branching and looping.</p> Signup and view all the answers

<p>Sequence, Selection/Branching, and Iteration/Looping.</p> Signup and view all the answers

<p>The <code>return</code> statement sends a value back to the calling function.</p> Signup and view all the answers

<p>Expressions within parentheses are evaluated first, overriding normal operator precedence.</p> Signup and view all the answers

<p><code>calculateArea(width, height);</code></p> Signup and view all the answers

<p>A function prototype tells the compiler that a function may be used later in the program.</p> Signup and view all the answers

<p>The result is <code>0</code> (false).</p> Signup and view all the answers

<p>Function type (return type), function name, parameter list, and a terminating semicolon.</p> Signup and view all the answers

<p>Actual parameters are the variables passed during the function call, while formal parameters receive these values in the function definition.</p> Signup and view all the answers

<p>2008</p> Signup and view all the answers

<p>1006</p> Signup and view all the answers

<p>Pointer arithmetic increments or decrements the pointer by the size of the data type it points to. For example, an <code>int</code> pointer increments by 2 bytes, while a <code>float</code> pointer increments by 4 bytes.</p> Signup and view all the answers

<p><code>int *ptr_array[5];</code></p> Signup and view all the answers

<p>An array name, without brackets, decays into a pointer to the first element of the array.</p> Signup and view all the answers

<p><code>int *ptr = arr;</code></p> Signup and view all the answers

<p>2999</p> Signup and view all the answers

<p>An array of pointers is useful for managing multiple memory locations, especially when dealing with dynamically allocated memory or collections of strings.</p> Signup and view all the answers

<p>'Call by value' passes a copy of the variable's value, while 'call by reference' passes the variable's address, allowing changes to reflect outside the function.</p> Signup and view all the answers

<p>The syntax '&amp;a' is used to pass the address of variable 'a', allowing the 'swap' function to modify the original variable directly.</p> Signup and view all the answers

<p>Recursion occurs when a function calls itself to solve smaller instances of a problem, such as calculating the factorial of a number.</p> Signup and view all the answers

<p>'a' will be 200 and 'b' will be 100 after executing the swap function.</p> Signup and view all the answers

<p>Yes, a recursive function can enter an infinite loop if it lacks a proper base case to end the recursion.</p> Signup and view all the answers

<p>Examples of problems that can be effectively solved using recursion include calculating Fibonacci numbers and generating subsets of a set.</p> Signup and view all the answers

<p>In the first example, the 'swap' function is ineffective because it operates on copies of the variables, which do not affect the originals.</p> Signup and view all the answers

<p>The 'temp' variable is used to temporarily hold the value of one of the variables during the swap process.</p> Signup and view all the answers

<p>Recursion requires more memory due to the overhead of multiple function calls.</p> Signup and view all the answers

<p>Recursion is preferred when the problem is naturally recursive and when code size is small.</p> Signup and view all the answers

<p>The time complexity of the GCD algorithm is O(log(min(n1, n2))).</p> Signup and view all the answers

<p>The factorial of 0 is defined as 1.</p> Signup and view all the answers

<p>The condition when n is less than 1 stops further recursive calls.</p> Signup and view all the answers

<p>Recursion typically has higher time complexity due to the multiple function calls involved.</p> Signup and view all the answers

<p>The factorial of n is represented as $n! = 1 * 2 * 3 * ... * n$.</p> Signup and view all the answers

<p>An iterative approach is often favored for managing time complexity and when the code size is large.</p> Signup and view all the answers

Block of code for a specific task, including a head and body.

Transferring control to the function using its name with arguments.

Prototype indicating a function’s type, name, and parameters before use.

Specifies the type of value returned by a function.

Variables passed to a function during a call.

Variables in the function definition that accept actual parameters.

Instruction to return a value from a function.

Declaration that informs the compiler about a function's type and parameters.

An interface between users and computer hardware that controls hardware components.

A diagrammatic representation of the steps to solve a problem or an algorithm.

A set of sequential steps in ordinary language to solve a problem.

Read the numbers a, b, c.

Compute the sum of a, b, and c.

Parallelograms used to represent input and output operations.

Ovals used to indicate the beginning or end of a program.

Flowcharts are useful for detailed representations of complicated programs.

A combination of variables, constants, and operators.

Determining the value of expressions using assignment statements.

Rules that determine the order of operations in expressions.

Operators with higher precedence: *, /, and %.

Operators with lower precedence: + and -.

Determines the order of execution for operators of the same precedence.

For expression 1 == 2 != 3, it evaluates as ((1 == 2) != 3).

The building blocks for structuring behavior in programs.

A method where function parameters receive copies of actual values, not affecting originals.

A method where function parameters receive references to actual data, allowing direct modification.

Function that exchanges the values of two variables, demonstrating parameter passing methods.

A variable that stores the memory address of another variable, often used in call by reference.

A programming technique where a function calls itself to solve smaller instances of the same problem.

A function that contains a call to itself, directly or indirectly, as part of its implementation.

The condition that stops the recursion from continuing indefinitely, preventing infinite loops.

Common uses of recursion include calculating factorials, generating Fibonacci series, and more.

Recursion is generally slower compared to iteration due to multiple function calls.

Recursion is preferred for smaller code sizes without strict time complexity concerns.

Iteration is preferred for larger code sizes and when managing time complexity is crucial.

Recursion typically has higher time complexity due to repeated calls.

Recursion often requires more memory because of the call stack.

The GCD of two numbers is the largest number that divides both without a remainder.

Factorial of n (n!) is the product of all positive integers up to n.

The stopping condition in recursion when no further calls are made.

When a pointer is incremented, it increases by the size of the data type it points to.

When a pointer is decremented, it decreases by the size of its data type.

Adding an integer to a pointer multiplies the integer by the data type size before adding.

A collection of pointers pointing to multiple memory locations of the same type.

Syntax for declaring a pointer array: pointer_type *array_name[array_size].

A pointer that references the first element of an array.

Access data through the pointer referencing the array.

Order of operations matters in pointer declarations, affecting pointers and arrays.