BCA1 Syllabus

Download as docx, pdf, or txt
Download as docx, pdf, or txt
You are on page 1of 30

Semester Study Scheme with contact hours, assigned

credits & distribution of marks


SEMESTER- I
Pre-
requisite
Periods/Week Marks
Course, Dura
S. Cours Cr
Course Title of if any tion
N e ed
Type Course Contin End of
o. Code its
Titl Co Tot uous Semes To Exam
L T P
e de al Assess ter tal
ment Exam
Compulsory Courses
Foundati 4.5CA1 Elements of 20
1 NA NA 3 1 0 4 100 100 3 4
on 00C00 Mathematics 0
Introduction
4.5CA1 to IT & 20
2 Core NA NA 3 0 0 3 100 100 3 3
00C01 Programmin 0
g in C
4.5CA1 Web 20
3 Core NA NA 3 0 0 3 100 100 3 3
01C01 Technologies 0
Database
4.5CA1 20
4 Core Management NA NA 3 0 0 3 100 100 3 3
02C01 0
System
C
4.5CA1 10
5 Core Programmin NA NA 0 0 4 4 50 50 3 2
51C01 0
g Lab
Web
4.5CA1 10
6 Core Technologies NA NA 0 0 2 2 50 50 3 1
52C01 0
Lab
Database
4.5CA1 10
7 Core Management NA NA 0 0 2 2 50 50 3 1
53C01 0
System Lab
4.5SBS Indian
20
8 AEC S100C Knowledge NA NA 2 0 0 2 100 100 3 2
0
04 System
Placement
4.5CD
Competency 10
9 SEC C196C NA NA 0 0 4 4 50 50 3 1
Enhancemen 0
05
t-I
Total 20
FIRST
SEMESTE
R
MANAV RACHNA INTERNATIONAL INSTITUTE OF
RESEARCH & STUDIES
(Deemed to be a University under section 3 of the UGC Act 1956)

4.5CA100C00: ELEMENTS OF MATHEMATICS

Periods/week Credits Max. Marks:


200
L: 3 T: 1 4 Continuous Evaluation: 100
Duration of Examination: 3 Hrs End Semester
Examination:100

Pre-Requisite: NA
Course Type: Foundation

Course Outcomes: At the end of the course, the student will be able to:
4.5CA100C00.1 Understand the concept of matrices along with its
operations
4.5CA100C00.2. Analyze the concept of power and exponent.
4.5CA100C00.3. Compute word problems using permutation and
combination.
4.5CA100C00.4. Demonstrate the rules of continuity and differentiation to
evaluate elementary functions.
4.5CA100C00.5. Apply the concept of power series to find the expansion
of any given function.

UNIT 1: Matrices and Determinants


1.1Matrices
1.2Types of matrices
1.3Operation on matrices
1.4Scalar multiplication and multiplication of matrices
1.5Determinant
1.6Inverse of matrices
1.7 Cramer’s Rule
1.8 Rank of matrix

UNIT 2: Indices and Surds


2.1 Basics of indices
2.2 Applications of indices
2.3 Basics of surds
2.4 Applications of surds
2.5 Concept of Logarithm
2.6 Applications of Logarithm

UNIT 3: Binomial and Permutations, Combinations


3.1 Definition and basics of binominal theorem
3.2 Positive index
3.3 Applications of binomial theorem (Only positive index)
3.4 Basics of Permutations and Combinations
UNIT 4: Trigonometry
4.1 Systems of measuring angles
4.2 Trigonometric functions
4.3 Identities and signs
4.4 Values of t-ratios
4.5 t-ratios of allied angles
4.6 Addition and subtraction formulae
4.7 Transformation of products into sum or difference of t-ratios

UNIT 5: Continuity and Differentiation


5.1 Elementary results on limits
5.2 Continuity
5.3 Differentiation
5.4 Derivatives of composite functions
5.5 Differentiation of implicit functions
5.6 Differentiation of parametric forms

UNIT 6: Taylor’s & Maclaurin’s Theorems


6.1 Definition of Taylor’s theorem
6.2 Application of Taylor’s theorem
6.3 Definition of Maclaurin’s Theorems
6.4 Applications of Maclaurin’s Theorems
6.5 Applications to expansion of functions.

Suggested Readings:
1. Dr. Babu Ram, 2012,Engineering Mathematics ,Pearson Education
2. D. C. Sancheti, V K Kapoor, 2014, Business Mathematics, Sultan Chand
3. Birkhauser, 2009, 103 Trigonometry Problems, Universities Press
4. Shanti Narayan, 2005, Differential Calculus,S.Chand

Note: Only latest editions of the books are recommended.

Web links:
http://www.hec.ca/en/cam/help/topics/Matrix_determinants.pdfhttp://
www.kkuniyuk.com/PrecalcBook/Precalc08.pdfhttps://www.oup.com.au/
__data/assets/pdf_file/0028/58276/IM9_5.2-
5.3_ch11_Surds_and_indices.pdfhttp://www.schurzhs.org/ourpages/auto/
2015/9/6/44741179/Chapter%205%20Indices%20and%20Surds%
20pg_%2096%20-%20135.pdf (Last visited date:21 May 2024)
https://www.vedantu.com/ncert-solutions/ncert-solutions-class-10-maths-
chapter-8-introduction-totrigonometry (Last visited date:21 May 2024)
http://www.ctr.maths.lu.se/media/MATA14/2014ht2014/Taylor_series.pdf
(Last visited date:21 May 2024)

