Brainscape's Knowledge GenomeTM

Browse over 1 million classes created by top students, professors, publishers, and experts.


See full index

CSC 200 > Chapter 5 and 7--components > Flashcards

Chapter 5 and 7--components Flashcards

1
Q

Nano, Pico, Micro, Milli, Tera, Giga, Kilo, and Mega–define, give exponents

A

nano–billionth/10^-9, pico–trillionth, 10^-12, micro–millionth, 10^-6, Milli, thousandth, 10^-3, Tera, trillion, 10^12, Giga, billion, 10^9, Kilo, thousand, 10^3, Mega, million, 10^6

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

FSB?

A

front side bus

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

ratio of binary exponents to decimal exponents

A

10 binary for every 3 decimal

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

define “peta”

A

Greek for 5

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

how many Gb can a Blue-Ray disc store?

A

25 or 50, depending on if it is dual layer (DL)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

what type of CD format is used in Audio recordings?

A

CD-DA, compact disc-digital audio

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

How much data can a CD-ROM hold, and how big is a sector?

A

600 Mb, and 2KB

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

What do the plus and minus symbols denote in the names of DVD formats? What does DL stand for?

A

two different, competing formats. dual layer

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

what are the capacities of DVD-R and DL DVD-R?

A

4.7 and 8.5 GB

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

What do R and RW stand for in DVD names? What does the x stand for?

A

recordable and rewritable. speed of access of info on the disk

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

what year was the flash drive introduced, and who introduced it?

A

IBM, 1998

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

How fast do the hard disks in regular desktops, laptops, and high performance servers run?

A

5400, 7200, and 15,000 RPM

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

Discuss different types of touch screens

A

Resistive–has two layers, one with horizontal and the other with vertical lines of conductive material. Capacitive–conductive laminate over a glass screen, with current at all 4 corners. the relative strength of the current is measured at each corner, giving the location of the touch. Infrared–grid of infrared beams. Surface Acoustic Wave–ultrasonic sound waves across the screen.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

How do embedded systems usually store their programming? Do they have OS?

A

in ROM. Some are so simple that they don’t require OS

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

discuss processor history in embedded systems, and discuss what languages are used in them.

A

early ones were 8-bit with homegrown OS. now there are 32-bit DSP (digital signal processors) and 64-bit RISC chips. Assembly language is usually used, but sometimes C. C is slower and larger, but easier to write in.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

Instruction-level parallelism? superscalar?

A

instruction-level parallelism is running unrelated steps in a program simultaneously. A superscalar is a processor that can recognize this situation and take advantage of it. A superscalar machine does not have multiple processors, but may have multiple execution resources, like two ALUs, one for integers and one for real numbers. Such resources are called Execution Units.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
17
Q

Data-level parallelism? Synchronous processing?

A

Data-level parallelism–based on the idea that a single set of instructions can be run on different data sets at the same time. This is called SIMD, which relies on a control unit directing multiple ALUs to carry out the same operation on different sets of operands. This is also called “synchronous processing”.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
18
Q

Task-level parallelism?

A

based on the idea that different processors can execute different tasks on the same or different data sets. Each processor can perform a different stage of the calculations on a particular data set. It can also involve MIMD, which can cause problems of coordination among the processors. This is solved by each processor having both a local and a shared memory. This is called “Shared Memory Parallel Processor”.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
19
Q

SMPs?

A

Symmetric Multiprocessors have multiple identical cores, they share memory, and are connected by a bus. The number of cores in an SMP is usually limited to 32.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
20
Q

Distributed computer?

A

multiple memory units connected through a network

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
21
Q

Cluster?

A

a group of standalone machines connected through an off-the-shelf network

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
22
Q

Massively parallel processor?

A

computer with over 1000 or more networked processors connected through a specialized network.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
23
Q

Parallel computers used for science might use ____ processing, whereas a search engine computer might use more ____ processing. Task-level/data-level

A

data-level, task-level

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
24
Q

Core 2 processor?

A

dual core

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
25
Q

Stored-program concept?

A

The stored program concept means that data and instructions are both logically the same and can both be stored in memory. The von Neumann architecture is built around this principle.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
26
Q

components of a von Neumann machine?

A

memory, arithmetic/logic unit, input/output units, the control unit

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
27
Q

Instruction register?

A

The instruction register is a special register in the control unit. It holds the instruction being executed.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
28
Q

Program counter?

A

The program counter is a special register in the control unit. It holds the address of the next instruction to be executed.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
29
Q

List steps in the fetch-execute cycle?

A
  1. Fetch the next instruction from the address in the program counter. 2. Decode the instruction.
  2. Execute the instruction.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
30
Q

Explain what is meant by “fetch an instruction.

A

The control unit goes to the address named in the program counter, makes a copy of the contents of that address, puts the copy into the instruction register, and increments the program counter

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
31
Q

Explain what is meant by “decode an instruction.”

A

The control unit determines what the instruction is and accesses any memory locations that contain operands for the instruction.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
32
Q

