3 Credits

Sem 1

Course code: BCA 102

Programming in C

Introduction to structured programming using C

Also in this semester:

Mathematics-I Professional Communication and Ethics Digital Logic Computer Fundamentals and Applications Hardware Workshop

Syllabus Notes

Course Syllabus

1 Doc

10 views6 Units48 Teaching Hrs

Course Information

Type: Both
Course Code: BCA 102
Credit Hours: 3
Full Marks: 100
Pass Marks: 40

Course Description

This course provides a comprehensive introduction to the C programming language, a foundational tool in computer science and software development. Emphasizing structured and procedural programming techniques, the course covers the core concepts of C including variables, data types, operators, control structures, arrays, functions, pointers, structures, unions, and file handling. Students will gain practical skills in writing efficient, modular, and error-free code, reinforced through hands-on lab sessions. The course is designed to develop algorithmic thinking, problem-solving ability, and a strong understanding of how memory and low-level operations work in modern computing environments. This course provides the essential groundwork for more advanced study in programming for software development, algorithms, and systems programming.

Objectives

The main objective of this course is to provide students both the theoretical foundation and practical knowledge of programming using C programming language. After the completion of the course, students will be able to:
Understand the basic structure and syntax of the C programming language, including data types, operators, and control statements
Develop algorithmic thinking and structured programming techniques to solve computational problems
Apply modular programming concepts using functions to enhance code reusability and clarity
Manipulate arrays, strings, and pointers effectively for data processing and memory management
Use structures and unions to model and organize complex data in C
Write, compile, debug, and test C programs using standard development tools and environments
Establish a strong foundation for learning advanced programming topics, such as data structures, operating systems, and embedded systems

Course Units

6 Units · 48 Hrs

1.1 Evolution of programming languages
1.2 History, characteristics and applications of C
1.3 Structure of a C program
1.4 Compilation and execution process of a C program
1.5 C tokens: keywords, identifiers, constants, string literals, operators
1.6 Variables: declaration, initialization, scope, and lifetime
1.7 Data types: basic data types (int, char, float, double, void), derived data types, user-defined data types
1.8 Type casting: implicit and explicit type conversion
1.9 Operators and expressions: arithmetic, relational, logical, bitwise, assignment, increment/decrement, conditional (ternary), special operators (sizeof, comma, address-of, dereference); operator precedence and associativity

2.1 Standard input and output functions
2.1.1 Formatted I/O: printf() and scanf()
2.1.2 Unformatted I/O functions: character I/O (getchar(), putchar(), getch(), getche(), putch())
2.2 Control structures
2.3 Decision making statements
2.3.1 if statement
2.3.2 if-else statement
2.3.3 Nested if-else statement
2.3.4 else-if ladder
2.3.5 switch statement
2.3.6 Conditional operator (?:)
2.4 Looping statements
2.4.1 while loop
2.4.2 do-while loop
2.4.3 for loop
2.4.4 Nested loops
2.5 Jump statements
2.5.1 break statement
2.5.2 continue statement
2.5.3 goto statement

3.1 Functions
3.1.1 Introduction to functions: advantages, function definition, function declaration/prototype
3.1.2 Function call
3.1.3 Types of functions: library functions vs. user-defined functions
3.1.4 Function arguments: call by value, call by reference
3.1.5 Recursion: concepts and examples
3.2 Arrays
3.2.1 Introduction to arrays: declaration, initialization, accessing elements
3.2.2 One-dimensional arrays: processing and examples
3.2.3 Two-dimensional arrays: declaration, initialization, accessing elements (matrix operations)
3.2.4 Multi-dimensional arrays
3.2.5 Arrays and functions
3.3 Strings
3.3.1 Introduction to strings: declaration, initialization
3.3.2 String input/output (gets, puts)
3.3.3 String handling functions (strlen, strrev, strcpy, strupr, strlwr, strcmp, strcat)
3.3.4 Array of strings

4.1 Structures and unions
Defining and declaring structures
Accessing members, including nested structures, arrays of structures
Passing structures to functions
Defining and declaring unions; comparison with structures
4.2 Enumerations (enums) and typedef implementation

