Category III Single Subject Specialization

BCA I and II semester w.e.f 2024-25 onwards

Hour / Week Examination

Sem Course Code Courses Credits Theory Lab Term end Formative Total Duration of
ester Examination Assessment Marks exam
Max Marks Max Marks Hours
1 24BCACP1.1 Computers Fundamentals 4 04 -- 80 20 100 03

24BCACP1.2 C Programming 4 04 -- 80 20 100 03

24BCACP1.3 Digital Logic and Computer Design 4 04 -- 80 20 100 03
24BCACL1.4 C Programming Lab 2 -- 04 40 10 50 03
24BCACL1.5 Digital Logic and Computer Design 2 -- 04 40 10 50 03
Lab
Total 16 400
2 24BCACP2.1 Discrete Mathematical Structures 4 04 -- 80 20 100 03

24BCACP2.2 Data Structures using C 4 04 -- 80 20 100 03

24BCACP2.3 Database Management System 4 04 -- 80 20 100 03
24BCACL2.4 Data Structure Lab 2 -- 04 40 10 50 03
24BCACL2.5 RDBMS Lab 2 -- 04 40 10 50 03

Total 16 400

2| B C A I & I I 2 0 2 4 S E P
The Curriculum Framework for BCA degrees is intended to facilitate the students to
achieve the following.

 To develop an understanding and knowledge of the basic theory of Computer Science

and
 Information Technology with good foundation on theory, systems and applications such
as algorithms, data structures, data handling, data communication and computation
 To develop the ability to use this knowledge to analyse new situations in the application
domain
 To acquire necessary and state-of-the-art skills to take up industry challenges. The
objectives and outcomes are carefully designed to suit to the above-mentioned purpose.
 The ability to synthesize the acquired knowledge, understanding and experience for a
better and improved comprehension of the real-life problems
 To learn skills and tools like mathematics, statistics and electronics to find the solution,
interpret the results and make predictions for the future developments
 To formulate, to model, to design solutions, procedure and to use software tools to solve
real world problems and evaluate

The objectives of the Programme are:

1. The primary objective of this program is to provide a foundation of computing principles

and business practices for effectively using/managing information systems and enterprise
software
2. It helps students analyze the requirements for system development and exposes students
to business software and information systems
3. This course provides students with options to specialize in legacy application software,
system software or mobile applications
4. To produce outstanding IT professionals who can apply the theoretical knowledge into
practice in the real world and develop standalone live projects themselves
5. To provide opportunity for the study of modern methods of information processing and
its applications.
6. To develop among students the programming techniques and the problem- solving skills
through programming
7. To prepare students who wish to go on to further studies in computer science and related
subjects.
8. To acquaint students to Work effectively with a range of current, standard, Office
Productivity software applications

3| B C A I & I I 2 0 2 4 S E P
Program Outcomes:

1. Discipline knowledge: Acquiring knowledge on basics of Computer Science and ability

to apply to design principles in the development of solutions for problems of varying
complexity
2. Problem Solving: Improved reasoning with strong mathematical ability to Identify,
formulate and analyze problems related to computer science and exhibiting a sound
knowledge on data structures and algorithms.
3. Design and Development of Solutions: Ability to design and development of
algorithmic solutions to real world problems and acquiring a minimum knowledge on
statistics and optimization problems. Establishing excellent skills in applying various
design strategies for solving complex problems.
4. Programming a computer: Exhibiting strong skills required to program a computer for
various issues and problems of day-to-day applications with thorough knowledge on
programming languages of various levels.
5. Application Systems Knowledge: Possessing a sound knowledge on computer
application software and ability to design and develop app for applicative problems.
6. Modern Tool Usage: Identify, select and use a modern scientific and IT tool or
technique for modeling, prediction, data analysis and solving problems in the area of
Computer Science and making them mobile based application software.
7. Communication: Must have a reasonably good communication knowledge both in oral
and writing.
8. Project Management: Practicing of existing projects and becoming independent to
launch own project by identifying a gap in solutions.
9. Ethics on Profession, Environment and Society: Exhibiting professional ethics to
maintain the integrality in a working environment and also have concern on societal
impacts due to computer-based solutions for problems.
10. Lifelong Learning: Should become an independent learner. So, learn to learn ability.
11. Motivation to take up Higher Studies: Inspiration to continue educations towards
advanced studies on Computer Science.

