Verified Documents at Dalhousie University

Browse the full collection of course materials, past exams, study guides and class notes for CSCI 1105 - Introduction to Programming at Dalhousie University verified by our …
PROFESSORS
All Professors
All semesters
Angela Siegel
fall
20

Verified Documents for Angela Siegel

Class Notes

Taken by our most diligent verified note takers in class covering the entire semester.
CSCI 1105 Lecture Notes - Lecture 2: Touchpad, Auxiliary Memory, Kilobyte
The cpu is composed of several hundred million transistors. These are basic electrical components which alter and send electrical currents and signals.
3353
CSCI 1105 Lecture 3: Lecture 2 - Numbers & Strings
Compile-time errors (syntax errors: spelling, capitalisation, punctuation, ordering of statements, matching of parenthesis, quotes. No executable progr
2119
CSCI 1105 Lecture Notes - Lecture 4: Roundoff, Round-Off Error, Decimal Mark
Lecture 3 programming with numbers and strings. Python supports the same basic math as a calculator. It can do: addition , subtraction , multiplication
3102
CSCI 1105 Lecture Notes - Lecture 4: Floating Point, Roundoff, Microsoft Powerpoint
Python supports all basic math (add +, subtract -, multiply *, divide /) Order as in math: parenthesis, exponent, multiply/devide, add/subtract (from l
385
CSCI 1105 Lecture Notes - Lecture 5: Concatenation, String Literal
Characters are letters, numbers, punctuation marks, spaces, etc. A string is a sequence of characters. In python, a string is specified by enclosing a
378
CSCI 1105 Lecture 5: Strings, Input and output - 18 Sep 2018
344
CSCI 1105 Lecture 6: CSCI 1105 Lecture 5 - Decisions & Relational Operations
Apply what you learn to checking user input. Compare integers, floating point numbers, and strings. A computer program needs to make decisions based on
2117
CSCI 1105 Lecture 6: Decisions - 20 Sep 2018
20 sep 2018 lec #6 decisions. Allows a program to carry out different actions depending on the nature of the data to be processed (dr siegel, powerpoin
334
CSCI 1105 Lecture Notes - Lecture 7: Lexicographical Order, Pseudocode, Boolean Data Type
Allows a program to carry out different actions depending on the nature of the data which is to be processed. Uses rational operators, such as: < &l
2104
CSCI 1105 Lecture Notes - Lecture 8: Boolean Data Type, Substring, Flowchart
Variables can be boolean types: true or false. Using and means that both must be true. Using or means that either can be true. Using not will invert a
281
CSCI 1105 Lecture Notes - Lecture 9: Infinite Loop, Compound Interest
171
CSCI 1105 Lecture 12: CSCI 1105 Loops 2
376
CSCI 1105 Lecture Notes - Lecture 13: Chart Attack
Loops can occur inside of loops, the same way that we can nest if statements. All you need to do is indent the code block. A good example is of process
258
CSCI 1105 Lecture Notes - Lecture 14: Concatenation
To use the for loop for traversing lists. A list is a sequence of elements which all share the same variable name, but referenced by an index. This is
278
CSCI 1105 Lecture 15: CSCI 1105 Lists Part II
Create a list called words co(cid:374)tai(cid:374)i(cid:374)g two stri(cid:374)gs, (cid:862)yes(cid:863) a(cid:374)d (cid:862)no(cid:863) words = [(cid
263
CSCI 1105 Lecture 16: CSCI 1105 Functions
To become familiar with the concept of parameter passing. To develop strategies for decomposing complex tasks into simpler ones: break your code into v
391
CSCI 1105 Lecture Notes - Lecture 17: Linear Search
Iterate as count controlled loop which iterated over a range of integer values: for any container, such as a list or a string (anything that contains o
3104
CSCI 1105 Lecture Notes - Lecture 20: Top-Down And Bottom-Up Design, Global Variable, Pseudocode
260
CSCI 1105 Lecture Notes - Lecture 23: Empty Set, Subset, C Preprocessor
Container that stores a collection of unique values. Unlike a list, the elements or members of the set are not stored in any specific order and cannot
281
CSCI 1105 Lecture Notes - Lecture 25: Venn Diagram, Global Variable
Summary chapter 5 (10 questions on the exam about this) A function is a named sequence of instructions. Arguments are supplied when functions are calle
290