Guidelines for the End Semester Question Paper:


 The question paper will be divided into 2 parts, with one question in
Part A and four questions in Part B. The questions will be of 20 marks
each.
 In Part A, the first question will consist of 10 conceptual questions (2
marks each) covering the entire syllabus and all the COs (up to BTL 3).
There will be no choice in question 1.
 In Part B (question number 2 to 5), there can be an internal choice
between each of the questions covering the same (set) of COs and BTL. All
COs will be covered in Part B.

Distribution of Continuous Evaluation Table

Sessional I 30
Sessional II 30
Assignment 20
Class Performance 10
Attendance 10

Assessment Tools:
Assignment/Tutorials
Sessional tests
Surprise questions during lectures/Class Performance
Term end examination

COURSE ARTICULATION MATRIX:

CO-PO P P P P
PO PO PO PO PO PO PO PO PS PS
Statemen O O O O
1 3 5 6 9 10 11 12 O1 O2
t 2 4 7 8
4.5CA100
1 1 2 2 3
C00 .1
4.5CA100
1 1 2 3 3
C00.2
4.5CA100
1 1 1 2 3 3 2 1
C00.3
4.5CA100
1 1 1 2 2 2 3 1
C00.4
4.5CA100
1 1 2 3 3
C00.5
MANAV RACHNA INTERNATIONAL INSTITUTE OF
RESEARCH AND STUDIES
(Deemed to be University under section 3 of the UGC Act 1956)

4.5CA101C01: INTRODUCTIONTO IT & PROGRAMMING IN C

Periods/week Credits Max. Marks: 200


L: 3 T: 0 3 Continuous Evaluation:100
Duration of Examination: 3 Hrs End Semester
Examination: 100

Pre-Requisite: NA
Course Type: Core

Course Outcomes: At the end of the course, students will be able to


4.5CA101C01.1.Identify and analyse top-down and bottom-up strategies
of programming.
4.5CA101C01.2. Understand the key hardware components in a modern
computer system and how software is mapped to the hardware.
4.5CA101C01.3. Examine the relationships and interactions between the
different parts of a complex problem.
4.5CA101C01.4. Design flowcharts, pseudo-code and decision tables for
solving real-time problems.
4.5CA101C01.5. Compare and contrast the various algorithmic solutions
to solve a particular problem.

UNIT 1: Information Technology Fundamentals


1.1Introduction to Computers: Basics of computer, Characteristics of
computers, Limitations of computers, Number System, System
Components, Input devices, Output devices, Computer Memory
1.2Introduction to Assemblers
1.3Introduction to Compilers, Interpreters, Linkers
1.4Techniques of Problem-Solving: Flowcharting, Algorithm, Pseudocode
1.5Browser and Internet basics.
1.6Email and Social Media Tools

UNIT 2: Basics of CLanguage and its Preprocessor


2.1Preprocessor: various preprocessor directives.
2.2Tokens, identifiers and keywords; constants and variables
2.3Program structure
2.4Data Types
2.5 Operators: Arithmetic; Relational; Logical; Bitwise; Increment;
Decrement; Assignment, Conditional operators
2.6Compilation and execution of C program in DOS

UNIT 3: I/O Functions and Control Statements


3.1Built in I/O functions: getch(); getche(); getchar(); putch(); putchar()
3.2Console based formatted I/O: printf(); scanf()
3.3Selection: if; nested if; If-else-if
3.4Iteration: for; while and do-while loop
3.5Alternative and Jump: switch statement; break; continue; goto; exit()
function

UNIT 4: Arrays and String


4.1Arrays: Single- and two-dimensional arrays
4.2Accessing and Initializing an Array
4.3Advantages and Disadvantages of Arrays
4.4Applications of Arrays
4.5Concept of Strings
4.6String Manipulation Functions
4.7String I/O functions: gets() ,puts(),getchar() and putchar().

UNIT 5: Functions
5.1Functions: Declaration and definition
5.2Function Prototype
5.3Passing parameters to Functions
5.4Sharing variables between functions
5.5Variable scope: local and global variables
5.6Call by reference and call by value
5.7Introduction to recursion

UNIT 6: Structure and Union, Pointers


6.1Structure and Union: Declaration and initializing
6.2Accessing members
6.3Array of structure and union
6.4Pointers: Basics of pointer
6.5Pointer operator
6.6Application of pointer
6.7Precedence of &, * operators.
6.8Array and Pointers; Dynamic memory allocation (malloc (), calloc ()
realloc())

Suggested Readings:
1. Byron Gottorfried, 2010, Schaum’s Outline of Programming with C,
Tata McGraw- Hill.
2. E. Balaguruswami, 2010, Programming in ANSI ‘C’, Tata McGraw- Hill.
3. YashwantKanetkar,2017, Let Us C ,BPB Publications
4. AshokKamthane, 2006, Programming with ANSI and TURBO C, Pearson
Publications

Note: Only the latest editions of the books are recommended.

Software required/ Web links:


https://sourceforge.net/projects/orwelldevcpp/ (Last visited date:21 May
2024)
http://www.codeblocks.org/ (Last visited date:21 May 2024)
Guidelines for the End Semester Question Paper:
 The question paper will be divided into 2 parts, with one question in
