CS2301 Systems Programming for Non-Majors D'10

Prof. Craig Wills

Introductory Course Materials

• Course Syllabus.
• Program Style.

Assignments

• Project 1.
• Project 2.
• Project 3.
• Project 4.
• Project 5.
• Project 5 code outline.
• Project 5 simple map.
• Project 5 complex map.
• Project 6.
• Project 6 code outline.

Labs

• Lab 1.
• Lab 2.
• Lab 3.
• Lab 4.
• Lab 5.
• Lab 6.
• Lab6Files.zip.

Course Assistance/Office Hours

• CS2301-staff mailing list to Professor and Assistants
• Prof. Wills: FL-236, Mon 9:00-10:00am, Tue 1:00-2:00pm, Thu 9:00-10:00am, Fri 10:00-11:00am.
• Christopher Lieb: FL-A22, Mon 3:00-4:00pm, Tue 1:00-3:00pm, Wed 11:00am-12:00pm.
• Fei Song: FL-A22, Tue 9:00-10:00am, Wed 6:00-7:00pm, Thu 1:00-3:00pm.
• Isaac Edwards: FL-A22, Wed 12:00-2:00pm, Fri 12:00-2:00pm.

Code Examples

• basic.c. Basic C program structure.
• helloworld.c. First program.
• convert.c. Simple I/O.
• salary.c. Conditional statement.
• branch.c. More conditional statements.
• evenodd.c. Loop with sentinel value.
• sumwhile.c. Count-controlled loop.
• sumfor.c. Same with a for statement.
• mypow.c. Function definiton and use.
• bowling.c. Single-dimension array.
• swap.c. Passing pointers to functions.
• poly.c. Passing arrays to functions.
• string.c. String examples.
• structexample.c. Struct example.
• polystruct.c. Polynomial Struct example.
• stack.h. Stack header file.
• stack.c. Stack routines.
• reverseread.c. Use of Stack routines.
• queue.h. Queue header file.
• queue.c. Queue routines.
• reread.c. Use of Queue routines.
• stackll.h. Stack linked list header file.
• stackll.c. Stack linked list routines.
• reversereadll.c. Use of stack routines.
• queuell.h. Queue linked list header file.
• queuell.c. Queue linked list routines.
• rereadll.c. Use of Queue routines.
• morell.c. More linked list code.
• tree.c. Binary tree code.
• set.c. Set code.

Course Notes

• Introduction. Figures.
• Flow Control. Figures.
• Functions. Figures.
• Arrays and Pointers. Figures.
• Structures. Figures.
• Stacks. Figures.
• Queues. Figures.
• Dynamic Memory Allocation.
• Linked Lists. Figures.
• More Linked Lists. Figures.
• Searching.
• Recursion.
• Trees. Figures.
• Hashing. Figures.
• Sets and Graphs. Figures.

Exams

Expectations for Exam 3.

Sample Exam 3 (Question 8b would not be asked on your exam).

Expectations for Exam 2.

Sample Exam 2 (This exam does not include stacks/queues while your exam will do so as described in expectations list).

Expectations for Exam 1.

Sample Exam 1 (Questions 2 and 3 would not be asked for your exam).