Anantha Lakshmi

Institute of Technology & Sciences

(Autonomous)
Affiliated
to
Jawaharlal Nehru Technological University
Anantapur

SYLLABUS
for
Master of Computer Applications
(Regular-Fulltime)

(Effective for the students admitted into I year from the Academic Year
2024-2025 onwards)
Name of the Board of Studies: Master of Computer Applications (MCA)
S.No Name &Designation Address Position in BoS
1. Mr.Y.Sudarshan Anantha Lakshmi Chairman
Chowdary Institute of Technology &
HoD of MCA Sciences
2. SK University University Nominee
Dr. N. Geethanjali
Ananthapuramu
Professor
[email protected]
Dept of MCA
m
9440896370
3. Dr. N. Kiran Kumar Yogivemana University Nominated by
Professor YSR Kadapa Academic Council
Dept of MCA [email protected] Subject Expert
7207937786
4. Dr.M. Nagamani School of Computer and Nominated by
Professor Information Sciences, Academic Council
Dept of MCA University of Hyderabad, Subject Expert
[email protected],
9490884076
5. Mr.Sudheendra Nextuple India Pvt Ltd Industry Expert
Manager [email protected]
9448233818
6. Dr.M.Surendra Naidu Anantha Lakshmi Internal Member
Institute of Technology &
Sciences
7. Mr.B.Venkata Reddy Anantha Lakshmi Internal Member
Institute of Technology &
Sciences
8. Ms.T.Syamala Anantha Lakshmi Internal Member
Institute of Technology &
Sciences
SEMESTER - I

Hours per
week
S.No. Cours Course Name Credits
e code
L T P

1. 21F00101 Mathematical
Science
Foundations of Computer 4 0 0 4

2. 21F00102 Software Engineering 4 0 0 4

3. 21F00103 Computer Organization & Architecture 4 0 0 4

4. 21F00104 Data Structures 4 0 0 4

5. 21F00105 Database Management Systems 4 0 0 4

7. 21F00106 Software Engineering Laboratory 0 1 2 2

8. 21F00107 Data Structures using C Laboratory 0 1 2 2

9. 21F00108 Database Management Systems Laboratory 0 1 2 2

10 21F00109 Research Methodology and IPR 2 0 0 2

TOTAL 22 3 8 28

SEMESTER - II

Hours per
S.No. Course Course Name Credit
s
code L T P

1. 21F00201 Operating Systems 4 0 0 4

2. 21F00202 Data Science with Python 4 0 0 4
3. 21F00203 Computer Networks 4 0 0 4
Program Elective – I
Software Testing Methodologies
4. 21F00204a Data Mining and Business Intelligence 4 0 0 3
21F00204b Managerial Economics and Financial
21F00204c Accountancy
Open Elective – I
Operations
5. 21F00205a 3 0 0 3
Research Digital
21F00205b
21F00205c Marketing
Cloud Computing
6. 21F00206 Operating Systems Laboratory 0 1 2 2
7. 21F00207 Data Science Laboratory 0 1 2 2
8. 21F00208 Computer Networks Laboratory 0 1 2 2

9. Skill Oriented Course – I 1 0 2 2

21F00209 Exploratory Data Analytics with Python
10. 21F00210 Seminar 0 0 4 2
Total 20 3 10 28

Course Code MATHEMATICAL FOUNDATIONS OF COMPUTER L T P C