Define what is meant by a block of data.

A

A block of data is the data stored in a sector of a disk.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
33
Q

4 measures of a disk drive’s efficiency

A

seek time, latency, access time, and transfer rate

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
34
Q

Distinguish between a compact disk and a magnetic disk.

A

Rather than having a series of concentric tracks, a
compact disk has one track that spirals from inside out. Both disks have the track broken into sectors.

The density at which the data is packed varies in a magnetic disk, but does not in a compact disk. The
rotation speed of a magnetic disk reader is constant, but the rotation speed of a compact disk varies depending on the position of the laser
beam.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
35
Q

Describe a parallel architecture that uses synchronous processing.

A

multiple processors applying the same program to multiple data sets.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
36
Q

Describe a parallel architecture that uses pipeline processing.

A

Multiple processors are arranged in tandem. Each processor contributes one part of the overall processing.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
37
Q

How does a shared-memory parallel configuration work?

A

Multiple processors do different processing with different data but communicate through the use of shared global memory.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
38
Q

How many different memory locations can a 16-bit processor access?

A

2^16, or about 65K

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
39
Q

What does DDR2 refer to in RAM?

A

Double-data rate, 2nd generation

40
Q

SATA?

A

Serial ATA, versus the older parallel ATA, which used multiple wires. ATA refers to a way of attaching a hard drive to the old IBM PC/AT, from 1984.

41
Q

IEEE 1394?

A

FireWire

42
Q

Pico, nano, micro, milli, kilo, mega, gigs, Tera, peta–give languages and defs AND abbreviations

A

Pico–Italian for small, rest are Greek except for milli, which is Latin for thousandth. Nano-dwarf, micro-small, kilo-thousand, mega-large, giga-giant, Tera-monster, peta-5. Abbreviations are the first letter, except micro which is mu. Big ones are caps

43
Q

John Vincent Atanasoff–accomplishments and awards.

A

National Medal of Technology. ABC machine (Atanasoff Berry Conputer)

44
Q

Discuss Fetching an instruction in detail.

A

Control unit goes to the addy in the Program counter, copies the contents, and puts them in the instruction register. Then the control unit updates the PC.

The instructions are stored contiguously, so adding the number of bytes in the current instruction to the PC gives the address of the next instruction. This is how the control unit updates the PC.

It is also possible that the PC may be updated later by the instruction being executed.

If an instruction needs additional data from memory, the ALU sends an address to the memory bus, and the memory responds with the value at that location.

The data retrieved from memory can either immediately be used in arithmetic or logic, or it can be stored in a register, depending on the computer.

45
Q

discuss decoding an instruction.

A

the control unit decodes the instruction into control signals that are in the machine language of the computer. The instruction may also require the control unit to get a value from memory.

46
Q

Discuss executing an instruction.

A

once the instruction has been decoded and any operands fetched, the control unit instructs the ALU to do the processing. If a number is being added to a register, the operand is sent to the ALU and added to the contents of the register.

When the cycle is complete, it begins again. If the last instruction was to add a value to the contents of the register, the next instruction probably says to store the results in memory. However, the next instruction might be a control instruction, which would ask a question about the result of the last instruction and possibly change the contents of the program counter.

47
Q

Main memory of a computer contains what type of memory?

A

usually both ROM and RAM

48
Q

how much music does a sector of a CD-DA contain?

A

1/75 of a second.

49
Q

how is the memory on a hard disk organized?

A

into tracks and sectors. As time has passed, there have been fewer sectors toward the center of a disk, and more toward the outside.

50
Q

Discuss latency for disk access, and give another name for it.

A

also called rotation delay, the average latency is 1/2 the time for a full disk rotation. Also known as the time it takes for a sector to be in position

51
Q

discuss seek time.

A

Seek time is the time it takes to get the correct TRACK under the read/write head. Track track track

52
Q

discuss access time.

A

Access time is the sum of seek time and latency.

53
Q

How fast can serial ATA transfer info?

A

Up to 300 MBPS

54
Q

Who probably originated the stored-program concept?

A

Credited to Von Neumann, but probably started with J. Presper Eckert and John Mauchly

55
Q

Most computers today are _____ addressable.

A

Byte

56
Q

What does it mean to say a machine is n-bit addressable?

A

N usually refers to the number of bits in the CPU General registers: so two n-bit numbers can be added with a single instruction. It can also refer to the width of the address bus, which is the size of the addressable memory, but not always.

It can even refer to the width of the data bus– but not always.

57
Q

Big book on problem solving–title, author, date

A

George Polya, 1945, “How To Solve It: A New Aspect of Mathematical Method”.

58
Q

4 phases of the computer problem-solving process. Give outputs.

A

Analysis and specification phase–results in a clearly-written problem statement. algorithm development phase–results in a general solution to the specified problem. implementation phase–results in a working computer program. maintenance phase–no result unless there are changes that need to be made, or errors are found.

59
Q

