[CSI106] Chapter 7-12

0.0(0)
studied byStudied by 11 people
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
Card Sorting

1/75

encourage image

There's no tags or description

Looks like no tags are added yet.

Study Analytics
Name
Mastery
Learn
Test
Matching
Spaced

No study sessions yet.

76 Terms

1
New cards

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

Computer hardware

2
New cards

What is the small program stored in ROM that loads the operating system into RAM called?

Bootstrap program

3
New cards

What is the technique that allows multiple programs to reside in memory at the same time to increase CPU efficiency called?

Multiprogramming

4
New cards

Which component of the OS is responsible for managing the creation, deletion, and access to files?

The file manager

5
New cards

What is a program that is in execution in memory defined as?

A process

6
New cards

Which memory management technique removed the requirement that the entire program must be in memory for execution?

Demand paging

7
New cards

What is the concept that allows a system to run programs with a total size larger than the available physical memory?

Virtual memory

8
New cards

What is the state of a process when it is waiting for an I/O event to complete?

Waiting

9
New cards

Which scheduler is responsible for moving a process between the Ready, Running, and Waiting states?

The process scheduler

10
New cards

What is the situation called when two or more processes are waiting for each other's resources in a circular chain?

Deadlock

11
New cards

In contrast to deadlock, what is the situation called when a process is perpetually denied necessary resources to run?

Starvation

12
New cards

In the UNIX operating system, what is the command-line interface that receives and interprets user commands called?

The shell

13
New cards

In the Windows architecture, which layer is responsible for hiding hardware differences from the upper layers?

The Hardware Abstraction Layer (HAL)

14
New cards

The UNIX operating system is considered highly portable because it is written primarily in which language?

The C language

15
New cards

Which operating system, developed by Linus Torvalds, has a kernel based on the architecture of UNIX?

Linux.

16
New cards

What is a step-by-step method for solving a problem, which accepts input and produces output, called?

B. An algorithm

17
New cards

Which of the three basic constructs involves executing instructions one after another in order?

A. Sequence

18
New cards

Which construct is used to test a condition and execute different sets of instructions based on the result?

C. Selection (Decision)

19
New cards

Which of these is a pictorial representation of an algorithm's flow and structure?

D. UML diagram

20
New cards

Which algorithm representation uses an English-like structure but is not a formal programming language?

B. Pseudocode

21
New cards

What is the main purpose of sorting algorithms?

A. To arrange data according to its values

22
New cards

Which sorting algorithm repeatedly finds the smallest element from the unsorted part and moves it to the sorted part?

C. Selection sort

23
New cards

Which searching algorithm requires the list to be sorted before it can work efficiently?

B. Binary search

24
New cards

What is a self-contained portion of an algorithm that can be called upon to perform a specific task?

D. A subalgorithm

25
New cards

An algorithm that calls itself to solve a problem is known as?

A. Recursive

26
New cards

What is the essential component of a recursive algorithm that prevents it from running forever?

C. A base case

27
New cards

Which searching method checks each item in a list from the beginning until the target is found?

A. Sequential search

28
New cards

What is the more formal definition of an algorithm?

D. An ordered set of unambiguous steps that produces a result and terminates in a finite time

29
New cards

In a binary search, where is the first comparison made?

C. In the middle of the list

30
New cards

Which sorting algorithm works by repeatedly swapping adjacent elements if they are in the wrong order?

B. Bubble sort

31
New cards

What is the only language that computer hardware can directly understand?

C. Machine language

32
New cards

Which translator converts the entire source program into an object program before execution?

C. Compiler

33
New cards

Which programming paradigm considers a program an "active agent" that manipulates "passive objects"?

B. Procedural

34
New cards

In object-oriented programming (OOP), what is the "blueprint" for creating objects called?

B. Class

35
New cards

What is the ability of a method to be executed in different ways for different objects in OOP called?

A. Polymorphism

36
New cards

LISP and Scheme are classic examples of which programming paradigm?

