BCA 4th Sem Full Syllabus
BCA 4th Sem Full Syllabus
1
DEPARTMENT OF COMPUTER SCIENCE & APPLICATIONS
KURUKSHETRA UNIVERSITY, KURUKSHETRA
Session: 2023-24
Part A - Introduction
Subject BCA
Semester IV
Name of the Course Data Structures and Applications
Course Code B23-CAP-401
Course Type: CC
(CC/MCC/MDC/CC-
M/DSEC/VOC/DSE/PC/AEC/
VAC)
Level of the course (As per 200-299
Annexure-I
Pre-requisite for the course (if Knowledge of any Computer Programming Language
any)
Course Learning Outcomes(CLO): After completing this course, the learner will be able to:
1. learn the basics of data structure and algorithm
complexities.
2. acquire knowledge of arrays and strings.
3. understand the idea of implementation for linked
lists and stacks.
4. learn various searching and sorting techniques
along with the implementation of queues.
5* develop the project with data structures.
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
The 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.
2
Unit Topics Contact
Hours
I Data Structure Definition, Data Type vs. Data Structure, 11
Classification of Data Structures, Data Structure Operations,
Applications of Data Structures.
Algorithm Specifications: Performance Analysis and Measurement
(Time and Space Analysis of Algorithms- Average, Best and Worst
Case Analysis).
Arrays: Introduction, Linear Arrays, Representation of Linear Array
in Memory, Two Dimensional and Multidimensional Arrays, Sparse
Matrix and its Representation, Operations on Array: Algorithm for
Traversal, Selection, Insertion, Deletion and its implementation.
II String Handling: Storage of Strings, Operations on Strings viz., 11
Length, Concatenation, Substring, Insertion, Deletion, Replacement,
Pattern Matching
Linked List: Introduction, Array vs. linked list, Representation of
linked lists in Memory, Traversing a Linked List, Insertion, Deletion,
Searching into a Linked list, Type of Linked List.
III Stack: Array Representation of Stack, Linked List Representation of 12
Stack, Algorithms for Push and Pop, Application of Stack: Polish
Notation, Postfix Evaluation Algorithms, Infix to Postfix Conversion,
Infix to Prefix Conversion, Recursion.
Introduction to Queues: Simple Queue, Double Ended Queue,
Circular Queue, Priority Queue, Representation of Queues as Linked
List and Array, Applications of Queue. Algorithm on Insertion and
Deletion in Simple Queue and Circular Queue. Priority Queues.
IV Tree: Definitions and Concepts, Representation of Binary Tree, 11
Binary Tree Traversal (Inorder, postorder, preorder), Binary Search
Trees – Definition, Operations viz., searching, insertions and deletion;
Searching and Sorting Techniques, Sorting Techniques: Bubble sort,
Merge sort, Selection sort, Quick sort, Insertion Sort. Searching
Techniques: Sequential Searching, Binary Searching.
V* Practicum: 30
Students are advised to do laboratory/practical practice not limited
to but including the following types of problems:
Write a program that uses functions to perform the following
operations on an array i) Creation ii) Insertion iii) Deletion iv)
Traversal.
Write a program that uses functions to perform the following
operations on strings i) Creation ii) Insertion iii) Deletion iv)
Traversal.
Write a program that uses functions to perform the following
operations on a singly linked list i) Creation ii) Insertion iii)
Deletion iv) Traversal.
Write a program that uses functions to perform the following
operations on a doubly linked list i) Creation ii) Insertion iii)
Deletion iv) Traversal
Write a program that implement stack (its operations) using
i) Arrays ii) Linked list(Pointers).
3
Write a program that implements Queue (its operations) using
i) Arrays and ii) Linked lists (Pointers).
Write a program that implements the following sorting
i) Bubble sort ii) Selection sort iii) Quick sort.
Write programs for various types of tree traversals.
Suggested Evaluation Methods
Internal Assessment: End-Term
➢ Theory Examination: A
Class Participation: 5 three-hour exam
Seminar/presentation/assignment/quiz/class test etc.: 5 for both theory
Mid-Term Exam: 10 and practicum.
➢ Practicum End Term
Exam Marks:
Class Participation: NA
70(50(T)+20(P)
Seminar/Demonstration/Viva-voce/Lab records etc.: 10
)
Mid-Term Exam: NA
Part C-Learning Resources
Recommended Books/e-resources/LMS:
Seymour Lipschutz, Data Structures, Tata McGraw- Hill Publishing Company Limited,
Schaum’s Outlines.
Yedidyan Langsam, Moshe J. Augenstein, and Aaron M. Tenenbaum, Data Structures
Using C, Pearson Education.
Trembley, J.P. And Sorenson P.G., An Introduction to Data Structures with Applications,
McGraw-Hill.
Mark Allen Weiss, Data Structures and Algorithm Analysis in C, Addison- Wesley.
4
DEPARTMENT OF COMPUTER SCIENCE & APPLICATIONS
KURUKSHETRA UNIVERSITY, KURUKSHETRA
Session: 2023-24
Part A - Introduction
Subject BCA
Semester IV
Name of the Course Front-end Development
Course Code B23-CAP-402
Course Type: CC
(CC/MCC/MDC/CC-
M/DSEC/VOC/DSE/PC/AEC/
VAC)
Level of the course (As per 200-299
Annexure-I
Pre-requisite for the course (if B23-CAP-202
any)
Course Learning Outcomes(CLO): After completing this course, the learner will be able to:
1. understand the basic concept of objects and regular
expressions in JavaScript;
2. acquire knowledge of JavaScript events and DOM
3. learn to use forms and BOM in JavaScript;
4. get familiar with jQuery
5*. Understand the programming of web pages and
handling events using JavaScript and jQuery.
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
The examiner will set a total of nine questions. Out of which the first question will be compulsory.
The remaining eight questions will be set from four units selecting two questions from each unit.
The examination will be of three-hour duration. All questions will carry equal marks. The first
question will comprise short answer-type questions covering the entire syllabus.
The candidate will have to attempt five questions in all, selecting one question from each unit.
The first question will be compulsory.
5
The practicum will be evaluated by an external and an internal examiner. Examination will
be of three-hour duration.
Unit Topics Contact
Hours
I Objects in JavaScript: Introduction to objects, Type of objects in 11
JavaScript, creating objects, Object methods, Constructor function,
Prototype in JavaScript, Inheritance using prototype chain.
Regular Expressions: Introduction to RegExp, Regular expression
usage, Modifiers, RegExp patterns, RegExp methods, String methods
for RegExp, Type conversion in JavaScript.
II Event handling: JavaScript events, Event handler, Event flow, Event 11
bubbling and capturing, Event listeners, Event types.
Document Object Model (DOM): Introduction to DOM, Types of
DOM, DOM standards and methods, Manipulating documents using
DOM, Handling images, Table manipulation, Animation, Node and
Node-list handling
III Browser Object Model (BOM): Introduction to BOM, DOM vs BOM 12
differences, Window object and methods, BOM navigator, BOM
history, BOM location, BOM timer, Introduction to Cookies, Session
and persistent cookies.
Form Handling: Introduction to forms, Form processing, Forms
object, Accessing data from forms, Form validation, Additional
features in forms, Validation APIs
IV Introduction to jQuery: jQuery Syntax, jQuery Selectors, jQuery 11
Events, jQuery Effects, jQuery HTML, jQuery Traversing, jQuery
AJAX, jQuery Misc.
V* Practicum: 30
Students are advised to do laboratory/practical practice not limited to
but including the following types of problems:
Use of JavaScript in Web page designing
Effective web page design
Creation of Event listeners in JavaScript
Update and modify website elements dynamically using
asynchronously retrieved data
Style HTML content with JavaScript
Iterate over arrays and objects using JavaScript for syntax.
JavaScript Program to Create Objects (4 Different Ways)
JavaScript Program to Iterate Over an Object
JavaScript Program to Find Max/Min Value of an Attribute in
an Array of Objects
JavaScript Program to Remove Duplicates from an Array of
Objects
Writing programs for event handling in JavaScript.
Write a JavaScript function to add rows to a table.
Write a JavaScript program to remove items from a drop-down
list.
Write a JavaScript program to calculate sphere volume.
6
Write a JavaScript program to get the window width and
height
Using BOM navigation and location
Creating cookies and sessions.
How can you create forms and perform validations on the
forms?
How can you use jQuery and perform various functions
using jQuery?
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
End Term
Class Participation: NA Exam Marks:
Seminar/Demonstration/Viva-voce/Lab records etc.: 10 70(50(T)+20(
Mid-Term Exam: NA P))
Part C-Learning Resources
Recommended Books/e-resources/LMS:
David Flanagan, JavaScript: The Definitive Guide: The Definitive Guide.
Kogent Learning, Web Technologies: HTML, JavaScript, PHP, Java, JSP, XML, AJAX
– Black Book, Wiley India Pvt. Ltd.
JavaScript and jQuery: Interactive Front-End Web Development by Jon Duckett
Head First JavaScript Programming: A Brain-Friendly Guide by Elisabeth
Robson and Eric Freeman
7
DEPARTMENT OF COMPUTER SCIENCE & APPLICATIONS
KURUKSHETRA UNIVERSITY, KURUKSHETRA
Session: 2023-24
Part A - Introduction
Subject BCA
Semester IV
Name of the Course Computer Graphics
Course Code B23-CAP-403
Course Type: CC
(CC/MCC/MDC/CC-
M/DSEC/VOC/DSE/PC/AEC/
VAC)
Level of the course (As per 200-299
Annexure-I
Pre-requisite for the course (if Basic Knowledge of computer
any)
Course Learning Outcomes(CLO): After completing this course, the learner will be able to:
1. understand the concepts of computer graphics
2. learn and implement point, line, and circle drawing
algorithms.
3. acquire knowledge of two-dimensional
transformations and line clipping algorithms.
4. understand 3-D graphics concepts and acquire skills for
designing 3-D graphics
5*. to design programs based on theoretical concepts of
Computer Graphics.
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))
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.
The candidate must 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.
8
Part B- Contents of the Course
Unit Topics Contact
Hours
I Introduction: History of Computer Graphics (CG), 11
Applications of Computer Graphics, Components of interactive
graphics systems
Display devices: Refresh CRT, Color CRT, Plasma Panel
displays LCD Panels, Raster-scan System, Random scan
System, Graphic software, Input/Output Devices, Tablets
II Output Primitives: Points and Lines, Line Drawing Algorithms: 11
DDA algorithm, Bresenham’s algorithm,
Circle drawing Algorithms: Polynomial Method, Bresenham’s
algorithm. Parametric representation of Cubic Curves, Bezier
Curves
III 2D Transformation: Use of Homogeneous Coordinates 12
Systems, Composite Transformation: Translation, Scaling,
Rotation, Mirror Reflection, Rotation about an Arbitrary Point.
Clipping and Windowing, Clipping Operations.
Line Clipping Algorithms: The Mid-Point subdivision
method, Cohen-Sutherland Line Clipping Algorithms, Polygon
Clipping, Sutherland Hodgeman Algorithms, Text Clipping.
IV 3-D Graphics: 3-D object representations, 3-D 11
Transformations: Translation, Rotation, Scaling, Projections,
Hidden surface elimination: Back face removal, Depth Buffer
algorithm, Scan-line algorithm, Depth sort algorithm, Shading.
V* The following activities be carried out/ discussed in the lab 30
during the semester.
Programming Lab:
Implement DDA line drawing algorithm for all types
of slope.
Implement Bresenham’s line drawing algorithm for all
types of slopes.
Implement Bresenham’s Circle drawing algorithm.
Implement Bresenham’s Ellipse drawing algorithm.
Implement various 2-D transformations on objects like
lines, rectangles, etc.
Implement to clip a line using the Mid-Point subdivision
algorithm
Implement to clip a line using Cohen-Sutherland
algorithm
Implement 3-D transformations on objects.
Suggested Evaluation Methods
Internal Assessment: End Term
➢ Theory Examination:
Class Participation: 5 A three-hour exam
Seminar/presentation/assignment/quiz/class test etc.: 5 for both theory and
Mid-Term Exam: 10 practicum.
End Term Exam
➢ Practicum
9
Class Participation: NA Marks:
Seminar/Demonstration/Viva-voce/Lab records etc.: 10 70(50(T)+20(P))
Mid-Term Exam: NA
Part C-Learning Resources
Recommended Books/e-resources/LMS:
Donald Hearn, M. Pauline Baker, Computer Graphics, Pearson Education.
J. D. Foley, A. Van Dam, S. K. Feiner and J. F. Hughes, Computer Graphics - Principles
and Practice, Pearson Education.
Newmann & Sproull, Principles of Interactive Computer Graphics, McGraw Hill.
Rogers, David F., Procedural Elements of Computer Graphics, McGraw Hill.
Zhigang Xiang, Roy Plastock, Computer Graphics, Tata McGraw Hill.
10
DEPARTMENT OF COMPUTER SCIENCE & APPLICATIONS
KURUKSHETRA UNIVERSITY, KURUKSHETRA
Session: 2023-24
Part A - Introduction
Subject COMPUTER SCIENCE
Semester II
Name of the Course Graphic Designing
Course Code B23-VOC-201
Course Type: VOC
(CC/MCC/MDC/CC-
M/DSEC/VOC/DSE/PC/AEC/
VAC)
Level of the course (As per
Annexure-I
Pre-requisite for the course (if
any)
Course Learning Outcomes(CLO): After completing this course, the learner will be able to:
1. Perform basic to intermediate image correction to
existing images
2. Enhance images using advance editing tools to create
magazine covers
3. Work with the Type tools and panels to type, insert
and manage text
4. Work with layers and masks to manage your projects
efficiently
5. Design various types of documents/cards/logos/etc.
____________________________________________
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
9
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 Elements of design- Types of Lines, Line Compositions, 10
Different types of Shapes-Geometric, Organic, Free-form,
Natural, and Shape, composition, Positive &Negative.
Textures- Physical &Visual, Texture Composition, Form
Space-Positive &Negative
II Introduction to Photoshop: 10
The Photoshop Interface, setting up a new Photoshop
document, Saving a new document, The Default Palettes,
Working with Photoshop Palettes, The Photoshop Toolbox and
Options bar, Using Guides and Ruler, Supported import in
export image formats, Opening an Image in Photoshop,
Creating Images in Photoshop, Saving Images in Photoshop,
Basic Image Editing, Changing Image Size, Cropping an
Image, Changing Color/Bit Depth, Optimizing Images using
Save for Web, Working with Color in Photoshop.
III Photoshop Tools 10
Move tool, Crop tool, Slice tools, Pencil, Paintbrush, Eraser
tools, History brushes, Clonetamp-Pattern stamp, healing brush
tool, Retouch tool, Gradient, Paint bucket, Burn- DodgeSponge,
Blur-Sharpen-Smudge, Shapes-Line rectangle- polygon-custom
shapes, Path, selection tool, Pen tool, Type tools, Notes Tool-
Audio annotation, Eyedropper-Color sampler Measure tool,
Hand-Zoom, Quick Mask-Screen modes, Jump to Image
Ready, Back ground and Foreground.
IV Photoshop Layers 10
About Layers-Fill and adjustment layers, The Layer Palette,
Naming Layers, Creating Layers, Deleting Layers, Viewing
Layers, Moving Layers, Layer Opacity, Locking Layers,
Merging Layers, Layer modes and blending options, Image
composting using layers.
V* Apply Photoshop skills to demonstrate following: 25
Use basic selection tools and edge refinement to isolate
and edit parts of an image.
Manipulate layers through ordering, positioning,
scaling, rotation, and adjustments.
Create composite images that demonstrate advanced
selection and layering techniques.
Prepare images for Web and print output with
appropriate sizing and resolution.
Apply painted masks, selection-based masks, gradient
masks, and blend modes to create sophisticated image
effects.
10
Create adjustment layers for editable, non-destructive
changes to image coloration and exposure.
Set and modify typography using the full range of type
tools, the Character panel, and the Paragraph panel.
Apply special effects to typography using masks, paths,
and layer styles.
Use preset brushes and custom brushes to colorize
images, enhance images, and build illustrations.
Suggested Evaluation Methods
Internal Assessment: End Term
➢ Theory Examination:
Class Participation: 5 A three hour exam for
Seminar/presentation/assignment/quiz/class test etc.: 5 both theory and
Mid-Term Exam: 10 practicum.
➢ Practicum
Class Participation: 5
Seminar/Demonstration/Viva-voce/Lab records etc.: 5
Mid-Term Exam: NA
11
9
English
Semester-IV
Nomenclature of the Course: English Language and Communication Skills: Level 4
Course Code: B23-AEC-411
Subject Philosophy
Semester Second
Course Type:
(CC/MCC/MDC/CC-M/DSEC/VOC/DSE/PC/AEC/VAC) VAC
Course Learning Outcomes(CLO): After completing this course, the learner will be able to
know/understand:
301.1. the ethical values from Indian Cultural Heritage.
301.2. the Values and Life Skills.
301.3. the Ethical Dilemmas and Various Ethical
Dimensions.
301.4. the Effective Communication in Everyday Life.
34(1799)
Theory Tutorial Total
Credits 02 00 02
Contact Hours 02 00 02
The paper-setter is requested to set Nine questions in all i.e., One Compulsory Objective Type Question (7x1) without any choice, equitably
distributed over the whole syllabi and Two Questions from Each Unit equitably spread over the concerned unit. The examinees will have to
attempt Five questions in all, selecting one question from each unit. All questions carry equal marks.
I 8
Ethical Values from Indian Cultural Heritage: Vasudhaiva Kutumbakam; PrursharthaLoksangrah
Value of Service ( Sikhism)
II Life Skills: Empathy; Adaptability; Conserving our natural resources; 8
34(1800)
IV Cultural Values of Festivals: Lohri; Holi; Baisakhi; Navratri; Roza Ramzan; Onam; Deepawali; 7
Christmas
Recommended Books/e-resources/LMS:
Ashok Kumar Verma : Nitishastra ki Rooprekha.
J.N.Sinha : Manual of Ethics (Hindi Version also Available).
Sri Aurobindo : Essays on the Gita.
S.K. Maitra : The Ethics of the Hindus.
H.P. Sinha: Dharma Darshan ki Ruprekha.
34(1801)