CSC122SylF2021 < CenterForComputing

%INCLUDE{CSC122ForSyllabus}%

---++Details
   * Professor:  Dr. Cathy Bareiss
   * Office SB 027
   * 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 ][Late work ]]
   * [[SoftwareStandards ][Software Standards]]
   * [[SoftwareDevelopmentReport ][Software Development Report]]:  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]]

---+++Grades

   * Grade scale
      * 93% <= average <= 100% ->	A
      * 90% <= average < 93% ->	A-
      * 87% <= average < 90% ->	B+
      * 83% <= average < 87% ->	B
      * 80% <= average < 83% ->	B-
      * 77% <= average < 80% ->	C+
      * 73% <= average < 77% ->	C
      * 70% <= average < 73% ->	C-
      * 67% <= average < 70% ->	D+
      * 63% <= average < 67% ->	D
      * 60% <= average < 63% ->	D-
      * 0% <= average < 60% ->	F

---+++Tentative Schedule
| *Monday*                                                      | *Wednesday*                                                   | *Friday: 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: Chapter 5<br>Queues                                      | 9/8: Chapter 7<br>Stacks                                      | 9/10: Lab 4<br>Stack and Queue Design |
| 9/13: Chapter 7<br>Stacks                                     | 9/15: Exam 1                                                  | 9/17: Lab 5<br>Stack and Queue Code |
| 9/20: Chapter 8<br>Trees                                      | 9/22: Chapter 8<br>Trees                                      | 9/24: Lab 6 <br>Tree Design |
| 9/27: Chapters 8 & 9<br>Trees                                 | 9/29: Chapter 9<br>Search Trees                               | 10/1: CCSC:MW |
| 10/4: Review                                                  | 10/6: Exam 2                                                  | 10/8:  Fall Break |
| 10/11: Chapter 6:<br>Searching & Sorting                      | 10/13: Chapter 6<br>Searching & Sorting                       | 10/15: Lab 7: Tree Code |
| 10/18: Chapter 11<br>Files                                    | 10/20: Adv Sorts and Searches                                 | 10/22: Lab 8: Sort/Search Design |
| 10/25: Adv Sorts & Searches                                   | 10/27: Secure Programming                                     | 10/29: Lab 9: Sort/Search Code |
| 11/1: Exam 3                                                  | 11/3: Chapter 12<br>Graphs                                    | 11/5: Lab 10: Graph Design |
| 11/8: Chapter 12<br>Graphs                                    | 11/10: Chapter 10<br>Hashing                                  | 11/12: Lab 11: Graph Code |
| 11/15: Chapter 10<br>Hashing                                  | 11/17: Exam 4                                                 | 11/19: Lab 12: Hash, etc. Design |
| 11/22: Advanced Data Structures                               | 11/24: Thanksgiving Break                                     | 11/26: Thanksgiving Break |
| 11/29: Current Topic                                          | 12/1: Review                                                  | 12/3: Lab 13: Hash, etc. Code |
| 12/6: Final Exam week                                         | 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: r6 - 2021-08-05 - cathybareiss