Creative Informatics

2005

Main Problems

1. Edit Distance
2. CPU cache
3. 3D Projection

Definition Problems

1. “Join. (Explain with an example)
2. The difference between “process” and “thread” in operating systems or programs.
3. Context-free grammar. (Explain with an example)
4. “Gouraud shading” and “Phong shading” in computer graphics
5. Image coding schemes “GIF” and “JPEG” universally used in the WWW.
6. Digital Signature method using the public-key encryption.
7. Knowledge representation using the “Semantic Network”, and its feature. (Explain with an example)
8. “PID control”, and the roles of its components: “P”, “I” and “D”.

2006

Main Problems

1. Sorting network
2. Circuit blocks
   • Analog multiplexer
   • Sample-and-hold
   • A/D converter
3. Robot control
   • Forward kinematics
   • Inverse kinematics

Definition Problems

1. Sampling theorem
2. RISC and CISC processors
3. TCP and UDP as transport-layer protocols in the Internet
4. The data structure used for heap sort (Explain with an illustrative example)
5. Features of functional programming languages
6. Branch-and-bound algorithm (Explain with an example)
7. Morpheme in natural languages (Explain with examples)
8. Homogeneous coordinate system

2007

Main Problems

1. Number Theory — Divisor Function
2. Concurrency control
3. Geometry
   • Translation
   • Rotation
   • Linear equations

Definition Problems

1. Divide and conquer algorithm
2. B-tree
3. Nyquist frequency
4. Impulse response, step response, and their relation
5. Vector quantization
6. Out-of-order execution
7. Regular grammar and regular language (Examples are mandatory)
8. CGI (Common Gateway Interface)

2008

Main Problems

1. Sort and search algorithms
   • Big O notation
   • Sequential search
   • Binary search
   • Hash tables
2. Counter
   • State transition diagram
   • Logic circuits
   • Big O notation
3. Semantic networks

Definition Problems

1. Position feedback and torque feedback in a servo system
2. Principle of proximity sensing (a particular type)
3. Uncertainty in measurement
4. Hidden Markov models
5. Grid computing
6. Phishing
7. Reflection in programming
8. Referential transparency

2009

Main Problems

1. Graph Theory
2. 3D Projection
3. ALU
   • Logic gates
   • Multiplier
   • Adder

Definition Problems

1. Bayes’ theorem
2. Decision tree learning method
3. Spread-spectrum telecommunications and its applications
4. Normalization in relational database
5. Turing machine
6. Snoop cache
7. Unicode
8. Three user authentication or personal identification techniques and a comparative analysis