Assam University, Silchar

Four Year Undergraduate Programme

Implemented under NEP 2020

Effective from the Academic Year 2023-24

Syllabus of Computer Application

Approved in the 94th meeting of the Academic Council on 20 th July 2023

vide Resolution No AC:94:07-23:6
 Programme Specific Outcome
Bachelor in Computer Application with Honours/Honours and Research

In a diverse world of Computer Science and Technology, Computer Application (CA) has
carved a separate space and user-base of its own. With strong connections to various other
disciplines like engineering, healthcare, business and finance, etc. Computer Application has
come of age in finding robust solutions for various problems pertaining to these disciplines
using a wide range of specialities – Computer Architecture, Software Systems, Graphics,
Artificial Intelligence, Mathematical and Statistical Analysis, Data Science, Computational
Science, Database Management, Software Engineering, etc. The BCA programme is aimed at
undergraduate level training facilitating multiple career paths. The curriculum aims at laying
a strong foundation of computer application at an early stage of the career to make students
industry-ready. Students, who graduate, can take up postgraduate programmes in
Computer Science or Computer Applications leading to R&D or can pursue a teaching
profession or can adopt a business management career. Graduating students can fetch
employment opportunities in the IT sector as programmer, Web Developer, Software
Engineer, Network Administrator, Data Scientist, or AI/ML personnel, etc. The Curriculum
Framework for BCA degrees is intended to facilitate the students to achieve the following:
1. Students will have a comprehensive understanding of computer science principles,
programming languages, software development methodologies, and data structures.
2. Students will be proficient in one or more programming languages and possess the
ability to develop software applications, write efficient code, and solve programming
problems.
3. BCA graduates will have strong analytical and problem-solving skills, allowing them to
identify and resolve complex computing problems through the application of logical
reasoning and critical thinking.
4. Graduates will be capable of designing, developing, and testing software applications
using appropriate software engineering principles and methodologies.
5. Students will acquire knowledge and skills in designing and managing databases,
including the ability to create database schemas, query data, and ensure data integrity.
6. BCA graduates will have effective oral and written communication skills, enabling them
to collaborate with clients, understand requirements, and document software projects
accurately.
7. Students will be adept at working in multidisciplinary teams, demonstrating the ability
to communicate, cooperate, and contribute to team projects effectively.
8. Graduates will understand the principles of information security and possess knowledge
of techniques to secure computer systems, networks, and applications.
9. BCA graduates will be aware of ethical considerations related to computer science and
information technology and demonstrate a commitment to professional and ethical
practices.
10. Students will be equipped with a strong foundation that allows them to adapt to
emerging technologies, learn new programming languages, and continuously update
their skills to keep pace with the evolving field of computer science.
Table 1: Semester wise list of Computer Application DSC Courses

Semester Course Code Title of the Courses Credits

Fundamentals of Information 3
CADSC101
I Technology
CADSC102 Discrete Mathematics 3
CADSC151 Data Structure 3
II
CADSC152 Lab on Data Structure 3
Computer Organization and 4
CADSC201
III Architecture
CADSC202 Operating System 4
CADSC251 Programming with Java 4
CADSC252 Database Management System 4
IV
Lab on Java Programming & 4
CADSC253
DBMS
CADSC301 Computer Graphics and C++ 4
CADSC302 System Analysis and Design 4
V
Lab on Computer Graphics and 4
CADSC303
C++
Computer Network and Internet 4
CADSC351
Technology
CADSC352 E-Commerce 4
VI
CADSC353 Programming with PHP 4
Lab on PHP & Network 4
CADSC354
Programming
Design and Analysis of Computer 4
CADSC401
Algorithms
Theory of Computation and 4
CADSC402
VII Compiler Design
CADSC403 Artificial Intelligence 4
Lab on DACA & Compiler 4
CADSC404
Design
(A) Research Methodology 4
CADSC451 OR
(B) Software Engineering
(A) Image Processing 4
CADSC452 OR
VIII (B) Data Analytics
CADSC453 Natural Language Processing 4
(A) IoT 4
CADSC454 OR
(B) Cloud Computing
CADSC455 Research Project/Dissertation 12
 Table 2: Semester wise list of Computer Application DSM Papers

DSM1/D Course Code Title of Courses Credits

Semester
SM2
I DSM 1 CADSM101 Programming with C 3
II DSM 2 CADSM151 Programming with C 3
DSM 1 CADSM201 Database Management 4
III
System
DSM 1 CADSM251 Lab on C & DBMS 3
IV DSM 2 CADSM252 Database Management 3
System
DSM 1 CADSM301 Computer Graphics 3
V
DSM 2 CADSM302 Computer Graphics 3
VI DSM 2 CADSM351 Lab on C & DBMS 4
VII DSM 1 CADSM401 Internet Technology 4
VIII DSM 2 CADSM451 Internet Technology 4

Table 3: Semester wise list of Computer Application SEC Courses

Semester Course Code Title of Courses Credits

I CASEC101 Programming with C 3
II CASEC151 Python Programming 3
III CASEC201 Web Programming 3

Table 4: Semester wise list of Computer Application IDC Courses

Semester Course Code Name of the Paper Credits

CAIDC101 Fundamentals of Information 3
I
Technology
CAIDC151 Programming Fundamentals 3
II
with C
CAIDC201 Introduction to Web 3
III
Designing & Cyber Security
 Syllabi of Computer Application DSC Courses
Semester :I
Course Type : DSC
Course Code : CADSC101
Name of the Course : Fundamentals of Information Technology
Learning level : Foundation or Introductory Course
Credits :3
Contact Hours : 45
Total Marks : 100
End Semester Marks : 70
Internal Marks : 30