Part A and four questions in Part B. The questions will be of 20 marks
each.
 In Part A, the first question will consist of 10 conceptual questions (2
marks each) covering the entire syllabus and all the COs (up to BTL 3).
There will be no choice in question 1.
 In Part B (question number 2 to 5), there can be an internal choice
between each of the questions covering the same (set) of COs and BTL. All
COs will be covered in Part B.

Distribution of Continuous Evaluation Table

Sessional I 30
Sessional II 30
Assignment 20
Class Performance 10
Attendance 10

Assessment Tools:
Assignment/Tutorials
Sessional tests
Surprise questions during lectures/Class Performance
Term end examination

COURSE ARTICULATION MATRIX:


CO-PO P P P P
PO PO PO PO PO PO PO PO PS PS
Statemen O O O O
1 3 5 6 9 10 11 12 O1 O2
t 2 4 7 8
4.5CA101
2 2 2 1 2 1
C01.1
4.5CA101
2 1 2 1 1 1
C01.2
4.5CA101
2 3 2 2 1 2 3 2
C01.3
4.5CA101
1 2 2 2 2 2 2 2
C01.4
4.5CA101
3 3 3 2 1 2 1 1
C01.5
MANAV RACHNA INTERNATIONAL INSTITUTE OF
RESEARCH & STUDIES
(Deemed to be a University under section 3 of the UGC Act 1956)

4.5CA152C01 WEB TECHNOLOGIES

Periods/week Credits Max. Marks:


200
L: 3 T: 3 Continuous Evaluation: 100
Duration of Examination: 3 Hrs End Term
Examination: 100

Prerequisite: NA
Course Type: Core

Course Outcomes: At the end of the course, the student will be able to:
4.5CA152C01.1 Understand the concept of the World Wide Web and its
applications
4.5CA152C01.2 Learn the basics of HTML and its structure
4.5CA152C01.3 Integrate CSS with HTML for designing interactive web
pages.
4.5CA152C01 .4 Apply basic syntax and semantics of JavaScript to create
a dynamic web page
4.5CA152C01 .5 Compare and explore server-side scripting and database
integration for dynamic web applications.

UNIT 1: Introduction to Networks, Protocols and Web


Technologies
1.1History of Networks &Their Types
1.2Internet and its Applications
1.3Internet Addressing
1.4History and Evolution of the Web
1.5 Web Architecture and Components
1.6 Web Standards and the W3C
1.7Different Web Browsers and their Characteristics
1.8Search Engines and their Features

UNIT 2: User Interface Design using HTML


2.1 Introduction to HTML
2.2 Different HTML Documents
2.3 Basic Structure of HTML Document
2.4 Markup Tags used in HTML
2.5 Heading-Paragraphs and Line Breaks
2.6 Elements of HTML: Working with Text
2.7 Working with Hyperlinks
2.8 Images and Multimedia used in HTML

UNIT 3: Lists, Tables and Forms in HTML


3.1Lists in HTML
3.2Ordered and Unordered List
3.3Definition List and Directory List
3.4HTML table and its Structure
3.5Table Formatting, Spanning of multiple rows and columns.
3.6Forms in HTML
3.7Creating Forms using <FORM> tag
3.8Named Input Fields: Text Box; Radio Button; Check Box; List Box;
Combo Box
3.9Creating Submit, Reset Button,andMultiple Line Text Windows
UNIT 4: Cascading Style Sheets (CSS)
4.1Introduction to Cascading Style Sheets
4.2The Need for Style Sheets
4.3Basic Syntax and Structure of Style Sheets
4.4Inline Style sheets; Internal Style sheets; External Style sheets;
Embedding Style sheets
4.5Linking External Style sheets
4.6Background; Manipulating Text; Margins and Padding
4.7Positioning using CSS

UNIT 5: JavaScript Basics


5.1 Introduction to JavaScript
5.2 Variables, Data Types, and Operators
5.3 Control Structures: Conditionals and Loops
5.4 Functions and Scope
5.5 Events and Event Handling
5.6 Manipulating the DOM
5.7 Objects and Array
5.8 Asynchronous JavaScript: Callbacks, Promises, and Async/Await
5.9 Error Handling and Debugging
5.10Using JavaScript Libraries (e.g., jQuery)

UNIT 6: Server-Side Scripting and Introduction to Databases


6.1 Introduction to Server-Side Technologies
6.2 Setting up a Server with Node.js and Express.js
6.3 Building RESTful APIs
6.4 Middleware and Routing
6.5 Overview of Other Server-Side Languages: PHP, ASP.NET
6.6 Introduction to Databases and Basics of SQL
6.7 Connecting to Databases from Server-Side Scripts
6.8 Performing CRUD Operations
6.9 Introduction to NoSQL Databases (e.g., MongoDB)

Suggested Readings:
1. Ivan Bayross,2005, HTML, DHTML, PERL, CGI, BPB Publications.
2. Behrouz A. Forouzan,2013, Data Communication and Networking,
McGraw Hill.
3. Stuart Langridge, 2005, DHTML Utopia - Modern Web Design Using
JavaScript &DOM,Sitepoint.
4.Elizabeth Castro,2013, HTML 4 for World Wide Web: Visual Quick Start
Guide,Peachpit Press.

Note: Only the latest editions of the books are recommended.

Software required/ Weblinks:


W3schools.com (Last visited date: 17 May 2024)
https://www.tutorialspoint.com/html/ (Last visited date:17 May 2024)
https://www.csstutorial.net/ (Last visited date:17 May 2024)
https://javascript.info/ (Last visited date:17 May 2024)