4| B C A I & I I 2 0 2 4 S E P
 BCA I Semester wef 2024-25
Course Code: 24BCACP1.1 Course Title: Computers Fundamentals
Credits: 4 Hrs/Week: 4 Hrs Contact Hours: 60
Formative assessment: 20 marks Term end exam: 80 marks Exam duration: 03 hrs

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

 Introduction to computers, classification of computers, anatomy of computer, constituents

and architecture, micro-controllers
 Operating systems, functions of operating systems, classification of operating systems,
kernel, shell, basics of Unix, shell programming, booting
 Databases, why databases are used, users, SQL, data types in SQL, introduction of queries -
select, alter, update, delete, truncate, using where, and or in, not in
 Internet basics, features, applications, services, internet service providers, domain name
system, browsing, email, searching
 Web Programming basics, introduction of HTML and CSS programming
 Introduction of computers, classification of computers, anatomy of computer, constituents
and architecture, microcontrollers.

Unit – 1 12 Hrs.
Fundamentals of Computers: Introduction to Computers - Computer Definition,
Characteristics of Computers, Evolution and History of Computers, Types of Computers, Basic
Organization of a Digital Computer; Number Systems – different types, conversion from one
number system to another; Computer Codes – BCD, Gray Code, ASCII and Unicode; Boolean
Algebra – Boolean Operators with Truth Tables; Types of Software – System Software and
Utility Software; Computer Languages - Machine Level, Assembly Level & High Level
Languages, Translator Programs – Assembler, Interpreter and Compiler; Planning a Computer
Program - Algorithm, Flowchart and Pseudo code withExamples.

Unit-2 12 Hrs.
Introduction to computers: Characteristics of computers, Classification of Digital Computer
Systems: Microcomputers, Minicomputers, Mainframes, Super computers. Anatomy of
Computer: Introduction, Functions & Components of a Computer, Central Processing Unit,
Microprocessor, Storage units, Input and output Devices. How CPU and memory works. Program
execution with illustrative examples. Introduction to microcontrollers.

Unit-3 12 Hrs.
Operating System Fundamentals: Operating Systems: Introduction, Functions of an operating
System, Classification of Operating Systems, System programs, Application programs, Utilities,
The Unix Operating System, Basic Unix commands, Microkernel Based Operating System,

5| B C A I & I I 2 0 2 4 S E P
Booting.

Unit-4 12 Hrs.
Introduction to Database Management Systems: Database, DBMS, Why Database -File system
vs DBMS, Database applications, Database users, Introduction to SQL, Data types,
Classification of SQL-DDL with constraints, DML, DCL, TCL

Unit-5 12 Hrs.
Internet Basics: Introduction, Features of Internet, Internet application, Services of Internet,
Logical and physical addresses, Internet Service Providers, Domain Name System.
Web Basics: Introduction to web, web browsers, http/https, URL, HTML5, CSS

Text Books:

1. Pradeep K. Sinha and Priti Sinha: Computer Fundamentals (Sixth Edition), BPB Publication,
2010.
2. Computational thinking for modern solver, Fundamentals of Computers, E Balaguruswamy,
Mc Graw Hill
3. David Riley and Kenny Hunt, Chapman & Hall/CRC.

Reference:
1. Introduction to Computers, Peter Norton, McGraw Hill
2. J. Glenn Brook Shear, Computer Science: An Overview, Addison-Wesley, 12th Edition, June
2017.
3. R.G. Dromey, “How to solve it by Computer”, Prentice-Hall International Series in
computer science, C.A.R.HOARE Series Editor, PHI.

Course Code: 24BCACP1.2 Course Title: C Programming

Credits: 4 Hrs/Week: 4 Hrs Contact Hours: 60
Formative assessment: 20 marks Term end exam: 80 marks Exam duration: 03 hrs