Course Objectives:
1. Familiarize students with the fundamental concepts, components, and terminology of
information technology.
2. Provide an understanding of computer hardware, software, and operating systems,
including their functions and interrelationships.
3. Teach students how to organize, store, retrieve, and protect data and information
effectively using IT tools and techniques.
4. Explore commonly used software applications and their practical applications, such as
word processing, spreadsheets, databases, and presentation tools.
5. Introduce the concepts of computer networks, network protocols, and the Internet,
including their impact on communication, collaboration, and information sharing.
Unit-I
Introduction to Computer: Computer Definition, Characteristics of Computers, Evolution of
Computers & its applications, IT tools and their applications, Types of Computers, Basic
Organization of a Digital Computer, Hardware and Software, Central Processing Unit, Input
devices, Output devices, Computer Memory & storage, Application Software, Systems Software,
Utility Software, Open source and Proprietary Software, Mobile Apps.

Unit-II
Number System: Representation of numbers and characters in computers. Binary, Hexadecimal,
Octal, BCD, ASCII, EDCDIC and Gray codes, Conversion of bases.
Operating System: Basics of Operating System, Functions of Operating System, Types of
Operating System, Overview of Windows and Linux Operating system and its User Interface and
differences.
Programming Language Tools: Assembler, Compiler, Interpreter, Linker and
Loader.Definition and concepts of algorithm and its different implementations - pseudo code,
flowchart and Computer programs.

Unit-III
IT Tools overview: Word Processing Basics, features of word processor, clipboard, font, page
and paragraph formatting, table creation, page setup and spelling and grammar. Spreadsheet
concept, Elements of Spreadsheet, Creating of Spreadsheet, cell address, formula bar, autofill,
formulas and chart. Creation of Presentation, Creating a Presentation Using a Template, Creating
a Blank Presentation, Inserting & Editing Text on Slides, Slide transition and Animation.

Unit-IV
Introduction to Internet and WWW: Basic of Computer Networks, Local Area Network
(LAN), Metropolitan area Network (MAN), Wide Area Network (WAN), Network Topology ,
Internet, Concept of Internet & WWW, Applications of Internet, Website Address and URL,
Introduction to IP Address, ISP and Role of ISP, Internet Protocol, Modes of Connecting Internet
(HotSpot, Wifi, LAN Cable, BroadBand, USB Tethering), Exploring the Internet , Surfing the
web, Popular Search Engines, Searching on Internet, Downloading Web Pages, Printing Web
Pages
Unit-V
Overview of IT Enabled Services: Structure of E-mail, Using E-mails, Opening, Creating and
Sending, forwarding and Replying to an E-mail message, Social Networking & e-Commerce,
Facebook, Twitter, Linkedin, Instagram, Instant Messaging, Introduction to Blogs, Basics of E-
commerce, Netiquettes, Overview of e-Governance Services, e-Governance Services on Mobile,
Digital Locker.Digital Financial Tools, Understanding OTP and QR Code, UPI, AEPS, USSD,
Card [Credit / Debit], eWallet, PoS, Internet Banking, NEFT, RTGS, IMPS, Online Bill
Payment.

Course Learning Outcomes: After successful completion of the course, the students will be able
to:
1. Acquire a comprehensive understanding of the fundamental concepts, principles, and
components of information technology.
2. Develop basic computer literacy skills, including proficiency in using operating systems,
software applications, and file management
3. Demonstrate the ability to effectively organize, store, retrieve, and manage data using
appropriate IT tools and techniques.
4. Gain practical skills in using commonly used software applications, such as word
processing, spreadsheets, databases, and presentation tool as well as Stay updated on
current and emerging trends in information technology, and understand their potential
impact on various industries and society as a whole.
Text Books:

1. Pradeep K. Sinha and PritiSinha, Computer Fundamentals, BPB Publication, 8th

Edition, 2018.
2. V. Rajaraman, Introduction to Information Technology, PHI Learning; 3rd edition,
2018
3. Anita Goel, Computer Fundamentals, Pearson Education India; First Edition, 2010

Reference Books:

1. David Riley and Kenny Hunt, Computational Thinking for Modern Solver, Chapman
and Hall/CRC; 1st edition, 2014.
 2. Glenn Brookshear, Computer Science: An Overview, Pearson Education; Twelfth
edition, 2017.
3. Puneet Kumar, SushilBhardwaj, et al., Introduction to Information Technology,
Kalyani Publishers; 2018th edition, 2018.

Semester :I
Course Type : DSC
Course Code : CADSC102
Name of the Course : Discrete Mathematics
Learning level : Foundation or Introductory Course
Credits :3
Contact Hours : 45
Total Marks : 100
End Semester Marks : 70
Internal Marks : 30

Course Objectives:

1. The purpose of the course is to familiarize the concepts of mathematical structures that
are fundamentally discrete.
2. To introduce the concepts of mathematical logic.
3. To provide an overview of sets, relations and functions; and their associated operations.
4. Give an understanding of graphs and trees.

Unit I
Mathematical Logic: Statements and Notations, Connectives, Normal forms, Equivalences,
Predicate calculus, Quantifiers, Inference theory of the predicate calculus.

Unit II
Set Theory and Ordered Sets: Basic concept of set theory, Operations with Sets, Function,
Relations, Properties of Relations, Representing Relations, Composition of Relations, Closures
of Relations, Ordered Sets, Hasse Diagrams of Partially Ordered Sets

Unit III
Ordering Relations, Lattices and Boolean Algebra: Partial Ordering Relations; Equivalence
Relations, Lattices, Bounded Lattices, Distributive Lattices, Complements, Complemented
Lattices, Introduction to Boolean algebra, Boolean Functions, Representation and Minimization
of Boolean functions
Unit IV
Trees: Basic Concepts of Tree, Properties of Trees, Pendant vertices in a Tree, Centre of a Tree,
Rooted binary trees, Complete and extended Binary Tree.
 Unit V