C. Functional

37
New cards

PROLOG is a typical language for which programming paradigm?

D. Declarative

38
New cards

What is the intermediate code generated by the Java compiler before being executed by the Java Virtual Machine (JVM) called?

C. Bytecode

39
New cards

What is a named location in memory used to store data that can change during program execution called?

B. Variable

40
New cards

Which parameter passing method creates a copy of the original data, preventing the subprogram from changing the original variable's value?

C. Pass by value

41
New cards

Which part of the translation process is responsible for grouping characters into meaningful units (tokens)?

C. Lexical analyzer

42
New cards

In OOP, what is the principle that allows a class to acquire the properties and methods of another class called?

A. Inheritance

43
New cards

The languages C, Pascal, and FORTRAN are examples of which paradigm?

A. Procedural

44
New cards

When using pass by reference, what does the subprogram actually receive from the main program?

B. The memory address of the variable

45
New cards

What is a program that translates and executes code line-by-line called?

D. Interpreter

46
New cards

What is the a fundamental concept in software engineering that describes the cycle of development, use, and modification of software?

B. Software lifecycle

47
New cards

Which development model follows a strict, sequential flow where one phase must be complete before the next begins?

A. Waterfall model

48
New cards

Which development model builds software in a series of steps, starting with a simple version and adding functionality over time?

C. Incremental model

49
New cards

The goal of which phase is to define WHAT the software will do, without specifying HOW?

A. Analysis phase

50
New cards

What is the goal of the design phase?

B. To define HOW the system will accomplish its tasks

51
New cards

The measure of how tightly two modules are bound to each other is called?

D. Coupling

52
New cards

The measure of how closely the elements within a single module are related is called?

C. Cohesion

53
New cards

In software design, what is the ideal for coupling and cohesion?

A. Low coupling, high cohesion

54
New cards

What is the name for testing that is based on knowing the internal structure of the software?

B. Glass-box testing

55
New cards

What type of testing focuses on functionality without knowledge of the internal code?

A. Black-box testing

56
New cards

Data Flow Diagrams (DFDs) and Use-Case Diagrams are tools primarily used in which phase?

D. Analysis phase

57
New cards

What type of documentation is created to help users run the software system properly?

C. User documentation

58
New cards

Which quality factor refers to the ability to move software from one hardware platform to another?

B. Transferability

59
New cards

What is the primary goal of the testing phase?

A. To find errors

60
New cards

Breaking a large project into smaller, more manageable parts is known as?

D. Modularity

61
New cards

What is a sequenced collection of elements, all of the same data type?

C. An array

62
New cards

What is a collection of related elements, possibly of different types, that are treated as a single unit?

B. A record

63
New cards

In a linked list, what is the term for an element that contains data and a pointer to the next element?

D. A node

64
New cards

How are individual elements in an array typically accessed?

B. Through their index or subscript

65
New cards

What is each named element inside a record called?

A. A field

66
New cards

Which data structure is generally more efficient for inserting and deleting elements at the beginning of a list?

D. A linked list

67
New cards

What does the link field of the last node in a simple linked list contain?

C. A null pointer

68
New cards

Which statement best describes the difference between an array and a record?

A. An array's elements are the same type

69
New cards

a record's fields can be different types.

70
New cards

The process of visiting every element in a list exactly once is called?

C. Traversal

71
New cards

If a 2D array is stored one row after another in memory, what is this storage method called?

B. Row-major storage

72
New cards

What is the only search algorithm that can be used on a standard linked list?

B. Sequential search

73
New cards

Which data structure is generally better for applications requiring frequent random access to elements by their position?

A. An array

74
New cards

What is the main memory overhead of a linked list compared to an array?

C. Each node needs extra space for the link/pointer.

75
New cards

What do we call a combination of an array and records, for example, to store information for 30 students?

D. An array of records

76
New cards

What is the name of the pointer that identifies the first element in a linked list?

A. Head pointer