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
1
Q
What is computer science ?
A
The study of algorithms.
2
Q
What is computer science technology ?
A
The study of principles, applications, technologies of computing and computers.
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
4
Q
What is an algorithm ?
A
An ordered sequence of instructions that is guaranteed to solve a specific problem.
5
Q
What are the different types of instructions in an algorithm ?
A
- Sequential
- Conditional
- Iterative
6
Q
1614
A
John Napier invents logarithms to simplify complex mathematical computations.
7
Q
1622
A
Slide Rule
8
Q
1672
A
Blaise Pascals Pascaline (mechanical, +, -)
9
Q
1674
A
Gotfried Leibnitzs Leibnitz Wheel (mechanical, +, -, *, %)
10
Q
17th century
A
- Represent numbers
- Perform arithmetic operations
- No memory to store information
- Not programmable
11
Q
1801
A
Joseph Jacquards Jacquard Loom (punched cards)
12
Q
1880
A
Herman Hollerith (programmable card processing machine)
13
Q
1902
A
Hollerith founded the Tabulating Recording company (later IBM)
14
Q
1823
A
Charles Babbages Difference Engine
15
Q
1830
A
Charles Babbage designs the Analytical Engine
16
Q
1979
A
ADA computer language (in honor of Ada Augusto Bryon Lovelace)
17
Q
19th century
A
- Mechanical
- Represent numbers
- Perform arithmetic operations
- Has Memory to store information
- Programmable
18
Q
1944
A
Mark 1
- Electromagnetical (relays, magnets, gears)
- Base 2 (vacuum tubes, electrical current)
- Capacity of 72 numbers
19
Q
1943
A
Colossus (secrecy of British Enigma project)
20
Q
1946
A
ENIAC
- First publicly known
- Fully electronic
- General purpose
- Programmable
21
Q
1942
A
Professor John Atanasoff and Clifford Berrys ABC System
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
1951
Von Neumanns research group built EDVAC (first stored program computer)
25
1941
Konard Zuse builds Z1 through Z3
- General-purpose
- Fully electronic
- Mechanical
- Programmable
26
First generation
- EDVAC
- Vacumm tubes
- Large, expensive, delicate
- Hard to use
27
Second generation
- Transistors and magnetic cores
| - FORTRAN and COBOL
28
Third generation
- Integrated circuits
- First minicomputer
- Software industry
29
Fourth generation
- First microcomputers
- Widespread computer networks
- Electronic mail, GUI and embedded systems
30
How does the 16-bits representation of Binary Fractional Number work ?
- 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
Code mapping
Representation of textual material interlnaly in binary.
- ASCII: 2pow8 = 256 different characters
- UNICODE: 2pow16 = 65 536 different characters
32
Sound waveform
-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
Digitze
Process of converting to a digital form
34
Sampling
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
Scanning
Consists of measuring the intensity values of distinct points located at regular intervals accross the image's surface
-Pixels: individual recorded samples
36
Raster graphics
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
RGB encoding scheme
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
Paradigm
A model or mental framework for representing or thinking about something
38
Paradigm
A model or mental framework for representing or thinking about something
39
Programming in a procedural language consists of ?
- Planning the algorithm
| - Capturing the unambiguous and effectively computable operations as program instructions
39
Programming in a procedural language consists of ?
- Planning the algorithm
| - Capturing the unambiguous and effectively computable operations as program instructions
40
Alternative paragdigms for programming languages include viewing a program's actions as ?
-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
Alternative paragdigms for programming languages include viewing a program's actions as ?
-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
Functional Programming
-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
Functional Programming
-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
Recursive
Something that is defined in terms of "smaller versions" of itself
42
Recursive
Something that is defined in terms of "smaller versions" of itself
43
Side effect
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
Side effect
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
Logic Programming
- 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
Logic Programming
- 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
Parallel Programming
- 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
Parallel Programming
- 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
prog. p.517
prog. p.517
46
prog. p.517
prog. p.517