Guidelines for the End Semester Question Paper:


 The question paper will be divided into 2 parts, with one question in
Part A and four questions in Part B. The questions will be of 20 marks
each.
 In Part A, the first question will consist of 10 conceptual questions (2
marks each) covering the entire syllabus and all the COs (up to BTL 3).
There will be no choice in question 1.
 In Part B (question number 2 to 5), there can be an internal choice
between each of the questions covering the same (set) of COs and BTL. All
COs will be covered in Part B.

Distribution of Continuous Evaluation Table

Sessional I 30%
Sessional II 30%
Assignment 20%
Class Performance 10%
Attendance 10%

Assessment Tools:
Assignment/Tutorials
Sessional tests
Surprise questions during lectures/Class Performance
End Term Examination
COURSE ARTICULATION MATRIX:

CO-PO P P P P P P P P P P
PO PO PS PS
Stateme O O O O O O O O O 1
10 11 O1 O2
nt 1 2 3 4 5 6 7 8 9 2
4.5CA15
3 2 3 1 3 3
2C01.1
4.5CA15
3 2 2 3 3 3
2C01.2
4.5CA15
2 3 1 3 3 3
2C01.3
4.5CA15
3 2 3 1 3
2C01.4
4.5CA15 2 2 3 3 3
2C01.5
MANAV RACHNA INTERNATIONAL INSTITUTE OF
RESEARCH & STUDIES
(Deemed to be University under section 3 of the UGC Act 1956)

4.5CA103C01: DATABASE MANAGEMENT SYSTEM

Periods/week Credits Max. Marks: 200


L:3 T: 0 3 Continuous Evaluation:100
Duration of Examination: 3 Hrs End Semester
Examination: 100

Pre-Requisite: NA
Course Type: Core

Course Outcomes: At the end of the course, students will be able to


4.5CA103C01.1. Learn the concept of databases.
4.5CA103C01.2. Understand the three-schema architecture of database
system.
4.5CA103C01.3. Study various strategies of database security and
recovery.
4.5CA103C01.4. Apply the query-based data on a given set of conditions.
4.5CA103C01.5. Analyse the interface that works with a normalised
database.
4.5CA103C01.6. Develop a database schema from a problem statement
to conceptualise the database design.

UNIT 1: Introduction to Database


1.1Database:Definition
1.2Characteristics of database approach
1.3Components of a DBMS
1.4Advantages and disadvantages of a DBMS
1.5Applications of DBMS
1.6Database system Vs file system
1.7Three level architecture of a DBMS
1.8DBMS architecture

UNIT 2: Data Modeling using Entity Relationship Model


2.1 Data Independence: physical independence; logical independence
2.2 Data Dictionary
2.3 Role of DBA
2.4 Data Models: Hierarchal, Network, Relational Data Models
2.5Introduction: Entities; Entity types; Entity set;Attributes
2.6E-R Diagram; Case Studies to represent E-R Diagram

UNIT 3: Domains, Keys and SQL


3.1 Concept of Keys: Primary Key; Candidate Key; Composite Key;
Alternate Key; Secondary Key; Foreign Key
3.2 Constraints: Relational Constraints, Domain Constraints, Key
Constraints, Integrity Constraints
3.3 Relational Algebra: set operations; basic operations
3.4Rrelational calculus
3.5Introduction to SQL:History of SQL; Basic Structure
3.6DDL Commands, DML Commands
3.7 SQL functions: Character functions, Aggregate Functions, Date
functions

UNIT 4: Normalization
4.1 Anomalies in databases and its solution
4.2 Functional dependencies: Full, Partial, Transitive, Multi-valued
4.3 Introduction to normalization
4.4 Advantages of Normalization
4.5Normal Forms: 1NF, 2NF, 3NF, BCNF for Relational Databases
4.6 Case study to implement normalization on data

UNIT 5: Concurrency Control


5.1 Transaction Management: Introduction; Transaction properties;
Transaction states
5.2 Introduction to Concurrency Control
5.3 Problems of concurrent transaction
5.4Locks: Introduction; types of locks
5.5 Algorithms of concurrency control

UNIT 6: Advanced Concepts in Databases


6.1 Data base Security: Introduction; security risks
6.2 Techniques to implement data base security
6.3 Data base Recovery: Introduction; causes of failure
6.4 Recovery Methods: log based recovery; checkpoints; shadow paging
6.5Introduction to Distributed Databases

Suggested Readings:
1. R.Elmasri, S.B. Navathe,2016, Fundamentals of Database Systems ,
Pearson Education/Addison Wesley
2. Parteek Bhatia, Gurvinder Singh, 2016, Simplified approach to
DBMS,Kalyani Publishers
3.Thomas Cannolly and Caroly
4.Henry F Korth, Abraham Silberschatz,2011, Database System
Concepts,McGraw Hill

Note: Only latest editions of the books are recommended.

Software required/Weblinks:
ORACLE 10g
https://www.tutorialspoint.com/dbms (Last visited date:21 May 2024)
https://www.w3schools.in › DBMS (Last visited date:21 May 2024)
Guidelines for the End Semester Question Paper:
 The question paper will be divided into 2 parts, with one question in
Part A and four questions in Part B. The questions will be of 20 marks
each.
 In Part A, the first question will consist of 10 conceptual questions (2
marks each) covering the entire syllabus and all the COs (up to BTL 3).
There will be no choice in question 1.
 In Part B (question number 2 to 5), there can be an internal choice