Graph theory with applications: Basic concepts of Graph Theory, Incidence and degree,
Isomorphism, Homomorphism, Sub graphs and Union of graphs, multigraphs and weighted
graphs, Planar Graphs, Walks, Paths and Circuits, Components and Connectedness, Eulerian
graph, Hamiltonian graph, Complete Graph, Regular Graph, Bipartite graph, cut-sets and cut-
vertices.

Course Learning Outcomes: After successful completion of the course, the students will be able
to:
1. Apply mathematical logic to solve problems.
2. Learn the concept of sets, relations, functions, lattice and Boolean algebra.
3. Model and solve real world problems using graphs and trees

Text Books:

1. Seymour Lipschutz and Marc Lars Lipson, Discrete Mathematics, Fourth Edition
Schaum’s Outline Series, McGraw Hill, 2022.
2. Kenneth H. Rosen, Discrete Mathematics and Its Applications, Seventh Edition,
McGraw Hill, 2012.
3. Swapan K Sarkar, A Textbook of Discrete Mathematics, 9th Edition, S Chand & Co
Ltd, 2016.

Reference Books:

1. D.J. Hunter, Essentials of Discrete Mathematics, Jones and Bartlett Publishers, 3rd
Edition, 2008.
2. C.L. Liu, D.P. Mahopatra, Elements of Discrete mathematics, 2nd Edition, Tata
McGraw Hill, 1985.
3. Deo N., Graph Theory with Applications to Engineering and Computer Science,
PHI; 6th edition 2010.
Semester : II
Course Type : DSC
Course Code : CADSC151
Name of the Course : Data Structure
Learning level : Foundation or Introductory Course
Credits :3
Contact Hours : 45
Total Marks : 100
End Semester Marks : 70
Internal Marks : 30

Course Objectives:
1. Introduce the basic concepts and principles of data structures, including their definition,
properties, and characteristics.
2. Familiarize students with the implementation of various data structures using
programming languages, including arrays, linked lists, stacks, queues, trees, graphs, and
hash tables.
3. How to analyze the time and space complexity of different data structures and
algorithms, enabling them to make informed decisions regarding their selection and
usage.
4. Cover various searching and sorting algorithms, including linear search, binary search,
bubble sort, insertion sort, selection sort, merge sort, quicksort, and their analysis.
5. Cover the concepts of hashing, hash functions, collision resolution techniques, and the
implementation and applications of hash tables.

UNIT-I
Arrays: Single and Multi-dimensional Arrays, Sparse Matrices (Array and Linked Representation).
Stacks: Implementing single / multiple stack/s in an Array; Prefix, Infix and Postfix expressions,
Utility and conversion of these expressions from one to another; Applications of stack; Limitations of
Array representation of stack.
Recursion: Developing Recursive Definition of Simple Problems and their implementation;
Advantages and Limitations of Recursion.

UNIT-II
Linked Lists: Singly, Doubly and Circular Lists (Array and Linked representation); Normal and
Circular representation of Stack in Lists; Self Organizing Lists; Skip Lists. Queues: Array and
Linked representation of Queue, De-queue, Priority Queues.

UNIT-III
Trees: Introduction to Tree as a data structure; Binary Trees (Insertion, Deletion, Recursive and
Iterative Traversals on Binary Search Trees); Threaded Binary Trees (Insertion, Deletion,
Traversals); Height-Balanced Trees (Various operations on AVL Trees), Heap Tree.
 UNIT-IV
Searching and Sorting: Linear Search, Binary Search, and Comparison of Linear and Binary
Search, Bubble Sort, Selection Sort, Insertion Sort, Merge Sort, Quick Sort, and Comparison of
Sorting Techniques.
UNIT-V
Hashing: Introduction to Hashing, Hash Table, Hash Key, Hash Function, Characteristics of Good
Hash Functions, Types of Hash Functions, Collision, Resolving Collision by Open Addressing &
closed Addressing: Linear probing, Quadratic probing, Double Hashing.

Course outcomes: After successful completion of the course, the students will be able to

1. Demonstrate a solid understanding of various data structures, including arrays, linked

lists, stacks, queues, trees and hash tables.
2. Develop proficiency in implementing data structures using programming languages,
including creating and manipulating data structures through appropriate algorithms.
3. Apply analytical skills to analyze the time and space complexity of algorithms associated
with different data structures, allowing for informed decision-making in algorithm
selection.
4. Enhance critical thinking skills and problem analysis abilities by identifying the
appropriate data structures and algorithms to solve given problems efficiently.

Text Books:

1. Seymour Lipschutz, Data Structures, Schaum’s Outline Series, TMH, 4th Edition, 2019.
2. Adam Drozdek, Data Structures and Algorithms in C++, Cengage Learning, 3rd Edition,
2012.
3. SartajSahni, Data Structures, Algorithms and Applications in C++, Universities Press, 2nd
Edition, 2011.

Reference Books:

1. D.S Malik, Data Structure using C++, Cengage Learning, Second Edition, 2010.
2. Aaron M. Tenenbaum, Moshe J. Augenstein, YedidyahLangsam, Data Structures Using C
and C++, PHI, 2nd Edition, 2009.
3. Robert L. Kruse, Data Structures and Program Design in C++, Pearson, 3rd Edition, 1999.

Semester : II
Course Type : DSC
Course Code : CADSC152P
Name of the Course : Lab on Data Structure
Learning level : Foundation or Introductory Course
Credits :3
Contact Hours : 90
Total Marks : 100
End Semester Marks : 70
Internal Marks : 30
Course Objectives:
1. Help students apply the theoretical concepts of data structures in a practical setting. It
should provide exercises and programming assignments that require students to
implement and manipulate different data structures.
2. Enhancing students' programming skills by providing practical programming exercises.
3. It should encourage students to write code, debug, and test their implementations of data
structures and associated algorithms.

This paper provides practical knowledge of data structure. List of laboratory programming
assignments (not limited to these):

