4-Computer-Applications

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

Kurukshetra University, Kurukshetra

(Established by the State Legislature Act XII of 1956)


(‘A+’ Grade, NAAC Accredited)

|| योगस्थ: कुरु कर्मा णि ||


सर्बुद्धि व योग युक्त होकर कर्ा करो
(Perform Actions while Stead fasting in the State of Yoga)

Scheme of Examination for Under-Graduate Programmes


Subject: Computer Applications
according to
Curriculum Framework for Under-Graduate Programmes
As per NEP-2020 (Multiple Entry-Exit, Internships and Choice Based
Credit System)
DEPARTMENT OF COMPUTER SCIENCE & APPLICATIONS
(For the Batches Admitted from 2023-2024)

1
Kurukshetra University Kurukshetra
Scheme of Examination forUndergraduate programmes
Subject: Computer Applications
According to
Curriculum Framework for Undergraduate Programmes
as per NEP 2020 (Multiple Entry-Exit, Internships and Choice Based Credit System)

Sem Course Course Nomenclature of Credits Contact Internal End Total Duration
Type Code paper hours marks term Marks of exam
Marks (Hrs)
T+P
1 CC-1 B23- Programming with 3 3 20 50 70 3
MCC-1 CAC- Python
101
Practical 1 2 10 20 30 3
MCC-2 B23- Operating Systems 3 3 20 50 70 3
CAC-
102 Practical 1 2 10 20 30 3

CC-M1 B23- Basics of Computer 1 1 10 20 30 3


CAC- Science
103
Practical 1 2 5 15 20 3
MDC 1 B23- Fundamentals of 2 2 15 35 75 3
CAC- Computer Science
104
Practical 1 2 5 20 25 3
2 CC-2 B23- Logical 3 3 20 50 70 3
MCC-3 CAC- Organization of
201 Computer
Practical 1 2 10 20 30 3
DSEC-1 B23- Data Base 3 3 20 50 70 3
CAC- Management
202 Systems
Practical 1 2 10 20 30 3
CC-M2 B23- Programming 1 1 10 20 30 3
CAC- Methodologies
203
Practical 1 2 5 15 20 3
MDC 2 B23- Web Technologies 2 2 15 35 50 3
CAC- Fundamentals
204
Practical 1 2 5 20 25 3
3 CC-3 B23- Object-Oriented 3 3 20 50 70 3
MCC-4 CAC- Programming using
301 C++
2
Practical 1 2 10 20 30 3
MCC-5 B23- Foundations of 3 3 20 50 70 3
CAC- Web Development
302
Practical 1 2 10 20 30 3
MDC 3 B23- Programming with 2 2 15 35 50 3
CAC- C
304
Practical 1 2 5 20 25 3
4 CC-4 B23- Computer Graphics 3 3 20 50 70 3
MCC-6 CAC-
401 Practical 1 2 10 20 30 3

MCC-7 B23- Concepts of Data 3 3 20 50 70 3


CAC- Structures
402
Practical 1 2 10 20 30 3
MCC-8 B23- Java Programming 3 3 20 50 70 3
CAC-
403 Practical 1 2 10 20 30 3

DSE-1 B23- Front-end 3 3 20 50 70 3


CAC- Development
404
Practical 1 2 10 20 30 3
Or
B23- Linux and Shell 3 3 20 50 70 3
CAC- Programming
405
Practical 1 2 10 20 30 3
5 CC-5 B23- Data Analytics 3 3 20 50 70 3
MCC-9 CAC- using SpreadSheets
501
Practical 1 2 10 20 30 3
MCC-10 B23- Computer 3 3 20 50 70 3
CAC- Networks
502
Practical 1 2 10 20 30 3
DSE-2 B23- Foundations of 3 3 20 50 70 3
CAC- Server-Side
503 Development
Practical 1 2 10 20 30 3
Or
B23- Cloud Computing 3 3 20 50 70 3
CAC-
504 Practical 1 2 10 20 30 3

DSE-3 B23- Java Based Web 3 3 20 50 70 3


CAC- App Development

3
505 Practical 1 2 10 20 30 3
Or
B23- Programming in R 3 3 20 50 70 3
CAC-
506 Practical 1 2 10 20 30 3

6 CC-6 B23- Artificial 3 3 20 50 70 3


