| Term/Year |
Class Number |
Section |
Act |
Days |
Time |
Room |
| Fa 2009 | 3338 | CSCI 693-01 | DIS | R | 530-820 | OCNL 121 |
| Fa 2008 | 6650 | CSCI 693-01 | DIS | R | 530-820 | OCNL 254 |
Catalog description: This course interweaves three distinct themes (investigation, experimentation, and technical writing), that culminate in a comprehensive research project, presentation, and oral defense. First, the students will be immersed into the research process within Computer Science. This includes an understanding of the role, ethics, and responsibility of researchers in Computer Science. The second focus is on rigorous design of experiments for the purpose of testing research hypothesis, simulations, and models, and interpreting the results of those experiments. Finally, proficiency in communication of scientific ideas and findings will be addressed, from intensive reading, critiques, technical writing and oral presentations.
Recommended
Reference(s)
|
Writing
for Computer Science, 2/e Justin Zobel, 2004. Springer, New York, NY. ISBN 978-1-85233-802-2
List of checklists ... |
| 55% | Written reports/projects,
which include at least the following deliverables:
|
|||
| 35% | Oral presentations | |||
| 10% | Class participation | |||
Note:
Deliverables and requirements will be graded based
on the following set of rubrics:
Students are responsible for acquiring their own, personal copy of the required textbook. The textbook provides good guidance for scientific writing and formal presentations.
The
following areas/fields of computer sciences will determine
research paper topics for approval by the instructor (this list is
based on information gathered by ACM, AIS, CSAB, and IEEE, and is also available from Wikipedia):
| Research Area | Sub Areas (in alphabetical order) |
| A: Algorithms and Data Structures | Algorithms Analysis of algorithms Data structures Parallel and distributed algorithms |
| B: Programming Methodology and Languages | Compilers Programming languages Software engineering |
| C: Numerical and Symbolic Computation | Artificial intelligence Bioinformatics Cognitive science Computational chemistry Computational neuroscience Computational physics Data mining Intelligent systems and robotics Numerical algorithms Symbolic mathematics |
| D: Computer Elements and Architecture | Digital logic Hardware developments and improvements Microarchitecture Multiprocessing |
| E: Systems and Networks | Computer networking and communication Computer security Cryptography Databases Distributed computation Operating systems |
| F: Graphics and Visualization | Computer graphics Computer-human interaction Scientific visualization Virtual reality |
| G: Mathematical Foundations | Category theory Computational geometry Graph theory Mathematical logic Number theory Type theory |
| H: Theory of Computing | Automata theory Computability theory Computational complexity theory Quantum computing theory |
Note: A cap will be placed on the number of students that can conduct research in a particular area.
Real Interval |
Letter Grade |
University Definition |
| [96.25,100.00] | A | Superior Work |
| [92.50, 96.25) | A- | |
| [88.75, 92.50) | B+ | Very Good Work |
| [85.00, 88.75) | B | |
| [81.25, 85.00) | B- | |
| [77.50, 81.25) | C+ | Adequate Work |
| [73.75, 77.50) | C | |
| [70.00, 73.75) | C- | |
| [0, 70) | F | Unacceptable Work |
Note: The University does not
recognize final grades of D or D+ to graduate students. Hence,
graduate students with a class standing less than C- (70%) earn a final
grade of F.
Topics (subject to change without notice):