Course Outcomes (COs): At the end of the course, students will be able to:
 Confidently operate Desktop Computers to carry out computational tasks
 Understand working of Hardware and Software and the importance of operating systems
 Understand programming languages, number systems, peripheral devices,networking,
multimedia and internet concepts
 Read, understand and trace the execution of programs written in C language
 Write the C code for a given problem
 Perform input and output operations using programs in C
 Write programs that perform operations on arrays

6| B C A I & I I 2 0 2 4 S E P
Unit – 1 12 Hrs.
Overview of C: History and importance of C; Structure of a C Program with Examples; Creating
and Executing a C Program; Compilation process in C.
Constants, variables and data types: Character Set; C tokens – keywords and identifiers,
constants, and variables; Data types; Declaration & initialization of variables.
Input and output with C: Formatted I/O functions - printf and scanf, Unformatted I/O functions
to read and display single character and a string - getchar, putchar, gets and puts functions.

Unit – 2 12 Hrs.
C Operators & Expressions: Arithmetic operators; Relational operators; Logical operators;
Assignment operators; Increment & Decrement operators; Bitwise operators; Conditional
operator; Special operators; Operator Precedence and Associatively; Evaluation of arithmetic
expressions; Type conversion.
Control Structures: Decision making Statements - Simple if, if_else, nested if_else, else_if
ladder, Switch Case, goto, break & continue statements; decision making and Looping Statements
- Entry controlled and exit controlled statements, while, do-while, for loops, Nested loops.

Unit – 3 12 Hrs.
Arrays: One Dimensional arrays - Declaration, Initialization; Two Dimensional arrays -
Declaration, Initialization, Multidimensional array.
Strings: Declaring & Initializing string variables; String handling functions - strlen, strcmp,
strcpy and strcat; Character handling functions - toascii, toupper, tolower, isalpha, isnumeric etc.

Unit – 4 12 Hrs.
User Defined Functions: Need for user defined functions; elements of user defined functions –
return values and their types; function calls and declaration, category of function, recursion.

Unit – 5 12 Hrs.
Pointers in C: Understanding pointers - Declaring and initializing pointers, accessing address
and value of variables using pointers; Pointers and Arrays; Pointer expressions; Advantages and
disadvantages of using pointers.
Structures and Unions - Structure Definition, accessing structure members, Structure members
initialization, comparing structure variables, Array of Structures; Unions - Union definition;
difference between Structures and Unions.

Text Books:
1. Programming in ANSI C, E. Balaguruswamy, 6th edition, Mc Graw Hill.
2. C: The Complete Reference, By Herbert Schildt. 4th Edition By Herbert Schildt .
3. C Programming Language, By Brain W. Kernighan, 2nd Edition AT & T Bell
Laboratories Murray Hill, New Jersey.

References:
1. Muttappa M. Mantur, Fundamentals and Programming in C, Deccan International
Academic Publishers

7| B C A I & I I 2 0 2 4 S E P
 2. P. K. Sinha & Priti Sinha, Computer Fundamentals, BPB Publications
3. Kamthane, Programming with ANSI and TURBO C, Pearson Education
4. V. Rajaraman, Programming in C, PHI
5. S. Byron Gottfried:, Programming with C, TMH
6. P.B. Kottur: Programming in C, Sapna Book House

Course Code: 24BCACT1.3 Course Title: Digital Logic and Computer Design
Credits: 4 Hrs/Week: 4 Hrs Contact Hours: 60
Formative assessment: 20 marks Term end exam: 80 marks Exam duration: 03 hrs

Course Outcomes (COs): At the end of the course, students will be able to:
 Use number systems and complements
 Identify the importance of canonical forms in the minimization or other optimization of Boolean
formulas in general and digital circuits.
 Minimize functions using any type of minimizing algorithms (Boolean algebra, Karnaughmap or
Tabulation Method).
 Implement functions using digital circuit (Combinational or Sequential)
 Analyzing and designing procedures of Combinational and Sequentialcircuits.
 Design the finite state machine using algorithmic state machine charts and perform simple
projects with a few flip-flops.

