Brainscape's Knowledge GenomeTM

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


See full index

1st Semester Fall 2014 > Intro to CS 1-2-4 > Flashcards

Intro to CS 1-2-4 Flashcards

0
Q

What does the study of algorithms include ?

A
  • Their formal and mathematical properties
  • Their harware realizations
  • Their linguistic realizations
  • Their applications
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
1
Q

What is computer science ?

A

The study of algorithms.

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

What is computer science technology ?

A

The study of principles, applications, technologies of computing and computers.

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

What does the study of principles, applications, technologies of computing and computers involve ?

A
  • Data, data structures and the algorithms to process them
  • Principles of computer architecture (hardware and software)
  • Problem-solving and design methodologies
  • Computer related topics such as numerical analysis, operations research, language design and artificial intelligence
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

What is an algorithm ?

A

An ordered sequence of instructions that is guaranteed to solve a specific problem.

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

What are the different types of instructions in an algorithm ?

A
  • Sequential
  • Conditional
  • Iterative
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

1614

A

John Napier invents logarithms to simplify complex mathematical computations.

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

1622

A

Slide Rule

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

1672

A

Blaise Pascals Pascaline (mechanical, +, -)

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

1674

A

Gotfried Leibnitzs Leibnitz Wheel (mechanical, +, -, *, %)

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

17th century

A
  • Represent numbers
  • Perform arithmetic operations
  • No memory to store information
  • Not programmable
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

1801

A

Joseph Jacquards Jacquard Loom (punched cards)

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

1880

A

Herman Hollerith (programmable card processing machine)

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

1902

A

Hollerith founded the Tabulating Recording company (later IBM)

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

1823

A

Charles Babbages Difference Engine

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

1830

A

Charles Babbage designs the Analytical Engine

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

1979

A

ADA computer language (in honor of Ada Augusto Bryon Lovelace)

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

19th century

A
  • Mechanical
  • Represent numbers
  • Perform arithmetic operations
  • Has Memory to store information
  • Programmable
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
18
Q

1944

A

Mark 1

  • Electromagnetical (relays, magnets, gears)
  • Base 2 (vacuum tubes, electrical current)
  • Capacity of 72 numbers
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
19
Q

1943

A

Colossus (secrecy of British Enigma project)

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

1946

A

ENIAC

  • First publicly known
  • Fully electronic
  • General purpose
  • Programmable
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
21
Q

1942

A

Professor John Atanasoff and Clifford Berrys ABC System

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

1946

A

John Von Neumann proposes the stored program computer model

23
Q

1953

A

RAND Corps Johnniac built in honor of John Von Neumann

24
Q

1951

A

Von Neumanns research group built EDVAC (first stored program computer)

25
Q

1941

A

Konard Zuse builds Z1 through Z3

  • General-purpose
  • Fully electronic
  • Mechanical
  • Programmable
26
Q

First generation

A
  • EDVAC
  • Vacumm tubes
  • Large, expensive, delicate
  • Hard to use
27
Q

Second generation

A
  • Transistors and magnetic cores

- FORTRAN and COBOL

28
Q

Third generation

A
  • Integrated circuits
  • First minicomputer
  • Software industry
29
Q

Fourth generation

A
  • First microcomputers
  • Widespread computer networks
  • Electronic mail, GUI and embedded systems
30
Q

How does the 16-bits representation of Binary Fractional Number work ?

A
  • 1 bit for the sign of the mantissa
  • (binary point)
  • 9 bits for the mantissa
  • 1 bit for the sign of the exponent
  • 5 bits for the exponent
31
Q

Code mapping

A

Representation of textual material interlnaly in binary.

  • ASCII: 2pow8 = 256 different characters
  • UNICODE: 2pow16 = 65 536 different characters
32
Q

Sound waveform

A

-Amplitude = height of the wave (loudness)
-Period (T) = time it takes for the wave to make a complete cycle
-Frequency (f) = number of cycles per second (hertz, pitch)
f = 1 / T
Human ears detect sounds in the range of 20 to 20 000 herts

33
Q

Digitze

A

Process of converting to a digital form

34
Q

Sampling

A

Consists of mesuring the amplitude and storing as an integer value at fixed intervals

  • Sampling rate: number of samples per second
  • Bit depth: number of bits used for each sample
35
Q

Scanning

A

