Kurukshetra University BCA 4th Semester Subjects

 Kurukshetra University 

BCA 4th Semester Subjects

 

KU - BCA 4th Semester - Subjects

Course

 

Subject Code

Subject Name

BCA 4th Sem

Main - Major

B23 CAP 401

Data Structures and Applications

BCA 4th Sem

Main - Major

B23-CAP-402

Front-end Development

BCA 4th Sem

Main - Major

B23-CAP-403

Computer Graphics

BCA 4th Sem

Main - Minor

CC-M4(V)

Fundamentals of E-Commerce

BCA 4th Sem

AEC-4

B23-AEC-411

English Language and Communication Skills: Level 4

BCA 4th Sem

VAC-3

B23-VAC-301

Constitutional Values and Fundamental Duties

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 (4th Semester) for Under-Graduate Programmes

Bachelor of Computer Applications (BCA)

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)

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/MCC/MDC/CC-

M/DSEC/VOC/DSE/PC/AEC/ VAC)

CC

Level of the course (As per Annexure-I

200-299

Pre-requisite for the course (if any)

Knowledge of any Computer Programming Language

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))

Internal Assessment Marks:30(20(T)+10(P)) End Term Exam Marks: 70(50(T)+20(P))

Time: 3 Hrs.(T), 3Hrs.(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.

Unit

Topics

Contact Hours

I

Data Structure Definition, Data Type vs. Data Structure, 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.

11

II

String Handling: Storage of Strings, Operations on Strings viz., 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.

11

III

Stack: Array Representation of Stack, Linked List Representation of 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.

12

IV

Tree: Definitions and Concepts, Representation of Binary Tree, 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.

11

V*

Practicum:

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).

30

 

 

·         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:

➢     Theory

·      Class Participation: 5

·      Seminar/presentation/assignment/quiz/class test etc.: 5

·      Mid-Term Exam: 10

➢     Practicum

·      Class Participation: NA

·      Seminar/Demonstration/Viva-voce/Lab records etc.: 10

·      Mid-Term Exam:     NA

End-Term Examination:A three-hour exam for both theory and practicum.

End Term Exam Marks: 70(50(T)+20(P)

)

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.

 

 

* Applicable for courses having practical components.





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/MCC/MDC/CC- M/DSEC/VOC/DSE/PC/AEC/

VAC)

CC

Level of the course (As per Annexure-I

200-299

Pre-requisite for the course (if any)

B23-CAP-202

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))

Internal Assessment Marks:30(20(T)+10(P)) End Term Exam Marks: 70(50(T)+20(P))