between each of the questions covering the same (set) of COs and BTL. All
COs will be covered in Part B.
Distribution of Continuous Evaluation Table

Sessional I 30
Sessional II 30
Assignment 20
Class Performance 10
Attendance 10

Assessment Tools:
Assignment/Tutorials
Sessional tests
Surprise questions during lectures/Class Performance
Term end examination

COURSE ARTICULATION MATRIX:

CO-PO P P P P
PO PO PO PO PO PO PO PO PS PS
Statemen O O O O
1 3 5 6 9 10 11 12 O1 O2
t 2 4 7 8
4.5CA103
1 2 2 2 3
C01 .1
4.5CA103
3 2 1 1 2 3
C01.2
4.5CA103
2 2 2 1 3 3
C01.3
4.5CA103
2 2 2 3 3
C01.4
4.5CA103
2 3 3 2 3
C01.5
4.5CA103
3 2 3 2
C01.6
MANAV RACHNA INTERNATIONAL INSTITUTE OF
RESEARCH AND STUDIES
(Deemed to be University under section 3 of the UGC Act 1956)

4.5CA151C01: C PROGRAMMING LAB

Periods/week Credits Max. Marks: 100


P: 4 T:0 2 Continuous Evaluation: 50
Duration of Examination: 3 Hrs End Semester
Examination: 50

Pre-Requisite: NA
Course Type: Core

Course Outcomes: At the end of the course, students will be able to


4.5CA151C01.1. Explain the concepts of Procedural programming.
4.5CA151C01.2. Solve basic programming problems using the building
blocks of C Language.
4.5CA151C01.3. Design programs involving decision structures and
loops.
4.5CA151C01.4. Create programs using the concept of dynamic memory
management.
4.5CA151C01.5. Design an application to solve a simple real-life or
mathematical problem.

List of Experiments:
Every student is required to maintain Practical File and write the following
steps in each practical:
a) Problem statement
b) Formula(s) used
c) Algorithm
d) Flow Chart
e) Source codes in student’s handwriting
f) Program listing (print-out)
g) Input & Output.

1. Write a Program to perform arithmetic operations (Addition,


Subtraction, Multiplication, Division) on two numbers.
2. Write a Program to calculate gross salary of an employee [using
formula:gross_sal = basic_sal+hra+da].
3. Write a program to find sum and reverse of three-digit number.
4. Write a Program to swap two numbers without using third variable.
5. Write a Program to print a table of any number.
6. Write a Program to find greatest in 3 numbers.
7. Write a Program to find that entered year is leap year or not.
8. Write a Program to find whether given no is even or odd.
9. Write a program to find the roots of a Quadratic Equation.
10. Write a Program to use switch statement. Display Monday to Sunday.
11.Write a Program to calculate power of a number using #DEFINE
12. Write a Program to display first 10 natural no & their sum.
13. Write a program to find the factorial of n number.
14. Write a program to generate the Fibonacci series up to n terms.
15. Write a Program to print stars Sequence.
*
**
***
****
*****
16. Write a Program to check whether given number is palindrome or not.
17. Write a Program to find the maximum no in an array.
18. Write a Program to search a number in an array.
19. Write a Program to find sum of two matrices.
20. Write a Program to find subtraction of two matrices.
21. Write a Program to find multiplication of two matrices.
22. Write a Program to find transpose of a matrix.
23. Write a Program to concatenate two strings without using strcat
function.
24. Write a Function to Check Prime and Armstrong Number by making
function
25. Write a Function to Convert binary number to decimal and vice-versa
26. Write a Program to create, initialize, assign and access a pointer
variable.
27. Write a function that reverses the elements of an array in place. The
function must accept only one pointer value and return void.
28. Write a Program to Create a structure Student containing fields for Roll
No., Name, Class, Year and Total Marks.
29. Write a Program to Add Two Distances (in inch-feet) System Using
Structures
30. Write a Program to Add Two Complex Numbers by Passing Structure to
a Function
31. Make a mini project based on above mentioned list of practical.
Suggested mini projects are:
a)Puzzle Game
b) Hangman Game
c)Weather widget
d)Contacts Management

Suggested Readings:
1. E.Balaguruswami, 2010, Programming in ANSI ‘C’ , Tata McGraw- Hill.
2. AshokKamthane,2006, Programming with ANSI and TURBO C , Pearson
Education.
3. K R. Venugopal, 2016, Mastering C ,Tata McGraw Hill.
4. Herbert Schildt, 2017, The Complete Reference , Tata McGraw Hill.
Note: Only the latest editions of the books are recommended.

Software Required
https://sourceforge.net/projects/orwelldevcpp/ (Last accessed: May 9,
2024) http://www.codeblocks.org/(Last accessed: May 9, 2024)

Distribution of Continuous Evaluation Table

Viva I 30%
Viva II 30%
File/Records 20%
Class Performance 10%
Attendance 10%

Assessment Tools:
Experiments in lab
File work/Class Performance
Viva (Question and answers in lab)
End Term Practical Exam
COURSE ARTICULATION MATRIX:
CO-PO
PO PO PO PO PO PO PO PO PO PO PO PO PS PS
Statemen
1 2 3 4 5 6 7 8 9 10 11 12 O1 O2
t
4.5CA151
2 2 2 3 3 3
C01.1
4.5CA151
1 2 2 1 1
C01.2
4.5CA151
1 2 2 1 1
C01.3
4.5CA151
2 2 3 3 3 1 1
C01.4
4.5CA151
1 2 3 3 2 1 2 2
C01.5
MANAV RACHNA INTERNATIONAL INSTITUTE OF RESEARCH &
STUDIES
(Deemed to be University under section 3 of the UGC Act 1956)