21F00101 SCIENCE 4 0 0 4
Semester I
Course Objectives:
• Introduces the elementary discrete mathematics for computer science and engineering.
• Topics include formal logic notation, methods of proof, induction, sets, relations, graph theory,
permutations and combinations, counting principles; recurrence relations and generating functions
Course Outcomes (CO): Student will be able to
• Demonstrate the ability to understand and construct precise mathematical proofs
• Demonstrate the ability to use logic and set theory to formulate precise statements
• Acquire the knowledge to analyse and solve counting problems on finite and discrete structures
• Demonstrate the ability to describe and manipulate sequences
• Demonstrate the ability to apply graph theory in solving computing problems
UNIT – I Lecture Hrs:
The Foundations Logic and Proofs: Propositional Logic, Applications of Propositional Logic,
Propositional Equivalence, Predicates and Quantifiers, Nested Quantifiers, Rules of Inference, Introduction to
Proofs, Proof Methods and Strategy.
UNIT – II Lecture Hrs:
Basic Structures, Sets, Functions, Sequences, Sums, Matrices and Relations: Sets, Functions, Sequences &
Summations, Cardinality of Sets and Matrices Relations, Relations and Their Properties, n-ary Relations
and Their Applications, Representing Relations, Closures of Relations, Equivalence Relations, Partial
Orderings.
UNIT - III Lecture Hrs:
Algorithms, Induction and Recursion: Algorithms, The Growth of Functions, Complexity of Algorithms.
Induction and Recursion: Mathematical Induction, Strong Induction and Well-Ordering, Recursive Definitions
and Structural Induction, Recursive Algorithms, Program Correctness
UNIT – IV Lecture Hrs:
Discrete Probability and Advanced Counting Techniques: An Introduction to Discrete Probability, Probability
Theory, Bayes’ Theorem, Expected Value and Variance.
Advanced Counting Techniques: Recurrence Relations, Solving Linear Recurrence Relations, Divide-and-
Conquer Algorithms and Recurrence Relations, Generating Functions, Inclusion-Exclusion, Applications
of Inclusion-Exclusion.
UNIT – V
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.
TEXTBOOKS
1. Discrete Mathematics and Its Applications with Combinatorics and Graph Theory- Kenneth H Rosen,
7thEdition, TMH.
REFERENCES
1. Discrete Mathematical Structures with Applications to Computer Science-J.P. Tremblay and R.
Manohar, TMH,
2. Discrete Mathematics for Computer Scientists & Mathematicians: Joe L. Mott, Abraham Kandel,
Teodore P. Baker, 2nd ed., Pearson Education.
3. Discrete Mathematics- Richard Johnsonbaugh, 7th ed., Pearson Education.
4. Discrete Mathematics with Graph Theory- Edgar G. Goodaire, Michael M. Parmenter.
5. Discrete and Combinatorial Mathematics - an applied introduction: Ralph.P. Grimald, 5th edition,
Pearson Education.

Course Code SOFTWARE ENGINEERING L T P C

21F00102 4 0 0 4
Semester I
Course Objectives:
 To learn the basic concepts of software engineering and life cycle models
 To explore the issues in software requirements specification and enable to write SRSdocuments for
software development problems
 To elucidate the basic concepts of software design and enable to carry out proceduraland
objectoriented design of software development problems
 To understand the basic concepts of black box and white box software testing andenable to design test
cases for unit, integration, and system testing
 To reveal the basic concepts in software project management
Course Outcomes (CO): Student will be able to
 Ability to apply software engineering principles and techniques.
 Ability to develop, maintain and evaluate large-scale software systems.
 To produce efficient, reliable, robust and cost-effective software solutions.
 Ability to work as an effective member or leader of software engineering teams.
 Ability to understand and meet ethical standards and legal responsibilities.
UNIT – I Lecture Hrs:
Basic concepts: abstraction versus decomposition, evolution of software engineering techniques, Software
development life cycle (SDLC) models: Iterative waterfall model, Prototype model, Evolutionary model, Spiral
model, RAD model, Agile models, software project management: project planning, project estimation,
COCOMO, Halstead’s Software Science, project scheduling, staffing, Organization and team
structure, risk management, configuration management.
UNIT – II Lecture Hrs:
The nature of software, The Unique nature of Webapps, Software Myths, Requirements gathering and analysis,
software requirements specification, Traceability, Characteristics of a Good SRS Document, IEEE 830
guidelines, representing complex requirements using decision tables and decision trees,
overview of formal system development techniques. Axiomatic specification, algebraic specification.
UNIT - III Lecture Hrs:
Good Software Design, Cohesion and coupling, Control Hierarchy: Layering, Control Abstraction, Depth and
width, Fan-out, Fan-in, Software design approaches, object oriented vs. function oriented design. Overview of
SA/SD methodology, structured analysis, Data flow diagram, Extending DFD technique to real life systems,
Basic Object oriented concepts, UML Diagrams, Structured design, Detailed design, Design review,
Characteristics of a good user interface, User Guidance and Online Help, Mode-based Vs. Mode-less Interface,
Types of user interfaces, Component-based GUI development, User interface design
methodology: GUI design methodology.
UNIT – IV Lecture Hrs:
Coding standards and guidelines, code review, software documentation, Testing, Black Box Testing,
White Box Testing, debugging, integration testing, Program Analysis Tools, system testing, performance
testing, regression testing, Testing Object Oriented Programs.
UNIT – V
Software reliability, Statistical testing, Software quality and management, ISO 9000, SEI capability maturity
model (CMM), Personal software process (PSP), Six sigma, Software quality metrics, CASE and its scope,
CASE environment, CASE support in software life cycle, Characteristics of software maintenance, Software
reverse engineering, Software maintenance processes model, Estimation
maintenance cost. Basic issues in any reuse program, Reuse approach, Reuse at organization level.
Text Books:
1. RajibMall, “Fundamentals of Software Engineering”, 5th Edition, PHI, 2018.
2.Pressman R, “Software Engineering- Practioner Approach”, McGraw Hill.