Consists of measuring the intensity values of distinct points located at regular intervals accross the image’s surface
-Pixels: individual recorded samples

36
Q

Raster graphics

A

Store a picture as a two-dimensional grid of pixel values storing each row of pixels from left to right.
Each is stored as an unsigned binary value representing its gray scale

37
Q

RGB encoding scheme

A

Represent a picture’s color with a combination of red, green and blue

  • (0 to 255)
  • 1 byte for each (red, green, blue)
  • 2pow24 distinct colors
  • Referred as True Color
38
Q

Paradigm

A

A model or mental framework for representing or thinking about something

38
Q

Paradigm

A

A model or mental framework for representing or thinking about something

39
Q

Programming in a procedural language consists of ?

A
  • Planning the algorithm

- Capturing the unambiguous and effectively computable operations as program instructions

39
Q

Programming in a procedural language consists of ?

A
  • Planning the algorithm

- Capturing the unambiguous and effectively computable operations as program instructions

40
Q

Alternative paragdigms for programming languages include viewing a program’s actions as ?

A

-A sequence of detailed instuctions provided to the computer
(Procedural programming)

-A combination of various transformstions on items
(Functional programming)

-A series of logical deductions from known facts
(Logical programming)

-Multiple copies of the same subtask or multiple subtasks of the same problem being performed simultaneously by different processors
(Parallel programming)

40
Q

Alternative paragdigms for programming languages include viewing a program’s actions as ?

A

-A sequence of detailed instuctions provided to the computer
(Procedural programming)

-A combination of various transformstions on items
(Functional programming)

-A series of logical deductions from known facts
(Logical programming)

-Multiple copies of the same subtask or multiple subtasks of the same problem being performed simultaneously by different processors
(Parallel programming)

41
Q

Functional Programming

A

-Started with LISP (LISt Processing) by John MacCarthy

Views every task in terms of functions

  • Primitive functions: part of the language
  • Other functions: defined by the programmer
  • Also called applicative language because of the property if repeatedly applying functions
41
Q

Functional Programming

A

-Started with LISP (LISt Processing) by John MacCarthy

Views every task in terms of functions

  • Primitive functions: part of the language
  • Other functions: defined by the programmer
  • Also called applicative language because of the property if repeatedly applying functions
42
Q

Recursive

A

Something that is defined in terms of “smaller versions” of itself

42
Q

Recursive

A

Something that is defined in terms of “smaller versions” of itself

43
Q

Side effect

A

Occurs when a program, on the course of acting on memory cells, data and values, also changes others that it has no business in changing

43
Q

Side effect

A

Occurs when a program, on the course of acting on memory cells, data and values, also changes others that it has no business in changing

44
Q

Logic Programming

A
  • Sometimes called declarative languages because they make declaracrions or assertions that various facst are true instead of issuing step-by-step commands
  • Best-known: Prolog (PROgramming LOGic), group A.Colmerauer
  • Programmer builds a knowledge base of facts and rules
  • Queries passed to inference engine (query interpreter)
  • Concentrates on “what” is true not “how” to find it
44
Q

Logic Programming

A
  • Sometimes called declarative languages because they make declaracrions or assertions that various facst are true instead of issuing step-by-step commands
  • Best-known: Prolog (PROgramming LOGic), group A.Colmerauer
  • Programmer builds a knowledge base of facts and rules
  • Queries passed to inference engine (query interpreter)
  • Concentrates on “what” is true not “how” to find it
45
Q

Parallel Programming

A
  • SIMD(single instruction stream/multiple data stream): Single control unit broadcats a single program instruction to many ALU’s which carry out the instructions in unison using shared data
  • MIMD(multiple instructions stream/multiple dra stream): Interconnected processor independently execute their own program on their own data. Multicore computing, uses message passing primitives (SEND/RECEIVE), divide-and-conquer
45
Q

Parallel Programming

A
  • SIMD(single instruction stream/multiple data stream): Single control unit broadcats a single program instruction to many ALU’s which carry out the instructions in unison using shared data
  • MIMD(multiple instructions stream/multiple dra stream): Interconnected processor independently execute their own program on their own data. Multicore computing, uses message passing primitives (SEND/RECEIVE), divide-and-conquer
46
Q

prog. p.517

A

prog. p.517

46
Q

prog. p.517

A

prog. p.517

1st Semester Fall 2014 (5 decks)

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