# All Educational Materials for CISC 235 at Queen's University

## Popular Study Guides

QUEEN'SCISC 235allWinter

## CISC 235 Midterm: CISC 235 Test 1 Winter 2018

OC25402947 Page
9 Jan 2019
0
Pencil answers will be marked, but will not be re-marked under any circumstances. The test will be marked out of 50. Behind complexity, there is always
View Document
QUEEN'SCISC 235allWinter

## CISC 235 Midterm: CISC 235 Test 4 Winter 2018

OC25402948 Page
9 Jan 2019
0
Pencil answers will be marked, but will not be re-marked under any circumstances. The test will be marked out of 50. For each of the following operatio
View Document
QUEEN'SCISC 235allWinter

## CISC 235 Study Guide - Midterm Guide: Quadratic Probing, Priority Queue

OC25402946 Page
9 Jan 2019
0
Pencil answers will be marked, but will not be re-marked under any circumstances. The test will be marked out of 50. You oughta be thankful, a whole he
View Document
QUEEN'SCISC 235allWinter

## CISC 235 Study Guide - Midterm Guide: Hash Table, Quadratic Probing, Pseudocode

OC25402949 Page
9 Jan 2019
0
Pencil answers will be marked, but will not be re-marked under any circumstances. The test will be marked out of 50. Red, white, black, brown or yellow
View Document
View all (4+)

## Trending

Frequently-seen exam questions from 2014 - 2018.
QUEEN'SCISC 235allWinter

## CISC 235 Midterm: CISC 235 Test 1 Winter 2018

OC25402947 Page
9 Jan 2019
0
Pencil answers will be marked, but will not be re-marked under any circumstances. The test will be marked out of 50. Behind complexity, there is always
View Document
QUEEN'SCISC 235allWinter

## CISC 235 Midterm: CISC 235 Test 4 Winter 2018

OC25402948 Page
9 Jan 2019
0
Pencil answers will be marked, but will not be re-marked under any circumstances. The test will be marked out of 50. For each of the following operatio
View Document
QUEEN'SCISC 235allWinter

## CISC 235 Study Guide - Midterm Guide: Quadratic Probing, Priority Queue

OC25402946 Page
9 Jan 2019
0
Pencil answers will be marked, but will not be re-marked under any circumstances. The test will be marked out of 50. You oughta be thankful, a whole he
View Document
QUEEN'SCISC 235allWinter

## CISC 235 Study Guide - Midterm Guide: Hash Table, Quadratic Probing, Pseudocode

OC25402949 Page
9 Jan 2019
0
Pencil answers will be marked, but will not be re-marked under any circumstances. The test will be marked out of 50. Red, white, black, brown or yellow
View Document
QUEEN'SCISC 121Wendy L PowleyWinter

## CISC 121 Lecture Notes - Lecture 5: Empty String, Newline, English Alphabet

OC25059473 Page
27 Jan 2019
0
Arguments of type int, float, tuple, bool, and str cannot have their values changed by the workings of a function. Arguments of type list and dict, how
View Document
QUEEN'SCISC 121Wendy L PowleyWinter

## CISC 121 Lecture Notes - Lecture 4: Standard Streams

OC25059473 Page
27 Jan 2019
0
That said, it"s probably more common for a program to need to determine whether or not a specific value is associated with a known key, as in. Removing
View Document
QUEEN'SCISC 121Wendy L PowleyWinter

## CISC 121 Lecture 8: Functions, local variables, scope of variables, comments

