BIT 142 Programming Data Structures in C Today

BIT 142: Programming & Data Structures in C#

Today • File I/O – Lesson has been used only a couple of times – If something is confusing then please ask questions on the Canvas Discussion Forum ASAP!! – Give yourself extra time in case something is confusing / missing / accidentally way too difficult • Also – watch out next lesson for obsolete references to Nunit (or "Auto-grading") – Tell me about them, – Then Ignore them BIT 142: Intermediate Programming 2

Next Lecture • Searching, Sorting Algorithms • Algorithmic analysis: Big ‘Oh’ notation BIT 142: Intermediate Programming 3

Next next lecture • Final exam – Make sure that you can make it! – (Or talk to me ASAP) • Bring photo ID BIT 142: Intermediate Programming 4

Final exam (2 lectures from now) • Starts at 11 am • Ends at 1: 15 pm • Leave once you’re finished • Feel free to bring snacks – Remember: you spill it on a computer, you buy a replacement BIT 142: Intermediate Programming 5

BIT 143 • Continues where this leaves off – A couple of weeks to review OOP, object composition, Big “Oh” notation, etc • Then moves on to basic data structures – Stacks, Queues, Linked Lists – Recursion – Binary Search Trees – Quick. Sort BIT 142: Intermediate Programming 6

BIT 143 • Similar/same format – homework assignments – Weekly PCEs • Enrollment is open – sign up while there’s still space!! BIT 142: Intermediate Programming 7