Course Code COMPUTER ORGANIZATION & ARCHITECTURE L T P C

21F00103 4 0 0 4
Semester I

Course Objectives:
• Learn the fundamentals of computer organization and its relevance to classical and
modern problems of computer design
• Understand the structure and behavior of various functional modules of a computer.
• Discuss the techniques that computers use to communicate with I/O devices
• Study the concepts of pipelining and the way it can speed up processing.
• Describe the basic characteristics of multiprocessors
Course Outcomes (CO): Student will be able to
• Demonstrate computer architecture concepts related to design of modern processors,
memories and I/Os
• Able to explore the hardware requirements for cache memory and virtual memory
• Ability to design algorithms to exploit pipelining and multiprocessors
• Ability to use memory and I/O devices effectively
• Detect pipeline hazards and identify possible solutions to those hazards
UNIT – I Lecture Hrs:
Basic Structure of Computer: Computer Types, Functional Units, Basic operational Concepts, Bus
Structure, Software, Performance, Multiprocessors and Multicomputer.
Machine Instructions and Programs: Numbers, Arithmetic Operations and Programs, Instructions and
Instruction Sequencing, Addressing Modes, Basic Input/output Operations
INTEL-8086: CPU architecture, Addressing modes - generation of physical address- code segment
registers, Zero, one, two, and three address instructions. INTEL 8086 ASSEMBLY LANGUAGE
INSTRUCTIONS-Data transfer instructions, input- output instructions, arithmetic, logical, shift, and rotate
instructions, Conditional and unconditional transfer.
UNIT – II Lecture Hrs:
Arithmetic: Addition and Subtraction of Signed Numbers, Design of Fast Adders, Multiplication of Positive
Numbers, Signed-operand Multiplication, Fast Multiplication, Integer Division, Floating- Point Numbers and
Operations.
Basic Processing Unit: Fundamental Concepts, Execution of a Complete Instruction, Multiple-Bus
Organization, Hardwired Control, Multi-programmed Control.
UNIT - III Lecture Hrs:
The Memory System: Basic Concepts, Semiconductor RAM Memories, Read-Only Memories, Speed, Size and
Cost, Cache Memories, Performance Considerations, Virtual Memories, Memory Management
Requirements, Secondary Storage.
UNIT – IV Lecture Hrs:
Input/output Organization: Accessing I/O Devices, Interrupts, Processor Examples, Direct Memory Access,
Buses, Interface Circuits, Standard I/O Interfaces.
UNIT – V
Pipelining: Basic Concepts, Data Hazards, Instruction Hazards, Influence on Instruction Sets.
Large Computer Systems: Forms of Parallel Processing, Array Processors, The Structure of General- Purpose
multiprocessors, Interconnection Networks.
TEXT BOOKS:
1. Computer Organization, Carl Hamacher, ZvonkoVranesic, SafwatZaky, McGraw Hill Education, 5th
Edition, 2013.
2. Microprocessors and Interfacing, Douglas Hall, Tata McGraw-Hill.
Course Code DATA STRUCTURES L T P C
21F00104 4 0 0 4
Semester I

Course Objectives:
 To illustrate the basic concepts of C programming language.
 To discuss the concepts of Functions, Arrays, Pointers and Structures.
 To familiarize with Stack, Queue and Linked lists data structures.
 To explain the concepts of non-linear data structures like graphs and trees.
 To learn the different types of searching and sorting techniques.
Course Outcomes (CO): Student will be able to
 Use C basic concepts to write simple C programs
 Explain the different notations of arithmetic express
 Analyze various operations on linked list
 Develop the representation of Tress
 Design the different sorting technique