MCC-11 CAC- Intelligence
601
Practical 1 2 10 20 30 3
MCC-12 B23- Advanced Web 3 3 20 50 70 3
CAC- Development
602 Techniques
Practical 1 2 10 20 30 3
DSE-4 B23- Developing 3 3 20 50 70 3
CAC- Modern Web
603 Applications using
React
Practical 1 2 10 20 30 3
Or
B23- Data Storage 3 3 20 50 70 3
CAC- Technologies and
604 Networks using
AWS
Practical 1 2 10 20 30 3
DSE-5 B23- Data Analytics 3 3 20 50 70 3
CAC- using Python
606
Practical 1 2 10 20 30 3
Or
B23- Data Analytics 3 3 20 50 70 3
CAC- using R
607
Practical 1 2 10 20 30 3
7 CC-H1 B23- Mobile Computing 4 4 30 70 100 3
CAC-
701
CC-H2 B23- Software Testing 4 4 30 70 100 3
CAC-
702
CC-H3 B23- Data Mining and 4 4 30 70 100 3
CAC- Warehousing
703
DSE-6 B23- NoSQL Databases 4 4 30 70 100 3
4
CAC-
704
Or
B23- Block Chain 4 4 30 70 100 3
CAC- Technologies
705
PC-H1 B23- Practical 4 8 30 70 100 6
CAC-
707
8 CC-H4 B23- Information 4 4 30 70 100 3
CAC- Security
801
CC-H5 B23- Internet of Things 4 4 30 70 100 3
CAC-
802
CC-H6 B23- Software Project 4 4 30 70 100 3
CAC- Management
803
DSE-7 B23- Big Data 4 4 30 70 100 3
CAC-
804
Or
B23- Machine Learning 4 4 30 70 100 3
CAC-
805
PC-H2 B23- Practical 4 8 30 70 100 6
CAC-
806
OR
CC-H4 B23- Information 4 4 30 70 100 3
CAC- Security
801
CC-H5 B23- Internet of Things 4 4 30 70 100 3
CAC-
802
Research B23- Project/ 12 300
CAC- Dissertation
807

5
Kurukshetra University, Kurukshetra
(Established by the State Legislature Act XII of 1956)
(‘A+’ Grade, NAAC Accredited)

|| : ||

(Perform Actions while Stead fasting in the State of Yoga)

Syllabus of Examination (1st Semester) for Under-Graduate Programmes


Subject: Computer Applications
according to
Curriculum Framework for Under-Graduate Programmes
As per NEP-2020 (Multiple Entry-Exit, Internships and Choice Based
Credit System)
DEPARTMENT OF COMPUTER SCIENCE & APPLICATIONS
(For the Batches Admitted From 2023-2024)

6
DEPARTMENT OF COMPUTER SCIENCE & APPLICATIONS
KURUKSHETRA UNIVERSITY, KURUKSHETRA

