Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                

PF Syllabus

Download as pdf or txt
Download as pdf or txt
You are on page 1of 4

Course Code ESC X01

Course Title Programming Fundamentals

Type of Course Core


LTP 300
Credits 3
Course Assessment Methods
End Semester Assessment (University 50
Exam.) 50
Continuous Assessment (Sessional,
Assignments, Quiz)
Course Prerequisites None
Course Outcomes (CO) 1. To develop simple algorithms for solving arithmetic
and logical problems.
2. To translate the algorithms to programs using C
language and their execution.
3. To implement conditional branching, iteration and
recursion.
4. To demonstrate the decomposition of a problem into
functions and synthesize a complete program.
5. To examine the use of arrays, pointers and structures
for various problems.
6. To implement programs for use of various file
handling operations.

SYLLABUS

Note for Examiner- Examiner will set 7 questions of equal marks. First question will cover
whole syllabus, having 10 conceptual questions of 1 mark each or 5 questions of 2 mark
each and is compulsory. Rest of the paper will be divided into two parts having three
questions each and the candidate is required to attempt at least two questions from each
part.
SECTION-A
Unit–1: Introduction to Programming [06]
Introduction to components of a computer system: Memory, processor, I/O devices,
storage, operating system, concept of assembler, compiler, interpreter, loader and
linker.
Concept of algorithm: Representation of an algorithm, flowchart, Pseudocode with
examples, converting algorithms to programs.
Programming Basics: Structure of C program, writing and executing the first C program,
Syntax and logical errors in compilation, object and executable code. Components of C
language, standard I/O in C, data types, variables and constants, memory storage,
storage classes.

Unit –2: Expressions and Statements [10]


Expressions and their evaluation: Operands and Operators, formation of expressions

42
using arithmetic, relational, logical and bitwise operators, precedence and associativity
rules , mixed operands, type conversion and evaluation of expressions.
Statements: Simple and compound statements, Conditional Branching: if and switch
statements, nested if-else, dangling else problem, use of break and default with switch.
Iteration and loops: use of while, do while and for loops, nested loops, use of break and
continue statements.
Unit– 3: Arrays & Basic Algorithms [07]
Arrays: Array notation and representation, manipulating array elements, using multi-
dimensional arrays, character arrays and strings.
Basic Algorithms: Searching and Sorting Algorithms (Bubble, Insertion and Selection),
finding roots of equations, notion of order of complexity through example programs.

SECTION-B

Unit–4: Functions [09]


Introduction, advantages of modularizing a program into functions, types of functions,
passing parameters to functions: call by value, call by reference, passing arrays to
functions, recursion with example programs.

Unit – 5: Structures , Union, Enums and Bit-fields [06]


Defining, declaring and usage of structures, unions and their arrays, passing structures
and unions to functions, introduction to enums and bit-fields.

Unit – 6: Pointers and File handling [07]


Pointers: Introduction, declaration, applications, dynamic memory allocation (malloc,
calloc, realloc, free), use of pointers in self-referential structures.
File handling: File I/O functions, standard C pre-processors, defining and calling macros,
command-line arguments.

TEXT BOOKS

S. NAME AUTHOR(S) PUBLISHER


No.
1. Schaum’s Outline of Byron Gottfried McGraw-Hill
Programming with C
2 Programming in C: A practical Dr. Ajay Mittal Pearson
approach Education, 2010
3 The C programming Kernighan Brain W. Pearson
and Ritchie Dennis M Education
4 Computer Basics and C V. Rajaraman PHI Learning,
Programming 2015
5 Computer Concepts and E Balaguruswamy McGraw Hill
Programming in C

43
6 Computer Science- A Behrouz A.Forouzan, Cengage
Structured Programming Richard F. Gilberg, Learning - 2007
Approach Using C Thomson, Third Edition

CO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2

CO1 2 2 1 1 1 1 1 1 1 1 -

CO2 2 2 1 1 1 1 1 1 -

CO3 2 1 2 1 2

CO4 3 3 1 1 2 1 1 1

CO5 3 2 2 1 1 1 1

CO6 2 3 1 1 1 1 1 2 1 1

Course Code ESC X51

Course Title Programming Fundamentals (Practical)

Type of Course Core


LT P 003
Credits 1
Course Assessment Methods
Practical (Continuous and end 50
semester evaluation)

Course Prerequisites None

44
Course Outcomes (CO) 1. To formulate algorithms for simple problems
and translate given algorithms to a working and correct
program
2. To be able to develop programs using arithmetic
expressions and if-then else constructs
3. To be able to execute iterative as well as
recursive programs
4. To be able to demonstrate use of arrays, strings
and structures for representing data and manipulate
them through a program
5. To be able to implement various pointers
operations and use them in defining self-referential
structures.
6. To be able to create, read and write to and from
simple text files

Lab1: Familiarization with programming environment


Lab 2: Simple computational problems using arithmetic expressions
Lab 3: Problems involving if-then-else structures
Lab 4: Iterative problems e.g., sum of series
Lab 5: 1D Array manipulation, Arrays: searching, sorting
Lab 6: Matrix problems, String operations
Lab 7: Simple functions and parameter passing
Lab 8: Numerical methods (Root finding, numerical differentiation, numerical integration)
Lab 9: Recursive functions
Lab 10: Pointers and structures
Lab 11: File operations

CO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2

CO1 2 2 1 1 1 1 1 1 1 1 -

CO2 2 2 1 1 1 1 1 1 -

CO3 2 1 2 1 2

CO4 3 3 1 1 2 1 1 1

CO5 3 2 2 1 1 1 1

CO6 2 3 1 1 1 1 1 2 1 1

45

You might also like