Thẻ ghi nhớ: CSI104 PT2 | Quizlet

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

1/159

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.

160 Terms

1
New cards

The ________ model is the basis for today's computers.

von Neumann

2
New cards

In a computer, the ________ subsystem stores data and programs.

memory

3
New cards

In a computer, the ________ subsystem performs calculations and

logical operations.

ALU

4
New cards

7-1 ________ is a program that facilitates the execution of other programs.

An operating system

5
New cards

7-2 ________ supervises the activity of each component in a computer

system.

An operating system

6
New cards

7-3 Multi-programming requires a ________ operating-system.

time-sharing

7
New cards

7-4 ________ is multi-programming with swapping.

Demand paging

8
New cards

7-5 ________ is multi-programming without swapping.

Partitioning

9
New cards

7-6 In ________ , only one program can reside in memory for execution.

mono-programming

10
New cards

7-7 ________ is a multi-programming method in which multiple programs are entirely in memory with each program occupying a contiguous space.

Partitioning

11
New cards

7-8 In paging, a program is divided into equally sized sections called________ .

pages

12
New cards

7-9 In ________ , the program can be divided into differently sized sections.

demand segmentation

13
New cards

7-10 In ________ , the program can be divided into equally sized sections called pages, but the pages need not be in memory at the same time for execution.

demand paging

14
New cards

7-11 A process in the ________ state can go to either the ready, terminated,or waiting states.

running

15
New cards

7-12 A process in the ready state goes to the running state when ________ .

it gets access to the CPU

16
New cards

7-13 A program becomes a ________ when it is selected by the operating system and brought to the hold state.

job

17
New cards

7-14 Every process is ________ .

a job and a program

18
New cards

7-15 The ________ scheduler creates a process from a job and changes a process back to a job.

job

19
New cards

7-16 The ________ scheduler moves a process from one process state to another.

process

20
New cards

7-17 To prevent ________ , an operating system can put resource

restrictions on processes.

deadlock

21
New cards

7-18 ________ can occur if a process has too many resource restrictions.

Starvation

22
New cards

7-19 The ________ manager is responsible for archiving and backup.

file

23
New cards

7-20 The ________ manager is responsible for access to I/O devices.

device

24
New cards

8-1 ________ is a step-by-step method for solving a problem or doing a task.

An algorithm

25
New cards

8-2 There are ________ basic constructs in computer -science.

three

26
New cards

8-3 The ________ construct tests a condition.

decision

27
New cards

8-4 The ________ construct uses a set of actions one after another.

sequence

28
New cards

8-5 The ________ construct handles repeated actions.

repetition

29
New cards

8-6 ________ is a pictorial representation of an algorithm.

A UML diagram

30
New cards

8-7 ________ is an English-language-like representation of code.

Pseudocode

31
New cards

8-8 ________ is a basic algorithm that adds a list of numbers.

Summation

32
New cards

8-9 ________ is a basic algorithm that multiplies a list of numbers.

Product

33
New cards

8-10 ________ is a basic algorithm that arranges data according to its value.

Sorting

34
New cards

8-11 The items are divided into two lists (sorted and unsorted) ________

sort.

in selection, bubble, or insertion

35
New cards

8-12 In ________ sort, the item that goes into the sorted list is always the first item in the unsorted list.

insertion

36
New cards

8-13 In ________ sort, the smallest item from the unsorted list is swapped with the item at the beginning of the unsorted list.

selection

37
New cards

8-14 In ________ sort, the smallest item moves to the beginning of the

unsorted list. There is no one-to-one swapping.

bubble

38
New cards

8-15 ________ is a basic algorithm in which we want to find the location of a target in a list of items.

Searching

39
New cards

8-16 We use a ________ search for an unordered list.

sequential

40
New cards

8-17 We use a ________ search for an ordered list.

binary

41
New cards

8-18 ________ is a process in which an algorithm calls itself.

Recursion

42
New cards

9-1 The only language understood by computer hardware is a ________

language.

machine

43
New cards

9-2 C, C++, and Java can be classified as ________ languages.

high-level

44
New cards

9-3 FORTRAN is a(n) ________ language.

procedural

45
New cards

9-4 Pascal is a(n) ________ language.

. procedural

46
New cards

9-5 Java is a(n) ________ language.

object-oriented

47
New cards

9-6 LISP is a(n) ________ language.

functional

48
New cards

9-7 ________ is a common language in the business -environment.

COBOL

49
New cards

9-8 ________ is a popular object-oriented language.

Java

50
New cards

9-9 A ________ program can be either an application or an applet.

Java

51
New cards

9-10 LISP and Scheme are both ________ languages.

functional

52
New cards

9-11 Prolog is an example of a(n) ________ language.

declarative

53
New cards

10-1 One phase in system development is ________

analysis

54
New cards

10-2 Defining the users, requirements, and methods is part of the ________phase.

analysis

55
New cards

10-3 In the system development process, writing the program is part of the________ phase.

implementation

56
New cards

10-4 In the system development process, structure charts are tools used in the ________ phase.

design

57
New cards

10-5 Testing a software system can involve ________ testing.

both black-box and glass-box

