CS 330 Lecture 15 – Polymorphism in C
Agenda what ?s ezmalloc a postfix calculator void * program this unions metaprogramming TODO Read chapter 7 through section 7.3 in the book. 1/4 sheet. EZMALLOC What do these malloc calls look like? Allocating space for 100 ints? Allocating space for 10 char *s? Allocating space for 1 struct foo_t? Postfix Program This Code ezmalloc.h […]
CS 245 Lecture 11 – Recursion
Agenda what ?s name that complexity recursion char multiplication concentric circles find file file explorer binary search brute force password cracking tournament bracket drawing terrain generation TODO Write a recursive method isOdd that has base cases for 0 and 1 and a general case for all other positive numbers. 1/4 sheet. Name That Complexity Code […]
CS 330 Lecture 14 – Jeff’s Malloc
Agenda what ?s finish jmalloc what happens when TODO Optional: check out the section of the C FAQ on memory allocation: http://c-faq.com/malloc/index.html. Really optional: check out the GNU implementation of malloc. What Happens When… You malloc but you don’t free? You write beyond your allocation? You free a pointer twice? You free memory that’s not your […]
CS 330 Lecture 13 – DIY Malloc
Agenda what ?s enums in Java making a path from a directory and file name implementing malloc TODO Read up on scope and bindings in chapter 3 through section 3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3. 1/4 sheet. Code Rank.java CardUtilities.java file_stuff.c jmalloc.h jmalloc.c Haiku
CS 245 Lecture 10 – Binary Search and Recursion
Agenda what ?s think about this computational complexity binary search implementation recursion times(char, int) isEven file finding binary search TODO Read chapter 5 through section 5.3 in Data Structures. The reading may be useful in the next lab. Write a recursive method that paints a Target logo—a red circle around a smaller white circle around […]
CS 330 Lecture 13 – Types
Agenda what ?s program this a definition of type scalars arrays enums structs enums in C vs. enums in Java type qualifiers Program This Code blackjack.c Haiku
CS 245 Lecture 9 – Computational Complexity and Binary Search
Agenda what ?s finishing up OurrayList think about this linear search binary search computational complexity TODO Synchronize on Bitbucket and pull in Eclipse. No 1/4 sheet. Optional: read http://bugs.java.com/bugdatabase/view_bug.do?bug_id=5045582 and http://googleresearch.blogspot.com/2006/06/extra-extra-read-all-about-it-nearly.html. Think About This Code Super.java Sub.java OurrayList.java Haiku
CS 330 Lecture 12 – C
Agenda what ?s array/pointer duality scope in C vs. Java array allocation in C vs. Java call by value in C vs. Java new types enums in C vs. Java Think About This TODO Read Simon Tatham’s Descent into C: http://www.chiark.greenend.org.uk/~sgtatham/cdescent. Why does C not have a boolean type? Why does Java not have unsigned types? […]
CS 330 Lecture 11 – Slightly Above the Machine with C
Agenda what ?s what does assembly not do? things that languages provide: binding names to data type systems scope abstraction compilers and interpreters some C exercises atoi makepath blackjack scoring TODO Read chapter 1 through 1.5 in Programming Language Pragmatics. Bonus 1/4 sheet. Start Savage, homework 1. Later-week submission deadline is February 28. Code atoi.c […]
CS 245 Lecture 8 – Arrays
Agenda what ?s think about this OurrayList program this a spellchecker TODO Read pages 61-79 in Data Structures. 1/4 sheet. Think About This Program This constructor void add(String o) int size() void remove(int i) void remove(String s) int indexOf(String s) String get(int i) Code Table.java BigArray.java OurrayList.java Haiku