Define data abstraction, procedural abstraction, control abstraction, and control structure. Give examples.

A

Data abstraction–the separation of the logical view of data from its implementation. Binary vs. decimal readouts

Procedural abstraction–the separation of the logical view of an action from its implementation. The use of a Subprogram

Control abstraction–the separation of the logical view of a control structure from its implementation.

Control structure–a statement used to alter the normally sequential flow of control. Commands in a programming language like “while” and “if” are control structures

60
Q

George Polya Prize?

A

For notable application of combinatorial theory

61
Q

Count-controlled loop? Name and define parts

A

A loop that repeats a process a specified number of times.

Loop Control Variable–is initialized to a starting value, then tested to see if it has reached a predetermined value, then incremented by 1.

62
Q

Event-controlled loop?

A

In which the number of repetitions is controlled by an event that occurs within the body of the loop itself.

63
Q

Nested structures?

A

One control structure imbedded inside another one

64
Q

Abstract and concrete steps?

A

Abstract steps need to be expanded further (they have unspecified details.) Concrete steps cannot be expanded.(no details remain specified(

65
Q

Array?

A

A named collection of homogeneous items in which individual items are accessed by their place in the collection

66
Q

The types of algorithms with arrays–name and define.

A

Searching, sorting, and processing–all other computing done with arrays that isn’t searching or sorting

67
Q

Record?

A

A named heterogeneous group of items in which individual items are accessed by name.

68
Q

Binary search?

A

Assumes items in the array are sorted, and either finds the item or eliminates half the array with one comparison. It begins in the middle, and stops when the item is found or when the portion of the array where the item might be found is empty.

69
Q

What is a cylinder?

A

All of the tracks that line up under one another on a hard disk

70
Q

Who developed ENIAC, when, where?

A

Mauchly and Eckert, U. Of PA, 1945

71
Q

Strategy used in the Quicksort algorithm

A

Split list into two parts and then do the same for each smaller list, etc

72
Q

Can selection structures be nested?

A

Yes

73
Q

Can all control structures be nested?

A

Yes

74
Q

The square root algorithm uses a count-controlled loop. T/F

A

False

75
Q

When are binary vs linear searches faster?

A

If the array is sorted, binary searches are faster if there are more than 20 items

76
Q

A selection sort does what?

A

Moves the smallest item to the top of the array, and puts the item that was previously there in the now-empty spot

77
Q

An insertion sort puts 1 more item into place with respect to the already-sorted portion. T/f

A

True

78
Q

Which other type of sort uses the bubble sort technique?

A

Insertion sort

79
Q

Recursive algorithm?

A

Uses its own name within itself. Uses a selection statement to determine whether to repeat the algorithm again.

Each one has at least 2 cases: base and general. The base case is the one that we have an answer to. The general case expresses the solution as a call to itself with a smaller version of itself

80
Q

Calling unit?

A

You can give a section of code a name and then use that section in another part of the program. When the name is encountered, the the processing in the other part of the program halts while the names code executes. When the named code finishes executing, processing resumes with the statement just below where the name occurred. The place where the name appears is called the calling unit.

81
Q

Recursive algorithms use “if” statements. T/F

A

True

82
Q

Iterative algorithms use “while” statements. T/f

A

True

83
Q

List the 4 steps in Polya’s list

A

Understand the problem.

Find the connection between the data and the unknown. You may need to consider auxiliary problems. You should obtain a PLAN of the solution.

Carry out the plan, checking each step.

Examine the solution, check the result if possible

84
Q

Difference between top-down design and object-oriented design.

A

Polya’s method is hierarchical/top-down design. It produces a hierarchy of tasks to be solved.

Object-oriented design produces a hierarchy of data objects.

85
Q

Identifiers?

A

Names within a specific programming language for data and activities

86
Q

Tony Hoare?

A

Quicksort and Turing award, and a knighthood. Retired from Oxford, works at Microsoft

87
Q

Two types of subprograms?

A

Named code that does a particular task (void) and named code that does a task AND returns a single value to the calling unit (value-returning subprograms)

88
Q

The while loop in a count-controlled loop is called a _______

A

Pretest loop, because it takes place before the loop is executed

89
Q

3 parts of process when using a while statement in an event-controlled loop?

A

Event must be initialized, tested, and updated

90
Q

Sequential search in an unsorted array ends when?

A

When the item is found, or when all items have been looked at without a match

91
Q

CD-WORM?

A

Write once, read many

92
Q

DVD?

A

Digital versatile disk

93
Q

Simple versus composite data type. Give example .

A

Composite type contains more than one value, a string is an example

94
Q

Give 2 composite data-structuring mechanisms.

A

Arrays and records

95
Q

Sort key?

A

The field(s) on which the ordering of a sort is/are based

96
Q

When does a sequential search in a sorted array end?

A

When you have looked at the place where the item should be

CSC 200 (12 decks)

Brainscape helps you reach your goals faster, through stronger study habits.
© 2024 Bold Learning Solutions. Terms and Conditions