| 1.
|
Write a program in which sorting and searching algorithms are used.
(I)
|
| 2.
|
Utilize advanced data mangement techniques such as queues, stacks,
linked lists and/or binary trees. (II)
|
| 3.
|
Use the C language dynamic allocation capabilities in a program. (III)
|
| 4.
|
Compare and contrast the various C memory models. (IV)
|
| 5.
|
Develop a C program which utilizes direct interface with the operating
system. (V)
|
| 6.
|
Optimize C programs for speed and resource usage. (VI)
|
| 7.
|
Utilize modern debuggers to analyze and debug C programs. (VII)
|
|