4.5CA152C01: WEB TECHNOLOGIES LAB

Periods/week Credits Max. Marks: 100


P: 4 T: 2 Continuous
Evaluation: 50
Duration of Examination: 3 Hrs End Semester
Examination: 50

Co-Requisite: NA
Course Type: Core

Course Outcomes: At the end of the course, the student will be able to:
4.5CA152C01.1 Apply markup language elements in web pages.
4.5CA152C01.2 Use Java scripting language to web pages.
4.5CA152C01.3 Implement cascading style sheets on web pages.
4.5CA152C01.4 Develop websites incorporating web technologies
(HTML,CSS and Javascript)

List of Experiments:
Every student is required to maintain Practical File and write the following
steps in each practical:
a) Problem statement
b) Formula(s) used
c) Algorithm
d) Flow Chart
e) Source codes in student’s handwriting
f) Program listing (print-out)
g) Input & Output.

HTML
1. Create a simple HTML page using basic tags.
2. Create a web page that displays your name to the screen.
3. Create a web page and show the output from 1 to 10 in separate lines.
4. Create a web page and show the output from 1 to 10 in separate lines,
each number being in different colour.
5. How do I make a picture as a background on my web pages?
6. Create a web page to print a paragraph with 4-5 sentences, each
sentence shall have a different font.
7. Write HTML code to print a paragraph that is description of a book, it
shall include the title of the book, its author name; name and title should
be underlined and all adjectives shall be bold and Italics.
8. Write HTML code to print your name using Heading tag, every letter
shall be of different heading size
9. WriteHTML code to print the sequence of numbers 1-20. Each number
shall be in different line with number 2 next to it as subscript, an equal
sign and the result.
10. Write HTML code to display an image with border of size with width
200, height 200 pixels, leaving Hspace and Vspace of your choice with
image hanging in the right side on the screen.
11. Write HTML code to create a web page with heading. The heading
shall be displayed at the top-center of the page and the image shall be at
the center, just below the heading.
12. Write HTML code using Multimedia tags.
13. Create a Table using Rowspan and Colspan taking example of student
Record.
14. Write HTML code using table tag <table> and cellpadding and
cellspacing as its attributes.
15. Create unordered, ordered and definition Lists taking example of your
subjects in MCA IST, IInd and IIIrd Semester.
16. Write HTML code using <frameset> and <frame> tag with all its
attributes
17. Write HTML code to design a form in HTML using controls and buttons
such as Teaxtbox, Textarea,
password, submit button, browse button, drop-down menu
18. Write HTML code to design a Registration Form in HTML.
19. Write HTML code to design a student admission Form in HTML.
20. Create a proper home page of your own using any components and
styles.
21. Write HTML code for including Local hyperlinking in a web page.
22. Write HTML code for including Inter hyperlinking in a web page.
23. Write HTML code for including External hyperlinking in a web page.
24. Write code to show External CSS with HTML code.
25. Write code to show Internal CSS with HTML code.
26. Write code to show Inline CSS with HTML code.
27. Write a program to add two numbers using form in Javascript.
28. Write a program in Javascript to swap two images using
OnmouseOver event.
29. Write a simple JavaScript program to sort an array.
30. Write a JavaScript program to take as input three numbers from the
user. Find the minimum and maximum of the three numbers. Print the
following output in BOLD in the following format:
MINIMUM =
MAXIMUM =
31. Make a mini project based on above mentioned list of practical.
Suggested mini projects are:
a). Student Admission Process for University:
Website will have all the necessary contents and number of web pages
pertaining the admission process of any university. The process will
inculcate the eligibility criteria, entrance exam and its result, based on the
fetched information, a student can get the admission in a particular
course in the University.
b). Movie Ticket Booking System:
The website will facilitate the advance booking of movie tickets, local
shows, applying discounts and different payment options for registered
users.

c). Online Food Order System:


The online portal will provide the complete food order from nearby
restaurants. The site will be first register the users and further go for
processing of orders.

d). Online Event Booking in Delhi/NCR


The website will show all the events details of Dehi/NCR to the registered
users. After taking and interest of the user, an appropriate notification will
be send to the user for an event.

Suggested Readings:
1. Ivan Bayross, HTML, DHTML, PERL, CGI, BPB Publications.
2. Behrouz A. Forouzan, Data Communication and Networking, McGraw
Hill.
3. Stuart Langridge, DHTML Utopia - Modern Web Design Using JavaScript
& DOM, Sitepoint.
4. Elizabeth Castro, HTML 4 for World Wide Web: Visual Quick Start Guide,
Peachpit Press.

Note: Only latest editions of the books are recommended.

Software required/Weblinks:
Notepad
Web Browser
https://www.tutorialspoint.com/html/ (Last accessed: May 9, 2024)
https://www.csstutorial.net/(Last accessed: May 9, 2024)
https://javascript.info/ (Last accessed: May 9, 2024)

Distribution of Continuous Evaluation Table

Viva I 30%
Viva II 30%
File /Records 20%
Class Performance 10%
Attendance 10%

