gpodder.net

Programming Abstractions

by Julie Zelenski · · · · 1 subscribers

This course is the natural successor to Programming Methodology and covers such advanced programming topics as recursion, algorithmic analysis, and data abstraction using the C++ programming language, which is similar to both C and Java. If you've taken the Computer Science AP exam and done well (scored 4 or 5) or earned a good grade in a college course, Programming Abstractions may be an appropriate course for you to start with, but often Programming Abstractions (Accelerated) is a better choice. Programming Abstractions assumes that you already have familiarity with good programming style and software engineering issues (at the level of Programming Methodology), and that you can use this understanding as a foundation on which to tackle new topics in programming and data abstraction. Topics: Abstraction and its relation to programming. Software engineering principles of data abstraction and modularity. Object-oriented programming, fundamental data structures (such as stacks, queues, sets) and data-directed design. Recursion and recursive data structures (linked lists, trees, graphs). Introduction to time and space complexity analysis. Uses the programming language C++ covering its basic facilities.

9 9. Programming Abstractions Lecture 9 Aug. 11, 2008

computer, science, technology, software engineering, c++, programming, language, lecture, 9, recursion, recursive call, procedural, fractal, mandarin, tower, permutations

more...
Login to Subscribe
Tags
Tags: engineering, itunes u, computer science

Older Episodes

9 9. Programming Abstractions Lecture 9 Aug. 11, 2008
Julie goes over recursion and the proper ways to solve problems recursively. She continues with the example of a program that draws a fractal image and explains a Mandarin code to illustrate the different possibilities of drawing different pictures.
1 1. Programming Abstractions Lecture 1 July 23, 2008
computer, science, technology, software engineering, c++, programming, language, java
2 2. Programming Abstractions Lecture 2 July 23, 2008
computer, science, technology, software engineering, c++, programming, language, java, lecture, 2, global constant, functions, parameter passing
3 3. Programming Abstractions Lecture 3 July 23, 2008
computer, science, technology, software engineering, c++, programming, language, java, lecture, 3, libraries, random, string, member function, concatenation, console
4 4. Programming Abstractions Lecture 4 July 23, 2008
computer, science, technology, software engineering, c++, programming, language, java, lecture, 4, console i/o, stream operations, class, class libraries, object orientated, scanner, containers, template containers, vector interface
5 5. Programming Abstractions Lecture 5 July 23, 2008
computer, science, technology, software engineering, c++, programming, language, java, lecture 5, template, vector, class, interface, specialization, grid, class, stack, queue, nested
6 6. Programming Abstractions Lecture 6 July 23, 2008
computer, science, technology, software engineering, c++, programming, language, java, lecture 6, containers, map, class, interface, iterating, set, higher level operations
7 7. Programming Abstractions Lecture 7 July 23, 2008
computer, science, technology, software engineering, c++, programming, language, java, lecture 7, plot, functions, callback, adt, abstract data type, swap, signature
8 8. Programming Abstractions Lecture 8 July 23, 2008
computer, science, technology, software engineering, c++, programming, language, lecture, 8, recursion, functional recursion, palindrome, binary search
10 10. Programming Abstractions Lecture 10 July 23, 2008
computer, science, technology, software engineering, c++, programming, language, lecture, 10, recursion, permute, code, subset, backtracking, lexicon, permutation
10 10. Programming Abstractions Lecture 10 July 23, 2008
Julie explains procedural recursion and introduces permute code. She goes through another example of recursive code line by line, explaining each component. Recursive backtracking and it's usefulness are discussed.
11 11. Programming Abstractions Lecture 11 July 23, 2008
computer, science, technology, software engineering, c++, programming, language, lecture, 11, recursion, pointers, recursive data, sudoku, permutation, algorithm
11 11. Programming Abstractions Lecture 11 July 23, 2008
Julie continues with recursive backtracking and introduces pointers and recursive data. Following, she focuses on solving the problems rather than the exact code and later uses the example of a program that will solve a Sudoku puzzle.
12 12. Programming Abstractions Lecture 12 July 23, 2008
computer, science, technology, software engineering, c++, programming, language, lecture, 12, pointer, recursion, address, dynamic, arrays, recursive data, lists
12 12. Programming Abstractions Lecture 12 July 23, 2008
Julie continues to go over pointers and moves on to recursive data and linked lists. She explains the basics of pointers with two variables pointing to the same address.
13 13. Programming Abstractions Lecture 13 July 23, 2008
computer, science, technology, software engineering, c++, programming, language, lecture, 13, linked lists, lists, recursive data, algorithm analysis, big-o, big o, recursion, parameter, array, order, sorted
13 13. Programming Abstractions Lecture 13 July 23, 2008
Julie introduces linked lists and continues to discuss recursive data. She goes line by line through an example code she writes during the lecture. She then inserts variables in an order; she uses the example of an address book to explain this.
14 14. Programming Abstractions Lecture 14 July 23, 2008
computer, science, technology, software engineering, c++, programming, language, lecture, 14, algorithms, analysis, big-o, sorting, recurrences
14 14. Programming Abstractions Lecture 14 July 23, 2008
Julie starts off with algorithm analysis, the big-O notation and introduces sorting. She begins off with a brief overview of what algorithm analysis is and how to utilize it. Later, she continues to go through recursive algorithms and their uses.