.. include:: ../shared/organizationHeader.rst

.. include:: ../shared/courseOutline.rst

.. include:: ../shared/william_leo.rst



In this course, we'll look at the foundations of research in computing, the motivations, the style, and the results. Doing so will allow us (and we mean it, us) to understand better and deeper what drives innovation in the discipline. How to tell a truly emerging trend from a passing infatuation. How to communicate an idea or an opinion about one. 

If you are taking this course to pursue a specific research topic or idea, please talk with your instructor sooner than later. Depending on your interests they may (or may not) be able to accommodate your plans. 

The course requires you to do a fair amount of reading and writing.  

#. Introductions. Foundations by Bush and von Neumann. A quick approach to critical reading of papers. Assignment: critical summaries of papers (200 words/paper/max) for non-technical audience, due in class. Require some formatting, maybe Google Docs.

#. In-class peer review of last week's critical summaries. Discussion about writing style, comment and review style. Assignment. Cryptography: read the DH paper.

#. DH review. Introduction to paper taxonomies, repositories, library searches. Assignment: a non-technical review of cryptography applications since DH. What is the most foundation paper cited by DH?

#. In-class peer review of last week's paper. Writing tools and styles. Bibliographies and literature searches. Assignment. read Codd's original paper.

#. In-class discussion of Codd: can you draw parallels to OOP? What/which? What was the transformational concept? The foundation? Assignment: Peter Chen's ERD paper and NAS' report on Database industry

#. In-class review of ERD concepts and the emergence of UML.  Assignment: commonalities of seminal papers: write a 200w critical review of any commonalities you see across DH and Codd.

#. The Dijkstra archive at the U of Texas. Why are these papers important. A review of his work. Assignment: tbd critical summary one of Dijkstra's papers.

#In-class peer review of last week's summary. Assignment: Cerf/Khan, and a non-technical summary of packet switching and best-effort protocols.

# .In-class peer review of last week's summary. Assignments: Metropolis and a 200w review

#. In-class peer review of last week's summary. Numerical computations: Monte Carlo, simulations, data science.

.. include:: ../shared/groundRules.rst



Textbook
++++++++

None

Grading scheme
++++++++++++++

There are two possible grade outcomes: an A for those who attend class, come prepared, participate in the discussions, and contribute with their writing; and a D for those who don't. 

.. .. include:: ../shared/deadlines.rst

Deadlines
+++++++++

No late homework will be accepted. If you anticipate an issue with late submission, it is your responsibility to contact the instructor as soon as possible. *Bona fide* emergencies will be handled on a case-by-case basis.

.. include:: ../shared/inClassAssignments.rst


Exam dates
++++++++++
The final and midterm exams will be a take-home assignments. Exact dates will be posted on Sakai.


.. include:: ../shared/studentHours.rst
.. include:: ../shared/academicIntegrity.rst
.. include:: ../shared/professionalism.rst
.. include:: ../shared/zoom.rst
.. include:: ../shared/formalStuff.rst