Untitled Deck

Question 1

What is a Field in programming?

Answer 1

A variable that is associated with an object or class.

Question 2

Define Inheritance in Object-Oriented Programming (OOP).

Answer 2

The mechanism where one class (child/subclass) derives attributes and behaviors from another (parent/superclass).

Question 3

What are Instances?

Answer 3

Concrete occurrences of an object created from a class.

Question 4

What are Methods?

Answer 4

Functions defined within a class that describe the behaviors of an object.

Question 5

Define Objects in programming.

Answer 5

Instantiations of a class that bundle data (fields) and behaviors (methods).

Question 6

What is a Record?

Answer 6

A data structure that groups related fields under one unit.

Question 7

What is an Argument?

Answer 7

Actual value passed into a function/method when called.

Question 8

What are Parameters?

Answer 8

Variables defined in a function/method declaration to accept arguments.

Question 9

What is a Parameter List?

Answer 9

The list of parameters a method/function expects.

Question 10

Define Parameter Value.

Answer 10

The actual data assigned to a parameter during execution.

Question 11

What is Parameter Reference?

Answer 11

When a parameter points to the memory address of a variable instead of copying its value.

Question 12

What does First Come First Served (FCFS) scheduling entail?

Answer 12

Requests handled in arrival order.

Question 13

Describe the SCAN (Elevator Algorithm).

Answer 13

Head moves back and forth across the disk, servicing requests in order.

Question 14

What is C-SCAN?

Answer 14

Head moves in one direction servicing requests, then jumps back to the start.

Question 15

What is the LOOK scheduling algorithm?

Answer 15

Like SCAN, but only goes as far as the final request before reversing direction.

Question 16

Define Declarative Paradigm.

Answer 16

Focus on what to solve, not how (e.g., SQL, Prolog).

Question 17

What is Procedural Programming?

Answer 17

Step-by-step instructions; sequence, selection, iteration (e.g., C, Pascal).

Question 18

What characterizes Object-Oriented Programming (OOP)?

Answer 18

Organizes code into classes and objects with inheritance and polymorphism (e.g., Java, Python, C++).

Question 19

Define Logic Programming.

Answer 19

Uses facts and rules to derive conclusions (e.g., Prolog).

Question 20

What is Functional Programming?

Answer 20

Emphasizes pure functions, immutability, recursion (e.g., Haskell, Lisp).

Question 21

Describe Event-Driven Programming.

Answer 21

Execution flow determined by events like clicks or signals (e.g., JavaScript GUIs).

Question 22

What is a Single Partition in memory allocation?

Answer 22

Entire memory allocated to one process.

Question 23

Define Fixed Partition.

Answer 23

Memory divided into equal-sized partitions. Best for predictable workloads.

Question 24

What is Dynamic Partition?

Answer 24

Memory divided as needed; can suffer from fragmentation.

Question 25

What does Multiple Partition entail?

Answer 25

Combines strategies, multiple jobs can run simultaneously.

Question 26

Define Page Table.

Answer 26

Maps virtual addresses to physical memory.

Question 27

What is a Page Register?

Answer 27

Holds the base address of a page table.

Question 28

What is a Base Register?

Answer 28

Holds the starting address of a process in memory.

Question 29

What does the Limit Register do?

Answer 29

Defines the size of a process’s memory allocation.

Question 30

What is a Translation Lookaside Buffer (TLB)?

Answer 30

Cache for page table entries to speed up translation.

Question 31

Define Address Binding.

Answer 31

Process of mapping logical addresses to physical memory.

Question 32

What is the New state in a process life cycle?

Answer 32

Process created.

Question 33

What does the Ready state signify?

Answer 33

Waiting to be assigned to CPU.

Question 34

Define the Running state.

Answer 34

Currently executing.

Question 35

What does the Waiting state indicate?

Answer 35

Waiting for I/O or event.

Question 36

What does the Terminated state mean?

Answer 36

Finished execution.

Question 37

What is a For Loop?

Answer 37

Count-controlled loop.

Question 38

Define Count Controlled Loop.

Answer 38

Loops based on a counter.

Question 39

What is a While Loop?

Answer 39

Repeats while condition is true.

Question 40

What is a Do-While Loop?

