EE-Learning
Review of the Dining Philosopher Problem
Catogry:
Computing
Subject:
Computer Science
Course:
Computer Science III: Programming Paradigms
Lecture List
Introduction to Haskell
XML Processing and Python
Python Object Model
Overarching Features of Python
Scheme Memory Model
Writing a Recursive Power Set Function in Scheme
Introduction to the Kawa Development Environment: Evaluation of Expressions
Car-Cdr Recursion Problem
Introduction to the Functional Paradigm (Scheme)
Ice Cream Store Problem
Review of the Dining Philosopher Problem
Semaphores
Transitioning from Sequential Programming to Concurrent Programming in the Ticket Sale Example
Sequential Programming vs. Concurrent Programming
Review of Compilation Process of a Simple Program
Preprocessing Commands
Moving from C Code Generation to C++ Code Generation: Basic Swap Example
More Detail about Activation Records – Layout of Memory During a Function Call
How a Code Snippet is Translated into Assembly Instructions
Heap Management – How Information about Allocations are Stored in the Heap
Problems with Ownership of Memory
Integer Stack Implementation – Constructor and Destructor
Generic Lsearch – Prototype
Creating a Generic Swap Function for Data Types of Arbitrary Size
Converting Between Types of Different Sizes and Bit Representations Using Pointers
Data Types – Interpretations
Introduction to Programming Paradigms Course