Unit – 1 12 Hrs.
Digital computers and digital systems: binary numbers, Number base conversion, Octal and
Hexadecimal number system, Compliments, Binary codes, Binary storage and Registers, binary
logic, IC.

Unit – 2 12 Hrs.
Boolean Algebra: Definition of Boolean Algebra, Laws and Theorems and properties of Boolean
algebra, Boolean functions, Canonical and standard forms, digital logic gates.
Simplifications of Boolean functions: functions for 2, 3 and 4 variable maps, Sum-of-products,
product of sums, Karnaugh Map, NAND and NOR implementation, Don’t Care conditions.

Unit – 3 12 Hrs.
Combinational logic Circuits: Design procedure, half adders, full adder, half Subtractors, full
subtractors, code conversion, multilevel NAND circuits, multilevel NOR circuits, Binary parallel
adder, decimal adder, decoders, multiplexers

Unit – 4 12 Hrs.
Sequential Logic: Introduction, flip-flops, Clocked RS flip-flop, D flip-flop, JK flip-flop,
clocked T flip-flop, triggering of flip-flops, Master-slave flip-flop, edge triggered flip-flop ,

8| B C A I & I I 2 0 2 4 S E P
analysis of clocked sequential circuits, design of counters.

Unit – 5 12 Hrs.
Registers: Registers, Types of registers, Serial In-Serial Out, Serial in Parallel Out, Parallel
In- Serial Out, Parallel- in- Parallel Out, Application of Shift Register, Ripple counters,
Synchronous Counters, Timing sequence, The memory unit.

Text-book
1. Morris Mano M., Digital logic and Computer Design, PHI, 3rd edition , 2013.

References

1. V. Rajaraman, T. Radhakrishnan, An Introduction to Digital Computer Design, PHI.

2. Anand Kumar, Switching Theory and Logic Design, 2nd Edition, PHI, 2014
3. Stephen Brown, Zvonko Vranesic, Fundamentals of Digital Logic with Verilog Design,
TMH, 2006, Charles H. Roth.
4. Roth, Fundamentals of Logic Design, 5th Edition, Thomson, India

Course Code: 24BCACL1.4 Course Title: C Programming Lab

Credits: 2 Hrs/Week: 4 Hrs Contact Hours: 45
Formative assessment: 10 marks Term end exam: 40 marks Exam duration: 03 hrs

Part A

1. Program to read radius of a circle and to find area and circumference

2. Program to read three numbers and find the biggest of three
3. Program to demonstrate library functions in math.h
4. Program to check for prime
5. Program to read a number, find the sum of the digits, reverse the number and check it for
palindrome
6. Program to read numbers from keyboard continuously till the user presses 999 and to find
the sum of only positive numbers
7. Program to find the roots of quadratic equation (demonstration of switch Case statement)
8. Program to read marks scored by n students and find the average of marks
(Demonstration of single dimensional array)
9. Program to remove Duplicate Element in a single dimensional Array
10. Program to find the length of a string without using built in function

Part B

1. Program to demonstrate string functions.

2. Program to demonstrate pointers in C

9| B C A I & I I 2 0 2 4 S E P
 3. Program to read, display and to find the trace of a square matrix
4. Program to read, display and add two m x n matrices using functions
5. Program to read a string and to find the number of alphabets, digits, vowels, consonants,
spaces and special characters.
6. Program to Reverse a String using Pointer
7. Program to Swap Two Numbers using Pointers
8. Program to demonstrate student structure to read & display records of n students.

Course Code: 24BCACL1.5 Course Title: Digital Logic and Computer Design Lab
Credits: 2 Hrs/Week: 4 Hrs Contact Hours: 45
Formative assessment: 10 marks Term end exam: 40 marks Exam duration: 03 hrs

Digital logic assignments shall be carried out using trainer kit or simulation software to illustrate
the concepts studied in the paper Digital Logic and Computer Design.

1) Implement basic gates, universal gates and advanced gates.