Time: 3 Hrs.(T), 3Hrs.(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.

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 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.

11

II

Event handling: JavaScript events, Event handler, Event flow, Event 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

11

III

Browser Object Model (BOM): Introduction to BOM, DOM vs BOM 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

12

IV

Introduction to jQuery: jQuery Syntax, jQuery Selectors, jQuery Events, jQuery Effects, jQuery HTML, jQuery Traversing, jQuery AJAX, jQuery Misc.

11

V*

Practicum:

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.

30

 

 

·         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:

➢     Theory

·      Class Participation: 5

·      Seminar/presentation/assignment/quiz/class test etc.: 5

·      Mid-Term Exam: 10

➢     Practicum

·      Class Participation: NA

·      Seminar/Demonstration/Viva-voce/Lab records etc.: 10

·      Mid-Term Exam:     NA

End-Term Examination: A three-hour exam for both theory and practicum.

End Term Exam Marks: 70(50(T)+20(

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

 Top BCA colleges in Delhi

*Applicable for courses having practical components.

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/MCC/MDC/CC- M/DSEC/VOC/DSE/PC/AEC/VAC)

CC

Level of the course (As per Annexure-I

200-299

Pre-requisite for the course (if any)

Basic Knowledge of computer

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))

Internal Assessment Marks:30(20(T)+10(P)) End Term Exam Marks: 70(50(T)+20(P))

Time: 3 Hrs.(T), 3Hrs.(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.

Part B- Contents of the Course

Unit

Topics

Contact Hours

I

Introduction: History of Computer Graphics (CG), 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

11

II

Output Primitives: Points and Lines, Line Drawing Algorithms: DDA algorithm, Bresenham’s algorithm,

Circle drawing Algorithms: Polynomial Method, Bresenham’s

algorithm. Parametric representation of Cubic Curves, Bezier Curves

11

III

2D Transformation: Use of Homogeneous Coordinates 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.

12

IV

3-D Graphics: 3-D object representations, 3-D Transformations: Translation, Rotation, Scaling, Projections, Hidden surface elimination: Back face removal, Depth Buffer

algorithm, Scan-line algorithm, Depth sort algorithm, Shading.

11

V*

The following activities be carried out/ discussed in the lab 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.

30

Suggested Evaluation Methods

Internal Assessment:

➢     Theory

·      Class Participation: 5

·      Seminar/presentation/assignment/quiz/class test etc.: 5

·      Mid-Term Exam: 10

➢     Practicum

End Term Examination:

A three-hour exam for both theory and practicum.

End Term Exam

 

·      Class Participation: NA

·      Seminar/Demonstration/Viva-voce/Lab records etc.: 10

·      Mid-Term Exam:     NA

Marks: 70(50(T)+20(P))

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.

 

*Applicable for courses having practical components.

 

BCA Colleges in Delhi

 

 



9

 

English Semester-IV

Nomenclature of the Course: English Language and Communication Skills: Level 4

Course Code: B23-AEC-411

Course Type: AEC-4

Level of the Course: 200-299

Credits: 2 (Theory 2)                                                                                           Total Marks: 50

End Term Exam Marks: 35 Internal Assessment Marks: 15

Exam Time: 3 Hrs.

Workload: Theory 2 hours

 

Course Learning Outcomes

After the successful completion of the course, the student will be able to:

E401.1. The students will enhance their vocabulary by learning formation of words. E401.2. They will learn the various types of sentences.

E401.3. They will comprehend the public speaking techniques and art of oratory.

E401.4. They will learn practical use of coherence in writing and contextual vocabulary

 

Contents of the Course:

Unit I: Vocabulary Building

Word formation and understating word roots, prefixes, and suffixes Unit II: Types of Sentences and Transformation of Sentences

Unit III: Public Speech, Persuasion Techniques

Various Aspects of Conversation: Starting a Conversation/Controlling a Conversation Unit IV: Coherence and Unity in a Paragraph, Transition Words and Phrases

Learning Contextual Vocabulary through Reading a Passage or Literary Text

Suggested Readings:

Lewis, Norman. Word Power Made Easy: The Complete Handbook for Building a Superior Vocabulary. Anchor, 2014.

Nida, Eugene A. Morphology: The Descriptive Analysis of Words. University of Michigan Press, 1965.

10

 

Tortora, Christina. Understanding Sentence Structure: An Introduction to English Syntax.

John Wiley & Sons, 2018.

 

 

Instructions to the Paper Setters:

1.                  Question No 1 will be compulsory and will have 7 parts based on all the four Units and the students will be required to attempt all the 7.

2.                  Question No 2 and 3 will be set on Unit-I covering the entire Unit. Students will be required to attempt any one.

3.                  Question No 4 and 5 will be set on Unit-II covering the entire Unit. Students will be required to attempt any one.

4.                  Question No 6 and 7 will be set on Unit-III covering the entire Unit. Students will be required to attempt any one.

5.                  Question No. 8 and 9 will be based on Unit-IV. Students will be required to attempt any one of these.

 

Evaluation of Internal Assessment

Internal Assessment (Theory) will be based on the following components.

i.            Class Participation                                    4 Marks

ii.            Seminar/Presentation/Assignments/

Quiz/Class Test etc.                                  4 Marks

iii.            Mid-Term Exam                                       7 Marks Total  15 Marks

 Kurukshetra University Kurukshetra Scheme of Examination for Undergraduate Subject Subject: Political Science

Course: Constitutional Values and Fundamental Duties (Value Added Course)

According to Curriculum Framework for Undergraduate Subject as per NEP 2020

 

 

Semester

Course Type

Course Code

Nomenclature of paper

Credits

Credits

Contact hours

Internal marks

End term Marks

Total Marks

Duration of exam (Hrs.)

Theory

Tutorial

T+T

3

VAC -3

B23-VAC-301

Constitutional Values and Fundamental Duties

2

2

NA

2

15

35

50

3

 

KURUKSHETRA UNIVERSITY KURUKSHETRA

Established by the State Legislature Act XIII of 1956 (‘A++’ Grade NAAC Accredited)

 

Syllabus of Examination for Undergraduate subject (Value Added Course): Semester-III

 

VAC - 3

Session 2023-2024

Part-A Introduction

Subject

Political Science

Semester

III

Name of the Course

Constitutional Values and Fundamental Duties

Course Code

B23-VAC-301

Course Type: (CC/MCC/MDC/ CCM/ DSEC/VOC/DSE/PC/AEC/ VAC

VAC

Level of the course (As per Annexure-I)

200-299

Pre-requisite for the course (if any)

NA

Course Learning Outcomes (CLO)

After completing this course, the learner will be able to:

1.      Understand the constitutional values like sovereignty, democracy and secularism.

2.      Develop an understanding of constitutional values of Justice, Liberty and Equality.

3.      Comprehend the fundamental duties of protection of institution, symbols and environment and development of scientific temper.

4.      Comprehend the fundamental duties of preservation of unity and integrity of the nation and culture and harmony.

Credits

Theory

Tutorial

Total

2

NA

2

Contact Hours

2 per week

NA

2 per week

Max. Marks:                              50

Internal Assessment Marks:     15

End Term Exam Marks:           35

Time: 3 Hours

Part-B Contents of the Course

Instructions for Paper Setters

1.      Total NINE Questions will be set and students will be required to attempt FIVE questions.

2.      Question No. 1 will be compulsory and will consist of 7 short answer type questions of 1 mark each spread over the entire syllabus.

3.      The remaining EIGHT questions will be set taking TWO questions from each of the four units. The

candidate would be required to attempt ONE question from each unit in addition to the compulsory question.

4.    Each question will carry 07 marks.

Unit

Topics

Contact Hours

I

Key Constitutional Values: Sovereignty, Democracy and Secularism

08

II

Key Constitutional Values: Justice, Liberty and Equality

08

III

Fundamental Duties: Protection of Institutions, Symbols and Environment; Development of Scientific Temper

08

IV

Fundamental Duties: Preservation of Unity and Integrity of the nation, composite culture and harmony

08

Suggested Evaluation Methods

Internal Assessment: 15 Marks

Class Participation: 04 Seminar/Presentation/Assignment/Quiz/Class Test etc: 04 Mid Term Exam: 07

End Term Examination:

35 Marks




 Top BCA colleges in North Delhi

 

 

Comments

Post a Comment

Popular posts from this blog

IP University Colleges List for BCA (2026)

Image
IP University Colleges List for BCA (2025) IP University Colleges List for BCA (2025) – Top Choices & Admission Guide Are you planning to pursue a Bachelor of Computer Applications (BCA) and considering IP University (Guru Gobind Singh Indraprastha University) in Delhi? You're on the right track! IP University is known for its quality education, experienced faculty, and industry-aligned curriculum, making it a top choice for BCA aspirants. Top IP University Colleges Offering BCA College Name Location Seats (Approx.) NAAC/Ranking Maharaja Surajmal Institute Janakpuri 180 NAAC 'A' Vivekananda Institute of Professional Studies (VIPS) Pitampura 240 NAAC 'A++' JIMS, Vasant Kunj Vasant Kunj 120 NAAC 'A' IITM Janakpuri 180 NAAC 'A' TIPS Dwarka 180 NAAC 'B++' FIMT Kapashera 120 NAAC 'B++' Bhai Parmanand Ins...
Read more

Kurukshetra University BCA 1st Sem Syllabus

Image
  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 Bachelor of Computer Applications ( BCA ) : SCHEME D 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) Kurukshetra University Kurukshetra Scheme of Examination for Undergraduate programmes Subject: BCA According to Curriculum Framework for Undergraduate Program...
Read more