UNIT – I Lecture Hrs:
Introduction to C Language - C Language Elements, Variable Declarations and Data Types, Operators and
Expressions, Decision Statements - If and Switch Statements, Loop Control Statements
-while, for, do-while Statements.
Introduction to Functions, Storage classes, Arrays, Structures, Unions, Pointers, Strings and Command line
arguments.
UNIT – II Lecture Hrs:
Data Structures, Stacks and Queues- Overview of Data Structure, Representation of a Stack, Stack Related
Terms, Operations on a Stack, Implementation of a Stack, Evaluation of Arithmetic Expressions, Infix, Prefix,
and Postfix Notations, Evaluation of Postfix Expression, Conversion of Expression from Infix to Postfix,
Recursion, Queues - Various Positions of Queue, Representation of Queue, Insertion, Deletion,
Searching Operations.
UNIT - III Lecture Hrs:
Linked Lists–Pointers, Singly Linked List, Dynamically Linked Stacks and Queues, Polynomials Using
Singly Linked Lists, Using Circularly Linked Lists, Insertion, Deletion and Searching Operations, Doubly
linked lists and its operations, Circular linked lists and its operations.
UNIT – IV Lecture Hrs:
Trees- Tree terminology, representation, Binary tress, representation, Binary tree traversals. Binary Tree
Operations, Graphs- Graph terminology, Graph representation, Elementary Graph Operations, Breadth first
search (BFS) and Depth first search (DFS), Connected Components, Spanning Trees.
UNIT – V
Searching and Sorting–Sequential, Binary, Exchange (Bubble) Sort, Selection Sort, Insertion Sort, Quick
Sort, Merge Sort, Heap Sort. Searching- Linear and Binary Search Methods.
Text Books:
1. The C Programming Language, Brian W Kernighan and Dennis M Ritchie, Second
Edition, Prentice Hall Publication.
2. Fundamentals of Data Structures in C, Ellis Horowitz, SartajSahni, Susan Anderson-Freed,
Computer Science Press.
3. Programming in C and Data Structures, J.R.Hanly, Ashok N. Kamthane and A. AnandaRao,
Pearson Education.
4. B.A.Forouzon and R.F. Gilberg, “COMPUTER SCIENCE: A Structured Programming
Approach Using C”, Third edition, CENGAGE Learning, 2016.
5. Richard F. Gilberg&Behrouz A. Forouzan, “Data Structures: A Pseudocode Approach with C”,
Second Edition, CENGAGE Learning, 2011.

Course Code L T P C
21F00105 DATABASE MANAGEMENT SYSTEMS 4 0 0 4
Semester I

Course Objectives:
• Train in the fundamental concepts of database management systems, database
modeling and design, SQL, PL/SQL and system implementation techniques.
• Enable students to model ER diagram for any customized application
• Inducting appropriate strategies for optimization of queries.
• Provide knowledge on concurrency techniques
• Demonstrate the organization of Databases
Course Outcomes (CO): Student will be able to
• Design a database for a real world information system
• Define transactions which preserve the integrity of the database
• Generate tables for a database
• Organize the data to prevent redundancy
• Pose queries to retrieve the information from database
UNIT – I Lecture Hrs:
Introduction: Database systems applications, Purpose of Database Systems, view of Data, Database Languages,
Database Design, Database Engine, Database and Application Architecture, Database Users and Administrators.
Introduction to Relational Model: Structure of Relational Databases, Database Schema, Keys, Schema
Diagrams, Relational Query Languages, Relational Algebra

UNIT – II Lecture Hrs:

