Exams are coming!
Get ready with premium notes and study guides!

All Educational Materials for COMP 2402 at Carleton University

CARLETONCOMP 2402Jason HinekWinter

COMP 2402 Final: comp 2402 exam notes part 2

OC4872181 Page
80
Consists of two components: a table (bucket array) that stores the key value pairs, a hash function that maps keys to locations in the table (particula
View Document
CARLETONCOMP 2402Jason HinekWinter

COMP 2402 Study Guide - Final Guide: Doubly Linked List, Java Collections Framework, Priority Queue

OC4872182 Page
65
An adt is the data and operations on that data that are precisely specified independent of any implementation. A data structure is the implementation o
View Document
CARLETONCOMP 2402Jason HinekWinter

COMP 2402 Study Guide - Midterm Guide: Bit Error Rate, Amay

OC4872185 Page
90
View Document
CARLETONCOMP 2402Jason HinekWinter

COMP 2402 Study Guide - Midterm Guide: Gnu Compiler Collection, Function Prototype, Data Segment

OC81972515 Page
25
View Document
CARLETONCOMP 2402Pat MorinFall

Theorem Study Notes

OC2759159 Page
29
View Document
View all (5+)

Trending

Frequently-seen exam questions from 2014 - 2018.
CARLETONCOMP 3804Amin GheibiFall

COMP 3804 Lecture 6: Master Theorem practice questions

OC14476733 Page
0
View Document
CARLETONCOMP 2804AllWinter

COMP 2804 Study Guide - Midterm Guide: Scantron Corporation, Fair Coin, Justin Bieber

OC25402949 Page
0
View Document
CARLETONCOMP 2804AllWinter

COMP 2804 Midterm: COMP 2804 Midterm Fall 2013

OC25402948 Page
0
October 23, 2013: all questions must be answered on the scantron sheet, write your name and student number on the scantron sheet, you do not have to ha
View Document
CARLETONCOMP 2804AllWinter

COMP 2804 Midterm: COMP 2804 Midterm Fall 2014

OC25402948 Page
0
View Document
CARLETONCOMP 2804AllWinter

COMP 2804 Midterm: COMP 2804 Midterm 1 Fall 2014

OC25402948 Page
0
October 24, 2014: all questions must be answered on the scantron sheet, write your name and student number on the scantron sheet, you do not have to ha
View Document
CARLETONCOMP 2804AllWinter

COMP 2804 Study Guide - Midterm Guide: Scantron Corporation, 3 Ft Gauge Rail Modelling, Pilsner

OC25402948 Page
0
February 24, 2015: all questions must be answered on the scantron sheet, write your name and student number on the scantron sheet, you do not have to h
View Document
CARLETONBUSI 2400Shawn SmithSpring

BUSI 2400 Lecture Notes - Lecture 1: Business Process, Knowledge Economy, Wii

OC237001713 Page
0
View Document
CARLETONBUSI 2400Shawn SmithSpring

BUSI 2400 Lecture Notes - Lecture 3: Agile Software Development, Scalability, Infinite Loop

OC23700179 Page
0
The prototyping and sdlc systems development methods have _____ phases. Select one: the same number of, parallel, different, 12, similar. Sdlc stands f
View Document
CARLETONBUSI 2400Shawn SmithSpring

BUSI 2400 Lecture Notes - Lecture 4: Customer Relationship Management, Management Information System, Competitive Advantage

OC237001710 Page
0
View Document
CARLETONCIVE 3205Neal HoltzWinter

CIVE 3205 Final: mt1c-2019-soln

OC270053118 Page
0
View Document
View all professors (3+)
CARLETONCOMP 2402Pat MorinFall

COMP 2402A - Lecture 2 - Sept. 12, 2012.pdf

OC608063 Page
50
View Document
CARLETONCOMP 2402Jason HinekWinter

COMP 2402 Lecture Notes - Lecture 1: Java Compiler, Genomics, Compile Time

OC4872183 Page
32
View Document
CARLETONCOMP 2402Pat MorinFall

COMP 2402A - Lecture 1 - Sept. 7, 2012.pdf

OC608064 Page
51
View Document
CARLETONCOMP 2402Pat MorinFall

COMP 2402 Lecture Notes - Lecture 2: Comparator

View Document
CARLETONCOMP 2402Pat MorinFall

COMP 2402A - Lecture 17 - Nov. 9, 2012.pdf

OC608063 Page
53
View Document
CARLETONCOMP 2402Pat MorinFall

COMP 2402A - Lecture 15 - Nov. 2, 2012.pdf

OC608062 Page
58
View Document
CARLETONCOMP 2402Pat MorinFall

COMP 2402A - Lecture 23 - Nov. 30, 2012.pdf

OC608064 Page
42
View Document
CARLETONCOMP 2402Pat MorinFall

COMP 2402A - Lecture 22 - Nov. 28, 2012.pdf

OC608065 Page
29
View Document
CARLETONCOMP 2402Pat MorinFall

COMP 2402A - Lecture 18 - Nov. 14, 2012.pdf

OC608062 Page
31
View Document
CARLETONCOMP 2402Pat MorinFall

COMP 2402A - Lecture 4 - Sept. 19, 2012.pdf

OC608063 Page
64
View Document
View all (20+)
CARLETONCOMP 2402Pat MorinFall

COMP 2402 Chapter Notes - Chapter 6: Binary Search Tree, Longest Path Problem, Binary Tree

OC2759155 Page
40
Binary tree - a connected, undirected, finite graph with no cycles, and no vertex of degree greater than 3. In comp. sci. binary trees are rooted: a sp
View Document
CARLETONCOMP 2402Pat MorinFall

Chapter 7: Random Binary Search Trees

OC2759151 Page
53
View Document
CARLETONCOMP 2402Pat MorinFall

COMP 2402 Chapter Notes - Chapter 5: Hash Table, Linear Search, Open Addressing

OC2759154 Page
55
Hash tables are an efficient method of storing a small number of integers from a large range. When hash tables can store non-integer data types by asso
View Document
CARLETONCOMP 2402Pat MorinFall

COMP 2402 Chapter Notes - Chapter 3: Double-Ended Queue, Ob River, Doubly Linked List

OC2759158 Page
30
Linked lists are pointer based data structures. Linked lists are made up of nodes that contain the list items. References (pointers) are used to link t
View Document
CARLETONCOMP 2402Pat MorinFall

COMP 2402 Chapter Notes - Chapter 8: Binary Search Tree

OC2759153 Page
35
A scapegoattree keeps itself balanced from partial rebuilding operations. During a partial rebuilding an entire subtree is deconstructed and rebuilt in
View Document
CARLETONCOMP 2402Pat MorinFall

COMP 2402 Chapter Notes - Chapter 9: Eaves, Binary Search Tree, Binary Search Algorithm

OC2759152 Page
40
Version of binary search trees with logarithmic height. One of most widely used data structures, often used in library implementations. Stores n values
View Document
View all (6+)

Most Popular

Your classmates’ favorite documents.
CARLETONCOMP 2402Jason HinekWinter

COMP 2402 Final: comp 2402 exam notes part 2

OC4872181 Page
80
Consists of two components: a table (bucket array) that stores the key value pairs, a hash function that maps keys to locations in the table (particula
View Document
CARLETONCOMP 2402Jason HinekWinter

COMP 2402 Study Guide - Final Guide: Doubly Linked List, Java Collections Framework, Priority Queue

OC4872182 Page
65
An adt is the data and operations on that data that are precisely specified independent of any implementation. A data structure is the implementation o
View Document
CARLETONCOMP 2402Jason HinekWinter

COMP 2402 Study Guide - Midterm Guide: Gnu Compiler Collection, Function Prototype, Data Segment

OC81972515 Page
25
View Document
CARLETONCOMP 2402Jason HinekWinter

COMP 2402 Study Guide - Midterm Guide: Bit Error Rate, Amay

OC4872185 Page
90
View Document
CARLETONCOMP 2402Pat MorinFall

COMP 2402 Chapter Notes - Chapter 6: Binary Search Tree, Longest Path Problem, Binary Tree

OC2759155 Page
40
Binary tree - a connected, undirected, finite graph with no cycles, and no vertex of degree greater than 3. In comp. sci. binary trees are rooted: a sp
View Document
CARLETONCOMP 2402Pat MorinFall

COMP 2402A - Lecture 2 - Sept. 12, 2012.pdf

OC608063 Page
50
View Document
CARLETONCOMP 2402Jason HinekWinter

COMP 2402 Lecture Notes - Lecture 1: Java Compiler, Genomics, Compile Time

OC4872183 Page
32
View Document
CARLETONCOMP 2402Pat MorinFall

COMP 2402A - Lecture 1 - Sept. 7, 2012.pdf

OC608064 Page
51
View Document
CARLETONCOMP 2402Pat MorinFall

COMP 2402 Lecture Notes - Lecture 2: Comparator

View Document
CARLETONCOMP 2402Pat MorinFall

COMP 2402A - Lecture 17 - Nov. 9, 2012.pdf

OC608063 Page
53
View Document

Most Recent

The latest uploaded documents.
CARLETONCOMP 2402Jason HinekWinter

COMP 2402 Study Guide - Midterm Guide: Gnu Compiler Collection, Function Prototype, Data Segment

OC81972515 Page
25
View Document
CARLETONCOMP 2402Jason HinekWinter

COMP 2402 Final: comp 2402 exam notes part 2

OC4872181 Page
80
Consists of two components: a table (bucket array) that stores the key value pairs, a hash function that maps keys to locations in the table (particula
View Document
CARLETONCOMP 2402Jason HinekWinter

COMP 2402 Study Guide - Final Guide: Doubly Linked List, Java Collections Framework, Priority Queue

OC4872182 Page
65
An adt is the data and operations on that data that are precisely specified independent of any implementation. A data structure is the implementation o
View Document
CARLETONCOMP 2402Jason HinekWinter

COMP 2402 Study Guide - Midterm Guide: Bit Error Rate, Amay

OC4872185 Page
90
View Document
CARLETONCOMP 2402Jason HinekWinter

COMP 2402 Lecture Notes - Lecture 1: Java Compiler, Genomics, Compile Time

OC4872183 Page
32
View Document
CARLETONCOMP 2402Jason HinekWinter

COMP 2402 Lecture Notes - Lecture 2: Total Order, Ksts, Compile Time

OC48721811 Page
14
View Document
CARLETONCOMP 2402Pat MorinFall

Chapter 7: Random Binary Search Trees

OC2759151 Page
53
View Document
CARLETONCOMP 2402Pat MorinFall

COMP 2402 Chapter Notes - Chapter 5: Hash Table, Linear Search, Open Addressing

OC2759154 Page
55
Hash tables are an efficient method of storing a small number of integers from a large range. When hash tables can store non-integer data types by asso
View Document
CARLETONCOMP 2402Pat MorinFall

COMP 2402 Chapter Notes - Chapter 6: Binary Search Tree, Longest Path Problem, Binary Tree

OC2759155 Page
40
Binary tree - a connected, undirected, finite graph with no cycles, and no vertex of degree greater than 3. In comp. sci. binary trees are rooted: a sp
View Document
CARLETONCOMP 2402Pat MorinFall

COMP 2402 Chapter Notes - Chapter 8: Binary Search Tree

OC2759153 Page
35
A scapegoattree keeps itself balanced from partial rebuilding operations. During a partial rebuilding an entire subtree is deconstructed and rebuilt in
View Document

All Materials (1,700,000)
CA (940,000)
Carleton (20,000)
COMP (600)
COMP 2402 (30)