1. Write a program to search an element from a list. Give users the option to perform Linear
or Binary search. Use Template functions.
2. WAP using templates to sort a list of elements. Give users the option to perform sorting
using Insertion sort, Bubble sort or Selection sort.
3. Implement Linked List using templates. Include functions for insertion, deletion and
search of a number, reverse the list and concatenate two linked lists (include a function
and also overload operator +).
4. Implement Doubly Linked List using templates. Include functions for insertion, deletion
and search of a number, reverse the list.
5. Implement Circular Linked List using templates. Include functions for insertion, deletion
and search of a number, reverse the list.
6. Perform Stack operations using Linked List implementation.
7. Perform Stack operations using Array implementation. Use Templates.
8. Perform Queues operations using Circular Array implementation. Use Templates.
9. Create and perform different operations on Double-ended Queues using Linked List
implementation.
10. WAP to scan a polynomial using a linked list and add two polynomials.
11. WAP to calculate factorial and to compute the factors of a given no. (i)using recursion,
(ii) using iteration
12. WAP to display fibonacci series (i)using recursion, (ii) using iteration
13. WAP to calculate GCD of 2 number (i) with recursion (ii) without recursion
14. WAP to create a Binary Search Tree and include following operations in tree: (a)
Insertion (Recursive and Iterative Implementation) (b) Deletion by copying (c) Deletion
by Merging (d)Search a no. in BST (e) Display its preorder, postorder and inorder
traversals Recursively (f) Display its preorder, postorder and inorder traversals Iteratively
(g) Display its level-by-level traversals (h) Count the non-leaf nodes and leaf nodes (i)
Display height of tree (j) Create a mirror image of tree (k) Check whether two BSTs are
equal or not
15. WAP to convert the Sparse Matrix into non-zero form and vice-versa.
16. WAP to reverse the order of the elements in the stack using additional stack.
17. WAP to reverse the order of the elements in the stack using additional Queue.
18. WAP to implement Diagonal Matrix using a one-dimensional array.
19. WAP to implement Lower Triangular Matrix using a one-dimensional array.
20. WAP to implement the Upper Triangular Matrix using a one-dimensional array.
 21. WAP to implement Symmetric Matrix using a one-dimensional array.
22. WAP to create a Threaded Binary Tree as per inorder traversal, and implement operations
like finding the successor / predecessor of an element, insert an element, inorder
traversal.
23. WAP to implement various operations on AVL Tree.

Course Learning Outcomes: After successful completion of the course, the students will be able
to.

1. Students should be able to demonstrate a solid understanding of various data structures

such as arrays, linked lists, stacks, queues, trees, graphs, and hash tables. They should be
able to explain the characteristics, operations, and applications of these data structures.
2. Students should be able to implement data structures and associated algorithms using a
programming language.
3. Students should be able to analyze the time and space complexity of algorithms
associated with different data structures.
 Syllabi of Computer Application DSM Courses
Semester :I
Course Type : DSM
Course Code : CADSM101
Name of the Course : Programming with C
Learning level : Foundation or Introductory Course
Credits :3
Contact Hours : 45
Total Marks : 100
End Semester Marks : 70
Internal Marks : 30

Course objectives:
1. To introduce the concepts of programming and programming language C.
2. To explain the concepts of functions and programme structure in C
3. To explain how to write and implement C programs
4. To explain the concept and working of pointers and files in C
5. To introduce the low level programming in C

UNIT-I
Fundamentals of computer programming with C – Data Types, Expressions, Operations – input,
output; Writing simple C programs; Control structures (WHILE, DO-WHILE, FOR, IF-ELSE,
SWITCH, BREAK, CONTINUE, GOTO STATEMENTS, nested loops etc.) and writing programs
using control structures; solving elementary programming problems from various areas of
applications including mathematics and statistics.

UNIT-II
Functions and program structure – Defining and accessing functions in C, passing arguments to a
function, specifying argument data types – Illustration with example programs and problem
solving through programs; Function prototypes, Functions returning non integers; Storage
classes – Automatic, External, Static and Register variables, Scope rules, Header files, Block
structure; Recursion in C – writing recursive programs and problem solving, The C Preprocessor

UNIT-III
Definition and array processing, passing arrays to a function, multidimensional arrays, Arrays
and Strings; POINTERS – pointers and addresses, pointer declaration, pointers and function
arguments – passing pointers to a function, Pointers and one dimensional arrays; Address
arithmetic – operations on pointers, character pointers and functions; Pointer arrays/arrays of
pointers, pointers to pointers, initialization of pointer arrays, pointers and multidimensional
arrays; Command line arguments, Pointers to functions, passing functions to other functions.
 UNIT-IV
Structures and Unions – Basics of structures, processing of structures, user defined data types
(typedef), Structures and Pointers, Structures and functions – passing structures to a function,
Arrays of structures, Pointers to structures, Self-referential structures, Table lookup, UNIONS.
writing programs and problem solving with structure and union

UNIT-V
Input and output – Standard input and output, Formatted output – printf, Variable length
argument, Formatted input - scanf; Data files – opening and closing data file, creating a data
file, processing a data file, file access, unformatted data files, miscellaneous function in C; Low
Level programming – Register variables, Bitwise operations, Bit fields, Enumeration,
Commands Line arguments/parameters, Library functions, Macros, The C preprocessor.

Course learning outcome:

After successful completion of the course, the students will be able to
1. Learn the concepts of Programming in C
2. Learn thoroughly the building blocks of C programming language
3. Write and implement C programs and solve problems through programming
4. Learn the Concept of pointers and files in C & Programming with C.
5. Design and implement programs using pointers and files in C.

Text Books:

1. Brian W. Kernighan and Denis M. Ritchie, The C Programming Language, Pearson

Education India; 2nd edition, 2015.
2. Byron S Gottfried, Programming with C, McGraw Hill Education; 4th Edition, 2018.
3. E Balagurusamy, Programming in ANSI C, McGraw Hill Education; Eighth edition,
2019
4. V. Rajaraman, Computer Programming in C, PHI Learning Private Limited; Second
edition, 2019