5.1 Pointer declaration, initialization, and dereferencing
5.1.2 Pointer arithmetic
5.1.3 Pointers with arrays, string, function, structure
5.2 Dynamic memory allocation: malloc, calloc, realloc, free
5.3 DMA with structure
5.4 Dangling pointers and memory leaks

6.1 File handling
6.1.2 Concepts of files (text vs. binary) and file operations (opening, closing, reading, writing)
6.1.3 File modes and standard I/O functions (fgetc, fputc, fgets, fputs, fprintf, fscanf, fread, fwrite)
6.1.4 Random access (fseek, ftell, rewind) and error handling
6.2 Command-line arguments
6.2.1 Introduction to main() function parameters (argc, argv)
6.2.2 Passing and accessing arguments from the command line
6.3 Graphics in C
6.3.1 Introduction to graphics programming (basic concepts, graphics modes)
6.3.2 Drawing primitives: points, lines, and common geometric shapes (rectangles, circles, ellipses, arcs, polygons)
6.3.3 Managing colors and fill styles for graphical output
6.3.4 Displaying and formatting text in graphics mode
6.3.5 Fundamentals of simple animation (clearing the screen, redrawing elements, using delays)

Laboratory Works

Laboratory work [48 hrs]
The practical component will reinforce theoretical concepts through hands-on programming exercises. A minimum of 48 hours (3 hours/week for 16 weeks) will be dedicated to practical sessions. Students are expected to complete assignments on a weekly basis.
General instructions for practical sessions:
Familiarization with a C IDE (e.g., Code::Blocks, Visual Studio Code with GCC, Eclipse CDT, Dev-C++, Turbo C++)
Understanding the compilation and execution process
Debugging techniques
Emphasis on practical application for complex topics, especially Pointers and File Handling, to ensure thorough understanding
List of practical concepts to implement (with enhanced emphasis):
1. Fundamental Programming Constructs: implement programs demonstrating basic input/output, arithmetic operations, and data type conversions; apply various operators (arithmetic, relational, logical, bitwise, conditional) in expressions.
2. Control Flow Mechanisms (practical emphasis): conditional statements (if, if-else, switch); iterative solutions using while, do-while, and for loops; jump statements (break, continue, goto).
3. Functions and Modularity (practical emphasis): modular programs using user-defined functions, argument passing (call by value, call by reference) and return types; recursive problem-solving approaches.
4. Array and String Manipulation (practical emphasis): operations on one-dimensional, two-dimensional, and multi-dimensional arrays including searching, sorting, and matrix operations; string input/output and standard string handling functions; arrays of strings.
5. Pointers and Dynamic Memory (strong practical emphasis): declaration, initialization, and dereferencing; pointer arithmetic and the relationship between pointers and arrays/strings; dynamic memory management using malloc(), calloc(), realloc(), and free().
6. Structured Data Types: structures, nested structures, arrays of structures, and pointers to structures; unions and their memory implications; enumerated types.
7. File Operations (practical emphasis): fundamental file operations (create, open, read, write) on both text and binary files; formatted and block I/O operations; random access; error handling mechanisms.
8. Command-Line Interaction: programs that accept and process command-line arguments.
9. Basic Graphics Programming: initialize graphics mode and draw fundamental shapes like points, lines, rectangles, circles, and ellipses; colors and fill patterns; text within graphics output; simple animation sequences.

Teaching Methods

The teaching faculties are expected to create environment where students can update and upgrade themselves with the current scenario of computing and information technology with the help of topics listed in the syllabus. The general teaching pedagogy that can be followed by teaching faculties for this course includes class lectures, laboratory activity, group discussions, case studies, guest lectures, research work, project work, assignments (theoretical and practical), and written and verbal examinations.

References & Books

