PF Syllabus
PF Syllabus
PF Syllabus
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.
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
TEXT BOOKS
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
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
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