At the end of this course, the students; 1) Learn to use pointers to implement C programs with it. 2) Learn to use strings and structures in C language. 3) Learn process sequential and random access files in C language. 4) Learn how to create and use dynamic data structures in C language. 5) Learn to use bitwise operations and preprocessor directives in C programs.
MODE OF DELIVERY
Face to face
PRE-REQUISITES OF THE COURSE
Yes(BİL101)
RECOMMENDED OPTIONAL PROGRAMME COMPONENT
None
COURSE DEFINITION
Pointers, Pointer Applications, Characters and Strings, Character and String Functions, Structures and Unions, File Structures and Applications, Processing Sequential (Text) Files, Processing Random-Access (Binary) Files, Dynamic Memory Allocation, Linked Lists, Stacks and Queues, Bitwise Operations, Preprocessor Directives
COURSE CONTENTS
WEEK
TOPICS
1st Week
Pointers
2nd Week
Pointer Applications
3rd Week
Characters and Strings
4th Week
Character and String Functions
5th Week
Structures and Unions
6th Week
File Structures and Applications
7th Week
Processing Sequential (Text) Files
8th Week
Mid-term
9th Week
Processing Random-Access (Binary) Files
10th Week
Dynamic Memory Allocation
11th Week
Linked Lists
12th Week
Stacks and Queues
13th Week
Bitwise Operations
14th Week
Preprocessor Directives
RECOMENDED OR REQUIRED READING
C How to Program, H.M.Deitel and P.J.Deitel, Prentice Hall, (2010-2015). Problem Solving and Program Design in C (7th Edition), Pearson (2012). Problem Solving and Programming Concept, M. Sprankle, Pearson Education (2003).