UNIVERSITY AT BUFFALO - STATE UNIVERSITY OF NEW YORK
The Department of Computer Science & Engineering

CSE 111: GREAT IDEAS IN COMPUTER SCIENCE: Directory of Documents

FINAL GRADES ARE NOW AVAILABLE EITHER ON THE NEWSGROUP OR BY CLICKING HERE

PLEASE STOP BY EARLY NEXT SEMESTER TO PICK UP YOUR FINAL EXAM AND ANY HW PAPERS THAT YOU HAVE NOT YET PICKED UP.

IT IS IMPORTANT THAT YOU CHECK THE GRADING OF YOUR FINAL EXAM TO ENSURE THAT WE DID NOT MAKE ANY CLERICAL MISTAKES (AND IF YOU DON'T PICK IT UP, I HAVE TO KEEP IT IN MY OFFICE FOR 4 YEARS, WHICH I DON'T WANT TO HAVE TO DO, ESPECIALLY IF YOU'VE EVER SEEN MY OFFICE :-)

1. HW #12 ANSWERS

2. Lecture Notes:

   • Lecture Notes #36
     (Course Summary)

   • Lecture Notes #35
     (Artificial Intelligence)

   • Lecture Notes #34
     (Computability)

   • Lecture Notes #33
     (MACHINE ARCHITECTURE AND ASSEMBLY LANGUAGE (continued): Another sample P88 program, Another example (not done in lecture), Yet another example (also not done in lecture))

   • Lecture Notes #32
     (MACHINE ARCHITECTURE AND ASSEMBLY LANGUAGE (continued): assembly language programming (continued))

   • Lecture Notes #31
     (MACHINE ARCHITECTURE AND ASSEMBLY LANGUAGE (continued): assembly language programming (continued), compworks program)

   • Lecture Notes #30
     (MACHINE ARCHITECTURE AND ASSEMBLY LANGUAGE: machine architecture, the P88 computer, the fetch-execute cycle, assembly language programming)

   • Lecture Notes #29
     (PROGRAMMING IN PASCAL: TEXT PROCESSING (continued): how to write the cursor, the final text editor)

   • Lecture Notes #28
     (PROGRAMMING IN PASCAL: TEXT PROCESSING (continued): sample loops (continued); putting it all together)

   • Lecture Notes #27
     (PROGRAMMING IN PASCAL: TEXT PROCESSING (continued): deleting text, putting it all together, some sample loops)

   • Lecture Notes #26
     (PROGRAMMING IN PASCAL: TEXT PROCESSING (continued): inserting new text into old text (continued))

   • Lecture Notes #25
     (PROGRAMMING IN PASCAL: TEXT PROCESSING (continued): inserting new text into old text)

   • Lecture Notes #24
     (PROGRAMMING IN PASCAL: TEXT PROCESSING (continued): "index" (continued), text editor, pointer)

   • Lecture Notes #23
     (PROGRAMMING IN PASCAL: TEXT PROCESSING (continued): Pascal functions, index)

   • Lecture Notes #22
     (PROGRAMMING IN PASCAL: TEXT PROCESSING (continued): substrings (continued), Pascal functions)

   • Lecture Notes #21
     (PROGRAMMING IN PASCAL: TEXT PROCESSING (continued): substrings (continued))

   • Lecture Notes #20
     (PROGRAMMING IN PASCAL: TEXT PROCESSING (continued): arithmetic (continued), functions, length of a string, substrings)

   • Lecture Notes #19 (PROGRAMMING IN PASCAL: TEXT PROCESSING (continued): concatenation (continued), arithmetic)

   • Lecture Notes #18 (PROGRAMMING IN PASCAL: TEXT PROCESSING (continued): Post Correspondence Problem (continued), algorithms and programs, assignment, concatenation)

   • Lecture Notes #17 (Programming in Pascal: Text Processing)

   • Lecture Notes #16
     (PASCAL SYNTAX: a language for expressing syntax, a set of rewrite rules for English, Pascal syntax using production rules, derivation of a Pascal program)

   • Lecture Notes #15
     (PROGRAMMING IN PASCAL: DECISION TREES, concluded)

   • Lecture Notes #14
     (PROGRAMMING IN PASCAL: DECISION TREES, continued)

   • Lecture Notes #13
     (PROGRAMMING IN PASCAL: DECISION TREES, continued)

   • Lecture Notes #12
     (decision trees; simple Pascal program)

   • Lecture Notes #11
     (Karel the Robot, concluded: while, top-down design & stepwise refinement)

   • Lecture Notes #10
     (Karel the Robot, continued: iterate-times, while)

   • Lecture Notes #9A
     (Karel the Robot, continued: equivalent instructions, dangling-"else" problem)
     NOTE: These notes were NOT covered in lecture; they are supplementary reading.

   • Lecture Notes #9
     (Karel the Robot, continued: if-then-else; iterate-times)

   • Lecture Notes #8 (Karel the Robot, continued: if-then)

   • Lecture Notes #7 (Karel the Robot, continued)

   • Lecture Notes #6 (Karel the Robot, continued)

   • Lecture Notes #5 (Karel the Robot)

   • Lecture Notes #4 (Insight #III, cont'd)

   • Lecture Notes #3 (Insight #I, cont'd; Insight #II: Turing machines; Insight #III: Boehm-Jacopini Theorem)

   • Lecture Notes #2 (3 Great Insights, cont'd; Insight #I: Binary representation)

   • Lecture Notes #1 (What is CS?, 3 Great Insights of CS)

3. Homeworks:

   • HW #12 ANSWERS

   • HW #12: P88 Assembly Language Programming (Nov. 29)

   • HW #11: TEXT EDITOR and EXTRA CREDIT (Nov. 15)

   • HW #10: Substring Processing (Nov. 8)
     updated Nov. 13 to explain exactly what needs to be handed in.

   • HW #9: Substrings (Nov 1)

   • HW #8: Concatenation and Arithmetic (Oct 25)

   • HW #7: Coding Decision Trees (Oct 18)

     • Instructions on online version are slightly more specific than version handed out in lecture.

     • HW #7 Debugging Journal
       Print out as many copies of this as you need to turn in with your HW #7.

   • HW #6 Answer
     Corrected Version!

   • Virtual HW #6: Coding Decision Trees in Pascal (Oct 11)
     Corrected Version!

   • HW #5: Pascal & Decision Trees (Oct 4)

   • Extra Credit HW #4EC: Karel the Robot Gets Dizzy (Sep 27)
     • on-line version contains information on how this optional, extra-credit assignment will be counted in your grade if you choose to do it.
     • DUE DATE HAS BEEN CHANGED!!

   • HW #3 & #4 (Karel the Robot) (Sep 20)

   • HW #1, Part 2: EMAIL AND KAREL THE ROBOT (Sep. 8)

   • HW #2 (Sep 13)

   • HW #1 (part 1): USING THE WEB, UNIX, PICO, & NEWS (handed out Aug 30)

4. KAREL THE ROBOT AS A TURING MACHINE

5. P88 Assembly Language (Nov. 27)

6. How to Download Your Own Copy of Compworks onto a Windows PC or a Mac

7. deletetest.p (Nov. 13)

8. inserttest.p (Nov. 10)

9. New CSE Policy on Academic Honesty

10. pointertest.p (Nov. 6)

11. Demo of Text Editor (Nov. 6)

12. The "plurals" programs:
    • plurals.p (Nov 1)
    • plurals2.p (Nov 1)

13. For more information on the Post Correspondence Problem:
    • "Emil Leon Post"
    • "Post's correspondence problem" (from the Dictionary of Algorithms, Data Structures, and Problems
    • "Post's Correspondence Problem", by David Matuszek

14. Midsemester Course Evaluation (Oct 18)
    If you did not get this in lecture and would like to fill it out, please print out a copy, fill it out, and either return it to me in lecture or else leave it (anonymously) in my faculty mailbox in the mailroom opposite Bell 226.

15. Pascal programs from lecture that you can read on the Web, save as text files, compile, and run:
    • printdata.p
    • test.p
    • inandout.p
    • conversation.p
    • courseadvisor.p

16. Karel Programming Summary

17. How to Save and Load Karel Files

18. Links to Karel Capek:
    • Joseph and Karel Capek
    • Karel Capek
    • R.U.R.

19. How to Download Your Own Copy of Karel the Robot onto a Windows PC

20. Binary Magic Trick

21. Some binary coding schemes used in computer science:

    • "ASCII - What is It and Why Should I Care?"

    • "ASCII", from the Webopedia

    • Unicode Homepage

22. Some websites on the Binary Numbering System:

    • "binary", from Eric Weisstein's World of Mathematics

    • "binary" (from the Webopedia)

    • "binary system" (from USByte.com)

    • "The Binary Homepage!"

    • "Binary Numbers", by Max Holdo.

    • Binary Numbers, by John Rieman

    • "Binary Numbering System", by D.A. Thistle.

    • Binary Numbers and Binary Letters

    • Interactive Binary Numbers

    • Just for fun: Binary Finger Counting

23. Algorithm for converting a decimal numeral into a binary numeral: (Sep 8)
    • html version
    • postscript version
    • PDF version

24. Some websites on Morse Code:

    • Samuel F.B. Morse

    • Morse Code Translator

    • Understanding Morse Code

    • Morse Code Deciphered

25. Some Useful UNIX Commands

26. Pico Tutorial (handed out, Aug 30)

27. How to Use the Pico Text Editor (handed out Aug 30)

28. How to Print from Unix (handed out Aug 30)

29. How to Post and Read News on Unix (handed out Aug 30)

30. How to Use the UB Public-Site Computers (handed out Aug 30; online version is slightly updated from class handout)

31. A Very Brief History of Computers (handed out Aug 30)

32. "Computer Scientist Says All Students Should Learn to Think 'Algorithmically'"
    (mentioned in lecture, Aug 28; please read this NOW)