Assessment Tools:
Experiments in lab
File work/Class Performance
Viva (Question and answers in lab)
End Term Practical Exam
COURSE ARTICULATION MATRIX:

CO-PO PO PO PO PO PO PO PO PO PO PO PO PO PS PS
Statement 1 2 3 4 5 6 7 8 9 10 11 12 O1 O2
4.5CA152C
3 3 2 2 2 3
01.1
4.5CA152C
1 3 3 2 2 3
01.2
4.5CA152C
3 3 2 2 2 3
01.3
4.5CA152C
2 1 3 2 2 3
01.4
MANAV RACHNA INTERNATIONAL INSTITUTE OF
RESEARCH & STUDIES
(Deemed to be University under section 3 of the UGC Act 1956)

4.5CA153C01: DATABASE MANAGEMENT SYSTEM LAB


Periods/week Credits Max.
Marks: 100
P: 2 T: 0 1 Continuous Evaluation: 50
Duration of Examination: 3 Hrs End Semester
Examination: 50

Pre-Requisite: NA
Course Type: Core

Course Outcomes: At the end of the course, students will be able to


4.5CA153C01.1. Create tables and databases using SQL.
4.5CA153C01.2. Design a query in database using SQL DML/DDL
commands
4.5CA153C01.3. Implement the relational databases in order to optimise
database performance in practice.
4.5CA153C01.4. Apply query-based data to any given set of conditions.
4.5CA153C01.5. Develop a database schema from a problem statement
to conceptualise the database design.

Q1: Create the following tables


Student
Column_name Data type Size Constraint
StudentId Number 4 Primary Key
Student name Varchar2 40 Not null
Address1 Varchar2 300
Gender Varchar2 15
Course Varchar2 8

Course:
CourseID Data type Size Constraint
DeptNo Number 2 Primary Key
Dname Varchar2 20
Location Varchar2 10

1. Insert five records for each table.


2. List all information about all students from student table
3. List all student numbers along with their Courses.
4. List Course names and locations from the Course table
5. List the details of the Students in MCA Course.
6. List the names of the employees whose employees numbers are 7369,
7777, 2233
7. List the employee names not belonging to the department 10, 40
8. List the employee names who are not eligible for commission.
9. List the employees whose names start with “S” not s.
10. List the employees ending with name “s”.
11. Display all the Arithmetic functions used in SQL.
12. List the names, salary and PF amount of all the employees (PF is
calculated as 10% of salary)
13. List the employee names having “k” as the second character.
14. List the students not assigned to any department.
15. List the students details in ascending order of course
16. List the number of Studentsin BCA course.
17. List the number of students available in student table.
18. Create a table with a primary key constraint.
19. Create a table with all column having not null constraints
20. Create a foreign key constraint in a table
21. Create a Table with a unique key constraint
22. Display the different students in department 1 and 2.
23. Display list of student ordered by course
24. Display alphabetically sorted list of students

Q2: Create the tables Customer and Orders as per the following:
Table CUSTOMER
column name Characteristic
SID Primary Key
Last_Name
First_Name

Table ORDERS
column name Characteristic
Order_ID Primary Key
Order_Date
Customer_SID Foreign Key
Amount Check >
20000

1. Insert five records for each table


2. The Customer_SID column in the ORDERS table is a foreign key
pointing to the SID column in the
CUSTOMER table.
3. List the details of the customers along with the amount.
4. List the customers whose names end with “s”.
5. List the orders where amount is between 21000 and 30000
6. List the orders where amount is increased by 500 and replace with
name “new amount”.
7. Display the order_id and total amount of orders
8. Calculate the total amount of orders that has more than 15000.
9. Display all the contents of s4 and s5 using union clause.
10. Find out the intersection of s4 and s5 tables.
11. Display the names of s4 and s5 tables using left, right, inner and full
join.
12. Display the first name of employee and their managers using self-join.
13. Find out the names of s4 which are distinct
14. Write a query to Grant access and modification rights to customer
table to user
15. Write a query to revoke access rights to customer table to user
16. Write a query to take backup of a database
17. Write a query to restore a database

Case Study:
Develop three different methods to combine data from multiple tables
into single result.
Tables are:

Event
Column_name Data type Size Constraint
Event_id Varchar2 6 Primary Key
Duration Number 20
Status_code Varchar2 6 Foreign Key
Reason_code Varchar2 15 Foreign Key

Status
Column_name Data type Size Constraint
Status_code Varchar2 6 Primary Key
Name Char 20

Ready Reason
Column_name Data type Size Constraint
Reason_code Varchar2 15 Primary Key
Name Char 20

Delay Reason
Column_name Data type Size Constraint
Reason_code Varchar2 15 Primary Key
Name Char 20

Method 1: Joining to the Status table to get the status name (using Inner
Join).
Method 2 : Utilizing UNION to Combine Reason Table Rows

Suggested Readings:
1. Parteek Bhatia, Gurvinder Singh,2016, Simplified approach to
DBMS ,Kalyani Publishers
2. IyanByross, 2010, Introduction to PL/SQL, BPB Publications
Softwarerequired/Web links:
ORACLE 10g
https://www.tutorialspoint.com/sql (Last accessed: May 9, 2024)
https://www.w3schools.com/sql/ (Last accessed: May 9, 2024)

Distribution of Continuous Evaluation Table