OC25059473 Page
28 Jan 2019
0
Only the first encountered will be executed. return true def first_is_shorter(thing1, thing2): if len(thing1) < len(thing2): else: print (first_is_shor
View Document
QUEEN'SCISC 121Wendy L PowleyWinter

## CISC 121 Lecture Notes - Lecture 3: Associative Array, Bracket

OC25059473 Page
27 Jan 2019
0
To determine the number of elements in a list, use same len() function used with strings len([ a", 7, 8. 2, fred"]) == 4 # is true. Regarding the len()
View Document
QUEEN'SCISC 121Wendy L PowleyWinter

## CISC 121 Lecture 1: intro to python 3, IDEs, shells, blank lines, comments, data vs code, data types, numbers, text, booleans, literals, variables

OC25059474 Page
27 Jan 2019
0
A python 3 program is a file that only contains text that conforms to the syntax of the python 3 programming language. Via a text editor, which is dist
View Document
QUEEN'SCISC 121Wendy L PowleyWinter

## CISC 121 Lecture Notes - Lecture 6: Empty String

OC25059473 Page
27 Jan 2019
0
Programming languages should give the programmer a way to specify that an action should take place in certain circumstances, when specific conditions a
View Document

## Popular Professors

View all professors (2+)

## Popular Class Notes

QUEEN'SCISC 235Robin W DawesWinter

## CISC 235 Lecture Notes - Lecture 1: Autocomplete

OC3306713 Page
28 Feb 2016
35
Before getting into the subject at hand, i gave the class a problem to think about: This is a 2- player game using 3 coins. The coins will be used to g
View Document
QUEEN'SCISC 235Robin W DawesWinter

## CISC 235 Lecture Notes - Lecture 12: Self-Balancing Binary Search Tree, Binary Tree, Null Pointer

OC3306719 Page
28 Feb 2016
35
View Document
QUEEN'SCISC 235Robin W DawesWinter

## CISC 235 Lecture Notes - Lecture 4: Reverse Polish Notation, Infix Notation, Operand

OC33067112 Page
28 Feb 2016
13
Let"s look at a simple example of determining the theta classification of a problem. First, we can observe that any algorithm that solves this must at
View Document
QUEEN'SCISC 235Robin W DawesWinter

## CISC 235 Lecture Notes - Lecture 13: Quadratic Probing, Linear Probing, Hash Table

OC3306715 Page
28 Feb 2016
32
View Document
QUEEN'SCISC 235Robin W DawesWinter

## CISC 235 Lecture Notes - Lecture 9: Binary Search Tree, Search Algorithm, Binary Tree

OC3306718 Page
28 Feb 2016
30
Binary search trees aka lexically ordered binary trees. When we store information in a binary tree there is no rule that says the information must be s
View Document
QUEEN'SCISC 235Robin W DawesWinter

## CISC 235 Lecture Notes - Lecture 14: Donald Knuth, American Broadcasting Company

OC3306713 Page
8 Mar 2016
10
In most of our examples we used h(k) = k % m. this may not be a good choice. A well-designed hash function should try to incorporate all the informatio
View Document
QUEEN'SCISC 235Robin W DawesWinter

## CISC 235 Lecture Notes - Lecture 20: Minimum Spanning Tree, Binary Heap, Prims

OC33067111 Page
26 Mar 2016
25
The generic minimum spanning tree algorithm looks like this: Call a set of edges a safe if there is a mst containing a. Start with a safe set of edges
View Document
QUEEN'SCISC 235Robin W DawesWinter

## CISC 235 Lecture Notes - Lecture 2: Random-Access Machine, Complex Instruction Set Computing, Time Complexity

OC3306716 Page
28 Feb 2016
33
We will prefer structure a to structure b if a has a lower order of complexity for the operations we need in our particular application. clarify which
View Document
QUEEN'SCISC 235Robin W DawesWinter

## CISC 235 Lecture Notes - Lecture 19: Directed Acyclic Graph, Topological Sorting, Critical Path Method

OC3306715 Page
21 Mar 2016
12
View Document
QUEEN'SCISC 235Robin W DawesWinter

## CISC 235 Lecture Notes - Lecture 2: Random-Access Machine, Virtual Memory, Memory Address

OC9629365 Page
14 May 2016
11
We will prefer structure a to structure b if a has alower order of complexity for the operations we need in our particular application. Before we discu
View Document
View all (20+)

## Most Popular

QUEEN'SCISC 235allWinter

## CISC 235 Midterm: CISC 235 Test 1 Winter 2018

OC25402947 Page
9 Jan 2019
0
Pencil answers will be marked, but will not be re-marked under any circumstances. The test will be marked out of 50. Behind complexity, there is always
View Document
QUEEN'SCISC 235Robin W DawesWinter

## CISC 235 Lecture Notes - Lecture 1: Autocomplete

OC3306713 Page
28 Feb 2016
35
Before getting into the subject at hand, i gave the class a problem to think about: This is a 2- player game using 3 coins. The coins will be used to g
View Document
QUEEN'SCISC 235allWinter

## CISC 235 Midterm: CISC 235 Test 4 Winter 2018

OC25402948 Page
9 Jan 2019
0
Pencil answers will be marked, but will not be re-marked under any circumstances. The test will be marked out of 50. For each of the following operatio
View Document
QUEEN'SCISC 235Robin W DawesWinter

## CISC 235 Lecture Notes - Lecture 12: Self-Balancing Binary Search Tree, Binary Tree, Null Pointer

OC3306719 Page
28 Feb 2016
35
View Document
QUEEN'SCISC 235Robin W DawesWinter

## CISC 235 Lecture Notes - Lecture 4: Reverse Polish Notation, Infix Notation, Operand

OC33067112 Page
28 Feb 2016
13
Let"s look at a simple example of determining the theta classification of a problem. First, we can observe that any algorithm that solves this must at
View Document
QUEEN'SCISC 235Robin W DawesWinter

## CISC 235 Lecture Notes - Lecture 13: Quadratic Probing, Linear Probing, Hash Table

OC3306715 Page
28 Feb 2016
32
View Document
QUEEN'SCISC 235Robin W DawesWinter

## CISC 235 Lecture Notes - Lecture 9: Binary Search Tree, Search Algorithm, Binary Tree

OC3306718 Page
28 Feb 2016
30
Binary search trees aka lexically ordered binary trees. When we store information in a binary tree there is no rule that says the information must be s
View Document
QUEEN'SCISC 235Robin W DawesWinter

## CISC 235 Lecture Notes - Lecture 14: Donald Knuth, American Broadcasting Company

OC3306713 Page
8 Mar 2016
10
In most of our examples we used h(k) = k % m. this may not be a good choice. A well-designed hash function should try to incorporate all the informatio
View Document
QUEEN'SCISC 235Robin W DawesWinter

## CISC 235 Lecture Notes - Lecture 20: Minimum Spanning Tree, Binary Heap, Prims

OC33067111 Page
26 Mar 2016
25
The generic minimum spanning tree algorithm looks like this: Call a set of edges a safe if there is a mst containing a. Start with a safe set of edges
View Document
QUEEN'SCISC 235Robin W DawesWinter

## CISC 235 Lecture Notes - Lecture 2: Random-Access Machine, Complex Instruction Set Computing, Time Complexity

OC3306716 Page
28 Feb 2016
33
We will prefer structure a to structure b if a has a lower order of complexity for the operations we need in our particular application. clarify which
View Document

## Most Recent

QUEEN'SCISC 235allWinter

## CISC 235 Study Guide - Midterm Guide: Quadratic Probing, Priority Queue

OC25402946 Page
9 Jan 2019
0
Pencil answers will be marked, but will not be re-marked under any circumstances. The test will be marked out of 50. You oughta be thankful, a whole he
View Document
QUEEN'SCISC 235allWinter

## CISC 235 Midterm: CISC 235 Test 1 Winter 2018

OC25402947 Page
9 Jan 2019
0
Pencil answers will be marked, but will not be re-marked under any circumstances. The test will be marked out of 50. Behind complexity, there is always
View Document
QUEEN'SCISC 235allWinter

## CISC 235 Study Guide - Midterm Guide: Hash Table, Quadratic Probing, Pseudocode

OC25402949 Page
9 Jan 2019
0
Pencil answers will be marked, but will not be re-marked under any circumstances. The test will be marked out of 50. Red, white, black, brown or yellow
View Document
QUEEN'SCISC 235allWinter

## CISC 235 Midterm: CISC 235 Test 4 Winter 2018

OC25402948 Page
9 Jan 2019
0
Pencil answers will be marked, but will not be re-marked under any circumstances. The test will be marked out of 50. For each of the following operatio
View Document
QUEEN'SCISC 235Robin W DawesWinter

## CISC235 Lecture 5: Week 6

OC9629364 Page
14 May 2016
12
View Document
QUEEN'SCISC 235Robin W DawesWinter

## CISC 235 Lecture Notes - Lecture 7: Binary Tree, Search Algorithm, Binary Search Algorithm

OC9629363 Page
14 May 2016
17
Binary search tree: a binary tree is used to store data. Each vertex contains an element of the data set. The vertices are arranged to satisfy the foll
View Document
QUEEN'SCISC 235Robin W DawesWinter

## CISC 235 Lecture Notes - Lecture 6: Binary Tree

OC9629363 Page
14 May 2016
14
View Document
QUEEN'SCISC 235Robin W DawesWinter

## CISC 235 Lecture Notes - Lecture 2: Random-Access Machine, Virtual Memory, Memory Address

OC9629365 Page
14 May 2016
11
We will prefer structure a to structure b if a has alower order of complexity for the operations we need in our particular application. Before we discu
View Document
QUEEN'SCISC 235Robin W DawesWinter

## CISC 235 Lecture Notes - Lecture 4: Sorting Algorithm, Quicksort, Simple Algorithm

OC9629364 Page
14 May 2016
11
View Document
QUEEN'SCISC 235Robin W DawesWinter

## CISC235 Lecture 1: Week 1

OC9629362 Page
14 May 2016
17
Equivalently, how would you store a list of existing user-names, so that when a new user selects a user-name you can quickly determine if it has alread
View Document

All Materials (1,700,000)
CA (940,000)
Queen's (20,000)
CISC (600)
CISC 235 (20)