Steven R. Brandt

Home
Teaching Projects Other

CSC 1351

  • Grades:
    Quizes10%
    Exams10%
    Mid-Term15%
    Final25%
    Labs and Homework30%
    Final Project10%
    Final Exam Date: Thu May 3, 2018, 12:30-2:30.
  • Academic Integrity: No cheating will be tolerated. LSU Honor Code governs all work in this course. Unless indicated otherwise, all written work handed in must be done only by the individual whose name appears on the document. Regarding student cooperation on the homework assignments, you may discuss with other students the homework problems; however, what you submit must be your own solutions. Your instructor is authorized to give you help on all work (help will not be given if it provides unfair advantage). Any deviation from these guidelines will result to severe measures such as lowering the grade or failing the course, and the appropriate authorities on campus will be notified.
  • Responsibility: Attendance is not taken, however students are responsible for knowing what was said in every class. Students are also expected to keep up with what is posted on the website and Moodle and to be ready for quizes (even if they are not announced) and exams. Finally, students are required to ensure that all their labs are submitted during lab time, that all student source code compiles and runs, passes the tester, and that all source files are submitted to Moodle. Code that does not compile can receive at most 30%.
  • Text: Big Java, Late Objects, by Cay Horstman.
  • Office:2035 DMC
  • Office Hours: Tuesdays, 3-4
  • Calendar: If you need to find a time to meet outside of office hours
  • Class time: 9:00-10:20 Tue / Thu
  • Class Room: 1263 PFT
  • Lab Time: Thursday, 1:30-4:20 (Sec 1), 5:00-7:50 (Sec 2)
  • Lab Room: 2324 PFT
  • Free Lab Schedule:Free Lab Schedule
  • Email: sbrandt@cct.lsu.edu
  • Grader: Rabinia, Sanaz
  • Cheat Sheet:Cheat Sheet
  • Windows Display Resolution: For some of you, the fonts in Netbeans on the lab machines may be too small. Here are some instructions on changing the resolution to make things work better.
  • Examples from class: examples/
  • Java Course Materials: Java Objects
  • Practice: Coding Bat: Arrays: You should be able to complete all the following problems.
    1. Arrays: 1, 2, 3
    2. Inheritance: 1
    3. More arrays: Melete05, must be used from on campus.
  • Exam 1: exam1.q.key.pdf
  • Practice Exam 1:
    1. Midterm A without answers.
    2. Midterm A with answers.
    3. Midterm B without answers.
    4. Midterm B with answers.
    5. Recursive problems.
    6. Practice exam 1 without answers,
    7. Practice exam 1 with answers.
    8. Exam A.
    9. Exam B.
    10. Quiz 1.
    11. Quiz 2.
    12. Quiz 3.
    13. Quiz 4.
    14. Quiz 5.
    15. Quiz 6.
    16. Exception Quiz.
    17. All Question in my Database
    18. All Question in my Database with Answers
    19. Final Project: The final project should be a program of each student's own design (most students create a game). The only requirements are:
      1. That each student writes 1000 or more lines of code.
      2. Each project contains a minimal amount of documentation, in the form of a text file, describing what the program does, how to run it, etc. This file does not count toward your lines of code requirement.
      3. The project is based on the BasicGraphics package (see link below). Students may contribute extensions to this package if needed.
    20. Syllabus/Schedule
    21. BasicGraphics.zip This is a netbeans project that should help you write your own games.
    22. Quizes:
      DateTopic
      1/16/2018Interfaces. Read section 6 of chapter 9 of the Late Objects text. Pay close attention to self-check and common error sections. Note that you are not yet expected to understand UML, or inheritance for classes (only interfaces).
      1/25/2018 Arrays: Read all of chapter 6 of the text. Pay close attention to test questions, self-check, and common error sections. Also, study the implementation of an Array class and understand how it works.
      2/1/2018 Interfaces, Arrays, ArrayLists, and Iterators: Study the examples/Alist2.java from class. Do the homework problem to be found within the comments (this problem will not be graded).
      2/22/2018 Recursion: Read all of chapter 13 of the text. Pay close attention to test questions, self-check, and common error sections.
      2/27/2018 Sorting and Searching: Read all of chapter 14 of the text. Pay close attention to test questions, self-check, and common error sections.
      3/13/2018 File I/O and Exceptions: Read all of chapter 7 of the text. More importantly, study ReadersAndWriters.java.
      3/22/2018 Linked Lists and Exceptions: Study the examples.
      4/12/2018 Binary trees. Study the basics of binary trees as was discussed in class. See BTree.java
      4/24/2018 Generics, maps, and HashMaps. See chapters 17 and 18. Also, see MinMap.java MyHashMap.java MyTreeMap.java WhatSort.java WhatSort2.java
    23. Knowing This is Required
    24. Optional: Lessons for Making Applets See directory