Balagurusamy, E. (n.d.). Programming in ANSI C (Latest ed.). Tata McGraw-Hill Education.
Deitel, P. J., & Deitel, H. M. (n.d.). C how to program (Latest ed.). Pearson Education.
Kernighan, B. W., & Ritchie, D. M. (n.d.). The C programming language (Latest ed.). Prentice Hall.
Prata, S. (n.d.). C primer plus (Latest ed.). Pearson Education.

Course Syllabus

1 Doc

10 views6 Units48 Teaching Hrs

Course Information

Type: Both
Course Code: BCA 102
Credit Hours: 3
Full Marks: 100
Pass Marks: 40

Course Description

Objectives

The main objective of this course is to provide students both the theoretical foundation and practical knowledge of programming using C programming language. After the completion of the course, students will be able to:
Understand the basic structure and syntax of the C programming language, including data types, operators, and control statements
Develop algorithmic thinking and structured programming techniques to solve computational problems
Apply modular programming concepts using functions to enhance code reusability and clarity
Manipulate arrays, strings, and pointers effectively for data processing and memory management
Use structures and unions to model and organize complex data in C
Write, compile, debug, and test C programs using standard development tools and environments
Establish a strong foundation for learning advanced programming topics, such as data structures, operating systems, and embedded systems

Course Units

6 Units · 48 Hrs

1.1 Evolution of programming languages
1.2 History, characteristics and applications of C
1.3 Structure of a C program
1.4 Compilation and execution process of a C program
1.5 C tokens: keywords, identifiers, constants, string literals, operators
1.6 Variables: declaration, initialization, scope, and lifetime
1.7 Data types: basic data types (int, char, float, double, void), derived data types, user-defined data types
1.8 Type casting: implicit and explicit type conversion
1.9 Operators and expressions: arithmetic, relational, logical, bitwise, assignment, increment/decrement, conditional (ternary), special operators (sizeof, comma, address-of, dereference); operator precedence and associativity

2.1 Standard input and output functions
2.1.1 Formatted I/O: printf() and scanf()
2.1.2 Unformatted I/O functions: character I/O (getchar(), putchar(), getch(), getche(), putch())
2.2 Control structures
2.3 Decision making statements
2.3.1 if statement
2.3.2 if-else statement
2.3.3 Nested if-else statement
2.3.4 else-if ladder
2.3.5 switch statement
2.3.6 Conditional operator (?:)
2.4 Looping statements
2.4.1 while loop
2.4.2 do-while loop
2.4.3 for loop
2.4.4 Nested loops
2.5 Jump statements
2.5.1 break statement
2.5.2 continue statement
2.5.3 goto statement

3.1 Functions
3.1.1 Introduction to functions: advantages, function definition, function declaration/prototype
3.1.2 Function call
3.1.3 Types of functions: library functions vs. user-defined functions
3.1.4 Function arguments: call by value, call by reference
3.1.5 Recursion: concepts and examples
3.2 Arrays
3.2.1 Introduction to arrays: declaration, initialization, accessing elements
3.2.2 One-dimensional arrays: processing and examples
3.2.3 Two-dimensional arrays: declaration, initialization, accessing elements (matrix operations)
3.2.4 Multi-dimensional arrays
3.2.5 Arrays and functions
3.3 Strings
3.3.1 Introduction to strings: declaration, initialization
3.3.2 String input/output (gets, puts)
3.3.3 String handling functions (strlen, strrev, strcpy, strupr, strlwr, strcmp, strcat)
3.3.4 Array of strings

4.1 Structures and unions
Defining and declaring structures
Accessing members, including nested structures, arrays of structures
Passing structures to functions
Defining and declaring unions; comparison with structures
4.2 Enumerations (enums) and typedef implementation

5.1 Pointer declaration, initialization, and dereferencing
5.1.2 Pointer arithmetic
5.1.3 Pointers with arrays, string, function, structure
5.2 Dynamic memory allocation: malloc, calloc, realloc, free
5.3 DMA with structure
5.4 Dangling pointers and memory leaks