Introduction to SQL: Overview of the SQL Query Language, SQL Data Definition, Basic Structure of SQL
Queries, Additional Basic Operations, Set Operations, Null Values, Aggregate Functions, Nested Sub-queries,
Modification of the Database. Intermediate SQL: Joint Expressions, Views, Transactions, Integrity Constraints,
SQL Data Types and Schemas, Index Definition in SQL, Authorization.
Advanced SQL: Accessing SQL from a Programming Language, Functions and Procedures, Triggers, Recursive
Queries, Advanced Aggregation Features.
UNIT – III Lecture Hrs:
Database Design and the E-R Model: Overview of the Design Process, The Entity-Relationship Model,
Complex Attributes, Mapping Cardinalities, Primary Key, Removing Redundant Attributes in Entity Sets,
Reducing E-R Diagrams to Relational Schemas, Extended E-R Features, Entity- Relationship Design Issues,
Alternative Notations for Modelling Data, Other Aspects of Database Design.
Relational Database Design:
Features of Good Relational Designs, Decomposition Using Functional Dependencies, Normal Forms,
Functional-Dependency Theory, Algorithms for Decomposition using Functional Dependencies,
Decomposition Using Multivalued Dependencies, More Normal Forms, Atomic Domains and First Normal
Form, Database–Design Process, Modelling Temporal Data, Indexing.
UNIT – IV Lecture Hrs:
Query Processing: Overview, Measures of Query cost, Selection Operation, Sorting, Join Operation, Other
Operations, Evaluation of Expressions, Query Processing in Memory.
Query optimization: Overview, Transformation of Relational Expressions, Estimating Statistics of Expression
Results, Choice of Evaluation Plans, Materialized views, Advanced Topics in Query
Optimization.
UNIT – V
Transaction Management:
Transactions: Transaction Concept, A Simple Transactional Model, Storage Structure, Transaction Atomicity
and Durability, Transaction Isolation, Serializability, Transaction Isolation and Atomicity,
Transaction Isolation Levels, Implementation of Isolation Levels, Transactions as SQL Statements. Concurrency
Control: Lock-Based Protocols, Deadlock Handling, Multiple Granularity, Insert Operations. Delete Operations
and Predicate Reads, Timestamp-Based Protocols, Validation- Based Protocols, Multiversion Schemes,
Snapshot Isolation, Weak Levels of Consistency in Practice, Advanced Topics in Concurrency.
Recovery System: Failure Classification, Storage, Recovery and Atomicity, Recovery Algorithm, Buffer
Management, Failure with Loss of Non-Volatile Storage, High Availability Using Remote Backup Systems,
Early Lock Release and Logical Undo Operations, ARIES, Recovery in Main- Memory
Databases.

TEXT BOOKS:
1. A.Silberschatz, H.F.Korth, S.Sudarshan, “Database System Concepts”, 7/e, TMH 2020

Course Code SOFTWARE ENGINEERING LAB L T P C

21F00106 0 1 2 2
Semester I

Course Objectives:
• To have hands on experience in developing a software project by using various software
engineering principles and methods in each of the phases of software development.
Course Outcomes (CO):
• Ability to translate end-user requirements into system and software requirements
• Ability to generate a high-level design of the system from the software requirements
• Will have experience and/or awareness of testing problems and will be able to
develop a simple testing report
List of Experiments:
1) Development of problem statement.
2) Preparation of Software Requirement Specification Document, Design Documents and Testing Phase
related documents.
3) Preparation of Software Configuration Management and Risk Management related documents.
4) Study and usage of any Design phase CASE tool
5) Performing the Design by using any Design phase CASE tools.
6) Develop test cases for unit testing and integration testing
7) Develop test cases for various white box and black box testing techniques.
Course Code DATA STRUCTURES USING C LABORATORY L T P C
21F00107 0 1 2 2
Semester I

Course Objectives:
• To get familiar with the basic concepts of C programming.
• To design programs using arrays, strings, pointers and structures.
• To illustrate the use of Stacks and Queues
• To apply different operations on linked lists.
• To demonstrate the Binary tree traversal techniques.
• To design searching and sorting techniques
Course Outcomes (CO):
 Develop C programs for computing and real life applications using basic elements like control
statements, arrays, functions, pointers and strings, and data structures like stacks, queues and
linked lists.
 Implement searching and sorting algorithms
List of Experiments:

Write C programs that use both recursive and non-recursive functions

i) To find the factorial of a given integer.

ii) To find the GCD (greatest common divisor) of two given integers.
iii) To solve Towers of Hanoi problem.

a) Write a C program to find both the largest and smallest number in a list of integers.
b) Write a C program that uses functions to perform the following:
i) Addition of Two Matrices ii) Multiplication of Two Matrices

a) Write a C program that uses functions to perform the following operations:

i) To insert a sub-string in to a given main string from a given position.
ii) To delete n Characters from a given position in a given string.

a) Write a C program that displays the position or index in the string S where the string T begins, or
– 1 if S doesn‘t contain T.
b) Write a C program to count the lines, words and characters in a given text.

a) Write a C Program to perform various arithmetic operations on pointer variables.