2) Implementation of given Boolean function in both SOP and POS forms.
3) Verification of state tables of RS-, JK-, T-, D- flip-flops.
4) Implementation and verification of de-coder, de-multiplexer and encoder using logic gates.
5) Construct half adder circuit and verify it’s working.
6) Construct full adder circuit and verify it’s working.
7) Perform Binary to Gray Code Conversion.
8) Perform gray code to binary code conversion.
9) Implementation of `4x1 multiplexer using logic gates.
10) Implementation of 4-bit parallel adder using 7483 IC. Design and verification of 4-bit
synchronous counter.

10 | B C A I & I I 2 0 2 4 S E P
 BCA II Semester wef 202425
Course Code: 24BCACP2.1 Course Title: Discrete Mathematical Structures
Credits: 4 Hrs/Week: 4 Hrs Contact Hours: 60
Formative assessment: 20 marks Term end exam: 80 marks Exam duration: 03 hrs

Course Outcomes (COs): At the end of the course, students will be able to:
 To understand the basic concepts of Mathematical reasoning, set and functions.
 To understand various counting techniques and principle of
inclusion andexclusions.
 Understand the concepts of various types of relations, partial ordering and
 equivalence relations.
 Apply the concepts of generating functions to solve the recurrence relations.
 Familiarize the fundamental concepts of graph theory and shortest path algorithm

Unit – 1 12 Hrs.
The Foundations: Logic and proofs: Propositional Logic, Applications of Propositional Logic,
Propositional Equivalences, Predicates and Quantifiers, Nested Quantifiers, Rules of Inference,
Introduction to Proofs, Proof Methods and Strategy.
Basic Structures: Sets, Functions, Sequences, Sums, and Matrices: Sets, set operations,
Functions, Sequences and Summations, matrices.

Unit – 2 12 Hrs.
Counting: Basics of counting, Pigeonhole principle, Permutation and combination, Binomial
Coefficient and Combination, Generating Permutation and Combination.
Advanced Counting Techniques: Applications of Recurrence Relations, Solving Linear
Recurrence, Relations, Divide and Conquer Algorithms and Recurrence Relations, Generating
functions, Inclusion-Exclusion, Applications of Inclusion-exclusion.

Unit – 3 12 Hrs.
Induction and Recursion: Mathematical Induction, Strong Induction and Well- Ordering,
Recursive Definitions and Structural Induction, Recursive Algorithms,Program Corrections

Unit – 4 12 Hrs.
Relation: Properties of relation, Composition of relation, Closer operation on relation,
Equivalence relation and partition. Operation on relation, Representing relation.

Unit – 5 12 Hrs.
Graphs: Graphs and Graph models, Graph Terminology and Special Types of Graphs,
Representing Graphs and Graph Isomorphism, Connectivity, Euler and Hamilton Paths, Shortest-
Path Problems, Planar Graphs, Graph Coloring.

11 | B C A I & I I 2 0 2 4 S E P
Text Book:

1. Discrete Mathematics and Its Applications, Kenneth H. Rosen: Seventh Edition, 2012.

References:
1. Discrete Mathematical Structure, Bernard Kolman, Robert C, Busby, Sharon Ross,
2003.
2. Graph Theory with Applications to Engg and Comp. Sci: Narsingh Deo-PHI 1986.
3. Discrete and Combinatorial Mathematics Ralph P. Grimaldi, B. V. Ramatta,
Pearson, Education, 5 Edition.
4. Discrete Mathematical Structures, Trembley and Manobar.

Course Code: 24BCACP2.2 Course Title: Data Structures using C

Credits: 4 Hrs/Week: 4 Hrs Contact Hours: 60
Formative assessment: 20 marks Term end exam: 80 marks Exam duration: 03 hrs

Course Outcomes (COs): At the end of the course, students will be able to:
 Describe how arrays, records, linked structures, stacks, queues, trees, andgraphs are represented
in memory and used by algorithms
 Describe common applications for arrays, records, linked structures, stacks,queues, trees, and
graphs
 Write programs that use arrays, records, linked structures, stacks, queues,trees, and graphs
 Demonstrate different methods for traversing trees
 Compare alternative implementations of data structures with respect toperformance
 Describe the concept of recursion, give examples of its use
 Discuss the computational efficiency of the principal algorithms for sorting,searching, and hashing

Unit-1 12 Hrs.
Introduction to data structures: Definition; Types of data structures - Primitive & Non-
primitive, Linear and Non-linear; Operations on data structures.
Dynamic memory allocation: Static & Dynamic memory allocation; Memory allocation and
de-allocation functions - malloc, calloc, realloc and free.
Algorithm Specification, Performance Analysis, Performance Measurement
Recursion: Definition; Types of recursions; Recursion Technique Examples - GCD,
Binomial coefficient nCr, Towers of Hanoi; Comparison between iterative and recursive
functions.
12 | B C A I & I I 2 0 2 4 S E P
Unit -2 12 Hrs.
Arrays: Basic Concepts – Definition, Declaration, Initialization, Operations on arrays; Types of
arrays; Arrays as abstract data types (ADT); Representation of Linear Arrays in memory;
Traversing linear arrays; Inserting and deleting elements; Sorting – Selection sort, Bubble sort,
Quick sort, Selection sort, Insertion sort; Searching - Sequential Search, Binary search; Iterative
and Recursive searching; Multidimensional arrays; Representation of multidimensional arrays;
Sparse matrices.

Unit-3 12 Hrs.
Linked list: Basic Concepts – Definition and Representation of linked list, Types of linked lists -
Singly linked list, Doubly liked list, Header liked list, Circular linked list; Representation of
Linked list in Memory;
Operations on Singly linked lists – Traversing, Searching, Insertion, Deletion; Memory
allocation; Garbage collection.

Unit – 4 12 Hrs.
Stacks: Basic Concepts – Definition and Representation of stacks; Operations on stacks;
Applications of stacks; Infix, postfix and prefix notations; Conversion from infix to postfix using
stack; Evaluation of postfix expression using stack; Application of stack in function calls.
Queues: Basic Concepts – Definition and Representation of queues; Types of queues, Simple
queues, Circular queues, Double ended queues, Priority queues; Operations on Simple queues.

Unit – 5 12 Hrs.
Trees: Definition; Tree terminologies –node, root node, parent node, ancestors of a node, siblings,
terminal & non-terminal nodes, degree of a node, level, edge, path, depth;
Binary tree: Type of binary trees - strict binary tree, complete binary tree, binary search tree and
heap tree; Array representation of binary tree. Traversal of binary tree; preorder, inorder and
postorder traversal;

Text Book
1. Ellis Horowitz and Sartaj Sahni, Fundamentals of Data Structures (1982), ISBN: 0-
914894- 20X.

References
1. Tanenbaum, Data structures using C, Pearson Education
2. Kamathane, Introduction to Data structures, Pearson Education
3. Y. Kanitkar, Data Structures Using C, BPB publications
4. Sudipa Mukherjee, Data Structures using C – 1000 Problems and Solutions, McGraw Hill
Education

13 | B C A I & I I 2 0 2 4 S E P
 Course Code: 24BCACP2.3 Course Title: Database Management System
Credits: 4 Hrs/Week: 4 Hrs Contact Hours: 60
Formative assessment: 20 marks Term end exam: 80 marks Exam duration: 03 hrs

Course Outcomes (COs): At the end of the course, students will be able to:
 Understand the merits and demerits of DBMS and the components of database system.
 Evaluate business information problem and find the requirements of a problem in termsof data.
 Understand, appreciate and effectively explain the concepts of database technologies.
 Design a database using ER modeling and Normalization to given Business informationproblem.
 Understand issues and techniques relating to concurrency and recovery in multi-userdatabase
environments.

Unit-1 12 Hrs.
Databases and Database Users: Introduction, An Example, Characteristics of the Database
Approach, Actors on the Scene, Workers behind the Scene, Advantages of Using the DBMS
Approach, A Brief History of Database Applications, When Not to Use a DBMS.

Unit-2 12 Hrs.
Database System Concepts and Architecture: Data Models, Schemas, and Instances, Three-
Schema Architecture and Data Independence, Database Languages and Interfaces, The Database
System Environment, Centralized and Client/Server Architectures for DBMSs, Classification of
Database Management Systems.

Unit-3 12 Hrs.
Data Modeling Using the Entity–Relationship (ER) Model: Using High-Level Conceptual
Data Models for Database Design, A Sample Database Application, Entity Types, Entity Sets,
Attributes, and Keys, Relationship Types, Relationship Sets, Roles, and Structural Constraints,
Weak Entity Types, Refining the ER Design for the COMPANY Database, ER Diagrams,
Naming Conventions, and Design Issues.

Unit-4 12 Hrs.
Relational Data Model and Relational Database Constraints: Relational Model Concepts,
Relational Model Constraints and Relational Database Schemas, Update Operations,
Transactions, and Dealing with Constraint Violations.
Basic SQL: SQL Data Definition and Data Types, Specifying Constraints in SQL, Basic
Retrieval Queries in SQL, INSERT, DELETE, and UPDATE Statements in SQL
Relational Algebra: Unary Relational Operations: SELECT and PROJECT, Relational Algebra
Operations from Set Theory, Binary Relational Operations: JOIN and DIVISION, Additional
Relational Operations.

Unit-5 12 Hrs.
Basics of Functional Dependencies and Normalization for Relational Databases: Informal
Design Guidelines for Relation Schemas, Functional Dependencies, Normal Forms Based on
14 | B C A I & I I 2 0 2 4 S E P
Primary Keys, General Definitions of Second and Third Normal Forms, Boyce-Codd Normal
Form.

Textbook
1. Fundamentals of Database Systems, Ramez Elamassri, Shankant B. Navathe, 7th Edition, Pearson,
2015.
2. Database Systems Concepts, Abraham Silberschatz, Henry Korth, S.Sudarshan, 6 th Edition,
McGraw Hill, 2010.

References

1. An Introduction to Database Systems, Bipin Desai, Galgotia Publications, 2010.

3. Introduction to Database System, C J Date, Pearson, 1999.
4. Database Management Systems, Raghu Rama Krishnan and Johannes Gehrke, 3 rd Edition,
2. McGraw Hill, 2002

Course Code: 24BCACL2.4 Course Title: Data Structure Lab

Credits: 2 Hrs/Week: 4 Hrs Contact Hours: 45
Formative assessment: 10 marks Term end exam: 40 marks Exam duration: 03 hrs

Part A
1. Program to find GCD using recursive function
2. Program to display Pascal Triangle using binomial function
3. Program to generate n Fibonacci numbers using recursive function.
4. Program to implement Towers of Hanoi.
5. Program to implement dynamic array, find smallest and largest element of the array.
6. Program to create two files to store even and odd numbers.
7. Program to create a file to store student records.
8. Program to read the names of cities and arrange them alphabetically.
9. Program to sort the given list using selection sort technique.
10. Program to sort the given list using bubble sort technique.

Part B
1. Program to sort the given list using insertion sort technique.
2. Program to sort the given list using quick sort technique.
3. Program to sort the given list using merge sort technique.
4. Program to search an element using linear search technique.
5. Program to search an element using recursive binary search technique.
6. Program to implement Stack.
7. Program to convert an infix expression to postfix.
8. Program to implement simple queue.
9. Program to implement linear linked list.
10. Program to display traversal of a tree.

15 | B C A I & I I 2 0 2 4 S E P
 Course Code: 24BCACL2.5 Course Title: DBMS Lab
Credits: 2 Hrs/Week: 4 Hrs Contact Hours: 45
Formative assessment: 10 marks Term end exam: 40 marks Exam duration: 03 hrs

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

 Designing and creating relational database systems.

 Practical knowledge of DDL and DDL using SQL
 Understand various SQL query execution such as relational constraints, joins, set operations,
aggregate functions, trigger, views and embedded SQL.
 To design and implement database applications on their own

1. Execute a single line query and group functions.

2. Execute DDL Commands.
3. Execute DML Commands
4. Execute DCL and TCL Commands.
5. Implement the Nested Queries.
6. Implement Join operations in SQL
7. Create views for a particular table
8. Implement Locks for a particular table.
9. Write a query to understand the concepts for ROLL BACK, COMMIT & CHECK
POINTS.
10. Write a query for extracting data from more than one table.

16 | B C A I & I I 2 0 2 4 S E P