Session: 2023-24
Part A - Introduction
Subject COMPUTER APPLICATIONS
Semester I
Name of the Course Programming with Python
Course Code B23-CAC-101
Course Type: CC
(CC/MCC/MDC/CC-
M/DSEC/VOC/DSE/PC/AEC/
VAC)
Level of the course (As per 100-199
Annexure-I
Pre-requisite for the course (if NA
any)
Course Learning Outcomes(CLO): After completing this course, the learner will be able to:
1. Write simple programs using built-in data structures
in Python.
2. Implement arrays and user defined functions in
Python.
3. Solve problems in the respective domain using
suitable programming constructs in Python.
4. Solve problems in the respective domain using the
concepts of object oriented programming in
Python.
____________________________________________
5*. to implement the programs based on various
concepts of Python.
Credits Theory Practical Total
3 1 4
Contact Hours 3 2 5
Max. Marks:100(70(T)+30(P)) Time: 3 Hrs.(T), 3Hrs.(P)
Internal Assessment Marks:30(20(T)+10(P))
End Term Exam Marks: 70(50(T)+20(P))
Part B- Contents of the Course
Instructions for Paper- Setter
Examiner will set a total of nine questions. Out of which first question will be compulsory.
Remaining eight questions will be set from four unit selecting two questions from each unit.
Examination will be of three-hour duration. All questions will carry equal marks. First question
will comprise of short answer type questions covering entire syllabus.

7
Candidate will have to attempt five questions in all, selecting one question from each unit. First
question will be compulsory.
Practicum will be evaluated by an external and an internal examiner. Examination will be of
three-hour duration.
Unit Topics Contact
Hours
I Introduction to Programming: Problem solving strategies; Structure 5
of a Python program; Syntax and semantics; Executing simple
programs in Python.
II Creating Python Programs: Identifiers and keywords; Literals, 13
numbers, and strings; Operators; Expressions; Input/output
statements; Defining functions; Control structures (conditional
statements, loop control statements, break, continue and pass, exit
function), default arguments.
III Built-in data structures: Mutable and immutable objects; Strings, 14
built-in functions for string, string traversal, string operators and
operations; Lists creation, traversal, slicing and splitting operations,
passing list to a function; Tuples, sets, dictionaries and their
operations.
IV File and exception handling: File handling through libraries; Errors 8
and exception handling.
V* Practicum: 25
Students are advised to do laboratory/practical practice not limited
to, but including the following types of problems:
 WAP to find the roots of a quadratic equation.
 WAP to accept a number ‘n’ and (a). Check if ’n’ is prime
(b). Generate all prime numbers till ‘n’ (c). Generate first ‘n’
prime numbers (d). This program may be done using
functions.
 WAP that accepts a character and performs the following:
(a). print whether the character is a letter or numeric digit or a
special character (b). if the character is a letter, print whether
the letter is uppercase or lowercase (c). if the character is a
numeric digit, prints its name in text (e.g., if input is 9, output
is NINE)
 WAP to perform the following operations on a string (a).
Find the frequency of a character in a string. (b). Replace a
character by another character in a string. (c). Remove the
first occurrence of a character from a string. (d). Remove all
occurrences of a character from a string.
 WAP to swap the first n characters of two strings.
 Write a function that accepts two strings and returns the
indices of all the occurrences of the second string in the first
string as a list. If the second string is not present in the first
string, then it should return -1.
 WAP to create a list of the cubes of only the even integers
appearing in the input list (may have elements of other types
8
also) using the following: (a). 'for' loop (b). list
comprehension
 WAP to read a file and (a). Print the total number of
characters, words and lines in the file. (b). Calculate the
frequency of each character in the file. Use a variable of
dictionary type to maintain the count. (c). Print the words in
reverse order. (d). Copy even lines of the file to a file named
‘File1’ and odd lines to another file named ‘File2’.
 Write a function that prints a dictionary where the keys are
numbers between 1 and 5 and the values are cubes of the
keys.
 Consider a tuple t1= (1, 2, 5, 7, 9, 2, 4, 6, 8, 10). WAP to
perform following operations: (a). Print half the values of the
tuple in one line and the other half in the next line. (b). Print
another tuple whose values are even numbers in the given
tuple. (c). Concatenate a tuple t2= (11,13,15) with t1. (d).
Return maximum and minimum value from this tuple
 WAP to accept a name from a user. Raise and handle
appropriate exception(s) if the text entered by the user
contains digits and/or special characters.
Suggested Evaluation Methods
Internal Assessment: End Term
➢ Theory Examination:
 Class Participation: 5 A three hour
 Seminar/presentation/assignment/quiz/class test etc.: 5 exam for both
 Mid-Term Exam: 10 theory and
practicum.
➢ Practicum
 Class Participation: 5
 Seminar/Demonstration/Viva-voce/Lab records etc.: 5
 Mid-Term Exam: NA

Part C-Learning Resources


Recommended Books/e-resources/LMS:
 Taneja, S., Kumar, N., Python Programming- A Modular Approach, Pearson Education
India, 2018.
 Balaguruswamy E., Introduction to Computing and Problem Solving using Python, 2nd
edition, McGraw Hill Education, 2018.
 Brown, Martin C., Python: The Complete Reference, 2nd edition, McGraw Hill
Education, 2018.
 Guttag, J.V. Introduction to computation and programming using Python, 2 nd edition,
MIT Press, 2016

*Applicable for courses having practical component.

9
DEPARTMENT OF COMPUTER SCIENCE & APPLICATIONS
KURUKSHETRA UNIVERSITY, KURUKSHETRA

Session: 2023-24
Part A - Introduction
Subject COMPUTER APPLICATIONS
Semester I
Name of the Course Operating Systems
Course Code B23-CAC-102 (Common with B23-CSE-301)
Course Type: MCC
(CC/MCC/MDC/CC-
M/DSEC/VOC/DSE/PC/AEC/
VAC)
Level of the course (As per 100-199
Annexure-I
Pre-requisite for the course (if
any)
Course Learning Outcomes(CLO): After completing this course, the learner will be able to:
1. understand the basic concepts of operating systems
and its services along with process management.
2. understand concept of process scheduling and acquire
knowledge of process synchronization.
3. learn about memory management and virtual memory
concepts.
4. learn to work with directory structure and security
aspects.
____________________________________________
5*. to implement the programs based on operating
systems.
Credits Theory Practical Total
3 1 4
Contact Hours 3 2 5
Max. Marks:100(70(T)+30(P)) Time: 3 Hrs.(T), 3Hrs.(P)
Internal Assessment Marks:30(20(T)+10(P))
End Term Exam Marks: 70(50(T)+20(P))
Part B- Contents of the Course
Instructions for Paper- Setter
Examiner will set a total of nine questions. Out of which first question will be compulsory.
Remaining eight questions will be set from four unit selecting two questions from each unit.
Examination will be of three-hour duration. All questions will carry equal marks. First question
will comprise of short answer type questions covering entire syllabus.
Candidate will have to attempt five questions in all, selecting one question from each unit. First

10
question will be compulsory.
Practicum will be evaluated by an external and an internal examiner. Examination will be of
three-hour duration.
Unit Topics Contact
Hours
I Introductory Concepts: Operating System, Functions and 10
Characteristics, Historical Evolution of Operating Systems, Operating
System Structure.
Types of Operating System: Real time, Multiprogramming,
Multiprocessing, Batch processing.
Operating System Services, Operating System Interface, Service
System Calls, System Programs.
Process Management: Process Concepts, Operations on Processes,
Process States and Process Control Block. Inter-Process
Communication.
II CPU Scheduling: Scheduling Criteria, Levels of Scheduling, 10
Scheduling Algorithms, Multiple Processor Scheduling, Algorithm
Evaluation.
Synchronization: Critical Section Problem, Semaphores, Classical
Problem of Synchronization, Monitors.
Deadlocks: Deadlock Characterization, Methods for Handling
Deadlocks, Deadlock Prevention, Deadlock Avoidance, Deadlock
Detection and Recovery.
III Memory Management Strategies: Memory Management of Single- 10
User and Multiuser Operating System, Partitioning, Swapping,
Contiguous Memory Allocation, Paging and Segmentation;
Virtual Memory Management: Demand Paging, Page Replacement
Algorithms, Thrashing.
IV Implementing File System: File System Structure, File System 10
Implantation, file operations, Type of Files, Directory
Implementation, Allocation Methods, and Free Space Management.
Disk Scheduling algorithm- SSTF, Scan, C- Scan, Look, C-Look.
SSD Management.
V* Practicum: 25
Students are advised to do laboratory/practical practice not limited
to, but including the following types of problems:
 Working with various operating systems, and performing
different operations using operating system.
 Write a program to print file details including owner access
permissions, file access time, where file name is given as
argument.
 Write a program to copy files using system calls.
 Write a program to implement FCFS scheduling algorithm.
 Write a program to implement Round Robin scheduling
algorithm.
 Write a program to implement SJF scheduling algorithm.
 Write a program to implement non-preemptive priority based
11
scheduling algorithm.
 Write a program to implement preemptive priority based
scheduling algorithm.
 Write a program to implement SRJF scheduling algorithm.
 Write a program to calculate sum of n numbers using thread
library.
 Write a program to implement first-fit, best-fit and worst-fit
allocation strategies.
Suggested Evaluation Methods
Internal Assessment: End Term
➢ Theory Examination:
 Class Participation: 5 A three hour
 Seminar/presentation/assignment/quiz/class test etc.: 5 exam for both
 Mid-Term Exam: 10 theory and
practicum.
➢ Practicum
 Class Participation: 5
 Seminar/Demonstration/Viva-voce/Lab records etc.: 5
 Mid-Term Exam: NA

Part C-Learning Resources


Recommended Books/e-resources/LMS:
 Silberschatz A., Galvin P.B., and Gagne G., Operating System Concepts, John Wiley &
Sons.
 Godbole, A.S., Operating Systems, Tata McGraw-Hill Publishing Company, New Delhi.
 Deitel, H.M., Operating Systems, Addison- Wesley Publishing Company, New York.
 Tanenbaum, A.S., Operating System- Design and Implementation, Prentice Hall of
India, New Delhi.

*Applicable for courses having practical component.

12
DEPARTMENT OF COMPUTER SCIENCE & APPLICATIONS
KURUKSHETRA UNIVERSITY, KURUKSHETRA

Session: 2023-24
Part A - Introduction
Subject COMPUTER SCIENCE/ COMPUTER APPLICATIONS
Semester I
Name of the Course Basics of Computer Science
Course Code B23-CAC-103 (Common with B23-CSE-103)
Course Type: CC-M
(CC/MCC/MDC/CC-
M/DSEC/VOC/DSE/PC/AEC/
VAC)
Level of the course (As per 100-199
Annexure-I
Pre-requisite for the course (if
any)
Course Learning Outcomes (CLO): After learning this course student will be able:

1. To introduce to the students, the basic understanding


of the working of a computer system.
2. To familiarize the students with the concept of
algorithms and flowchart.
3. To familiarize the students with the various types of
software.
4. To make the students familiar with the basic internet
technology and concepts.
Credits Theory Practical Total
1 1 2
Contact Hours 1 2 3
Max. Marks:50(30(T)+20(P)) Time: 3 Hrs.(T), 3Hrs.(P)
Internal Assessment Marks:15(10(T)+5(P))
End Term Exam Marks:35(20(T)+15(P))
PartB-Contentsofthe Course
Instructions for Paper- Setter
Unit Topics Contact
Hours
I Introduction to Computers: Definition of Computers, History 4
and Generations of Computers, Characteristics of computer,
Classification of Computers. Fundamental Block diagram of
Computer: CPU, Input & Output Unit.

13
II Software: Definition of Software, Types of Software-System 4
software, Application software and Utility software. Types of
Computer Languages, Assemblers, Interpreters, Compiler.
III Introduction to Operating Systems: Types of Operating System, 4
Functions of Operating System.
Windows: Introduction to Windows, Starting Windows, Desk
Top, Task Bar, Opening and closing applications, icons-
creating, renaming and removing. Date and Time setting,
Working with files and folders-creating, deleting, opening,
finding, copying, moving, and renaming.
IV Networking: Concept, Basic Elements of a Communication 4
System, Data Transmission Media, LAN, MAN, WAN.
Introduction of Internet and WWW, Basic working of a Web
Browser, Introduction to popular web browsers.
V* Practicum: 25
Students are advised to do laboratory/practical practice not
limited to, but including the following types of problems:
 Dismantling the system unit, recognize all major
components inside a PC, describe function of each
component and define the relationship of internal
components
 Explore and describe some system utility like regedit,
memory portioning, control panel, window tools.
 Understanding control panel
 Date and Time setting.
 Working with files and folders-creating, deleting,
opening, finding, copying, moving, and renaming.
Suggested Evaluation Methods
Internal Assessment: End Term
➢ Theory Examination:
 Class Participation: 4 A three hour exam
 Seminar/presentation/assignment/quiz/class test etc.: NA for both theory and
 Mid-Term Exam: 6 practicum.
➢ Practicum
 Class Participation: NA
 Seminar/Demonstration/Viva-voce/Lab records etc.: 5
 Mid-Term Exam: NA

Part C-Learning Resources


Text /Reference Books:
 Fundamentals of Computers, V. Rajaraman 6th edition PHI Learning Private Limited
2014
 Peter Norton: Computing Fundamentals. 6th Edition, McGraw Hill-Osborne,2007
 Alexis Leon and Marthews Leon: Introduction to Computers, Leon Vikas,1999.
 Internet Basics. E. Douglas Commer PHI.

14
*Applicable for courses having practical component.

15
DEPARTMENT OF COMPUTER SCIENCE & APPLICATIONS
KURUKSHETRA UNIVERSITY, KURUKSHETRA

Session: 2023-24
Part A - Introduction
Subject COMPUTER SCIENCE/ COMPUTER APPLICATIONS
Semester I
Name of the Course Fundamentals of Computer Science
Course Code B23-CAC-104 (Common with B23-CSE-104)
Course Type: MDC
(CC/MCC/MDC/CC-
M/DSEC/VOC/DSE/PC/AEC/
VAC)
Level of the course (As per 100-199
Annexure-I
Pre-requisite for the course (if
any)
Course Learning Outcomes(CLO): After completing this course, the learner will be able to:
1. understand the basic concepts of operating systems
2. do the basic editing and formatting in a document
3. create basic spread-sheets for different purposes
4. create basic presentations for different applications
____________________________________________
5*. to understand the working of operating system and
various office tools practically.
Credits Theory Practical Total
2 1 3
Contact Hours 2 2 4
Max. Marks:75(50(T)+25(P)) Time: 3 Hrs.(T), 3Hrs.(P)
Internal Assessment Marks:20(15(T)+5(P))
End Term Exam Marks: 55(35(T)+20(P))
Part B- Contents of the Course
Instructions for Paper- Setter
Examiner will set a total of nine questions. Out of which first question will be compulsory.
Remaining eight questions will be set from four unit selecting two questions from each unit.
Examination will be of three-hour duration. All questions will carry equal marks. First question
will comprise of short answer type questions covering entire syllabus.
Candidate will have to attempt five questions in all, selecting one question from each unit. First
question will be compulsory.
Practicum will be evaluated by an external and an internal examiner. Examination will be of
three-hour duration.
Unit Topics Contact
16
Hours
I Computer Fundamentals: Evolution of Computers through 7
generations, Characteristics of Computers, Strengths and
Limitations of Computers, Classification of Computers, Functional
Components of a Computer System, Applications of computers in
Various Fields. Types of Software: System software, Application
software, Utility Software.
II Memory Systems: Concept of bit, byte, word, nibble, storage 7
locations and addresses, measuring units of storage capacity, access
time, concept of memory hierarchy. Primary Memory - RAM,
ROM, PROM, EPROM. Secondary Memory - Types of storage
devices, Magnetic Tape, Hard Disk, Optical Disk, Flash Memory.
I/O Devices: I/O Ports of a Desk Top Computer, Device Controller,
Device Driver. Input Devices: classification and use, keyboard,
pointing devices - mouse, touch pad and track ball, joystick,
magnetic stripes, scanner, digital camera, and microphone Output
Devices: speaker, monitor, printers: classification, laser, ink jet,
dot-matrix. Plotter.
III Introduction to Operating System: Definition, Functions, Features 5
of Operating System, Icon, Folder, File, Start Button, Task Bar,
Status Buttons, Folders, Shortcuts, Recycle Bin, Desktop, My
Computer, My Documents, Windows Explorer, Control Panel.
IV The Internet: Introduction to networks and internet, history, 6
Internet, Working of the Internet, Modes of Connecting to Internet.
Electronic Mail: Introduction, advantages and disadvantages, User
Ids, Passwords, e-mail addresses, message components, message
composition, mailer features. Browsers and search engines.
V* Operating System: 25
 Starting with basics of Operating Systems and its
functionalities
Computer Basics:
 Identify the various computer hardware
 Understanding the working of computer
 Understanding various types of software
Internet and E-mail:
 Using Internet for various tasks
 Creating and using e-mail.
Suggested Evaluation Methods
Internal Assessment: End Term
➢ Theory Examination:
 Class Participation: 4 A three hour
 Seminar/presentation/assignment/quiz/class test etc.:4 exam for both
 Mid-Term Exam: 7 theory and
practicum.
➢ Practicum
 Class Participation: 2
 Seminar/Demonstration/Viva-voce/Lab records etc.:3
17
 Mid-Term Exam: NA

Part C-Learning Resources


Recommended Books/e-resources/LMS:
 Sinha, P.K. & Sinha, Priti, Computer Fundamentals, BPB.
 Dromey, R.G., How to Solve it By Computer, PHI.
 Norton, Peter, Introduction to Computer, McGraw-Hill.
 Leon, Alexis & Leon, Mathews, Introduction to Computers, Leon Tech World.
 Rajaraman, V., Fundamentals of Computers, PHI.

*Applicable for courses having practical component.

18

You might also like