b) Write a C Program to demonstrate the following parameter passing mechanisms:
i) call-by-value ii) call-by-reference.

Write a C program that uses functions to perform the following operations:

i) Reading a complex number
ii) Writing a complex number
iii) Addition of two complex numbers
iv) Multiplication of two complex numbers (Note: represent complex number using a structure.)

Write C programs that implement stack (its operations) using

i) Arrays
ii) Pointers

Write C programs that implement Queue (its operations) using

i) Arrays
ii) Pointers

Write a C program that uses Stack operations to perform the following:

i) Converting infix expression into postfix expression
ii) Evaluating the postfix expression

Write a C program that uses functions to perform the following operations on singly linked list.

i) Creation ii) Insertion iii) Deletion iv) Traversal

Write a C program that uses functions to perform the following operations on Doubly linkedlist.

i) Creation ii) Insertion iii) Deletion iv) Traversal

Write a C program that uses functions to perform the following operations on Circular linkedlist.

i) Creation ii) Insertion iii) Deletion iv) Traversal

Write a C program that uses functions to perform the following:

i) Creating a Binary Tree of integers

ii) Traversing the above binary tree in preorder, inorder and postorder.

Write C programs that use both recursive and non-recursive functions to perform the
following searching operations for a Key value in a given list of integers:
i) Linear search
ii) Binary search

Write a C program that implements the following sorting methods to sort a given list of
integers in ascending order
i) Bubble sort
ii) Selection sort

Write a C program that implements the following sorting methods to sort a given list of
integers in ascending order
i) Insertion sort
ii) Merge sort
iii) Quick sort

Course Code L T P C
21F00108 DATABASE MANAGEMENT SYSTEMS 0 1 2 2
LABORATORY
Semester I
Course Objectives:
• To implement the basic knowledge of SQL queries and
relational algebra.
• To construct database models for different database applications.
• To apply normalization techniques for refining of databases.
• To practice various triggers, procedures, and cursors using PL/SQL.
• To design and implementation of a database for an organization
Course Outcomes (CO):
• Design database for any real world problem
• Implement PL/SQL programs
• Define SQL queries
• Decide the constraints
• Investigate for data inconsistency
List of Experiments:

1. Create a table called Employee with the following structure.

Name Type
Empno Number

Ename Varchar2(20
)
Job Varchar2(20
)
Mgr Number
Sal Number

a. Add a column commission with domain to the Employee table.

b. Insert any five records into the table.
c. Update the column details of job
d. Rename the column of Employ table using alter command.
e. Delete the employee whose empno is19.
1. Create department table with the following structure.

a. Add column designation to the department table.

b. Insert values into the table.
c. List the records of emp table grouped by dept no.
d. Update the record where dept no is9.
e. Delete any column data from the table

QUERIES USING DDL AND DML

1. a. Create a user and grant all permissions to the user.
b. Insert the any three records in the employee table and use rollback. Check the result.
c. Add primary key constraint and not null constraint to the employee table.
d. Insert null values to the employee table and verify the result.
2. a. Create a user and grant all permissions to the user.
b. Insert values in the department table and use commit.
c. Add constraints like unique and not null to the department table.
d. Insert repeated values and null values into the table.
3. a. Create a user and grant all permissions to the user.
b. Insert values into the table and use commit.
c. Delete any three records in the department table and use rollback.
d. Add constraint primary key and foreign key to the table.
4. a. Create a user and grant all permissions to the user.
b. Insert records in the sailor table and use commit.
c. Add save point after insertion of records and verify save point.
d. Add constraints not null and primary key to the sailor table.
5. a. Create a user and grant all permissions to the user.
b. Use revoke command to remove user permissions.
c. Change password of the user created.
d. Add constraint foreign key and notnull.
6. a. Create a user and grant all permissions to the user.
b. Update the table reserves and use save point and rollback.
c. Add constraint primary key , foreign key and not null to the reserves table
d. Delete constraint not null to the table

column. QUERIES USING AGGREGATE

FUNCTIONS