Reference Books:

1. Yashavant P. Kanetkar, Let Us C, BPB; 16th edition, 2017.

2. Kamthane, Programming in C, Pearson Education India; 3rd edition, 2015.

Semester : II
Course Type : DSM
Course Code : CADSM151
Name of the Course : Programming with C
Learning level : Foundation or Introductory Course
Credits :3
Contact Hours : 45
Total Marks : 100
End Semester Marks : 70
Internal Marks : 30

Course objective:
1. To introduce the concepts of programming and programming language C.
2. To explain the concepts of functions and programme structure in C
3. To explain how to write and implement C programs
4. To explain the concept and working of pointers and files in C
5. To introduce the low level programming in C

UNIT-I
Fundamentals of computer programming with C – Data Types, Expressions, Operations – input,
output; Writing simple C programs; Control structures (WHILE, DO-WHILE, FOR, IF-ELSE,
SWITCH, BREAK, CONTINUE, GOTO STATEMENTS, nested loops etc.) and writing programs
using control structures; solving elementary programming problems from various areas of
applications including mathematics and statistics.

UNIT-II
Functions and program structure – Defining and accessing functions in C, passing arguments to a
function, specifying argument data types – Illustration with example programs and problem
solving through programs; Function prototypes, Functions returning non integers; Storage
classes – Automatic, External, Static and Register variables, Scope rules, Header files, Block
structure; Recursion in C – writing recursive programs and problem solving, The C Preprocessor.

UNIT-III
Definition and array processing, passing arrays to a function, multidimensional arrays, Arrays
and Strings; POINTERS – pointers and addresses, pointer declaration, pointers and function
arguments – passing pointers to a function, Pointers and one dimensional arrays; Address
arithmetic – operations on pointers, character pointers and functions; Pointer arrays/arrays of
pointers, pointers to pointers, initialization of pointer arrays, pointers and multidimensional
arrays; Command line arguments, Pointers to functions, passing functions to other functions.

UNIT-IV
Structures and Unions – Basics of structures, processing of structures, user defined data types
(typedef), Structures and Pointers, Structures and functions – passing structures to a function,
Arrays of structures, Pointers to structures, Self-referential structures, Table lookup, UNIONS.
writing programs and problem solving with structure and union
 UNIT-V
Input and output – Standard input and output, Formatted output – printf, Variable length
argument, Formatted input - scanf; Data files – opening and closing data file, creating a data
file, processing a data file, file access, unformatted data files, miscellaneous function in C; Low
Level programming – Register variables, Bitwise operations, Bit fields, Enumeration,
Commands Line arguments/parameters, Library functions, Macros, The C preprocessor.

Course learning outcome:

After successful completion of the course, the students will be able to
1. Learn the concepts of Programming in C
2. Learn thoroughly the building blocks of C programming language
3. Write and implement C programs and solve problems through programming
4. Learn the Concept of pointers and files in C & Programming with C.
5. Design and implement programs using pointers and files in C.

Text Books:
1. Brian W. Kernighan and Denis M. Ritchie, The C Programming Language, Pearson
Education India; 2nd edition, 2015.
2. Byron S Gottfried, Programming with C, McGraw Hill Education; 4th Edition, 2018.
3. E Balagurusamy, Programming in ANSI C, McGraw Hill Education; Eighth edition,
2019
4. V. Rajaraman, Computer Programming in C, PHI Learning Private Limited; Second
edition, 2019

Reference Books:
1. Yashavant P. Kanetkar, Let Us C, BPB; 16th edition, 2017.
2. Kamthane, Programming in C, Pearson Education India; 3rd edition, 2015.
 Syllabi of Computer Application SEC Courses
Semester :I
Course Type : SEC
Course Code : CASEC101
Name of the Course : Programming with C
Learning level : Foundation or Introductory Course
Credits :3
Contact Hours : 30
Total Marks : 100
End Semester Marks : 80 [50 (Theory) + 30 (Practical)]
Internal Marks : 20

Course objectives:
1. To introduce the concepts of programming and programming language C.
2. To explain the concepts of functions and programme structure in C
3. To explain how to write and implement C programs
4. To explain the concept and working of pointers and files in C
5. To introduce the low level programming in C

UNIT-I
Fundamentals of computer programming with C – Data Types, Expressions, Operations – input,
output; Writing simple C programs; Control structures (WHILE, DO-WHILE, FOR, IF-ELSE,
SWITCH, BREAK, CONTINUE, GOTO STATEMENTS, nested loops etc.) and writing programs
using control structures; solving elementary programming problems from various areas of
applications including mathematics and statistics.

UNIT-II
Functions and program structure – Defining and accessing functions in C, passing arguments to a
function, specifying argument data types – Illustration with example programs and problem
solving through programs; Function prototypes, Functions returning non integers; Storage
classes – Automatic, External, Static and Register variables, Scope rules, Header files, Block
structure; Recursion in C – writing recursive programs and problem solving, The C Preprocessor

UNIT-III
Definition and array processing, passing arrays to a function, multidimensional arrays, Arrays
and Strings; POINTERS – pointers and addresses, pointer declaration, pointers and function
arguments – passing pointers to a function, Pointers and one dimensional arrays; Address
arithmetic – operations on pointers, character pointers and functions; Pointer arrays/arrays of
pointers, pointers to pointers, initialization of pointer arrays, pointers and multidimensional
arrays; Command line arguments, Pointers to functions, passing functions to other functions.
 UNIT-IV
Structures and Unions – Basics of structures, processing of structures, user defined data types
(typedef), Structures and Pointers, Structures and functions – passing structures to a function,
Arrays of structures, Pointers to structures, Self-referential structures, Table lookup, UNIONS.
writing programs and problem solving with structure and union

