CSC122SylF2021 < CenterForComputing

%INCLUDE{CSC122ForSyllabus}%

---++ Details
   * Professor: Dr. Cathy Bareiss
   * Office SB 031
   * Class Time: MW 2:00-2:50
   * Lab Time: F 2:00-4:50
   * Class Location: S 025
   * Textbook: <u>Data Structures and Program Design Using Java: A Self-Teaching Introduction</u> by Dheeraj Malhotra, Neha Malhotra. ISBN: 9781683924647. Free with student membership in ACM via Skill Soft Library
   * Additional resources: (All free with ACM student membership from Skill Soft)
      * <u>Handbook of Data Structures and Applications, Second Edition</u>
      * <u>Data Structures and the Java Collections Framework, Third Edition</u>
      * Courses starting with "Data Structures & Algorithms in Java"
      * Courses starting with "Advanced Data Structures & Algorithms in Java"
   * Additional Resources from O'Reilly (also free with ACM Student membership)
      * <u>Beginning Java Data Structures and Algorithms</u>
      * Video: From 0 to 1: Data Structures & Algorithms in Java
   * Foundational work in Data Structures: (from O'Reilly)
      * <u>Art of Computer Programming, The: Volume 1: Fundamental Algorithms</u>
      * <u>Art of Computer Programming, Volume 2: Seminumerical Algorithms, 3rd Edition</u>
      * <u>Art of Computer Programming, The: Volume 3: Sorting and Searching</u>
      * <u>Art of Computer Programming, Volume 4A, The: Combinatorial Algorithms, Part 1</u>
---++ Course Content
---+++ Policies
   * [[AcceptableWork][Integrity]]
   * [[LatePolicy ]]
   * [[SoftwareStandards ]]
   * [[SoftwareDevelopmentReport ]]: A sample software development report: [[https://twiki.betheluniversity.edu/pub/CenterForComputing/CSC122SylF2021/SDRDemo1.pdf][A sample Software Development Report]]

---+++ Assignments
   * [[CSC122F2021Lab1][Reviewing programming and Java]]
   * [[CSC122F2021Lab2][Turing Machine]]
   * [[CSC122F2021Lab3][Hard drive simulator]]
   * [[CSC122F2021Lab4][Lab 7: Word Count]]
   * [[CSC122F2021Lab5][Search and sort analysis]]
---+++Homework
   * [[CSC122F2021HomeSort][Homework for Sorting/Searching]]

---+++ Grades
   * Homework, etc. is worth 10% of the final grade
   * Programs are worth 40% of the final grade
   * Exams are worth 50% of the final grade with the cumulative final being worth twice a normal exam
   * Grade scale
      * 93% &lt;= average &lt;= 100% -&gt; A
      * 90% &lt;= average &lt; 93% -&gt; A-
      * 87% &lt;= average &lt; 90% -&gt; B+
      * 83% &lt;= average &lt; 87% -&gt; B
      * 80% &lt;= average &lt; 83% -&gt; B-
      * 77% &lt;= average &lt; 80% -&gt; C+
      * 73% &lt;= average &lt; 77% -&gt; C
      * 70% &lt;= average &lt; 73% -&gt; C-
      * 67% &lt;= average &lt; 70% -&gt; D+
      * 63% &lt;= average &lt; 67% -&gt; D
      * 60% &lt;= average &lt; 63% -&gt; D-
      * 0% &lt;= average &lt; 60% -&gt; F

---+++ Tentative Schedule
| *Monday*  | *Wednesday*  | *Wed. Lab*  | *Friday: Review and Lab*  |
| 8/16:  | 8/18:  | | 8/20: Lab 1<br> [[CSC122F2021Lab1][Review of Java Code]] |
| 8 23: Chapter 1<br>Syllabus & Intro to Data Structures  | 8/25: Chapters 1 & 4<br>Intro to Data Structures & Java | | 8/27: Lab 2 <br> [[CSC122F2021Lab2][Turing Machine]] Design |
| 8/30: Chapters 2 & 3<br>Arrays & Linked Lists  | 9/1: Chapter 5<br>Queues  | | 9/3: Lab 3<br> [[CSC122F2021Lab2][Turing Machine]] Code |
| 9/6: Labor Day  | 9/8: Chapters 5 & 7<br>Queues and Stacks  | | 9/10: Lab 4<br> [[CSC122F2021Lab3][Hard drive simulator]]: Stack and Queue Design |
| 9/13: Chapter 7<br>Stacks  | 9/15: Chapter 8<br>Trees  | Design help.  | 9/17: Exam Review<br>Lab 5<br> [[CSC122F2021Lab3][Hard drive simulator]]: Stack and Queue Code |
| 9/20: Exam 1  | 9/22: Chapter 8<br>Trees  | Debugging help  | 9/24: Lab 6 <br>[[CSC122F2021Lab4][Tree Design]] |
| 9/27: Chapters 8 & 9<br>Trees  | 9/29: Chapter 9<br>Search Trees  | Design fix  | 10/1: CCSC:MW |
| 10/4: Searches/Sorting (Chap. 6)  | 10/6: Searching/Sorting (Chap 6.)  | testing discussion  | 10/8: Fall Break |
| 10/11: Sorts/Review | 10/13: Tree Exam | code start  | 10/15: [[CSC122F2021Lab4][Lab 7: Tree Code]] |
| 10/18: Chapter 11<br>Files  | 10/20: Adv Sorts and Searches  | design start  | 10/22: [[CSC122F2021Lab5][Lab 8: Sort/Search Design]] |
| 10/25: Interfaces  | 10/27: Hashing (Chap 10)  | code start  | 10/29: Lab 9: Sort/Search Code |
| 11/1: Secure programming  | 11/3: Chapter 12<br>Graphs  | design and code  | 11/5: Lab 10: Sort/Search Code |
| 11/8: Chapter 12<br>Graphs<br>Sort Code due (midnight)  | 11/10: Exam (Sorting/Search/Interfaces/Inheritance/Files/Secure programming)  | Hash code start  | 11/12: Lab 11: Hash Code |
| 11/15: Graphs  | 11/17: Graphs<br>(Hash code due midnight)  | design start  | 11/19: Lab 12: Graph Design |
| 11/22: Ethical programming | 11/24: Thanksgiving Break  | Thanksgiving break  | 11/26: Thanksgiving Break |
| 11/29: Graph design due (8:00am)<br>Exam 4 (hashing, graphs, ethical programming)  | 12/1: Review  | coding started  | 12/3: Lab 13: Graph Code |
| 12/6: Final Exam week<br>Graph code due at midnight  | 12/8: Final Exam:<br /> 1:00-2:50  | | 12/10: |
%INCLUDE{CampusPolicies2021}%
   * [[%ATTACHURLPATH%/SDRDemo1.pdf][SDRDemo1.pdf]]: Sample SDR report
Attachments
Topic attachments
I	Attachment	History	Action	Size	Date	Who	Comment
pdf	SDRDemo1.pdf	r1	manage	44.2 K	2021-08-05 - 12:43	UnknownUser	Sample SDR report
This topic: CenterForComputing > WebHome > SyllabiFall2021 > CSC122SylF2021
Topic revision: r19 - 2021-11-02 - cathybareiss