1. a. By using the group by clause, display the names who belongs to dept no 10 along with
average salary.
b. Display lowest paid employee details under each department.
c. Display number of employees working in each department and their department number.
d. Using built in functions, display number of employees working in each department and their
department name from dept table. Insert dept name to dept table and insert dept name for each row,
do the required thing specified above.
e. List all employees which start with either B or C.
f. Display only these ename of employees where the maximum salary is greater than or equal
to 5000.
2. a. Calculate the average salary for each different job.
b. Show the average salary of each job excluding manager.
c. Show the average salary for all departments employing more than three people.
d. Display employees who earn more than the lowest salary in department 30
e. Show that value returned by sign (n) function.
f. How many days between day of birth to current date
3. a. Show that two substring as single string.
b. List all employee names, salary and 15% rise in salary.
c. Display lowest paid emp details under each manager
d. Display the average monthly salary bill for each deptno.
e. Show the average salary for all departments employing more than two people.
f. By using the group by clause, display the eid who belongs to dept no 05 along with average
salary.
4. a. Count the number of employees in department20
b. Find the minimum salary earned by clerk.
c. Find minimum, maximum, average salary of all employees.
d. List the minimum and maximum salaries for each job type.
e. List the employee names in descending order.
f. List the employee id, names in ascending order by empid.
5. a. Find the sids ,names of sailors who have reserved all boats called “INTERLAKE
Find the age of youngest sailor who is eligible to vote for each rating level with at least two such
sailors.
b. Find the sname , bid and reservation date for each reservation.
c. Find the ages of sailors whose name begin and end with B and has at least 3characters.
d. List in alphabetic order all sailors who have reserved red boat.
e. Find the age of youngest sailor for each rating level.

6 a. List the Vendors who have delivered products within 6 months.

b. Display the Vendor details who have supplied both Assembled and Subparts.
c. Display the Sub parts by grouping the Vendor type (Local or Non

Local). PROGRAMS ON PL/SQL

1. a. Write a PL/SQL program to swaptwonumbers.

b. Write a PL/SQL program to find the largest of three numbers.
2. a. Write a PL/SQL program to find the total and average of 6 subjects and display thegrade.
b. Write a PL/SQL program to find the sum of digits in a given umber.
3. a. Write a PL/SQL program to display the number in reverse order.
b. Writea PL/SQLprogramtocheckwhetherthegivennumberisprimeornot.
4. a. Write a PL/SQL program to find the factorial of a givennumber.
b. Write a PL/SQL code block to calculate the area of a circle for a value of radius varying from 3 to
7. Store the radius and the corresponding values of calculated area in an empty table named areas,
consisting of two columns radius andarea.
5. a. Write a PL/SQL program to accept a string and remove the vowels from the string. (When
‘hello’ passed to the program it should display ‘Hll’ removing e and o from the worldHello).
b. Write a PL/SQL program to accept a number and a divisor. Make sure the divisor is less than or
equal to 10. Else display an error message. Otherwise Display the remainderin words.

PROCEDURES AND FUNCTIONS

1. Write a function to accept employee number as parameter and return Basic +HRA
together as single column.
2. Accept year as parameter and write a Function to return the total net salary spent for a given
year.
3. Create a function to find the factorial of a given number and hence find NCR.
4. Write a PL/SQL block o pint prime Fibonacci series using local functions.
5. Create a procedure to find the lucky number of a given birth date.
6. Create function to the reverse of given number
PROCEDURES

1. Create the procedure for palindrome of given number.

2. Create the procedure for GCD: Program should load two registers with two Numbers and
then apply the logic for GCD of two numbers. GCD of two numbers is performed by dividing the
greater number by the smaller number till the remainder is zero. If it is zero, the divisor is the GCD if
not the remainder and the divisors of the previous division are the new set of two numbers. The
process is repeated by dividing greater of the two numbers by the smaller number till the remainder
is zero and GCD isfound.
3. Write the PL/SQL programs to create the procedure for factorial of givennumber.
4. Write the PL/SQL programs to create the procedure to find sum of N naturalnumber.
5. Write the PL/SQL programs to create the procedure to find Fibonacciseries.
6. Write the PL/SQL programs to create the procedure to check the given number is perfect
ornot

CASE STUDY: BOOK PUBLISHING COMPANY

A publishing company produces scientific books on various subjects. The books are written by
authors who specialize in one particular subject. The company employs editors who, not necessarily
being specialists in a particular area, each take sole responsibility for editing one or more
publications.
A publication covers essentially one of the specialist subjects and is normally written by a single
author. When writing a particular book, each author works with on editor, but may submit another
work for publication to be supervised by other editors. To improve their competitiveness, the
company tries to employ a variety of authors, more than one author being a specialist in a particular
subject for the above case study, do the following:
1. Analyze the data required.
2. Normalize the attributes.
Create the logical data model using E-R diagrams