58
New cards

10-6 ________ is the breaking up of a large project into smaller parts.

Modularization

59
New cards

10-7 ________ is a measure of how tightly two modules are bound to each other.

Coupling

60
New cards

10-8 ________ between modules in a software system must be minimized.

Coupling

61
New cards

10-9 ________ between modules in a software system must be maximized.

Cohesion

62
New cards

11-1 A data structure can be ________ .

an array, a record, or a linked list

63
New cards

11-2 An array that consists of just rows and columns is a ________ array.

one-dimensional

64
New cards

11-3 Each element in a record is called ________ .

a field

65
New cards

11-4 All the members of a record must be ________ .

related types

66
New cards

11-5 ________ is an ordered collection of data in which each element

contains the location of the next element.

A linked list

67
New cards

11-6 In a linked list, each element contains ________

data and a link

68
New cards

11-7 The ________ is a pointer that identifies the next element in the linked list.

link

69
New cards

11-8 Given a linked list called children, the pointer variable children identifies

________ element of the linked list.

the first

70
New cards

11-9 An empty linked list consists of ________

a null head pointer

71
New cards

11-10 To traverse a list, you need a ________ pointer.

walking

72
New cards

12-1 In an abstract data type, ________ .

the ADT implementation is hidden

73
New cards

12-2 A stack is a ________ structure.

LIFO

74
New cards

12-3 A (n) ________ list is also known as a queue.

FIFO

75
New cards

12-4 If A is the first data element input into a stack, followed by B, C, and D,

then ________ is the first element to be removed.

D

76
New cards

12-5 If A is the first data element input into a queue, followed by B, C, and

D, then ________ is the first element to be removed.

A

77
New cards

12-6 The pop operation ________ of the stack.

deletes an item from the top

78
New cards

12-7 The push operation ________ of the stack.

inserts an item at the top

79
New cards

12-8 In a binary tree, each node has ________ two subtrees.

at most

80
New cards

12-9 In preorder traversal of a binary tree, the ________

root is processed first

81
New cards

12-10 In ________ traversal of a binary tree, the right subtree is processed first

inorder

82
New cards

12-11 In postorder traversal of a binary tree, the root is processed ________

last

83
New cards

12-12 In postorder traversal of a binary tree, the left subtree is processed________ .

first

84
New cards

12-13 In ________ traversal of a binary tree, the left subtree is processed

last.

preorder

85
New cards

12-14 In an inorder traversal of a binary tree, the root is processed ________.

second

86
New cards

In Windows , you can see the Task manager by using which of the following? *

1/1

Tab +Alt +Del key

Shift +Alt +Del key

Ctrl+Alt +Del key

Fn +Alt +Del key

Ctrl+Alt +Del key

87
New cards

Which type of guided medium is the least susceptible to attenuation and inductance? *

0/1

Coaxial cable

Copper wire

Fiber-optic cable

Golden wire

Fiber-optic cable

88
New cards

What is the positional value of the 7 in the base 8 number 2715? *

1/1

16

8

64

100

64

89
New cards

Which of the following is not one of the basic Boolean operators? *

1/1

AND

. OR

NOT

XOR

XOR

90
New cards

Which of the following is OSI layer of Router *

1/1

Data Link

Network

Physical

Transport

Network

91
New cards

DOS stands for: *

1/1

Demand Open Sources

Disk Operating System

Device Outer Shell

Direct Operating System

Disk Operating System

92
New cards

Which of the following is not a multitasking OS? *

1/1

Linux

UNIX

Windows

DOS

DOS

93
New cards

The process of arranges the disk's surface into addressable areas and sets up the disk's basic directory tree structure *

1/1

Partitioning

Set up

Booting

Formatting

Formatting

94
New cards

What binary value is equivalent to the hex number C43A? *

1/1

1100100100010110

1100110101111010

1100010000111010

1100001101011101

1100010000111010

95
New cards

Which part of the CPU is responsible for mathematical operations? *

1/1

CU

ALU

RLU

VLSI

ALU

96
New cards

What features of transistors made them superior for computers, compared with vacuum tubes? *

1/1

They were more expensive than tubes but lasted longer and were cooler in temperature.

They didn't last as long as tubes but were less expensive.

They were cheaper and smaller than tubes.

They were cheaper, smaller, and cooler than tubes and lasted longer.

They were cheaper, smaller, and cooler than tubes and lasted longer.

97
New cards

Today, Microsoft considers its major competition in operating systems to be what system? *

0/1

Control Data Corporation OS

Sega Games operating system

Linux operating system

Mac OS X

Linux operating system

98
New cards

Linux operating system

High-speed __________________ is used to speed processing in a computer system *

0/1

Mass storage

Cache memory

ROM

Cache memory

99
New cards

Which of the following circuit types is used to create SRAM? *

1/1

Decoder

Flip-flop

LCD

ROM

Flip-flop

100
New cards

DSL speeds range from: *

1/1

256 Kbps to 1.5 Mbps

256 Mbps to 15 Mbps

56 Kbps to 256 Kbps

100 Kbps to 156 Kbps

256 Kbps to 1.5 Mbps