https://cs.indstate.edu/web/index.php?action=history&feed=atom&title=CS_202_Computer_Science_II 2026-04-14T21:56:23Z Revision history for this page on the wiki MediaWiki 1.44.0 https://cs.indstate.edu/web/index.php?title=CS_202_Computer_Science_II&diff=47&oldid=prev 2025-08-17T13:22:11Z

<p>1 revision imported</p> <table style="background-color: #fff; color: #202122;" data-mw="interface"> <col class="diff-marker" /> <col class="diff-content" /> <col class="diff-marker" /> <col class="diff-content" /> <tr class="diff-title" lang="en"> <td colspan="2" style="background-color: #fff; color: #202122; text-align: center;">← Older revision</td> <td colspan="2" style="background-color: #fff; color: #202122; text-align: center;">Revision as of 13:22, 17 August 2025</td> </tr><tr><td colspan="4" class="diff-notice" lang="en"><div class="mw-diff-empty">(No difference)</div> </td></tr> <!-- diff cache key wiki2:diff:1.41:old-46:rev-47 --> </table>

Jkinne https://cs.indstate.edu/web/index.php?title=CS_202_Computer_Science_II&diff=46&oldid=prev 2021-05-17T19:47:32Z

<p><span class="autocomment">CS 202 Computer Science II</span></p> <p><b>New page</b></p><div>== Catalog Description ==<br /> <br /> This course is a continuation of CS 201. It involves a deeper study of programming languages, but emphasizes programming in a particular language. Topics include algorithm design and analysis, data structures, recursion, threads, network programming, graphics, security, and ethics. Prerequisites - C or better in CS 201.<br /> <br /> == Prerequisites ==<br /> * basic programming concepts <br /> * ability to use unix<br /> <br /> == Standard Content ==<br /> ===Course Outline ===<br /> * Review (2 weeks)<br /> ** C Programming - all keywords and operations, libraries and header files<br /> ** Data formats and number systems (binary, decimal, octal, hex), signed/unsigned, two’s complement, floating point, long, int, short char, C strings<br /> ** I/O with different data formats and number systems<br /> ** Basic data structures - unsorted array, sorted array, linked list, heap, stack, queue - code for all in class and as assignments<br /> ** Search and sorting - linear and binary search, selection and insertion sort, mergesort, heapsort, quicksort - code for all in class and as assignments<br /> * Asymptotic analysis and running time (1 week) - big O/Omega/Theta, little o/omega, definitions, basic proofs, polynomials / exponentials / logarithms, recursion trees<br /> * Memory organization (1 week) - text, data, heap, stack, malloc, free, pointer arithmetic<br /> * Unix and debugging (1 week) - gdb, grep, sed, awk, find, compiler options, makefiles, unix regular expressions, reading manual and manual organization, pipes, I/O redirection<br /> * Disk organization (1 week) - inodes, superblocks, etc.<br /> * New data structures (4 weeks) - binary search tree (including balanced), hash table, skip list, trie, B tree - code for some in class and as assignments<br /> * Graphs (1 week) - terminology, adjacency matrix, adjacency list, basic algorithms (BFS, DFS, shortest path, minimum spanning tree) - do all algorithms on the board, code for some in class, running time for all<br /> * Classes and objects in C++ (2 weeks) - data abstraction and encapsulation, defining classes, creating objects, inheritance, protection, virtual functions and polymorphism<br /> * The Standard Template Library (1 week)<br /> * Comparison of C++ and other OO Languages (Java, Python, etc.) (1 week)<br /> <br /> ===Learning Outcomes===<br /> * C programming and debugging, <br /> * data structures understanding (can explain lookup/insert/delete for each DS, work small examples on paper, know running times) and <br /> * coding (can finish partially complete DS code, write new functions to traverse DS)<br /> <br /> <br /> ===Important Assignments and/or Exam Questions===<br /> * Programming assessment - must pass with 3 and 2 halves to get a C or better<br /> * Data structures programming, exam/homework question - given prototype for insert/lookup/delete, can give correct code<br /> * Data structures programming, exam/homework question - given prototype for function that should use data structure functions, can give correct code<br /> * C programming play computer, exam question - given any short C program (a few dozen lines, say) and sample input, can trace execution and final output<br /> * Some large project that is interesting - game, etc.<br /> <br /> === Standard resources ===<br /> * Introduction to Algorithms by Cormen, Leiserson, Rivest, and Stein<br /> * The C Programming Language by Kernighan and Ritchie<br /> * Online courses/tutorials - MIT course - Practical Programming in C , How to Think Like a Computer Scientist, C++ Version - an online textbook, CS 50: Intro to CS I at Harvard - has videos, lecture notes, Reference on C and C++, The C Programming Language, C Programming Tutorial, Fresh2fresh C Tutorial</div>

wiki_previous>Znoble1