UNIT-V
Input and output – Standard input and output, Formatted output – printf, Variable length
argument, Formatted input - scanf; Data files – opening and closing data file, creating a data
file, processing a data file, file access, unformatted data files, miscellaneous function in C; Low
Level programming – Register variables, Bitwise operations, Bit fields, Enumeration,
Commands Line arguments/parameters, Library functions, Macros, The C preprocessor.

Course learning outcome:

After successful completion of the course, the students will be able to
1. Learn the concepts of Programming in C
2. Learn thoroughly the building blocks of C programming language
3. Write and implement C programs and solve problems through programming
4. Learn the Concept of pointers and files in C & Programming with C.
5. Design and implement programs using pointers and files in C.

Text Books:
5. Brian W. Kernighan and Denis M. Ritchie, The C Programming Language, Pearson
Education India; 2nd edition, 2015.
6. Byron S Gottfried, Programming with C, McGraw Hill Education; 4th Edition, 2018.
7. E Balagurusamy, Programming in ANSI C, McGraw Hill Education; Eighth edition,
2019
8. V. Rajaraman, Computer Programming in C, PHI Learning Private Limited; Second
edition, 2019

Reference Books:
3. Yashavant P. Kanetkar, Let Us C, BPB; 16th edition, 2017.
4. Kamthane, Programming in C, Pearson Education India; 3rd edition, 2015.
LAB: PART B: Programming with C (Practical): 30 Hours. (Practical /Project/Field
work): Total marks: 30
Pass marks: 12
This part provides the practical knowledge of Programming with C.

Problem solving of various natures by implementing programs in C Programming languages

based on unit wise contents of the theory paper Programming with C. Following are some
programming tasks for laboratory programming assignments but the assignments are not limited
to these only.

List of laboratory programming assignments (not limited to these):

1. Write a program to
a) Produce ASCII equivalent of given number
b) Find divisor or factorial of a given number
c) Evaluate the following algebraic expressions after reading necessary values from
the user (ax+b)/ (ax-b) -2.5 log x-cos 30+|x2-y2|+sqrt (2xy) - (x5+10x4+8x3+4x+2)
d) Find sum of a geometric series
e) Cipher a string
f) Check whether a given string follows English capitalization rules
g) Find sum of the following series 1+ ½ + 1/3 +________+1/20
h) Search whether a given substring exist in an input string or not and then delete this
string from input string
2. Write a recursive program for tower of Hanoi problem
3. The Fibonacci sequence of numbers is 1, 1, 2, 3, 5, 8……. Based on the recurrence
relation F(n)=F(n-1)+F(n-2) for n>2 Write a recursive program to print the first n
Fibonacci number
4. Write a menu driven program for matrices to do the following operation depending on
whether the operation requires one or two matrices
a) Addition of two matrices
b) Subtraction of two matrices
c) Finding upper and lower triangular matrices
d) Trace of a matrix
 e) Transpose of a matrix
f) Check of matrix symmetry
g) Product of two matrices.
5. Write a program that takes two operands and one operator from the user perform the
operation and then print the answer
7. Write functions to add, subtract, multiply and divide two complex numbers (x+iy) and
(a+ib) Also write the main program.
8. Write a menu driven program for searching and sorting with following options:-
a) Searching (1) Linear searching (2) Binary searching
b) Sorting (1) Insertion sort (2) Selection sort
9. Write a program to copy one file to another, use command line arguments.
10. Write a program to mask some bit of a number (using bit operations)
11. An array of records contains information of managers and workers of a company.
Print all the data of managers and workers in separate files.

Semester : II
Course Type : SEC
Course Code : CASEC151
Name of the Course : Python Programming
Learning level : Foundation or Introductory Course
Credits :3
Contact Hours : 30
Total Marks : 100
End Semester Marks : 80 [50 (Theory) + 30 (Practical)]
Internal Marks : 20

Course Objectives:
1. Familiarize students with the basics of Python programming language, including syntax,
variables, data types, and control structures syntax, variables, data types, and control
structures.
2. Introduce students to fundamental programming concepts such as variables, data types,
operators, conditional statements, loops, and functions, within the context of Python.
3. Explore various data structures in Python, such as lists, tuples, dictionaries, and sets,
and develop the skills to manipulate, access, and organize data using these structures.
4. Teach students how to read from and write to files using Python, including text files and
CSV files, enabling them to handle data stored in external files.
5. Develop skills in handling errors and exceptions in Python programs, allowing for
graceful error handling and robustness.
 Unit-I
Introduction: Basic Elements of Python, Python character set, Python tokens (keyword,
identifier, literal, operator, punctuator), variables, concept of l-value and r-value, use of
comments, Knowledge of data types: Number(integer, floating point, complex), boolean,
sequence(string, list, tuple), None, Mapping(dictionary), mutable and immutable data
types.Operators: arithmetic operators, relational operators, logical operators, assignment
operators, augmented assignment operators, identity operators (is, is not), membership operators
(in not in)Expressions, statement, type conversion, and input/output: precedence of operators,
expression, and evaluation of an expression, type-conversion (explicit and implicit conversion),
accepting data as input from the console and displaying output.

Unit-II
Flow of Control: introduction, use of indentation, sequential flow, conditional and iterative
flow; Conditional statements: if, if-else, if-elif-else, flowcharts, simple programs: e.g.: absolute
value, sort 3 numbers and divisibility of a number. Iterative Statement: for loop,range(), while
loop, flowcharts, break and continue statements, nested loops, suggested programs: generating
pattern, summation of series, finding the factorial of a positive number, etc.Strings: introduction,
string operations (concatenation, repetition, membership and slicing), traversing a string using
loops, built-in functions/methods.

