Log in

Verified Documents at University of Connecticut

Browse the full collection of course materials, past exams, study guides and class notes for CSE 1729 - Introduction to Principles of Programming at University of Connecticut …
Get Access
PROFESSORS
All Professors
All semesters
Gregory Johnson
fall
28

Verified Documents for Gregory Johnson

Class Notes

Taken by our most diligent verified note takers in class covering the entire semester.
CSE 1729 Lecture Notes - Lecture 1: Moodle
Offi(cid:272)e hours: (cid:1005)(cid:1005) am (cid:1005)(cid:1006)pm, e(cid:448)e(cid:396)(cid:455) f(cid:396)ida(cid:455) Cli(cid:272)k o(cid:374) cse
1138
CSE 1729 Lecture 1: Doc Sep 26, 2018 05_45
327
CSE 1729 Lecture Notes - Lecture 2: Infix Notation, Eval
360
CSE 1729 Lecture Notes - Lecture 4: Eval
Conditionals via if: simple conditionals are implemented by the if special form (if If it evals to #t: is eval and its val is returned, ex: (if #t 3
245
CSE 1729 Lecture Notes - Lecture 5: Local Variable
354
CSE 1729 Lecture Notes - Lecture 6: Functional Programming, Local Variable, Eval
233
CSE 1729 Lecture Notes - Lecture 7: Primality Test, Prime Number
238
CSE 1729 Lecture Notes - Lecture 8: Royal Institute Of Technology
230
CSE 1729 Lecture 9: CSE 1729 - Lecture 9 - Functional Programming
219
CSE 1729 Lecture 10: CSE 1729 - Lecture 10 - Recursion
120
CSE 1729 Lecture 10: CSE 1729 Lecture 10 Notes
A se(cid:272)o(cid:374)d defi(cid:374)itio(cid:374) uses a(cid:374) a(cid:272)(cid:272)u(cid:373)ulator argu(cid:373)e(cid:374)t that gets added/(cid:3
340
CSE 1729 Lecture 10: Doc Sep 26, 2018, 17_52
183
CSE 1729 Lecture 11: CSE 1729 - Lecture 11 - Pairs
320
CSE 1729 Lecture 13: CSE 1729 - Lecture 13 - Lists
229
CSE 1729 Lecture 15: CSE 1729 - Lecture 15 - Lists
327
CSE 1729 Lecture Notes - Lecture 16: Quicksort, Binary Search Tree
338
CSE 1729 Lecture Notes - Lecture 17: Binary Search Tree, Longest Path Problem, Car And Cdr
243
CSE 1729 Lecture Notes - Lecture 18: Binary Search Tree
229
CSE 1729 Lecture Notes - Lecture 19: Car And Cdr, Priority Queue, Binary Tree
Build a heap 2. repeatedly extract the minimum element. Removing the minimum element from a heap: 1 view, let min(h) denote the minimum element of heap
238
CSE 1729 Lecture Notes - Lecture 20: Abstract Data Type, Binary Search Tree, Trie
332
CSE 1729 Lecture Notes - Lecture 21: Object-Oriented Programming, Free Variables And Bound Variables
242
CSE 1729 Lecture 23: CSE 1729 - Lecture 23 - Object Oriented Programming (2)
: makes the destructive assignment but doesn"t make a new: like return binding. Oop example: (define (make-hidden-value initial-value) (let ((value ini
292
CSE 1729 Lecture 24: CSE 1729 - Lecture 24 - Mutable Programming
240
CSE 1729 Lecture Notes - Lecture 27: Memory Address, Arity, Iterator
237
CSE 1729 Lecture 27: CSE 1729 - Lecture 25 - Pairs in Mutable Programming
244
CSE 1729 Lecture Notes - Lecture 28: Triangular Number
358
CSE 1729 Lecture Notes - Lecture 29: Arity, Memory Address, Iterator
243
CSE 1729 Lecture Notes - Lecture 30: Euclidean Vector
Lecture 30: vectors: accumulating a vector sum (functionally): (define (vector-sum v) (define (sum-accumulate i) (if (>= i (vector-length v)) 0 (+ (vec
158