CASE STUDY: STUDENT PROGRESS MONITORING SYSTEM

A database is to be designed for a college to monitor students' progress throughout their course of
study. The students are reading for a degree (such as BA, BA (Hons) M.Sc., etc) within the
framework of the modular system. The college provides a number of modules, each being
characterized by its code, title, credit value, module leader, teaching staff and the department they
come from. A module is coordinated by a module leader who shares teaching duties with one or
more lecturers. A lecturer may teach (and be a module leader for) more than one module. Students
are free to choose any module they wish but the following rules must be observed: Some modules
require pre- requisites modules and some degree programmes have compulsory modules. The
database is also to contain some information about
studentsincludingtheirnumbers,names,addresses,degreestheyreadfor,andtheirpastperformance
i.e. modules taken and examination results. For the above case study, do the following:
1. Analyze the datarequired.
2. Normalize theattributes.
3. Create the logical data model i.e., ERdiagrams.
4. Comprehend the data given in the case study by creating respective tables with primary keys
and foreign keys whereverrequired.
5. Insert values into the tables created (Be vigilant about Master- Slavetables).
6. Display the Students who have taken M.Sccourse
7. Display the Module code and Number of Modules taught by eachLecturer.
8. Retrieve the Lecturer names who are not Module Leaders.
9. Display the Department name which offers ‘English’module.
10. Retrieve the Prerequisite Courses offered by every Department (with Departmentnames).
11. Present the Lecturer ID and Name who teaches‘Mathematics’.
12. Discover the number of years a Module istaught.
13. List out all the Faculties who work for ‘Statistics’Department.
14. List out the number of Modules taught by each
15. ModuleLeader. List out the number of Modules taught by a
16. Create a view which contains the fields of both Department and Module tables. (Hint- The
particularLecturer.
fields like Module code, title, credit, Department code and itsname).
17. Update the credits of all the prerequisite courses to 5. Delete the Module ‘History’ from the
Module table.
Course Code RESEARCH METHODOLOGY AND IPR L T P C
21F00109 2 0 0 2
Semester I

Course Objectives:
 Identify an appropriate research problem in their interesting domain.
 Understand ethical issues understand the Preparation of a research project thesis report.
 Understand the Preparation of a research project thesis report
 Understand the law of patent and copyrights.
 Understand the Adequate knowledge on IPR
Course Outcomes (CO): Student will be able to
 Analyze research related information
 Follow research ethics
 Understand that today’s world is controlled by Computer, Information Technology, but
tomorrow w world will be ruled by ideas, concept, and creativity.
 Understanding that when IPR would take such important place in growth of individuals & nation,
it is needless to emphasis the need of information about Intellectual Property Right to be
promoted among students in general & engineering in particular.
 Understand that IPR protection provides an incentive to inventors for further research work and
investment in R & D, which leads to creation of new and better products, and in turn brings about,
economic growth and social benefits.
UNIT - I Lecture Hrs:
Meaning of research problem, Sources of research problem, Criteria Characteristics of a good research
problem, Errors in selecting a research problem, scope, and objectives of research problem. Approaches
of investigation of solutions for research problem, data collection, analysis, interpretation, Necessary
instrumentations
UNIT - II Lecture Hrs:
Effective literature studies approaches, analysis Plagiarism, Research ethics, Effective technical writing,
how to write report, Paper Developing a Research Proposal, Format of research proposal, a presentation
and assessment by a review committee.
UNIT - III Lecture Hrs:
Nature of Intellectual Property: Patents, Designs, Trade and Copyright. Process of Patenting and
Development: technological research, innovation, patenting, development. International Scenario:
International cooperation on Intellectual Property. Procedure for grants of patents, Patenting under PCT.
UNIT - IV Lecture Hrs:
Patent Rights: Scope of Patent Rights. Licensing and transfer of technology. Patent information and
databases. Geographical Indications.
UNIT - V
New Developments in IPR: Administration of Patent System. New developments in IPR; IPR of
Biological Systems, Computer Software etc. Traditional knowledge Case Studies, IPR and IITs.
Text Books:
1. Stuart Melville and Wayne Goddard, “Research methodology: an
introduction for science & engineering students’”
2. Wayne Goddard and Stuart Melville, “Research Methodology: An Introduction”