Answer 40

Executes at least once before checking condition.

Question 41

What does an If-Else statement do?

Answer 41

Selection statement for decision-making.

Question 42

What is a Select/Case structure?

Answer 42

Multi-branch decision structure.

Question 43

Describe Bubble Sort.

Answer 43

Repeatedly swaps adjacent elements until sorted.

Question 44

What is Selection Sort?

Answer 44

Finds smallest element and places it in order.

Question 45

Define Insertion Sort.

Answer 45

Builds sorted array by inserting elements in order.

Question 46

What is Merge Sort?

Answer 46

Divide-and-conquer sorting algorithm.

Question 47

Describe Quick Sort.

Answer 47

Divide-and-conquer using pivot partitioning.

Question 48

What is Radix Sort?

Answer 48

Non-comparison sort based on digit positions.

Question 49

Define Binary Search.

Answer 49

Repeatedly divides sorted array in half.

Question 50

What is Linear Search?

Answer 50

Checks each element sequentially.

Question 51

What is the Association of Computing Machinery (ACM)?

Answer 51

Professional society with code of ethics.

Question 52

What does IEEE stand for?

Answer 52

Technical organization with code of ethics, standards.

Question 53

What do Codes of Ethics emphasize?

Answer 53

Honesty, privacy, professionalism, and responsibility.

Question 54

What is the Software Development Life Cycle (SDLC)?

Answer 54

Phases: planning, analysis, design, implementation, testing, maintenance.

Question 55

What is the Computer Problem-Solving Process?

Answer 55

Define → Analyze → Design → Implement → Test.

Question 56

Define Pseudocode.

Answer 56

Informal way to describe algorithms in structured English.

Question 57

What are Flowcharts?

Answer 57

Graphical representation of algorithm flow.

Question 58

What does an Absolute Path represent?

Answer 58

Full path from root directory.

Question 59

Define Relative Path.

Answer 59

Path relative to current directory.

Question 60

What is the role of Directories?

Answer 60

Organizational structure for files.

Question 61

What is a LAN?

Answer 61

Local Area Network (small, local).

Question 62

Define WAN.

Answer 62

Wide Area Network (large scale).

Question 63

What is a MAN?

Answer 63

Metropolitan Area Network (citywide).

Question 64

What is a Star topology?

Answer 64

All nodes connect to central hub.

Question 65

Describe Bus topology.

Answer 65

All nodes share a single communication line.

Question 66

What is a Mesh topology?

Answer 66

Every node connects to every other.

Question 67

Define Ring topology.

Answer 67

Nodes connected in a circle.

Question 68

What characterizes Tree topology?

Answer 68

Hierarchical structure.

Question 69

What is CPU Scheduling?

Answer 69

Determines order of process execution.

Question 70

Define Turnaround Time.

Answer 70

Time from submission to completion of process.

Question 71

What is Process Management?

Answer 71

OS management of running processes.

Question 72

What is Context Switching?

Answer 72

Saving/restoring CPU state when switching processes.

Question 73

Define Multiprogramming.

Answer 73

Running multiple processes simultaneously.

Question 74

What is Batch Processing?

Answer 74

Execution of jobs without manual intervention.

Question 75

What is Integer Division?

Answer 75

Division with truncation of remainder.

Question 76

What does Round Robin scheduling entail?

Answer 76

Each process given equal time slices.

Question 77

True or False: Preemptive Scheduling allows the OS to interrupt a process.

Answer 77

True

Question 78

True or False: Non-Preemptive Scheduling allows a process to run until finished or blocked.

Answer 78

True

Question 79

What does IoT stand for?

Answer 79

Internet of Things.

Question 80

Define Abstract Data Type (ADT).

Answer 80

Model for data (stack, queue).

Question 81

What is a Multi-Core Processor?

Answer 81

CPU with multiple processing units.

Question 82

Describe Von Neumann Architecture.

Answer 82

Control Unit, Memory, ALU, I/O system.

Question 83

What is an Instruction Register?

Answer 83

Holds current instruction.

Question 84

What does the Program Counter hold?

Answer 84

Holds address of next instruction.

Question 85

Define PCB (Process Control Block).

Answer 85

Stores process info (state, registers, program counter).