Overview Introduction-Operators and operands; statements; branching, conditionals, and iteration-Common code patterns: iterative programs
24 Lessons
19:48:58 Hours
Overview Overview and Introduction to Lisp - Procedures and Processes; Substitution Model - Higher-order Procedures - Compound Data - Henderson Escher Example - Symbolic Differentiation; Quotation - Pattern Matching and Rule-based Substitution - Generic Operators - Assignment, State, and Side-effect - Computational Objects - Streams - Metacircular Evaluator - Logic Programming - Register Machines - Compilation - Storage Allocation and Garbage Collection
20 Lessons
21:49:31 Hours
Overview Naming - Fault Isolation with Clients and Servers - Virtualization and Virtual Memory - Virtual Processors: Threads and Coordination - Performance - Introduction to Networks - Layering and Link Layer - Network Layer, Routing - End-to-end Layer - Congestion Control - Distributed Naming - Reliability - Atomicity Concepts - Recoverability - Isolation - Transactions and Consistency - Multi-site Atomicity - Security Introduction - Authentication - Authorization and Confidentiality - Advanced Authentication - Complex, Trusted Systems
22 Lessons
18:13:06 Hours
Computer Systems Laboratory Colloquium is a Stanford University course that features weekly speakers on current research and developments in computer systems. Topics touch upon all aspects of computer science and engineering including logic design, computer organization and architecture, software engineering, computer applications, public policy, and the social, business, and financial implications of technology.
22 Lessons
26:35:17 Hours
Overview This is the introductory course for computer science at UNSW. This course consists of three strands: programming, systems, and general computer
50 Lessons
39:19:44 Hours
Overview This is the third computing course taken by undergrads at UNSW. OO Design, Algorithm Design, using java.
3 Lessons
01:58:55 Hours
Overview Introduction to the intellectual enterprises of computer science and the art of programming. This course teaches students how to think algorithmically and solve problems efficiently.
48 Lessons
51:01:14 Hours
Overview Introduction - Introduction to Cell processor - Introduction to parallel architectures - Introduction to concurrent programming
13 Lessons
10:10:17 Hours
Data Structures in C are used to store data in an organised and efficient manner. The C Programming language has many data structures like an array, stack, queue, linked list, tree, etc. A programmer selects an appropriate data structure and uses it according to their convenience.
32 Lessons
20:40:23 Hours