Mapping with Programme Outcomes:
CO/PSO PSO 1 PSO 2 PSO 3 PSO 4 PSO 5 PSO 6
CO 1 3 3 3 3 3 3
CO 2 2 3 3 3 3 3
CO 3 3 3 2 3 3 2
CO 4 3 3 3 3 3 3
CO 5 3 3 3 3 3 3
Weight age of course 14 15 14 15 15 14
contributed to each PSO
S-Strong-3 M-Medium-2 L-Low-1
Subject Subject Name L T P S Marks
Inst. Hours
Category
Code
Credits
External
Total
CIA
Problem Solving
FC FC 2 - - - 2 2 25 75 100
Techniques
Learning Objectives
LO1 Familiarize with writing of algorithms, fundamentals of C and philosophy of problem solving.
LO2 Implement different programming constructs and decomposition of problems into functions.
LO3 Use data flow diagram, Pseudo code to implement solutions.
LO4 Define and use of arrays with simple applications
LO5 Understand about operating system and their uses
UNIT Contents No. Of. Hours
I Introduction: History, characteristics and limitations of
Computer. Hardware/Anatomy of Computer: CPU, Memory,
Secondary storage devices, Input Devices and Output
devices. Types of Computers: PC, Workstation,
Minicomputer, Main frame and Supercomputer. Software: 6
System software and Application software. Programming
Languages: Machine language, Assembly language, High-
level language,4 GL and 5GL-Features of good programming
language. Translators: Interpreters and Compilers.
II Data: Data types, Input, Processing of data, Arithmetic
Operators, Hierarchy of operations and Output. Different
phases in Program Development Cycle (PDC).Structured
Programming: Algorithm: Features of good algorithm,
Benefits and drawbacks of algorithm. Flowcharts:
6
Advantages and limitations of flowcharts, when to use
flowcharts, flowchart symbols and types of
[Link]: Writing a pseudocode. Coding,
documenting and testing a program: Comment lines and
types of errors. Program design: Modular Programming.
III Selection Structures: Relational and Logical Operators -
Selecting from Several Alternatives – Applications of
Selection Structures. Repetition Structures: Counter 6
Controlled Loops –Nested Loops– Applications of Repetition
Structures.
IV Data: Numeric Data and Character Based Data. Arrays:
One Dimensional Array - Two Dimensional Arrays – Strings 6
as Arrays of Characters.
V Data Flow Diagrams: Definition, DFD symbols and types
of DFDs. Program Modules: Subprograms-Value and
Reference parameters- Scope of a variable - Functions –
6
Recursion. Files: File Basics-Creating and reading a
sequential file- Modifying Sequential Files.
TOTAL HOURS 30
Course Outcomes Programme
Outcomes
CO On completion of this course, students will
Study the basic knowledge of Computers. PO1, PO2, PO3,
CO1 Analyze the programming languages. PO4, PO5, PO6
Study the data types and arithmetic operations. PO1, PO2, PO3,
CO2 Know about the algorithms. PO4, PO5, PO6
Develop program using flow chart and pseudocode.
Determine the various operators.
PO1, PO2, PO3,
CO3 Explain about the structures.
PO4, PO5, PO6
Illustrate the concept of Loops
Study about Numeric data and character-based data. PO1, PO2, PO3,
CO4 Analyze about Arrays. PO4, PO5, PO6
Explain about DFD
PO1, PO2, PO3,
CO5 Illustrate program modules.
PO4, PO5, PO6
Creating and reading Files
Textbooks
1 Stewart Venit, “Introduction to Programming: Concepts and Design”, Fourth Edition,
2010, Dream Tech Publishers.
Web Resources
1. [Link]
2. [Link]
3. [Link]
Mapping with Programme Outcomes:
CO/PSO PSO 1 PSO 2 PSO 3 PSO 4 PSO 5 PSO 6
CO 1 3 3 3 3 3 3
CO 2 3 3 3 3 3 3
CO 3 3 2 3 3 3 3
CO 4 3 3 2 3 3 3
CO 5 3 3 3 3 3 2
Weightage of course 15 14 14 15 15 14
contributed to each PSO
S-Strong-3 M-Medium-2 L-Low-1
Semester II
Title of the Subject Name Category L T P S M
k
a
r
s
Inst. Hours
Course/
Credits
Paper External
Total
CIA
DATA
STRUCTURES
Core
AND 5 - - - 5 5 25 75 100
CC3
ALGORITHMS
Learning Objectives
LO1 To understand the concepts of ADTs
LO2 To learn linear data structures-lists, stacks, queues
LO3 To learn Tree structures and application of trees
LO4 To learn graph strutures and and application of graphs