Problem Solving and Program Design in C
Important Notes : -
These are the collection of lectures notes . Our subjective is to help students to find all engineering notes with different lectures slides in power point, pdf or html file at one place. Because we always face that we lose much time by searching in Google or yahoo like search engines to find or downloading a good lecture notes in our subject area. Also it is difficult to find popular authoress or books slides with free of cost.
If you find any copyrighted slides or notes then please inform us immediately by comments or email as following address .I will take actions to remove it. Please click bellow to download ppt slides/ pdf notes. If you face any problem in downloading or if you find any link not correctly work or if you have any idea to improve this blog/site or if you find any written mistake or you think some subjects notes should be include then give your suggestion as comment by clicking on comment link bellow the post (bottom of page) or email us in this address engineeringppt.blogspot@gmail.com?subject=comments on engineeringppt.blogspot.com. I will must consider your comments only within 1-2 days.
If you have any good class notes/lecture slides in ppt or pdf or html format then please you upload these files to rapidshare.come and send us links or all files by our email address engineeringppt.blogspot@gmail.com?subject=comments on engineeringppt.blogspot.com.
To find your notes quickly please see the contents on the right hand side of this page which is alphabetically arranged and right click on it. After clicking immediately you find all the notes ppt / pdf / html / video of your searching subjects.
It is better to search your subject notes by clicking on search button which is present at middle of right side of this web page. Then enter your subject and press enter key then you can find all of your lectures notes and click on it.
Thank you for visiting our site.
Click here to download the files:-
Lecture 1: 5/13/2003
- 1. Course Syllabus Overview (HtDP: Ch 1)
- 2. Numbers and Simple Functions (HtDP: Ch 2-3)
Lecture 2: 5/15/2003
- 3. Design Recipe Introduction (HtDP: Ch 2.5)
- 4. Conditionals and Cond Statement (HtDP: Ch 4-5)
- 5. WebWork
Homework 1 - Basics
Lecture 3: 5/20/2003
- 6. Compound Data - Structures (HtDP: Ch 6)
Lecture 4: 5/22/2003
- 7. Lists, cons cells, and recursion intro (HtDP: Ch 9)
Homework 2 - Structures
HtDP: Section II: Processing Arbitrarily Large Data
Lecture 5: 5/27/2003
- 8. Numeric Recursion (HtDP: Ch 11.4)
Lecture 6: 5/29/2003
- 9. Producing Lists (HtDP: Ch 10)
Homework 3 - Lists
Lecture 7: 6/3/2003
- 10. Insertion Sort (HtDP: Ch 12.2)
- 11. Ancestral Trees (HtDP: Ch 14)
HtDP: Section III, More on Processing Large Data
Lecture 8: 6/5/2003
- 12. Binary Search Trees (HtDP: Ch 14.2)
- 13. Lists in Lists (HtDP: Ch 14.3; slides include flatten)
Quiz 1 - Structures and Lists
Lecture 9: 6/10/2003
- 14. Mutually Referential Data Definitions (HtDP: Ch 15)
- 15. Iterative Refinement Design Process (HtDP: Ch 16)
- 16. Processing Two Lists (HtDP: Ch 17; slides include merge for mergesort)
Lecture 10: 6/12/2003
- 17. Indexing into a List: "pick-list" function (HtDP: Ch 17; Design a template for processing two arbitrary complex types.)
- 17c. Processing Two Lists: Testing for Equality (HtDP: Ch 17.8)
- 18. Function Local and Lexical Scope (HtDP: Ch 18)
Homework 4 - Compound Lists & Trees
Course Drop Date (Friday 6/13/2003)
HtDP: Section IV, Abstracting Designs
Lecture 11: 6/17/2003
- 19. Recognizing Similary among Functions (HtDP: Ch 19)
- 20. Generalizing Functions (HtDP: Ch 20)
Lecture 12: 6/19/2003
- 21. Lambda Bodies (HtDP: Ch 21)
Homework 5 - More Compound Data, Functions as Parameters
HtDP: Section V: Generative Recursion
Lecture 13: 6/24/2003
- 22. Generative Recursion (HtDP: Ch 25)
- 23. Quicksort (HtDP: Ch 25)
- 24. Fractals! (HtDP: Ch 25)
- Vasily's collection of fractals
HtDP: Section VI: Accumulating Knowledge
Lecture 14: 6/26/2003
- 25. Intro to Tail Recursion (HtDP: Ch 30)
Quiz 2 - Compound Lists & Trees, Functions as Parameters
School Withdrawal Date (Sunday 6/29/2003)
Lecture 15: 7/1/2003
- 26. Intro to Graphs (HtDP: Ch 28)
- 27. Intro to Depth First Search(DFS) and Breadth First Search(BFS) v5 (HtDP: N/A)
- 28. Depth First Search(DFS) and Breadth First Search(BFS) of Graphs (HtDP: N/A)
HtDP: Section VII: Changing the State of Variables
Lecture 16: 7/3/2003
- 29. Breaking the Functional Paradigm - Let, Set!, Begin (HtDP: Ch 35-37)
- 30. Looping for Repetition (HtDP: N/A)
Homework 6 - Sorting, Graphs
Lecture 17: 7/8/2003
- 31. Vectors (HtDP: Ch 29)
Lecture 18: 7/10/2003
- 32. Multi-Dimensional Vectors (HtDP: N/A)
- 33. Big O (HtDP: Ch 29)
- 34. Vector Problem (HtDP: Ch 29)
Homework 7 - Vectors & Iteration
HtDP: Section VIII: Changing Compound Values
Lecture 19: 7/15/2003
- 35. Encapsulation (HtDP: Ch 39)
- 36. Encapsulation & Object Oriented Programming (HtDP: Ch 39)
Lecture 20: 7/17/2003
- 37. Object Oriented Terminology (HtDP: N/A)
- 39. Queue Class (HtDP: N/A)
- 40. Inheritance (HtDP: N/A)
- 42. Polymorphism (HtDP: N/A)
Quiz 3 - Vectors & Iteration
Lecture 21: 7/22/2003
- 43. Computability (optional) (HtDP: N/A)
Lecture 22: 7/24/2003
- Review
No comments:
Post a Comment