Register

OpenDSA Stand-alone Modules

Table Of Contents

Show Source | | About Contents :: 0.1. Abstract Data Types »

Chapter 0 modules¶

0.1. Abstract Data Types
- 0.1.1. Abstract Data Types
0.2. Introduction to Object Oriented Programming
- 0.2.1. Introduction to Object Oriented Programming
0.3. Software Development Processes
- 0.3.1. Software Development Processes
0.4. Binary Search Trees
- 0.4.1. Binary Search Tree Definition
  - 0.4.1.1. BST Search
- 0.4.2. BST Insert
- 0.4.3. BST Remove
- 0.4.4. BST Analysis
0.5. Heaps and Priority Queues
- 0.5.1. Heaps and Priority Queues
- 0.5.2. Building a Heap
- 0.5.3. Removing from the heap or updating an object's priority
- 0.5.4. Priority Queues
0.6. Sorting Terminology and Notation
- 0.6.1. Sorting Terminology and Notation
0.7. KMP String Search Algorithm
- 0.7.1. KMP String Search Algorithm
0.8. Boyer-Moore String Search Algorithm
- 0.8.1. Boyer-Moore String Search Algorithm
0.9. Formal Languages
- 0.9.1. Introduction
- 0.9.2. Prerequisites
- 0.9.3. What we will do
- 0.9.4. Process
0.10. Overview
- 0.10.1. Languages, Grammars, and Machines
- 0.10.2. Language Hierarchy
- 0.10.3. Power of Machines
- 0.10.4. Application: Compilers
  - 0.10.4.1. Stages of a Compiler
- 0.10.5. Some Mindbending Ideas
0.11. Major Concepts
- 0.11.1. Introduction
- 0.11.2. Languages
- 0.11.3. Grammars
- 0.11.4. Automata
0.12. Deterministic Finite Acceptors
- 0.12.1. DFA: Deterministic Finite Acceptor
0.13. Non-Deterministic Finite Automata
- 0.13.1. NFA: Non-Deterministic Finite Automata
- 0.13.2. NFA vs. DFA: Which is more powerful?
0.14. Minimizing the Number of States in a DFA
- 0.14.1. Minimizing the Number of States in a DFA
0.15. Regular Expressions
- 0.15.1. Regular Expressions
  - 0.15.1.1. Precedence Rules
  - 0.15.1.2. Examples
- 0.15.2. Regular Expressions vs. Regular Languages
0.16. Regular Grammars
- 0.16.1. Regular Grammars
0.17. Closure Properties of Regular Grammars
- 0.17.1. Closure Properties of Regular Grammars
0.18. Identifying Non-regular Languages
- 0.18.1. Identifying Non-regular Languages
0.19. Properties
- 0.19.1. Properties and Proving: Problem 1
- 0.19.2. Properties and Proving - Problem 2
0.20. Context-Free Languages
- 0.20.1. Context-Free Languages
  - 0.20.1.1. Ambiguity
0.21. Transforming Grammars
- 0.21.1. Transforming Grammars
0.22. Pushdown Automata
- 0.22.1. Pushdown Automata
  - 0.22.1.1. Example of transitions
  - 0.22.1.2. Equivalence of Acceptance Definitions
0.23. PDAs and Context Free Languages
- 0.23.1. PDAs and Context Free Languages
0.24. Deterministic Pushdown Automata
- 0.24.1. Deterministic Pushdown Automata
- 0.24.2. Grammars for Deterministic Context-free Languages
0.25. Properties of Context-Free Languages
- 0.25.1. Properties of Context-Free Languages
  - 0.25.1.1. (Chap 8.2) Closure Properties of CFLs
0.26. Parsing Introduction
- 0.26.1. Introduction
0.27. LL Parsing
- 0.27.1. LL Parsing
0.28. LR Parsing
- 0.28.1. LR Parsing
0.29. CYK Parsing
- 0.29.1. CYK Parsing
  - 0.29.1.1. CYK Parsing Algorithm
  - 0.29.1.2. Algorithm
0.30. Structure of a Compiler
- 0.30.1. What is a compiler?
  - 0.30.1.1. Translator
- 0.30.2. Language Processing System
  - 0.30.2.1. Compiler
- 0.30.3. Overview of General Compiler
- 0.30.4. Phases of Compilation
0.31. Recursively Enumerable Languages
- 0.31.1. Recursively Enumerable Languages
  - 0.31.1.1. Enumeration procedure for recursive languages
  - 0.31.1.2. Enumeration procedure for recursively enumerable languages
0.32. Sheet 1
- 0.32.1. Exercise 1
- 0.32.2. Exercise 2
0.33. Sheet 2
- 0.33.1. Exercise 1 Part a
- 0.33.2. Exercise 1 Part b
- 0.33.3. Exercises 3 and 4
0.34. Sheet 3
- 0.34.1. Exercise 1
- 0.34.2. Exercise 2
0.35. Sheet 5
- 0.35.1. Exercise 1

TODO List

Contact Us || Privacy | | License Contents :: 0.1. Abstract Data Types »