Viva I 30%
Viva II 30%
File/Records 20%
Class Performance 10%
Attendance 10%
Assessment Tools:
Experiments in lab
File work/Class Performance
Viva (Question and answers in lab)
End Term Practical Exam

COURSE ARTICULATION MATRIX:

CO-PO P P P P P P P P P
PO PO PO PS PS
Statemen O O O O O O O O O
10 11 12 O1 O2
t 1 2 3 4 5 6 7 8 9
4.5CA153
2 3 1 3 3 2 2 1 2 2 3 1
C01.1
4.5CA153
1 3 2 3 3 2 1 2 3
C01.2
4.5CA153
3 1 3 3 1 2 3
C01.3
4.5CA153
1 2 2 3 3 1 1 2 3
C01.4
4.5CA153
1 2 2 3 1 1 1 3 1
C01.5
MANAV RACHNA INTERNATIONAL INSTITUTE OF
RESEARCH & STUDIES
(Deemed to be University under section 3 of the UGC Act 1956)

4.5CDC196C05: Placement Competency Enhancement-I

Periods/week Credits
Max. Marks: 100
L: 0 T: 0 P: 4 1
Internal Evaluation: 50
Mode of End-Term Examination: Online +Practical End
Semester Examination: 50

Pre-Requisite: NA
Course Type: SEC

Course Outcomes: The students will be able to:


4.5CDC196C05.1: develop an all-round personality by mastering
interpersonal skills to function effectively in different circumstances.
4.5CDC196C05.2: demonstrate effective communication through
grammatically correct language.
4.5CDC196C05.3: apply effective listening and speaking skills in real-life
scenarios.
4.5CDC196C05.4: solve problems based on the number system, Average
& Progression.
4.5CDC196C05.5: solve problems based on verbal reasoning &
simplification.

Unit 1: Attitudinal Communication


1.1 Attitude and its Impact on Communication
1.2 Courtesy & Politeness in Communication
1.3 Diversity & Inclusion – Bullying, Cultural Sensitivity, Stereotypes,
Sexual Harassment, LGBTQ, Respect, Chivalry, Racial & Gender
Discrimination, Disability Harassment, Inclusion.

Unit 2: Syntactical Communication - I


2.1 Common errors in communication
2.2 Identification of word class
2.3 Errors & rectifications in
2.3.1 Article usage
2.3.2.Tenses usage - Present Perfect vs. Past Simple vs. Past Perfect

2.3.3 Subject Verb Agreement

Unit 3: Phonetics
3.1 Impact of First Language Influence
3.2 Tone
3.3 Intonation
3.4 Rate of Speech
3.5 Pronunciation: Vowels & Consonant sounds

Unit 4: Developing Communication Skills -I (Listening &


Speaking)
4.1 Concept of LSRW: Importance of LSRW in communication.
4.2 Listening Skills: Real-Life challenges, Barriers to Listening
4.3 Speaking: Self Introduction, Interview, GD, Resume

Unit 5: Number System


5.1 Vedic Mathematics
5.1.1 Basic mathematics
5.1.2 Addition and subtraction using Vedic Mathematics
5.1.3 Multiplication of two and three numbers.
5.2 Simplification
5.2.1 BODMAS rule
5.2.2 Fractions and recurring decimals
5.2.3 Surds and indices
5.3. Numbers
5.3.1 Types of numbers and number tree
5.3.2 Divisibility Rule
5.3.3 HCF & LCM
5.3.4 Factors and Multiples
5.3.5 Unit Digits &Cyclicity
5.3.6 Remainders
5.3.7 Factorials

Unit 6: Arithmetic 1
6.1 Averages
6.2 Progressions
6.3 Logarithm

Unit 7: Logical Reasoning 1


7.1 Direction Sense Test
7.2 Blood Relation Test
7.3 Ranking

Recommended Texts and Readings:


1. Abrams, D. A. (2019). Diversity and inclusion: The big six formula for
success (1st ed.). Da Abrams Books.
2. Wren, P. C., & Martin, H. (2017). High school English grammar and
composition (Revised ed.). S. Chand & Company Pvt. Ltd.
3. Lewis, N. (2015). Word power made easy (1st ed.). Penguin Random
House Pvt. Ltd.
4. Estrada, C. (2021). Soft skills for the rigid worker: How to authentically
lead, effectively manage, and master interpersonal relationships (1st ed.).
Anti Fragile Media Group.
5. Vyner, J. (2018). Mastering soft skills (1st ed.). Matador.
6. https://www.mckinsey.com/featured-insights/mckinsey-explainers/what-
is-diversity-equity-and-inclusion (Last accessed: May 9, 2024)

Assessment Tools:
● Continuous Assessment: Assignments/ Activities/ Quiz
● Sessional examination (Online mode) at 2nd sessional
● Term-end examination (Practical + Online mode)

Internal Marks Distribution:

Sessional 30 marks
examination at the
time of 2nd sessional

Continuous 15 marks
assessment

Attendance 5 marks

Course
PO PO PO PO PO PO PO PO PO PO PO PO PS PS
Outcome
1 2 3 4 5 6 7 8 9 10 11 12 O1 O2
(CO)

4.5CDC196 3 2 3 3
C05.1

4.5CDC196 2 3 3
C05.2

4.5CDC196 2 3 3
C05.3

4.5CDC196 2 3 2 3 2
C05.4

4.5CDC196 2 3 2 3 2
C05.5
Course Articulation Matrix:

You might also like