Unit-III
Lists: introduction, indexing, list operations (concatenation, repetition, membership and slicing),
traversing a list using loops, built-in functions/methods, nested lists. Tuples: introduction,
indexing, tuple operations (concatenation, repetition, membership and slicing); built-in functions.
Set: creating set, changing/ adding elements to a set, removing elements to a set, python set
operations, python set methods. Dictionary: introduction, accessing items in a dictionary using
keys, mutability of a dictionary (adding a new term, modifying an existing item), traversing a
dictionary, built-in functions/methods. Introduction to Python modules: Importing module using
‘import <module>’ and using from statement, importing math Module. String Manipulation:
Basic Operations, Slicing
Unit-IV
Python functions, types of functions, function definition, function call, types of function
arguments, pas by value and pass by reference/object reference, recursion, advantages and
disadvantages of recursion, scope and lifetime variables. Python Modules, Python Package.

Unit-V
Python Files: Python File Operation, Python Directory , Python Exception Handling, python
built-in exception, Try, Except and Finally, Python user defined exception, Python graph plotting
using Matplotlib.

Course outcomes: After successful completion of the course, the students will be able to

1. Demonstrate a solid understanding of Python syntax, including variables, data types,

control structures, functions, classes, and modules.
 2. Develop problem-solving skills and the ability to design, implement, and debug Python
programs to solve a variety of computational problems.
3. Demonstrate the ability to read from and write to files, process data from external
sources, and handle input/output operations using Python.

Text Books
1. John V. Guttag, Introduction to Computation and Programming Using Python, 2nd
Edition, PHI 2 Core, 2016
2. R. Nageswara Rao, Python Programming, dreamtech Press, 2nd Edition, 2018.

Reference Books
1. Ramsey Hamilton, Python: Programming: A Beginner’s Guide, Create space Independent Pub,
2nd Edition, 2016
2. YashavantKanetkar, Let Us Python, BPB Publications, 5th Edition, 2022
3. R.S. Salaria, Programming in Python, Khanna Publishing House, 2nd Edition, 2019.
4. P. Sharma, Programming in Python, BPB, 2nd Edition, 2014
5. T. Budd, Exploring Python, TMH, 1st Edition, 2011

LAB: PART B: Python Programming (Practical): 30 Hours. (Practical /Project/Field work):

Total marks: 30
Pass marks: 12
This part provides the practical knowledge of Programming with Python.

This paper provides practical knowledge of python programming. List of laboratory

programming assignments (not limited to these):

1. Using a loop, print a table of Celsius/Fahrenheit equivalences. Let c be the Celsius

temperatures ranging from 0 to 100, for each value of c, print the corresponding
Fahrenheit temperature.
2. Using a while loop, produce a table of sins, cosines and tangents. Make a variable x in
range from 0 to 10 in steps of 0.2. For each value of x, print the value of sin(x), cos(x)
and tan(x).
3. Write a program that reads an integer value and prints “leap year” or “not a leap year”.
4. Write a program that takes a positive integer n and then produces n lines of output shown
as follows.
5. For example enter a size: 5
*
**
***
****
*****
6. Write a function that takes an integer ‘n’ as input and calculates the value of
1 + 1/1! + 1/2! + 1/3! + … + 1/n
7. Write a function that takes an integer input and calculates the factorial of that number.
8. Write a function that takes a string input and checks if it’s a palindrome or not.
9. Write a list function to convert a string into a list, as in list (‘abc’) gives [a, b, c].
10. Write a program to generate Fibonacci series.
11. Write a program to check whether the input number is even or odd.
12. Write a program to compare three numbers and print the largest one.
13. Write a program to print factors of a given number.
14. Write a method to calculate GCD of two numbers.
15. Write a program to sort a list using insertion sort and bubble sort and selection sort.
16. Problems related to File handling, exception handling in python, usage of user defined
exceptions and assertions.
17. Problems related to string manipulations, basic operations , slicing.
18. Write a program to draw a line, bar, histograms, pie chart etc.
 Syllabi of Computer Application IDC Courses
Semester :I
Course Type : IDC
Course Code : CAIDC101
Name of the Course : Fundamentals of Information Technology
Learning level : Foundation or Introductory Course
Credits :3
Contact Hours : 45
Total Marks : 100
End Semester Marks : 70
Internal Marks : 30

Course Objectives:
1. Familiarize students with the fundamental concepts, components, and terminology of
information technology.
2. Provide an understanding of computer hardware, software, and operating systems,
including their functions and interrelationships.
3. Teach students how to organize, store, retrieve, and protect data and information
effectively using IT tools and techniques.
4. Explore commonly used software applications and their practical applications, such as
word processing, spreadsheets, databases, and presentation tools.
5. Introduce the concepts of computer networks, network protocols, and the Internet,
including their impact on communication, collaboration, and information sharing.
Unit-I
Introduction to Computer: Computer Definition, Characteristics of Computers, Evolution of
Computers & its applications, IT tools and their applications, Types of Computers, Basic
Organization of a Digital Computer, Hardware and Software, Central Processing Unit, Input
devices, Output devices, Computer Memory & storage, Application Software, Systems Software,
Utility Software, Open source and Proprietary Software, Mobile Apps.

Unit-II
Number System: Representation of numbers and characters in computers. Binary, Hexadecimal,
Octal, BCD, ASCII, EBCDIC and Gray codes, Conversion of bases.
Operating System: Basics of Operating System, Functions of Operating System, Types of
Operating System, Overview of Windows and Linux Operating system and its User Interface and
differences.
Programming Language Tools: Assembler, Compiler, Interpreter, Linker and
Loader.Definition and concepts of algorithm and its different implementations - pseudo code,
flowchart and Computer programs.

Unit-III
IT Tools overview: Word Processing Basics, features of word processor, clipboard, font, page
and paragraph formatting, table creation, page setup and spelling and grammar. Spreadsheet
concept, Elements of Spreadsheet, Creating of Spreadsheet, cell address, formula bar, autofill,
formulas and chart. Creation of Presentation, Creating a Presentation Using a Template, Creating
a Blank Presentation, Inserting & Editing Text on Slides, Slide transition and Animation.

