Programming and Data Structures
CS 2250, Spring 2008, E01, TR 5:30pm-6:45pm, 134 Social Science Business

Instructor:
Martin Pelikan
E-mail: pelikan@cs.umsl.edu
WWW: http://www.cs.umsl.edu/~pelikan/
Note: Do not call me, I don't respond to phone messages.

Office hours
TBA, 320 CCB
or by appointment (send email to arrange)

Prerequisites
CS 1250

Textbooks

• K.N. King. C Programming: A Modern Approach. W.W. Norton & Company, New York, NY. 1996.
• Thomas A. Standish. Data Structures, Algorithms and Software Principles in C. Addison Wesley, Reading, MA. 1995.
• (optional) A. Robbins. Unix in a Nutshell. O'Reilly, Sebastopol, CA. 2005.

Grading Policy

• Homeworks and programming projects.....50%
• Three tests (in class), no final
  • Test 1.....15%
  • Test 2.....15%
  • Test 3.....20%

Covered topics

• Compound data structures
  • Characters and strings
  • Structures, unions, bit manipulations, and enumerations
• File processing
• C preprocessor
• Dynamic memory allocation
• Self-referential structures
• Linked lists, Stacks, Queues, Trees
• Introduction to sorting, searching, and graphs

Additional info

• If you don't have all the prerequisities, you MUST contact me ASAP.
• Covered topics might evolve over the course of the semester based on progress and interest.
• Visit the course's web page on mygateway regularly.
• Extensions for homeworks only with prior consent of the instructor and only under extraordinary circumstances (at instructor's discretion).
• Grades will be curved at the discretion of the instructor.
• If you need special arrangements for exams due to a disability, you are responsible for making arrangements with the testing center at least 2 weeks before the exam.
• No delayed grade will be given unless really special circumstances are proven.
• Maintaining confidentiality of student grades: Click here.
• Student conduct code including the campus policy on academic dishonesty: Click here.
• Cancellation of student registration: Click here.
• Wait list: Click here.

Short bio of the instructor:
Martin Pelikan received Ph.D. from the Dept. of Computer Science at the University of Illinois at Urbana-Champaign in 2002. He joined the Dept. of Math and Computer Science at the University of Missouri at St. Louis in August, 2003. Currently, he is an assistant professor of computer science. Pelikan's research focuses on genetic and evolutionary computation. He worked at the Slovak University of Technology at Bratislava, the German National Center for Information Technology at Sankt Augustin, the Illinois Genetic Algorithms Laboratory (IlliGAL) at the University of Illinois at Urbana-Champaign, and the Swiss Federal Institute of Technology (ETH) at Zurich. Pelikan's most important contributions to genetic and evolutionary computation are the Bayesian optimization algorithm (BOA), the hierarchical BOA (hBOA), and the scalability theory for BOA and hBOA. BOA and hBOA combine machine learning with genetic and evolutionary algorithms to create optimizers that can solve broad classes of optimization problems in a robust and scalable manner with few or no parameters. BOA and hBOA are among the most advanced and powerful genetic and evolutionary algorithms.