# GTUT DIPLOMA Basic Computer Programming GTU 21 Course (I - CE - 4310702)

Rs. 275.00
Tax included. Shipping calculated at checkout.

Syllabus Basic Computer Programming - (4310702) Total Credits (CI+T/2+P/2) Examination Scheme Theory Marks Practical Marks Total Marks C CA ESE CA ESE 5 30 70 25 25 150 Unit Unit Outcomes (UOs) (4 to 6 UOs at different levels) Topics and Sub-topics Flowchart Unit - I : Flowchart and Algorithm 1a. Write pseudo code for the given problem statements 1.1 Definition and Importance of flowchart. 1b. Select appropriate flowchart symbols to represent problem solution graphically. 1.2 Symbols of flowchart 1c. Write algorithms for the given problem statements. 1.3 Flow lines, Terminals, Input / Output, Processing Decision, Connection off-page connectors. 1d. Develop flowchart for the given problem statement. 1.4 Guidelines for preparing Flowchart 1e. Develop Algorithm for the given problem statement. 1.5 Flowchart structure : Sequence, selection, repetition. 1.6 Limitation of flowchart. Algorithm 1.7 Developing and writing algorithm using pseudo codes (Chapter - 1) Unit - II : Basics of ‘C’ Basics of ‘C’ 2a. Comprehend general structure of ‘C’ program 2.1 General structure of ‘C’ program and standard directories 2b. Choose appropriate operators amongst C operators to form expressions in C. 2.2 Write, compile, execute a simple ‘C’ program 2c. Write simple C programs using arithmetic expressions 2.3 Character set, ‘C’ tokens 2d. Apply different format strings for the input and output using ‘C’ statements. 2.4 Keywords and Identifiers. 2.5 Data Types in ‘C’. 2.6 Variables and rules for defining variables, Declaration and Initialization of variables. 2.7 Dynamic initialization. 2.8 Constant and volatile variable. 2.9 Introduction of different types of operators and their symbolic representation, Assignment, Arithmetic, Relational, Logical, Bitwise, Increment and Decrement, Conditional, Comma, size of Operators. 2.10 Operator precedence and their associativity. 2.11 Evaluation of Expressions. 2.12 Type Conversion-Implicit and Explicit. 2.13 Input and Output statements in ‘C’. 2.14 Formatted input and output in ‘C’. (Chapter - 2) Unit - III : Decision Statements and Control Structure Decision Statements 3a. Develop programs using decision making if-else statement. 3.1 Conditional branching statements : Simple if statement 3b. Develop programs using decision making switch – case statement. 3.2 If-else statement. 3c. Develop programs using unconditional branching goto statements in ‘C’ language. 3.3 Nested If-else statement. 3d. Develop C programs using control structure: for, While and Do-While. 3.4 If-else-if Ladder statement. 3e. Apply Break and Continue Statement based on the problem statements in ‘C’ language. 3.5 switch statements. 3.6 Unconditional branching statement : goto. Control Statements 3.7 for loop. 3.8 While loop. 3.9 Do-while loop. 3.10 Nested for loop. 3.11 Break and continue statements. (Chapter - 3) Unit - IV : Array and Pointers Array 4a. Develop programs using one dimensional arrays in ‘C’ language. 4.1 Introduction to an Array. 4b. Write programs using two dimensional arrays. 4.2 A characteristics of an array. 4c. Write programs to demonstrate the use of pointers in C programs. 4.3 One dimensional array: Declaration, initialization and accessing. 4d. Write simple programs to demonstrate use of strings. 4.4 Two-dimensional array: Declaration, initialization and accessing. 4.5 Introduction to a String: Declaration and Initialization of String, gets() and puts(). Pointer 4.6 Introduction to Pointers. 4.7 Characteristics of Pointers. 4.8 Address of Operator and Indirection operator. 4.9 Declaration and initialization of Pointers. 4.10 Types of Pointers: void and null. 4.11 Pointers to Pointers. (Chapters - 4, 5) Unit - V : Functions 5a. Write a simple C program to declare, define and call a function. 5.1 Introduction to Functions. 5b. Write C programs using function with arguments. 5.2 Types of Functions : Built-in and user defined Functions. 5c. Write C functions using call by value and call by reference. 5.3 Advantages of using Functions. 5d. Write C programs using recursive functions. 5.4 Working of a Function. 5e. Use built-in functions of math and string library. 5.5 Declaring, Defining and calling user defined Functions. 5.6 Categories of user-defined Functions. 5.7 Call by Value and call by Reference. 5.8 Recursion. 5.9 Built-in Functions: String and Maths. 5.10 Storage Classes : auto, static, register and extern. (Chapter - 6) Unit - VI : Structure, Union and Files Structure 6a. Write a simple C program to define, declare and access user defined Structure. 6.1 User-defined Data types : enum, typedef. 6b. Write a simple C program to define, declare and access user defined union. 6.2 Introduction to Structures. 6c. Develop a program to read from and write into files using ‘C’ language. 6.3 Declaration, Initialization and accessing of Structures. 6d. Write a simple program to demonstrate use of “Array of structures''. 6.4 Array of structures. Union 6.5 Introduction to Union. 6.6 Declaration, Initialization and accessing of Union. Files 6.7 Introduction to text Files. 6.8 Opening & Closing Files in text mode. 6.9 Reading From and writing into Files in text mode only. (Chapters - 7, 8)

Pickup available at Nashik Warehouse