Unit-IV
Introduction to Internet and WWW: Basic of Computer Networks, Local Area Network
(LAN), Metropolitan area Network (MAN), Wide Area Network (WAN), Network Topology ,
Internet, Concept of Internet & WWW, Applications of Internet, Website Address and URL,
Introduction to IP Address, ISP and Role of ISP, Internet Protocol, Modes of Connecting Internet
(HotSpot, Wifi, LAN Cable, BroadBand, USB Tethering), Exploring the Internet , Surfing the
web, Popular Search Engines, Searching on Internet, Downloading Web Pages, Printing Web
Pages
Unit-V
Overview of IT Enabled Services: Structure of E-mail, Using E-mails, Opening, Creating and
Sending, forwarding and Replying to an E-mail message, Social Networking & e-Commerce,
Facebook, Twitter, Linkedin, Instagram, Instant Messaging, Introduction to Blogs, Basics of E-
commerce, Netiquettes, Overview of e-Governance Services, e-Governance Services on Mobile,
Digital Locker.Digital Financial Tools, Understanding OTP and QR Code, UPI, AEPS, USSD,
Card [Credit / Debit], eWallet, PoS, Internet Banking, NEFT, RTGS, IMPS, Online Bill
Payment.

Course Learning Outcomes: After successful completion of the course, the students will be able
to:
1. Acquire a comprehensive understanding of the fundamental concepts, principles, and
components of information technology.
2. Develop basic computer literacy skills, including proficiency in using operating systems,
software applications, and file management
3. Demonstrate the ability to effectively organize, store, retrieve, and manage data using
appropriate IT tools and techniques.
4. Gain practical skills in using commonly used software applications, such as word
processing, spreadsheets, databases, and presentation tool as well as Stay updated on
current and emerging trends in information technology, and understand their potential
impact on various industries and society as a whole.
Text Books:
1. Pradeep K. Sinha and PritiSinha, Computer Fundamentals, BPB Publication, 8th
Edition, 2018.
2. V. Rajaraman, Introduction to Information Technology, PHI Learning; 3rd edition,
2018
3. Anita Goel, Computer Fundamentals, Pearson Education India; First Edition, 2010
Reference Books:
1. David Riley and Kenny Hunt, Computational Thinking for Modern Solver, Chapman
and Hall/CRC; 1st edition, 2014.
2. Glenn Brookshear, Computer Science: An Overview, Pearson Education; Twelfth
edition, 2017.
3. Puneet Kumar, SushilBhardwaj, et al., Introduction to Information Technology,
Kalyani Publishers; 2018th edition, 2018
Semester : II
Course Type : IDC
Course Code : CAIDC151
Name of the Course : Programming Fundamentals with C
Learning level : Foundation or Introductory Course
Credits :3
Contact Hours : 45
Total Marks : 100
End Semester Marks : 70
Internal Marks : 30

Course Objectives:
1. Write algorithms, flowcharts and programs.
2. Implement different programming constructs and decomposition of problems into
functions.
3. Use and implement data structures like arrays to obtain solutions.

UNIT I
Introduction to Programming: Computer Programs, Natural Language vs Programming
Language, Concepts of Machine Level, Assembly Level and High-level Programming Language,
Compiler, Interpreter.
Programming terms: Source Code, Target Code, Input, Output, Compiling, Warning, Running,
Debugging, Testing.
Errors: Errors in Computer Programs, Different types of Errors in Computer Programs.

UNIT II
Introduction to Computing: Art of Programming through Algorithms and Flowcharts,
Qualities of Good Algorithm, Flowchart Symbols, Rules for designing Flowchart.
Overview of C Programming: History and importance of C, Basic structure of C program,
executing a C program.
UNIT III

Constants, Variable and Data Types: Introduction, Character Set, C Tokens, Keywords and
Identifiers, Constants, Variables, Data Types, Declaration of Variables, Assigning Values to
Variables, Defining Symbolic Constants.
Operators and Expressions: Introduction, Arithmetic Operators, Relational Operators, Logical
Operators, Assignment Operators, Increment and Decrement Operators, Conditional Operator,
Arithmetic Expressions.

UNIT IV
Decision Making and Branching: Introduction, Decision Making with Simple IF Statement, IF-
ELSE Statement, Nested of IF-ELSE Statements, ELSE IF Ladder, Switch statement.
Looping: Introduction, while Statement, do while statement, for statement.
 UNIT V
Arrays: One-dimensional Arrays, Declaration of One-dimensional Arrays, Initialization of One-
dimensional Arrays.

User-defined Functions: Need for functions, Elements of User-defined Functions, Definition of

Functions, Return Values and their Types, Function Calls, Function Declaration, Category of
Functions, No Arguments and no Return Values, Arguments but no Return values, Arguments
with Return Values, No Arguments but Returns a Value, Passing Arrays to Functions, Recursion.

Pointers: Introduction to pointers in C (basic Concepts)

Course Learning Outcomes: After successful completion of the course, the students will be able
to:

1. Demonstrate problem solving skills by developing and implementing algorithms to solve

problems.
2. Apply appropriate Control structures to solve problems.
3. Describe the concept of Arrays.
4. Write user defined functions and apply the concept of function to solve problems.

Text Books:
1. Brian W. Kernighan and Denis M. Ritchie, The C Programming Language, Pearson
Education India; 2nd edition, 2015.
2. Byron S Gottfried, Programming with C, McGraw Hill Education; 4th Edition, 2018.
3. E Balagurusamy, Programming in ANSI C, McGraw Hill Education; Eighth edition,
2019
4. V. Rajaraman, Computer Programming in C, PHI Learning Private Limited; Second
edition, 2019

Reference Books:
1. Yashavant P. Kanetkar, Let Us C, BPB; 16th edition, 2017.
2. Kamthane, Programming in C, Pearson Education India; 3rd edition, 2015.