6.1 File handling
6.1.2 Concepts of files (text vs. binary) and file operations (opening, closing, reading, writing)
6.1.3 File modes and standard I/O functions (fgetc, fputc, fgets, fputs, fprintf, fscanf, fread, fwrite)
6.1.4 Random access (fseek, ftell, rewind) and error handling
6.2 Command-line arguments
6.2.1 Introduction to main() function parameters (argc, argv)
6.2.2 Passing and accessing arguments from the command line
6.3 Graphics in C
6.3.1 Introduction to graphics programming (basic concepts, graphics modes)
6.3.2 Drawing primitives: points, lines, and common geometric shapes (rectangles, circles, ellipses, arcs, polygons)
6.3.3 Managing colors and fill styles for graphical output
6.3.4 Displaying and formatting text in graphics mode
6.3.5 Fundamentals of simple animation (clearing the screen, redrawing elements, using delays)

Laboratory Works

Laboratory work [48 hrs]
The practical component will reinforce theoretical concepts through hands-on programming exercises. A minimum of 48 hours (3 hours/week for 16 weeks) will be dedicated to practical sessions. Students are expected to complete assignments on a weekly basis.
General instructions for practical sessions:
Familiarization with a C IDE (e.g., Code::Blocks, Visual Studio Code with GCC, Eclipse CDT, Dev-C++, Turbo C++)
Understanding the compilation and execution process
Debugging techniques
Emphasis on practical application for complex topics, especially Pointers and File Handling, to ensure thorough understanding
List of practical concepts to implement (with enhanced emphasis):
1. Fundamental Programming Constructs: implement programs demonstrating basic input/output, arithmetic operations, and data type conversions; apply various operators (arithmetic, relational, logical, bitwise, conditional) in expressions.
2. Control Flow Mechanisms (practical emphasis): conditional statements (if, if-else, switch); iterative solutions using while, do-while, and for loops; jump statements (break, continue, goto).
3. Functions and Modularity (practical emphasis): modular programs using user-defined functions, argument passing (call by value, call by reference) and return types; recursive problem-solving approaches.
4. Array and String Manipulation (practical emphasis): operations on one-dimensional, two-dimensional, and multi-dimensional arrays including searching, sorting, and matrix operations; string input/output and standard string handling functions; arrays of strings.
5. Pointers and Dynamic Memory (strong practical emphasis): declaration, initialization, and dereferencing; pointer arithmetic and the relationship between pointers and arrays/strings; dynamic memory management using malloc(), calloc(), realloc(), and free().
6. Structured Data Types: structures, nested structures, arrays of structures, and pointers to structures; unions and their memory implications; enumerated types.
7. File Operations (practical emphasis): fundamental file operations (create, open, read, write) on both text and binary files; formatted and block I/O operations; random access; error handling mechanisms.
8. Command-Line Interaction: programs that accept and process command-line arguments.
9. Basic Graphics Programming: initialize graphics mode and draw fundamental shapes like points, lines, rectangles, circles, and ellipses; colors and fill patterns; text within graphics output; simple animation sequences.

Teaching Methods

References & Books

Balagurusamy, E. (n.d.). Programming in ANSI C (Latest ed.). Tata McGraw-Hill Education.
Deitel, P. J., & Deitel, H. M. (n.d.). C how to program (Latest ed.). Pearson Education.
Kernighan, B. W., & Ritchie, D. M. (n.d.). The C programming language (Latest ed.). Prentice Hall.
Prata, S. (n.d.). C primer plus (Latest ed.). Pearson Education.

Programming in C

Programming in C

Course Syllabus

Course Information

Course Description

Objectives

Course Units

Introduction to C Programming Language and Basics

Input/Output and Control Structures

Functions, Arrays and Strings

Structures, Unions, and Enumerations

Pointers and Memory Management

File Handling, Command-Line Arguments, and Graphics

Laboratory Works

Teaching Methods

References & Books

Course Syllabus

Course Information

Course Description

Objectives

Course Units

Introduction to C Programming Language and Basics

Input/Output and Control Structures

Functions, Arrays and Strings

Structures, Unions, and Enumerations

Pointers and Memory Management

File Handling, Command-Line Arguments, and Graphics

Laboratory Works

Teaching Methods

References & Books