|General Information||Resources||Weekly Schedule||Credits||Lecture Notes||Example Code||Read-Only Board|
I. General Information
Dr. Yoonsuck Choe
Introduce entering students to the broad field of computing; presentations from industry and academia about how computer science concepts are used in research and end products; includes a major writing component.
Time: Tuesday and/or Thursday, 2:20pm to 3:35pm
Room: HRBB 124
The class will meet about 15 times, most likely once per week but some weeks can have no meeting while some others can have two. Specific schedule can change so please closely monitor the announcements on the course web page. It is your responsibility to keep track of the schedule.
Lectures will be given either by the instructor or a guest lecturer from CSE or from external organizations.
The goals of this course are:
- to introduce entering students to the broad field of computing.
- to help students develop technical writing skills.
The expected accomplishments of the students are as follows:
- Become familiar with a broad range of topics in computer science.
- Become skilled in forming independent thoughts about research topics in computer science.
- Become skilled in organizing thoughts in a coherent manner and expressing them in written form.
The students who take this course should be able to demonstrate the following upon the completion of this course.
- Knowledge of contemporary issues in computer science.
- Knowledge of how computer science can impact society.
- Ability to form independent, constructive criticism.
- Ability to argue in a coherent manner.
- Ability to write in an organized manner.
We will be using the following textbook (required):
Recommended texts include:
- Writing for Computer Science, 2nd Edition, by Justin Zobel, Springer, 2004.
- Great Ideas in Computer Science, Alan W. Bierman, MIT Press, 1990. Not so new but still has good general material.
- Computer Science, An Overview, J. Glenn Brookshear, Addison Wesley, multiple editions.
- An Invitation to Computer Science, G. Michael Schneider and Judith L. Gersting, Brooks/Cole, multiple editions.
- A Balanced Introduction to Computer Science, David Reed, Prentice Hall, multiple editions.
The topics to be covered in lecture periods are as follows (tentative: some topics may not be covered due to the time constraint and availability of guest lecturers):
- computer systems: computer architecture, networking, distributed computing, parallel computing, computer security
- theoretical foundations: algorithms, theory of computation, randomized algorithms
- software: programming languages, compilers
- intelligent systems: artificial intelligence, machine learning, pattern recognition, robotics, information retrieval
- multidisciplinary topics: computational biology, computational neuroscience, complex systems
- human-centered computing: human-computer interaction, sketch recognition, computer graphics
See the Weekly Schedule section for more details.
Grading will be based on the following:
You must pass all components of this course in order to earn a passing grade.
- Attendance: Attendance is required for all scheduled lectures. More than two unexcusable absences will result in an automatic 'fail'.
- Class participation:
- Sleeping, reading news paper, doing other work, using laptop/cell phone during the class, eating, and other disruptive behavior will result in one penalty point per offense. Accumulating three penalty points will lead to an automatic 'fail'.
- Students are required to ask at least three meaningful questions during the guest lectures (or research presentations) during the semester. Students may either raise their hands and ask the question (state your name clearly to get credit) or submit a short written note with their question(s) (sentence or two) during the presetation to fulfill this requirement. Several questions submitted during one lecture will only count as one. Obvious questions will not count toward this requirement (e.g., "So, you did this and that?", "What was that again?", etc.).
- Students are required to read chapters from the textbook (see the weekly schedule for chapter assignment). Students are expected to read the chapters before coming to class on the day indicated in the weekly schedule. Three very short quizzes will be given (one question per chapter). Students are expected to pass at least two quizzes to successfully complete this requirement.
- Short reports: six short reports. A one-page report from select lectures will be required. Students need to score 7 or higher (out of 10) on all six reports to pass.
- Term paper: one final report. A major write up, 5 to 6 pages in length, will be assigned. This will be a survey paper on a topic of your choice, and you need to score 70 or above (out of 100) to pass.
AGGIE HONOR CODE: An Aggie does not lie, cheat, or steal or tolerate those who do.
Upon accepting admission to Texas A&M University, a student immediately assumes a commitment to uphold the Honor Code, to accept responsibility for learning, and to follow the philosophy and rules of the Honor System. Students will be required to state their commitment on examinations, research papers, and other academic work. Ignorance of the rules does not exclude any member of the TAMU community from the requirements or the processes of the Honor System.
For additional information please visit: http://www.tamu.edu/aggiehonor/
For this class, certain aspects of the honor code need to be clarified.
Failure to do so will result in an automatic 'F'.
- All writing should be in your own words.
- Properly cite when you take ideas or verbatim quotes from other sources.
- Late Assignments: Late submissions will not be accepted, unless there is a legitimate reason (health, etc.).
- Communication: A class web page (listed at the top of this syllabus) will be maintained throughout the semester. Students are responsible for checking both the web page and email regularly for class updates.
The Americans with Disabilities Act (ADA) is a federal anti-discrimination statute that provides comprehensive civil rights protection for persons with disabilities. Among other things, this legislation requires that all students with disabilities be guaranteed a learning environment that provides for reasonable accommodation of their disabilities. If you believe you have a disability requiring an accommodation, please contact the Department of Student Life, Services for Students with Disabilities, in Cain Hall or call 845-1637.
III. Weekly Schedule and Class Notes
|1||1/17 Tue||Introduction (Choe)||Zobel chapters 1 (introduction) and 13 (ethics): read it this week||slide01.pdf
|1||1/19 Thu||---||"---" means no lecture|
|2||1/24 Tue||Technical writing (Choe)||Zobel chapter 2 (good style): read before coming to class (same applies to the rest of the chapters)||slide02.pdf
|2||1/26 Thu||Guest lecture: Mike Abney, Technical Director, Improving http://improvingenterprises.com||Second lecture this week!|| slides [link]
|3||1/31 Tue||Research talk (Choe):Intelligent systems (Neuroevolution)||Zobel chapter 3 (style)||SR1||Short report #1 due Monday 1/30 11:59pm||slide03.pdf
|3||2/2 Thu||---||Quiz1||Quiz #1 deadline Thursday 2/2 11:59pm (Zobel 1, 2, 13)|
|4||2/9 Thu||Research talk (Dr. Evdokia Nikolova): Algorithmic game theory||Zobel chapter 4 (punctuation) Thursday Lecture!|| AGT-overview.pdf
|5||2/14 Tue||Finding and citing sources; Critical thinking; Creative Thinking (Choe)||SR2||Short report #2 (Abney/Choe/Nikolova) due Monday 2/13 11:59pm|| slides [link]
|6||2/21 Tue||Guest lecture: Brian Orrell, CTO, Pariveda Solutions http://parivedasolutions.com||Zobel chapter 8 (editing)|
|6||2/23 Thu||---||Quiz2||Quiz #2 deadline Thursday 2/23 11:59pm (Zobel 3, 4, 8)|
|7||2/28 Tue||Research talk (Dr. Dylan Shell): Flocks and robots||Zobel chapter 9 (writing up)||SR3||Short report #3 (Abney/Choe/Nikolova) due Monday
|| slides [link]
|8||3/6 Tue||Research talk (Manoj Prasad): Sketch recognition||Zobel chapter 10 (doing research)|
|9||3/13 Tue||Spring break|
|9||3/15 Thu||Spring break|
|10||3/20 Tue||History of computer science (Choe)||SR4||Short report #4 (Nikolova/Orrell/Shell/Prasad) due Monday 3/19 11:59pm||slide06.pdf
|11||3/27 Tue||Research talk (Dr. Steve Liu)||Security||Quiz3(last quiz)||Quiz #3 deadline 3/27 Tuesday 11:59pm (Zobel 9, 10)|
|12||4/3 Tue||Research talk (Dr. Jaakko Järvi)||software||SR5||Short report #5 (Orrell/Shell/Prasad, or Choe's computer history lecture) due Monday 4/2 11:59pm.|| slides [link]
|12||4/5 Thu||---||LR(topic)||Long report topic due Thursday 4/5 11:59pm.|
|13||4/10 Tue||Research talk (Dr. Jinxiang Chai)||Computer vision|| slides [link]
|13||4/12 Thu||Research talk (Jerry Snyder and Ben Ketcherside, Exxon Mobile)||Company Overview and a Technical Talk (3D Visualization of 300 Gigs) Thursday Lecture!||LR(abstract)||Long report abstract due Thursday 4/12 11:59pm.|
|14||4/19 Thu||Research talk (Dr. Bjarne Stroustrup)||programming languages. Thursday Lecture!|
|15||4/24 Tue||Research talk (Dr. E. J. Kim)||computer architecture|
|15||4/26 Thu||---||LR(draft) AND SR6||Long report draft AND Short report #6 (Chai(Computer Vision, presented by Choe)/Prasad/Liu/Järvi/ Snyder&Ketcherside/ Stroustrup/Kim) due 4/26 Thursday 11:59pm|
|16||5/1 Tue||No lecture||SR(extras), LR(final)||All extra Short Reports (Snyder&Ketcherside/Liu/Stroustrup/Kim) and Final Report due. 5/3 Thursday 11:59pm|
Course design adapted from Profs. Jinxiang Chai, John Keyser, Jennifer Welch, and Valerie Taylor.