Year II

Semester IV

CSE11108 Database Management Systems L T P C

Version 1.0 Contact Hours – 45 3 0 0 3

Pre-requisite/Exposure Set Theory, Knowledge of programming language.

Co-requisite NIL
Course Objectives:
1. To understand database concepts, applications, data models, schemas and instances.

2. To implement the relational database design and data modelling using entity-
relationship (ER) model.

3. To demonstrate the use of constraints and relational algebra operations and

Normalization process

4. To learn the new emerging Technologies and Applications in database.

Course Outcomes:
On the completion of this course the student will be able to
1. Describe the characteristics of database and the architecture of Database system.

2. Model the elements used in Entity- Relationship diagram.

3. Summarize relational model concept and illustrate the relational constraints.

4. Build Structured Query Language (SQL) and apply to query a database and Define
normalization for relational databases.

5. Develop some Standalone (Example)/ Mobile/ Web Application DB on real world

case studies.

Course Description:
Databases form the backbone of all applications today – tightly or loosely coupled, intranet or
internet based, financial, social, administrative, and so on. Database Management Systems
(DBMS) based on relational and other models have long formed the basis for such databases.
Consequently, Oracle, Microsoft SQL Server, Sybase etc. have emerged as leading commercial
systems while MySQL, PostgreSQL etc. lead in open source and free domain. While DBMS’s
differ in the details, they share a common set of models, design paradigms and a Structured
Query Language (SQL). In this background the course examines data structures, file
organizations, concepts and principles of DBMS’s, data analysis, database design, data
modeling, database management, data & query optimization, and database implementation.
More specifically, the course introduces relational data models; entity-relationship modeling,
SQL, data normalization, and database design. Further it introduces query coding practices
using MySQL (or any other open system) through various assignments. Design of simple multi-
tier client / server architectures based and Webbased database applications is also introduced.
Course Content:
Unit-I 9 Lecture Hours
Overview of database management systems and the relational mode:
Database system architecture: Data Abstraction, Data Independence, Data Definition
Language (DDL), Data Manipulation Language (DML). Data models: Entity-relationship
model, network model, relational and object-oriented data models, integrity constraints,
data manipulation operations. ER models: Entity Set, Relation Ship Set, Cardinality
Properties, Type of Entities, Type of Keys, Aggregation, Specialization and
Generalization.
Unit-II 9 Lecture Hours
Database design: E-R diagrams, constraints, normal forms
Relational algebra, Fundamental Operations, Additional Operations. Select, Project,
Cartesian Product, UNION, Set difference, Rename. Types of joining operations, Division,
Intersection, Aggregate. Tuple and domain relational calculus, SQL3, DDL and DML
constructs, Open source and Commercial DBMS - MYSQL, ORACLE, DB2, SQL server.
Unit-III 9 Lecture Hours
SQL: data definition, data manipulation, queries, views, constraints, triggers:
Relational database design: Integrity Constraint, Domain Constrain, Referential Integrity,
Functional Dependencies, Closure of Set, Cover and Canonical Cover, Types of
Anomalies, Armstrong's axioms, Extended Armstrong's axioms, Assertions and Demons.
Data Base Decomposition: Domain and data dependency, Normal forms: 1NF, 2 NF, 3 NF,
BCNF, Dependency preservation, Lossless design.

Unit-IV 9 Lecture Hours

Storage and indexing: B-trees, hashing:
Query processing and optimization: Evaluation of relational algebra expressions, Query
equivalence, Join strategies, Query optimization algorithms. Storage strategies: Indices, B-
trees, B+-trees, hashing, File System, Disk Organization, Physical Storage, Buffer
management.
Unit-V 9 Lecture Hours
Case Studies : Standalone (Example)/ Mobile/ Web Application DB:
Transaction processing: Failure, Recovery from Failure, Different States of Transaction,
Transaction Isolation, ACID property, Serializability of scheduling, Multi-version and
optimistic Concurrency Control schemes. Concurrency control: Locking and timestamp-
based schedulers, 2-Phase Locking Protocol, Dead Lock, Database Security:
Authentication, Authorization and access control, DAC, MAC and RBAC models,
Intrusion detection, SQL injection. Advanced topics: Distributed databases, Data
warehousing and data mining.

Text Books:
1. “Database System Concepts”, 6th Edition by Abraham Silberschatz, Henry F.
Korth, S. Sudarshan, McGraw-Hill 2. “Principles of Database and Knowledge –
Base Systems”, Vol 1 by J. D. Ullman, Computer Science Press.
Reference Books:
1. “Fundamentals of Database Systems”, 5th Edition by R. Elmasri and S. Navathe,
Pearson Education
2. “Foundations of Databases”, Reprint by Serge Abiteboul, Richard Hull, Victor
Vianu, Addison-Wesley

Modes of Evaluation: Quiz/Assignment/Presentation/Extempore/ Written Examination

Examination Scheme:
Components Mid Term Class Assessment End Term
Weightage (%) 20 30 50

Relationship between the Course Outcomes (COs) and Program Outcomes (POs)
Mapping between COs and POs
Course Outcomes (COs) Mapped Program
Outcomes
CO1 Describe the characteristics of database and the architecture of PO1, PO2, PSO1
Database system.
CO2 Model the elements used in Entity- Relationship diagram. PO2, PO3, PO4, PSO1
CO3 Summarize relational model concept and illustrate the relational PO1, PO2, PO4
constraints.
CO4 Build Structured Query Language (SQL) and apply to query a PO2, PO3, PO4, PO5
database and Define normalization for relational databases.
CO5 Develop some Standalone (Example)/ Mobile/ Web Application PO3, PO5
DB on real world case studies.
 Course Course P P P P P P P P P P P P PS PS PS
Code Title O O O O O O O O O O O O O O O
1 2 3 4 5 6 7 8 9 1 1 1 1 2 3
0 1 2
CSE11 Database
108 Manage
2 3 2 3 2 - - - - - - 2
ment
Systems

1 = Weakly Mapped 2 = Moderately Mapped 3 = Strongly Mapped

 ADAMAS UNIVERSITY
END SEMESTER EXAMINATION
(EVEN SEMESTER 2022)
Name of the Program: B.Tech Semester: IV

Paper Title: Database Management Systems Paper Code: CSE11108

Maximum Marks: 50 Time Duration: 3 Hrs

Total No. of Questions: 17 Total No of 3

Pages:
(Any other information for the 1. At top sheet, clearly mention Name, Univ. Roll No., Enrolment No., Paper Name
student may be mentioned here) & Code, Date of Exam.
2. All parts of a Question should be answered consecutively. Each Answer should start
from a fresh page.
3. Assumptions made if any, should be stated clearly at the beginning of your answer.

Group A
Answer All the Questions (5 x 1 = 5)
1 What is Primary Key? Explain with Example? Remember CO1
2 What is DDL? Explain with Example? Remember CO2
3 What is the full form for SQL? Apply CO3
4 Define multi-valued attributes with example? Understand CO4
5 Define Derived Attribute? Remember CO5
Group B
Answer All the Questions (5 x 2 = 10)
6 What is highest normal form for the given relation R? Explain your answer? Apply CO1
R={A,B,C,D,E,F}
FDs:
A  B,C
C D,E,F

7 What is the Sparse Index? Understand CO2

8 What is Deadlock? Remember CO3

9 Justify all Primary keys are candidate keys but not all candidate keys are primary keys? Apply CO4

10 Explain Various types of Two-phase locking protocol? Understand CO5

Group C
Answer All the Questions (7 x 5 = 35)
11 Draw an entity-relationship diagram for the Hospital management system. Please mention Apply CO1
proper symbols and cardinality property.
12 Consider the following table Understand CO2
Table1 : Student
Student_ID First_Name Address Age Percentage Grade
201 Akash Delhi 18 89 A2
202 Bhavesh Kanpur 19 93 A1
203 Yash Delhi 20 89 A2
204 Bhavna Delhi 19 78 B1
205 Yatin Lucknow 20 75 B1
206 Ishika Ghaziabad 19 91 C1
207 Vivek Goa 20 80 B2

Table2: Department
Dept_ID Dept
Name
1 Geography
2 CSE
3 ECE
4 EE
Table3:
Dept_ID Student_ID
1 201
2 202
3 203
4 204
1 205
2 206
Express the following queries in Relational Algebra
a) Find the name of the students who stay in the same city as Akash?
b) Find the name of the students who got more marks Yatin?
c) Find the name of the students Studying Geography?
d) Find the student names aged more than 19 years?
Find the name of the student who had not enrolled under any department?

13 Explain Different Database Models? Remember CO3

14 Explain Fundamental Relational Algebra operators? Apply CO4

15 Write Short note on BCNF Normal forms? With proper example? Understand CO4

16 What are the mechanisms used for Deadlock Recovery? Remember CO5

17 Explain Transaction State Diagram? Remember CO5

 CSE11109 Object Oriented Programming L T P C
Version 1.0 Contact Hours – 45 3 0 0 3
Pre-requisite/Exposure Knowledge of procedural programming
Co-requisite NIL

Course Objectives:
Students will be motivated to solve the problems in engineering using the concepts of object-
oriented programming.

Course Outcomes:
On completion of this course, the students will be able to

CO1. Interpret fundamentals of object-oriented programming in Java, including defining

Classes, invoking methods, using class libraries, etc.
CO2. Construct programming solutions with exception handling and multi-threading
concept
CO3. Develop programming solutions using database connection
CO4. . Solve GUI program with proper event handling techniques
CO5. Develop programming solutions to real world problems effectively.

Course Description:
This course investigates object-oriented methods including object-oriented programming
methodologies and techniques. Current methodology is emphasized. The use of object-oriented
features such as encapsulation, information hiding, inheritance and polymorphism is reinforced
by class assignments and programming exercises. The importance of multi-threading and
exception handling is introduced in this course.
Course Content:
Unit-I 09 Lecture
Hours
OOP Concepts - Data Abstraction, Encapsulation, Inheritance, Benefits of Inheritance,
Polymorphism, Classes and Objects, Procedural and OOP Paradigms. Introduction To Java,
Data Types, Variables & Constants, Scope & Life Time Of Variables, Precedence Of
Operator, Expressions, Type Casting, Enumerated Types, Block Scope, Control Flow,
Conditional Statements, Loops, Break & Continue Statements, Arrays, Console
Input/Output, Formatting Output, Constructors Methods, Parameter Passing, Static Fields &
Methods, Access Control, “This” Reference, Method Overloading, Recursion, Garbage
Collection, Building Strings, String Class.
Unit-II 09 Lecture
Hours

Exception Handling - Dealing With Errors, Advantages Of Exception Handling, The

Classification - Exception Hierarchy, Checked And Unchecked Exceptions, Try, Catch,
Throw, Throws And Finally, Exceptions-Throwing, Exception Specification, Built In
Exceptions, Creating Exception Sub Classes.
Multithreading - Difference Between Multiple Processes And Multiple Threads, Thread
States, Creating And Interrupting Threads, Thread Priorities, Synchronizing Threads, Inter-
Thread Communication, Procedure Consumer Pattern.
Unit-III 09 Lecture
Hours

Collection Framework - Introduction, Generics and Common Use Of Collection Classes,

Array List, Vector, Hash Table, Stack, Enumeration, Iterator, String Tokenizer, Random,
Scanner, Calendars And Properties.
Files - Streams - Byte Streams, Character Streams, Text Input/Output, Binary Input/Output,
Random Access of File Operations, File Management.
Connecting To Database – JDBC / ODBC Type 1 To 4 Drivers, Connection And Handling
Databases With JDBC.
Unit-IV 09 Lecture
Hours
GUI Programming - The AWT Class Hierarchy, Introduction To Swing, Swing Vs, AWT,
Hierarchy Of Swing Components, Containers - Jframe, Japplet, Jdialog, Jpanel, Overview
Of Swing Components: Jbutton, Jlabel, Jtextfield, Jtextarea, Swing Applications, Layout
Management - Types - Border, Grid And Flow
Event Handling - Events, Sources, Classes, Listeners, Event Sources And Listeners,
Delegation Event Model, Examples. Handling Mouse Events, Adapter Classes.
Applets - Inheritance Hierarchy For Applets, Differences Between Applets And
Applications, Life Cycle, Passing Parameters To Applets, Applet Security Issues.
Unit-V 09 Lecture
Hours

Application Development: Design of real life GUI applications using Swing/AWT/JDBC

for Employee management system, Hotel management system, Hospital management
system etc.
Text Books:
1. Java Fundamentals - A Comprehensive Introduction, Illustrated Edition
ByDaleskrien, Herbert Schildt, Mcgraw-Hill Education.

Reference Books:
1. Java For Programmers, 2nd Edition By Paul Deitel And Harvey Deitel, Pearson
Education.
2. Thinking In Java, Low Price Edition By Bruce Eckel, Pearson Education

Modes of Evaluation: Quiz/Assignment/Presentation/Extempore/ Written Examination

Examination Scheme:
Components Mid Term Class Assessment End Term
Weightage (%) 20 30 50

Relationship between the Course Outcomes (COs) and Program Outcomes (POs)
Mapping between COs and POs
Course Outcomes (COs) Mapped Program
Outcomes
CO1 PO1, PSO1,PO12
Interpret fundamentals of object-oriented programming in Java,
including defining classes, invoking methods, using class
libraries, etc.

CO2 Construct programming solutions with exception handling and PO1, PO2, PO3
multi-threading concept

CO3 Develop programming solutions using database connection PO1, PO2, PSO1

CO4 Solve GUI program with proper event handling techniques PO1, PO12, PO3, PSO1

CO5 Develop programmingsolutions to real world problems PO1, PO2, PO3, PSO1, PO12
effectively.
 Cour Course P P P P P P P P P P P P PS PS PS
se Title O O O O O O O O O O O O O O O
Code 1 2 3 4 5 6 7 8 9 1 1 1 1 2 3
0 1 2
CSE
1110 Object
9 oriented
program 3 3 2 - - - - - - - - 3 3
ming

1 = Weakly Mapped
2 = Moderately Mapped
3 = Strongly Mapped

ADAMAS UNIVERSITY
END SEMESTER EXAMINATION
(Academic Session: 2020 – 21)
Name of the Program: B.Tech Semester: IV

Paper Title: Object oriented programming Paper Code: CSE

11109
Maximum Marks: 50 Time Duration: 3 Hrs

Total No. of Questions: 17 Total No of 2

Pages:
(Any other information for the 4. At top sheet, clearly mention Name, Univ. Roll No., Enrolment No., Paper Name
student may be mentioned here) & Code, Date of Exam.
5. All parts of a Question should be answered consecutively. Each Answer should start
from a fresh page.
 6. Assumptions made if any, should be stated clearly at the beginning of your answer.

Group A
Answer All the Questions (5 x 1 = 5)
1 How many primitive data types are there in JAVA? R CO1

2 Which access specifier can be used for a class so that its R CO2
members can be accessed by a different class in the same
package?
3 What is the correct ordering for importing a class? R CO3
4 Name some of the most common types of exceptions that might R CO5
occur in java.
5 What is join() method? R CO5
Group B
Answer All the Questions (5 x 2 = 10)
6 What are the features of Java? Explain in brief. R CO1

7 What is the difference between while and do-while loop? R CO2

8 Define constructor with a suitable example. R CO3

9 What is multithreading? R CO5

10 Why doesn’t Java support Multiple Inheritance? R CO4

Group C
Answer All the Questions (7 x 5 = 35)
11 What is typecasting? Why it is required in the program? R CO1

12 Develop a Java program in java to print the following triangle: AP CO2

1
01
101
0101
10101

13 Briefly explain Static binding and Dynamic binding U CO3

14 Explain Array List and Vector with examples. U CO4

15 Explain the life cycle of JAVA thread. U CO5

16 Develop a java program to use the yield ( ), stop ( ) and sleep ( ) AP CO5
methods of a thread.

17 Develop an applet that receives three numeric values as input from the AP CO6
user and then displays the largest of the three on the screen.
 CSE11110 Design and Analysis of Algorithms L T P C
Version 1.0 Contact Hours – 45 3 0 0 3
Pre-requisite/Exposure Discrete Mathematics
Co-requisite Concepts on Programming, Logical Ability, Problem Solving

Course Objectives:
1. To introduce problem solving approach through design.
2. To develop students to analyse the existing algorithms and approach for improvement.
3. To introduce the students a perspective to different design and analysis approach for
algorithm(s) to solve a problem.
4. To develop students to select optimal solution to a problem by choosing the most
appropriate algorithmic method.

Course Outcomes:
On the completion of this course the student will be able to
CO1: Understand the basics about algorithms and learn how to analyse and design
algorithms

CO2: Choose brute force, divide and conquer, dynamic programming and greedy
techniques methods to solve computing problems

CO3: Understand the approach for solving problems using iterative method.

CO4: Describe the solution of complex problems using backtracking, branch and
bound techniques.

CO5: Classify the different Computability classes of P, NP, NP-complete and NP-
hard.

Course Description:
Algorithmic study is a core part of Computer Science. This study caters to all possible
applicable areas of Computer Science. This study includes observation, design, analysis and
conclusion. Various types of algorithms have different notion of implementation according to
their cost (in terms their time and space complexity). This study also includes refinement of
one algorithm as per the applicability to real problems. Categorization of algorithms according
to different method of design also includes in this course. It also compares the same algorithm
using different algorithm design methods. For example, Knapsack problem can be solved in
Greedy approach and Dynamic approach, both are optimization method. This course enables
the students to think analytically while applying, designing an algorithm to solve a specific
problem.
Course Content:
 Unit-I 09 Lecture Hours
Introduction:
Characteristics of algorithm. Analysis of algorithm: Asymptotic analysis of complexity bounds – best,
average and worst-case behaviour; Performance measurements of Algorithm, Time and space trade-offs,
Analysis of recursive algorithms through recurrence relations: Substitution method, Recursion tree method
and Masters’ theorem.
Algorithm Design Paradigms.

Unit-II 09 Lecture Hours

Sorting Algorithms & Data Structures:
Selection sort, bubble sort, insertion sort, Sorting in linear time, count sort, Linear search,
Divide & Conquer:
Quick sort, worst and average case complexity, Merge sort, Matrix multiplication
Binary search, Binary search tree, Strassen’s algorithm for matrix multiplication, The substitution
method for solving recurrences, The recursion-tree method for solving recurrences, The master method
for solving recurrences.

Unit-III 09 Lecture Hours

Greedy algorithms:
General Characteristics of greedy algorithms, Problem solving using Greedy Algorithm-
Activity selection problem, Minimum Spanning trees (Kruskal’s algorithm, Prim's algorithm), Graphs:
Shortest paths, The Knapsack Problem

Dynamic programming:
Introduction, The Principle of Optimality, Problem Solving using Dynamic Programming-
Making Change Problem, Assembly Line Scheduling, Knapsack problem, Matrix chain multiplication,
Longest Common Subsequence Dynamic Programming using Memoization.

Unit-IV 09 Lecture Hours

Graph Algorithms :
Representations of graphs, Breadth-first search, Depth-first search, Topological sort, Strongly connected
components, Minimum Spanning Trees, Growing a minimum-spanning tree, The algorithms of Kruskal
and Prim, Single-Source Shortest Paths, Bellman-Ford algorithm, Single-source shortest paths in directed
acyclic graphs, Dijkstra’s algorithm, Difference constraints and shortest paths, Proofs of shortest-paths
properties, All-Pairs Shortest Paths, Shortest paths and matrix multiplication, The Floyd-Warshall
algorithm, Johnson’s algorithm for sparse graphs, Maximum Flow, Flow-networks, The Ford-Fulkerson
method,

Branch & Bound & Backtracking

Unit-V 09 Lecture Hours

String Matching
The naive string-matching algorithm, The Rabin-Karp algorithm, String matching with finite automata,
The Knuth-Morris-Pratt algorithm
Approximation Algorithms:
The vertex-cover problem, The traveling-salesman problem, The set-covering problem, Randomization
and linear programming
NP-Completeness:
Polynomial time, Polynomial-time verification, NP-completeness and reducibility,
NP-completeness proofs , NP-complete problems.
 Text Books:
1. Introduction to Algorithms, 4TH Edition, Thomas H Cormen, Charles E Lieserson, Ronald L
Rivest And Clifford Stein, MIT Press/ Mcgraw-Hill.
2. Fundamentals of Algorithms – E. Horowitz Et Al.
3. Algorithm Design, 1ST Edition, Jon Kleinberg and Évatardos, Pearson.
4. Book 3 – Author – Publisher

Reference Books:
1. Algorithm Design: Foundations, Analysis, And Internet Examples, Second Edition, Michael T
Goodrich And Roberto Tamassia, Wiley.
2. Algorithms -- A Creative Approach, 3RD Edition, Udimanber, Addison-Wesley, Reading, MA.
Modes of Evaluation: Quiz/Assignment/Presentation/Extempore/ Written Examination

Examination Scheme:
Components Mid Term Class Assessment End Term
Weightage (%) 20 30 50

Relationship between the Course Outcomes (COs) and Program Outcomes (POs)
Mapping between COs and POs
Course Outcomes (COs) Mapped Program
Outcomes
CO1 Understand the basics about algorithms and learn how to PO1, PO, PO3, PO4, PSO1,
analyse and design algorithms PSO2
CO2 Choose brute force, divide and conquer, dynamic programming PO1, PO, PO3, PO4, PSO1,
and greedy techniques methods to solve computing problems PSO2
CO3 Understand the approach for solving problems using iterative PO1, PO, PO3, PO4, PSO1,
method. PSO2
CO4 Describe the solution of complex problems using backtracking, PO1, PO, PO3, PO4, PSO1,
branch and bound techniques. PSO2
CO5 Classify the different Computability classes of P, NP, NP- PO1, PO, PO3, PO4, PSO1,
complete and NP-hard. PSO2
 Course Course
PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO PSO
Code Title 1 2 3 4 5 6 7 8 109 11 12 1 2 3
CSE Design and 3 3 3 3 - - - - - - - - 3 3 -
11110 Analysis
of
Algorithms

1 = Weakly Mapped
2 = Moderately Mapped
3 = Strongly Mapped

ADAMAS UNIVERSITY
END SEMESTER EXAMINATION
(EVEN SEMESTER 2022)
Name of the Program: B.Tech Semester: IV

Paper Title: Design and Analysis of Algorithm Paper Code: CSE

11110
Maximum Marks: 50 Time Duration: 3 Hrs

Total No. of Questions: 17 Total No of 3

Pages:
(Any other information for the 7. At top sheet, clearly mention Name, Univ. Roll No., Enrolment No., Paper Name
student may be mentioned here) & Code, Date of Exam.
8. All parts of a Question should be answered consecutively. Each Answer should start
from a fresh page.
9. Assumptions made if any, should be stated clearly at the beginning of your answer.

Group A
Answer All the Questions (5 x 1 = 5)
 1 Explain Asymptotic Tight Bound notation. E CO1
2 Which algorithm design technique is used for Quick Sort? R CO2
3 Which algorithm solves All-pair shortest path algorithm R CO3
4 What is the time complexity of Binary Search algorithm on n items R CO3
5 What is the running time of BFS of a Graph defined by G=(V,E) R CO3
Group B
Answer All the Questions (5 x 2 = 10)
6 a) What is the complexity of the following recurrence relation using R CO1
Master Theorem?
T(n) = 2T (n1/2) + log n

7 a) What is Tail recursion? Give an example R CO2

8 a) Compare and Contrast between BFS and DFS U CO3

9 a) What is the difference between Divide-and-Conquer and Dynamic R CO4

Programming

10 a) What is classes P and NP R CO5

Group C
Answer All the Questions (7 x 5 = 35)
11 a) Discuss the Time Complexity of Binary Search for all three cases C CO1

12 a) Discuss Strassen’s Matrix Multiplication C CO2

13 a) Find the optimal solution using Greedy criteria for a Knapsack having R CO2
Capacity 100Kg for the following list of Items having values and
weights shown in the table:
Item Value Weight
I1 10 15
I2 20 25
I3 30 35
I4 40 45
I5 50 55

14 a) Discuss Kahn’s Algorithm for Topological Sorting using BFS C CO3

15 a) Using Dijkstra’s Algorithm, find the shortest distance from source R CO3
vertex ‘S’ to remaining vertices in the following graph-
16 a) What will be the total weight and Minimal Spannig Tree of the R CO4
following graph using Kruskal’s Algorithm.

17 a) Discuss Travelling Salesman Problem With an suitable example C CO5

 CSE11111 Formal Language and Automata L T P C
Version 1.0 Contact Hours – 45 3 0 0 3
Pre-requisite/Exposure NIL
Co-requisite NIL

Course Objectives:
1. Introduce concepts in automata theory and theory of computation
2. Identify different formal language classes and their relationships
3. Design grammars and recognizers for different formal languages
4. Prove or disprove theorems in automata theory using its properties
5. Determine the decidability and intract
6. ability of computational problems

Course Outcomes:
On the completion of this course the student will be able to
CO1: Define the basic concepts in formal language theory, grammars, automata
theory, computability theory, and complexity theory.
CO2: Demonstrate abstract models of computing, including deterministic (DFA),
non-deterministic (NFA), Push Down Automata (PDA) and Turing (TM) machine
models and their power to recognize the languages
CO3: Prove and disprove theorems establishing key properties of formal languages
and automata.
CO4: Acquire a fundamental understanding of core concepts relating to the theory of
computation and computational models including (but not limited to) decidability and
Intractability.
CO5: Solve fundamental problems related to Computational Model.

Course Description:
This course will provide a foundation to the “Theory of Computation”. The student
will realize that the sometimes chaotic technology oriented world of computers has a
very elegant mathematical basis to it. This basis is deeply rooted in mathematics developed
before the days of modern computers. Our study will lead to some interesting
implications concerning the theoretical limits of computing. On the practical side, this course
is a background for a course on compilers. Topics covered in this course include:
mathematical prerequisites, finite state machines (automata), concept of a language and
grammars, deterministic and non-deterministic accepters, regular expressions and languages,
context-free languages, normal/canonical forms, pushdown automata, Turing machines,
context sensitive languages, recursive and recursively enumerable languages. Each of the
language classes has two points of view: a class of automata defining the language, and a
class of grammars defining the language. This dual approach to defining languages, will
finally lead to the Chomsky hierarchy of languages. We shall observe that the Turing
Machine not only serves to define a language class, but also a mathematical model for
computation itself and defines the theoretical limits of computation.
Course Content:
 Unit-I 4 Lecture Hours
Mathematical Preliminaries:
Set Theory, Describing a Set, Empty Set, Identity and Cardinality, Subset, Power Sets, Operations on
Sets: Union, Intersection, Set Theoretic Equalities, Sequence versus Set, Ordered Pairs, Cartesian
Product,Relations, Binary Relation, Domain and Range of Relation, Operations on Relations, Properties
of Relations, Functions, Types of Functions, Alphabet, String and Language, Operations on Language,
Grammars, Types of Grammars–Chomsky Hierarchy, Graphs and Trees, Directed Graph, Undirected
Graph, Trees, Lemma, Theorem Proving, Proof by Induction Proof by Contradiction, Proof by Example.
Unit-II 16 Lecture Hours
Finite Automata:
Finite-state Machine, Finite-Automaton Model, Properties of Transition Function ‘c’, Transition Diagram,
Transition Table, Language Acceptance, Two Types of Finite Automata, Deterministic Finite Automata
(DFA) Non-deterministic Finite Automaton, Acceptance of NFA, Equivalence of DFAs and NFAs,
Converting NFA to DFA, Subset Construction, NFA with Epsilon-(ε) Transitions, Epsilon Closure (e-
closure), Eliminating e-Transitions, Converting NFA with ε-Transition to NFA, without ε-Transition,
Converting NFA with ε-Transition to DFA, Comparison Method for Testing, Equivalence of Two FA,
Reduction of Number of States in FA, Indistinguishable States, Equivalent Classes, Minimization of DFA,
Minimization of DFA Using Myhill Nerode Theorem, Finite Automata with Output, Moore Machine,
Mealy Machine, Equivalence Between Moore and Mealy Machines, Interconversions Between Machines,
Applications of Finite Automata with Output, The Full-adder, The String Sequence Detector.
Regular Languages and Regular Grammar:
Regular language, Regular expressions, Deterministic finite automata (DFA) and equivalence with regular
expressions, NFA and equivalence with DFA, Regular grammars and equivalence with finite automata,
Properties of regular languages, Pumping lemma for regular languages, Problem solving using pumping
lemma.
Unit-III 15 Lecture Hours
Pushdown Automata & Context Free Languages:
Graphical Representation of PDA, Instantaneous Description of PDA, Language Acceptance by PDA,
Equivalence of Acceptance of Final State and Empty Stack, Types of PDAs, Deterministic PDA, Closure
Properties of DCFL, Decision Properties of DCFLs, DPDA and Regular Languages, DPDA and
Ambiguous Grammar, Equivalence of PDA’s and CFG’s, Nondeterministic pushdown automata (NPDA),
NPDA and equivalence with CFG, Constructing PDA for Given CFG, Constructing CFG for the Given
PDA, Two-stack PDA, Applications of PDA, PDA as a Parser, Top-down Parser Using the PDA, Pumping
lemma for context-free languages.
Context Free Grammar:
Context-free grammars (CFG), Leftmost and Rightmost Derivations, Derivation Tree, Equivalence of
Parse Trees and Derivations, Ambiguous Grammar, Removing Ambiguity, Inherent Ambiguity,
Simplification of Grammars, Elimination of Useless Symbols, Elimination of e-Productions, Eliminating
Unit Productions, Chomsky normal forms, Greibach normal forms

Unit-IV 10 Lecture Hours

Context Sensitive Grammar and Languages:
Context-sensitive grammars (CSG), Context-sensitive Languages, Linear bounded automata, Linear
bounded automata and equivalence with CSG, Properties of Context-sensitive grammars (CSG) and
Languages, Properties of Linear bounded automata.
Turing Machine :
Turing Assumptions, Instantaneous Description, Turing Machine as Language Accepter, Turing Machine
as a Computational Machine, Techniques for Turing Machine Construction, Storage in Finite Control,
Multi-track Tape, Checking off Symbols, Subroutines, Shifting Over, Types of Turing Machines, Non-
deterministic Turing Machines, Turing Machines with Two-dimensional, Tapes, Turing Machines with
Multiple Tapes, Turing Machines with Multiple Heads, Turing Machines with Infinite Tape, Church’s
Thesis, Turing Machines as Enumerators, Universal Turing Machine, Counter Machine, Recursive and
Recursively Enumerable Languages
Unrestricted grammars and equivalence with Turing machines, Church-Turing thesis, universal Turing
machine, Rice's theorem, undecidable problems about languages.
Unit-V 10 Lecture Hours
Decidability:
Decidable Languages, Decidable problems concerning regular languages, Decidable problems concerning
context-free languages, Undecidability, The diagonalization method, An undecidable language
A Turing-unrecognizable language
Reducibility:
Undecidable Problems from Language Theory, Reductions via computation histories, Simple Undecidable
Problem, Mapping Reducibility , Computable functions, Formal definition of mapping reducibility
Time Complexity:
Measuring Complexity, Big-O and small-o notation, Analyzing algorithms, Complexity relationships
among models, The Class P, Polynomial time, Examples of problems in P, The Class NP, Examples of
problems in NP,
P versus NP, NP-completeness, Polynomial time reducibility, Definition of NP-completeness, The Cook–
Levin Theorem
Space Complexity:
Savitch’s Theorem, The Class PSPACE, PSPACE-completeness
Text Books:
1. Introduction to Automata Theory, Languages, and Computation, 3rd Edition, John E. Hopcroft
Rajeev Motwani and Jeffrey D. Ullman, Pearson Education.
2. Michael Sipser, Introduction to the Theory of Computation, PWS Publishing
3. An Introduction To Formal Languages And Automata, Peter Linz

Reference Books:
1. Harry R. Lewis and Christos H. Papadimitriou, Elements of the Theory of Computation,Pearson
Education Asia.
2. Dexter C. Kozen, Automata and Computability, Undergraduate Texts in Computer Science,
Springer.
 Modes of Evaluation: Quiz/Assignment/Presentation/Extempore/ Written Examination

Examination Scheme:
Components Mid Term Class Assessment End Term
Weightage (%) 20 30 50

Relationship between the Course Outcomes (COs) and Program Outcomes (POs)
Mapping between COs and POs
Course Outcomes (COs) Mapped Program
Outcomes
CO1 Define the basic concepts in formal language theory, grammars, PO1, PO, PO3, PO4, PSO1,
automata theory, computability theory, and complexity theory. PSO2
CO2 Demonstrate abstract models of computing, including PO1, PO, PO3, PO4, PSO1,
deterministic (DFA), non-deterministic (NFA), Push Down PSO2
Automata (PDA) and Turing (TM) machine models and their
power to recognize the languages
CO3 Prove and disprove theorems establishing key properties of PO1, PO, PO3, PO4, PSO1,
formal languages and automata. PSO2
CO4 Acquire a fundamental understanding of core concepts relating to PO1, PO, PO3, PO4, PSO1,
the theory of computation and computational models including PSO2
(but not limited to) decidability and Intractability.
CO5 Solve fundamental problems related to Computational Model. PO1, PO, PO3, PO4, PSO1,
PSO2

Course
Course PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO PSO
Code
Title 1 2 3 4 5 6 7 10
8 11
9 12 1 2 3
CSE11111 Formal 3 3 3 3 - - - - - - - - 3 3 -
Language
and
Automata
Theory
 1 = Weakly Mapped
2 = Moderately Mapped
3 = Strongly Mapped
ADAMAS UNIVERSITY
END SEMESTER EXAMINATION
(MARCH-2022)

Name of the Program: B.Tech Semester: IV

Paper Title: Formal Languages and Automata Theory Paper Code: CSE11111

Maximum Marks: 50 Time Duration: 3 Hrs

Total No. of Questions: 17 Total No of 3

Pages:
(Any other information for 10. At top sheet, clearly mention Name, Univ. Roll No., Enrolment No., Paper
the student may be Name & Code, and Date of Exam.
mentioned here) 11. All parts of a Question should be answered consecutively. Each Answer
should start from a fresh page.
12. Assumptions made if any, should be stated clearly at the beginning of
your answer.

Group A
Answer All the Questions (5 x 1 = 5)
1 What is recognized by finite automata? Remembering CO1

a) Any language b) Context sensitive language

c) Context -free language d) Regular language
2 Which one is the set of all strings of {0, 1} where 0 is followed Remembering CO1
by 1 and 1 is followed by 0 is

a) (01)* b) 0*1* c) 0*1 + 1*0 d) 0*1* + 1*0*

3 Select the value of ^ + R R* Remembering CO1,
CO3
a) R b) R* c) R+ d) ^
4 What is the Useless symbols in CFG? Remembering CO1,
CO4
a) Non-generating and non-reachable symbols
b) Non-terminal symbols
c) Null alphabets and null string
d) All of these
5 What is the machine format of PDA? Remembering CO2

a) Type 0 language b) Type 1 language

 c) Type 2 language d) Type 3 language
Group B
Answer All the Questions (5 x 2 = 10)
6 Distinguish between NFA and DFA. Analyzing CO2

7 Define NFA. Remembering CO2

8 What is the necessity of simplification of CFG? Remembering CO1,

CO4

9 Define CFG. Remembering CO1

10 Find S* and S+ , if S = { a, b, ab} Remembering CO1,

CO4

Group C
Answer All the Questions (7 x 5 = 35)
11 Construct a DFA from the given NFA. Creating CO2
______________________________________________
Next State
-----------------------------------------
Present State 0 1
______________________________________________

q0 q0 , q 3 q 0, q1

q1 Ø q2

q2 q2 q2

q3 q4 Ø

q4 q4 q4

_____________________________________________________________________

(Here q0 is the initial state and q4 is the final state)

12 Construct an FA equivalent to the RE, L = (0 + 1)* (10) + Creating CO1,

(00)*(11)*. CO3

13 Examine whether the following grammar is ambiguous or not. Analyzing CO1,

CO4
S —> a / Sa / bSS / SSb / SbS
14 Delete the left recursion from the following grammar. Creating CO1,
S —> Aa/b CO4
A —> Ac/Sd/f

15 From the identities of RE, prove that Evaluating CO1,

10 + (1010)* [^ + (1010)*] = 10 + (1010)*. CO3

16 Construct a Finite Automata equivalent to the Regular Creating CO1,

Expression: CO2

L = ab + (aa + bb) (a +b)* b

17 Construct a PDA to accept the language L = {WCWR, where W Creating CO2,

ε (a, b)+ and WR is the reverse of W} by the empty stack. CO5

(OR)
 CSE11112 Introduction to Artificial Intelligence L T P C

Version 1.0 Contact Hours – 45 3 0 0 3

Pre-requisite/Exposure Fundamentals of computer science, Operating system

Co-requisite NIL

Course Objectives:
1. To provide the most fundamental knowledge of AI.

2. To make a computer that can learn, plan, and solve problems autonomously.

3. To give the students a perspective on the main research topics in AI i.e. problem
solving, reasoning, planning, etc.

4. To enable students to acquire knowledge on some basic search algorithms for problem
solving; knowledge representation and reasoning; pattern recognition; fuzzy logic;
and neural networks.

Course Outcomes:
On the completion of this course the student will be able to
CO1: Define Artificial Intelligence and its approach.
CO2: Describe propositional logic and inference engine.
CO3: Execute Planning with state-space search.
CO4: Construct Bayesian networks and other temporal models.
CO5: Explain the types of Learning.

Course Description:
Artificial intelligence (AI) is a research field that studies how to realize the intelligent human
behaviors on a computer. The ultimate goal of AI is to make a computer that can learn, plan,
and solve problems autonomously. The main research topics in AI include: problem solving,
reasoning, planning, natural language understanding, computer vision, automatic
programming, machine learning, and so on. Of course, these topics are closely related with
each other. For example, the knowledge acquired through learning can be used both for
problem solving and for reasoning. In fact, the skill for problem solving itself should be
acquired through learning. Also, methods for problem solving are useful both for reasoning
and planning. Further, both natural language understanding and computer vision can be
solved using methods developed in the field of pattern recognition. In this course, we will
study the most fundamental knowledge for understanding AI. We will introduce some basic
search algorithms for problem solving; knowledge representation and reasoning; pattern
recognition; fuzzy logic; and neural networks
 Unit-I 10 Lecture
Hours
Introduction:
Introduction, Agents, Problem formulation, Forward and backward chaining, Unification,
Resolution.
Unit-II 8 Lecture Hours
Search in State Space and Planning:
Uninformed search strategies, Heuristics, Informed search strategies, Satisfying
constraints. Planning with state-space search, Partial-order planning, planning graphs,
Planning and acting in the real world, Forward and backward chaining, Unification,
Resolution.
Unit-III 9 Lecture Hours
Knowledge Representation & Reasoning:
Introduction & Overview, Logical agents, Propositional logic, Inference rules, First-order
logic, Inferences in first order logic, Ontology Engineering, knowledge representation
Unit-IV 9 Lecture Hours
Uncertainty
Quantifying Uncertainty, Probabilistic Reasoning, Probabilistic Reasoning over Time
,Probabilistic Programming, Making Simple Decisions, Making Complex Decisions
,Multiagent Decision Making

Unit-V 9 Lecture Hours

Various wings of AI:
Introduction to various wings of AI –Neurophysiology, cognitive science, pattern
recognition, machine learning, machine vision, linguistics, data science, robotics,
bioinformatics, speech processing, generative systems.
Text Books:
1.Artificial Intelligence – A Modern Approach, Second Edition, S. Russel and P. Norvig
Pearson Education, 2003. 2.Machine Learning, 1st Edition, Tom M. Mitchell, McGraw-
Hill Series. In Computer Science
3.Neural Networks and Learning Machines, 3rd Edition, Simon O. Haykin, Prentice Hall
4.Introduction to Machine Learning, 2nd Edition, Ethem Alpaydın, The MIT Press.
Reference Books:
1.Computational Intelligence: a logical approach”, David Poole, Alan Mack worth, Randy
Goebel, First edition; Oxford University Press, 2004 2.Artificial Intelligence: Structures
and Strategies for complex problem solving”, Fourth Edition, G. Luger, Pearson Education,
2002. 3.Minsky, Marvin. "Society of Mind: a response to four reviews." Artificial
Intelligence 48.3 (1991): 371-396.
Course Content:

Modes of Evaluation: Quiz/Assignment/Presentation/Extempore/ Written Examination

Examination Scheme:
Components Mid Term Class Assessment End Term
Weightage (%) 20 30 50

Relationship between the Course Outcomes (COs) and Program Outcomes (POs)
 Mapping between COs and POs
Course Outcomes (COs) Mapped Program
Outcomes
CO1 Define Artificial Intelligence and its approach. PO1, PO2
CO2 Describe propositional logic and inference engine. PO2, PO3, PO4
CO3 Execute Planning with state-space search. PO1, PO2, PO4
CO4 Construct Bayesian networks and other temporal models. PO2, PO3, PO4, PO5, PSO3
CO5 Explain the types of Learning. PO3, PO5, PSO3

Cour Course P P P P P P P P P P P P PS PS PS
se Title O O O O O O O O O O O O O O O
Code 1 2 3 4 5 6 7 8 9 1 1 1 1 2 3
0 1 2
CSE Introduct
1111 ion to
2 Artificial 2 3 2 3 2 - - - - - - 2
Intellige
nce
 1 = Weakly Mapped
2 = Moderately Mapped
3 = Strongly Mapped

ADAMAS UNIVERSITY
END SEMESTER EXAMINATION
(MARCH-2022)
Name of the Program: B.Tech Semester: IV

Paper Title: Introduction to Artificial Intelligence Paper Code: CSE

11112
Maximum Marks: 50 Time Duration: 3 Hrs

Total No. of Questions: 17 Total No of 2

Pages:
(Any other information for the 13. At top sheet, clearly mention Name, Univ. Roll No., Enrolment No., Paper Name
student may be mentioned here) & Code, Date of Exam.
14. All parts of a Question should be answered consecutively. Each Answer should
start from a fresh page.
15. Assumptions made if any, should be stated clearly at the beginning of your
answer.

Group A
Answer All the Questions (5 x 1 = 5)
1 What makes any system artificially intelligent? U CO1
2 Define Intelligence. U CO2
3 Explain the metrices that is used to draw meaningful insights in R CO3
regression.
4 What are the algorithms that are used for prediction as well as U CO4
classification?
5 Why Machine Learning is a part of AI? U CO5
Group B
Answer All the Questions (5 x 2 = 10)
6 i)What is supervised learning? R CO1
ii)Write the mathematical model for multiple regression.

7 Explain the condition where lasso regression and ridge regression U CO2
techniques are used.

8 “Learning is done by viewing, listening, interactions, studying and by Apply CO3

experience”. Do you agree with the statement. If yes, Elucidate

9 Explain the significance of Baye’s Theorem. U CO4

10 How can you avoid overfitting in machine learning? U CO5

Group C
Answer All the Questions (7 x 5 = 35)
11 i)What is logistic regression model? R CO1
ii)How do you evaluate a logistic regression model?

12 What are different types of training models in Machine Learning? U CO2

13 Explain any one encoding techniques with code snippet. Apply CO3

14 How do you choose a classifier based on training set size? Apply & CO4
Analyse

15 Consider the given dataset. Apply Naïve Bayes algorithm and predict Apply CO4
that if a fruit has the following properties then predict the type of fruit
it is Fruit={ Yellow, Sweet, Size}
Fruit Yellow Sweet Size
mango 350 450 650
banana 400 300 400
others 50 100 150

16 Describe the metrices that are used in Decision Trees to find the root U CO5
node while taking any decision.

17 Write a basic Machine Learning program to check the accuracy of a Apply CO5
model, by importing any dataset using any classifier?
 PSG11021 Human Values and Professional Ethics L T P C
Version 1.0 Contact Hours -45 3 0 0 3
Pre-requisites/Exposure Basic human ethics
Co-requisites --

Course Objectives:

1. To help the students appreciate the essential complementarity between 'VALUES' and
'SKILLS' to ensure sustained happiness and prosperity which are the core aspirations of all
human beings.
2. To facilitate the development of a Holistic perspective among students towards life,
profession and happiness, based on a correct understanding of the Human reality and the
rest of existence. Such a holistic perspective forms the basis of Value based living in a
natural way.
3. To highlight plausible implications of such a Holistic understanding in terms of ethical
human conduct, trustful and mutually satisfying human behaviour and mutually enriching
interaction with Nature.

Course Outcomes:

On the successful completion of the course, students will be able to

CO1. Explain the morals, values, ethics, and the law and to explore how they impact
professional practice;
CO2. Develop an increased personal understanding of issues related to ethics.
CO3. Develop an increased personal understanding of issues related the law
CO4. Analyze one’s own ethical decision-making processes.
CO5. Plan guidelines for enhancing one’s ability to generate ethical behavior and solutions
to conflicts arising in the practice.

Catalog Description:

This course offers an introduction to graph theory, with an emphasis on applications and
modelling. Graph theory is a study of graphs, trees and networks. Topics that will be discussed
include Euler formula, Hamilton paths, planar graphs and coloring problem; the use of trees in
sorting and prefix codes; useful algorithms on networks such as shortest path algorithm,
minimal spanning tree algorithm and min-flow max-cut algorithm.

Course Content:

Unit I: 9 lecture hours

Ethics, morals and values: The meaning of ethics, morals and values, The relevance of ethics,
morals and values in the promotion of scientific temper, Theories of right action, Kohlberg’s
and Gilligan’s theory of moral development, Ethical theories and their applications.

Unit II: 9 lecture hours

Ethics in Engineering Practice and Research: Overview of engineering ethics, Rights and
obligations in engineering, The NPSE, IEEE and ECI codes, Violation of codes and their
consequences, Conflicts of interest, Whistle blowing, Whistle blowing cases.

Unit III: 9 lecture hours

Sustainable Engineering and Sustainable Development: Meaning of sustainable
engineering, Principles of sustainable engineering, Safety and risk assessment, Sustainable
development, Sustainable engineering v. engineering negligence.

Unit IV: 9 lecture hours

Engineering Negligence: The elements of engineering negligence, The standard duty of care,
Liability in negligence cases, Defenses Negligence Cases (Engineering, med ical and
others).

Unit V: 9 lecture hours

Rights and obligations of Engineers under Various Indian Laws: The Indian adjuratory
system, Constitutional laws governing engineering professionals, Contractual obligations of
engineers Environment protection laws, Arbitration and conciliation laws, Intellectual
property laws, Information technology laws.

Text Books:
1.AroraVibha, AroraKunwar, Laws for Engineers, Central Law Publications, 1 st Edition,
2017.
2.Fledderman Charles B., Engineering Ethics, Pearson Education Inc., 4 th Edition, 2012
3.Govindarajan M., Natarajan S., Senthilkumar V. S., Engineering Ethics Includes Human
Values, PHI Learning Private Limited, 1st Edition, 2010

Reference Books:
1.Govindarajan M., Natarajan S., Senthilkumar V. S., Professional Ethics and Human
Values, PHI Learning Private Limited, 1st Edition, 2017.
2.Harris Charles E., Jr., Pritchard Michael S., Rabins Michael J., Engineering Ethics,
Wadsworth Cengage Learning, 4th Edition, 2009

Modes of Evaluation: Quiz/Assignment/ presentation/ extempore/ Written Examination

Examination Scheme:

Components Class Assessment Mid Term End Term

Weightage (%) 30 20 50
Relationship between the Course Outcomes (COs) and Program Outcomes (POs)
Mapping between COs and POs
Mapped
Course Outcomes (COs) Program
Outcomes
Explain the morals, values, ethics, and the law and to PO2, PO7,
CO1
explore how they impact professional practice PO8
 Develop an increased personal understanding of issues PO8, PO3,
CO2
related to ethics. PO4
Develop an increased personal understanding of issues
CO3 related the law. PO2, PSO3
Analyze one’s own ethical decision-making processes.
CO4 PO11, PO12
Plan guidelines for enhancing one’s ability to generate
CO5 ethical behavior and solutions to conflicts arising in the PSO1, PSO2
practice.

Course Course
Code Title PO6PO5PO7 PO8 PO9 PO10 PO11 PO12
PO1 PO2 PO3 PO4
PSO1 PSO2 PSO3
Human
Values and 3 2 2 2
PSG11021 - 2 - - - - 3 2 - - 2
Professional
Ethics

1=weakly mapped
2= moderately mapped
 3=strongly mapped

ADAMAS UNIVERSITY
END SEMESTER EXAMINATION
(MARCH-2022)
Name of the Program: B.Tech Semester: IV

Paper Title: Human Values and Professional Ethics Paper Code: PSG11021

Maximum Marks: 50 Time Duration: 3 Hrs

Total No. of Questions: 17 Total No of 2

Pages:
(Any other information for the 16. At top sheet, clearly mention Name, Univ. Roll No., Enrolment No., Paper Name
student may be mentioned here) & Code, Date of Exam.
17. All parts of a Question should be answered consecutively. Each Answer should
start from a fresh page.
18. Assumptions made if any, should be stated clearly at the beginning of your
answer.

Group A
Answer All the Questions (5 x 1 = 5)
1 Explain the meaning of accountability. U CO1
2 What are values? Explain how values have degenerated. U CO2
3 Discuss the aim of engineering ethics.. R CO3
4 Discuss the need to focus on professional ethics. R CO4
5 Explain the meaning of moral leader ship. U CO5
Group B
Answer All the Questions (5 x 2 = 10)
6 Discuss the relationship between professional responsibility and R CO1
loyalty to company?
7 What are the barriers to communication? Explain some physical U CO2
and psychological barriers of communication.

8 What do you understand by communication? Write a note on the U CO3

importance of effective communication.(R)

9 What is Happiness? U CO4

10 What are the three senses of relative values? U CO5

Group C
Answer All the Questions (7 x 5 = 35)
11 R CO1
Fill in the blanks using suitable article. Please copy the sentences
given, while answering:

a. He was ____ first man to arrive.

b. Would you like to be ______ teacher?
c. I am going to buy ______ hat.
d. Picasso was ____ famous painter.

The Ganga is ____ sacred river.

12 U CO2
Change the following sentences from active to passive
voice:

a. The cat killed a mouse

b. People lined the road
c. He was singing a song yesterday
d. I have read this book.

Who broke the jug?

13 Write a paragraph on the impact of COVID 19 in our society Apply CO3

14 Write an application to the Vice-Chancellor of your University Apply CO4

as the class representative of your respective class requesting &
permission to organize a science exhibition in your department. Analyse

15 Read the following passage and answer the questions that follow. Apply CO4
A few countries already use powerful electromagnets to build high
speed trains. These trains are called maglev trains. Maglev is the
shortened form of magnetic levitation. Maglev trains work on the
principles of magnetism and float over a guideway.
The maglev train is different from a conventional train in that it
does not have an engine. At least it does not have the kind of
engines that pull train cars along steel tracks. It does not consume
fossil fuels either.
 Since maglev trains float in the air, there is no friction between
the train and the track. This lack of friction and the aerodynamic
design of these trains allow them to reach speeds of over 500
kilometer per hour.
Japan and Germany pioneer research in the maglev train
technology. They have already built their prototypes and are in the
process of testing them. Transrapid is an electromagnetic
suspension system developed by German engineers. The idea of
maglev transportation has been in existence for over a century.
The first commercial maglev train made its debut in Shanghai,
China in 2002. This train was developed by a German company.
Right now the Shanghai Transrapid line connects Longyang Road
station and Pudong airport. China is planning to extend this line
to Hangzhou by building a 99 miles guideway.
Several other countries are also planning to build their own
maglev train system, but right now the Shanghai maglev train is
the only commercial maglev line.
Complete the sentences: (2×5=10)
(a) The two main differences between maglev trains and
conventional trains are: ……………………………..,
……………………………………..
(b) Maglev trains are environment friendly because
………………………
(c) The two nations that lead the research in maglev train
technology are ……………………………..
(d) The two factors that help maglev trains to achieve high speeds
are …………………………………….
(e) A suitable title for the passage would be
…………………………………………….

16 What are the aspects of engineering that make it appropriate to view U CO5
engineering projects as experiments?

17 Explain the levels of moral development suggested by Kohlberg. Apply CO5

 CSE12113 Database Management Systems Lab L T P C
Version 1.0 Contact Hours -30 0 0 2 1
Pre-requisites/Exposure Basic human ethics
Co-requisites --

Course Objectives:
1. To explain basic database concepts, applications, data models, schemas and instances.
2. To demonstrate the use of constraints and relational algebra operations.
3. To describe the basics of SQL and construct queries using SQL.
4. To emphasize the importance of normalization in databases.
5. To facilitate students in Database design
6. To familiarize issues of concurrency control and transaction management.

Course Outcomes:

On completion of this course, the students will be able to

CO1. Organize the basic concepts of Database Systems and Applications.

CO2. Construct the basics of SQL and construct queries using SQL in database creation
interaction.
CO3. Define a commercial relational database system (Oracle, MySQL) by writing SQL
using the system.

Catalog Description:

This course introduces the core principles and techniques required in the design and
implementation of database systems. This introductory application-oriented course covers the
relational database systems RDBMS - the predominant system for business scientific and
engineering applications at present. It includes Entity-Relational model, Normalization,
Relational model, Relational algebra, and data access queries as well as an introduction to SQL.
It also covers essential DBMS concepts such as: Transaction Processing, Concurrency Control
and Recovery. It also provides students with theoretical knowledge and practical skills in the
use of databases and database management systems in information technology applications.

Course Content:

Experiment 1:
Familiarization of structured query language.
Experiment 2:
Table Creation.
Experiment 3:
Insertion, Updation, Deletion of tuples.
Experiment 4:
Executing different queries based on different functions.
Experiment 5:
Performing joining operations.
Experiment 6:
Nested Queries.
Experiment 7:
Use of aggregate functions.
Experiment 8:
Use of group functions.
Experiment 9:
Use of order by functions.
Experiment 10:
Arithmetic operations.
Experiment 11:
Trigger using SQL.
Experiment 12:
Introduction to PL/SQL.
Experiment 13:
Report generation of various queries.
Experiment 14:
Merging Data Bases with front end using ODBC connection.
Experiment 15:
SQL Injection on a non-harmful test page.

Text Books:
1. Database System Concepts, 6th Edition by Abraham Silberschatz, Henry F. Korth, S.
Sudarshan, McGraw-Hill
2. Principles of Database and Knowledge – Base Systems, Vol 1 by J. D. Ullman, Computer
Science Press.

Reference Books:
1.Fundamentals of Database Systems, 5th Edition by R. Elmasri and S. Navathe, Pearson
Education
2.Foundations of Databases, Reprint by Serge Abiteboul, Richard Hull, Victor Vianu, Addison-
Wesley.

Modes of Evaluation: Quiz/Assignment/ presentation/ extempore/ Written Examination

Examination Scheme:

Components Continuous Assessment ETE

Weightage (%) 50 50

Relationship between the Course Outcomes (COs) and Program Outcomes (POs)
 Mapping between COs and POs
Mapped
Course Outcomes (COs) Program
Outcomes
Organize the basic concepts of Database Systems and PO1,
CO1
Applications. PO12,PSO3
Construct the basics of SQL and construct queries using PO1, PO3,
CO2
SQL in database creation interaction. PSO2
Design a commercial relational database system (Oracle, PO2, PO3,
CO3 MySQL) by writing SQL using the system. PO4, PSO1
Course
Course Title PO6PO5
PO1 PO2 PO3 PO4 PO7 PO8 PO9 PO10 PO11 PO12
Code PSO1 PSO2 PSO3
CSE12113 Database
Management 3 2 2 3
2 3 2 3 - - - - - - -
Systems Lab

1=weakly mapped
2= moderately mapped
3=strongly mapped
 ADAMAS UNIVERSITY
SCHOOL OF ENGINEERING AND TECHNOLOGY
END-SEMESTER EXAMINATION: JULY 2020
Name of the Program: B. Tech Semester: IV Stream: CSE
PAPER TITLE: Database Management Systems Lab
PAPER CODE: CSE12113
Maximum Marks: 40 Time duration: 3 hours
Total No of questions: 5 Total No of Pages: 02

Instruction for the Candidate:

1. At top sheet, clearly mention Name, Univ. Roll No., Enrolment No., Paper Name & Code, and Date of Exam.
1. All parts of a Question should be answered consecutively. Each Answer should start from a fresh page.
2. Assumptions made if any, should be stated clearly at the beginning of your answer.

Part A (1X 20=20)

Q1. 1. Table: Customer

Column Format Remarks

Name
Customer_ID Varchar(3) Primary Key
Last_Name Char(20)
First_Name Char(20) Not Null
Area Varchar(30)
Phone_No Number(10)

2. Table: Movie_Gallery

Column Format Remarks CO1,

Name R
CO2
Movie_No Varchar(3) Primary Key
Movie_Title Char(20) Not Null
Movie_Type Char(10) Not Null
Movie_Rating Number(05)
CD_Rack_No Number(05)

3. Table: Invoice_Details

Column Name Format Remarks

Invoice_No Varchar(3) Primary Key
Movie_No Char(20) Foreign Key(Table 2)
Customer_ID Varchar(3) Foreign Key(Table 1)
 Issue_Date Date
Return_Date Date
Please enter at least 15 values for each table. Please follow your query before entering
your values.

Part-B (4X5=20)
Q2. Create a SQL query to find out the names of all the customers. U CO2
Q3. Change the return date of invoice number ‘I08’ to 23/02/2018. R CO3
Q4. Write a SQL query to influence the Movies Price by 15% where the price is more than
AP CO2
150/- and show the query as “New_Price”.
Q5. Select the First name of the customers where customers last name does not exist in your
R CO2
table.
Q6 Select the Middle name of the customers where customers last name does not exist in
R CO2
your table.
 CSE12114 Object Oriented Programming Lab L T P C
Version 1.0 Contact Hours – 30 0 0 2 1
Pre-requisite/Exposure Knowledge of programming basics
Co-requisite NIL

Course Objectives:
To understand how to design, implement, test, debug, and document programs that use
basic data types and computation, simple I/O, conditional and control structures, string
handling, functions and object oriented approaches.

Course Outcomes:
On the completion of this course the student will be able to
CO1. Define classes, objects, members of a class and the relationships among them needed
for a
finding the solution to specific problem.
CO2. Illustrate object-oriented modelling techniques like classes and Instances modelling
techniques
CO3. Interpret fundamentals of object-oriented programming in Java, including defining
Classes, invoking methods, using class libraries, etc.
CO4. Construct programming solutions with exception handling and multi-threading
concept
CO5. Solve GUI program with proper event handling techniques.

Course Description:
This course investigates object-oriented methods including object-oriented programming
methodologies and techniques. Current methodology is emphasized. The use of object-oriented
features such as encapsulation, information hiding, inheritance and polymorphism is reinforced
by class assignments and programming exercises. The importance of multi-threading and
exception handling is introduced in this course.
Course Content:
Unit-I 09 Lecture
Hours
Write a Java program to create an abstract class named Shape that contains two integers
and an empty method named print Area (). Provide three classes named Rectangle,
Triangle, and Circle such that each one of the classes extends the class Shape. Each one of
the classes contains only the method print Area () that prints the area of the given shape.

Write a Java program to illustrate the parameterized constructor.

Write a Java program to add two numbers with int and float types using method
overloading.

Unit-II 09 Lecture
Hours
Write a Java program that creates a user interface to perform integer divisions. The user
enters two numbers in the text fields, Num1 and Num2. The division of Num1 and Num 2
is displayed in the Result field when the Divide button is clicked. If Num1 or Num2 were
not an integer, the program would throw a Number Format Exception. If Num2 were Zero,
the program would throw an Arithmetic Exception. Display the exception in a message
dialog box

Unit-III 09 Lecture
Hours
Write a Java program to list all the files in a directory including the files present in all its
subdirectories.

Write a Java program that loads names and phone numbers from a text file where the data
is organized as one line per record and each field in a record are separated by a tab (\t). It
takes a name or phone number as input and prints the corresponding other value from the
hash table (hint: use hash tables).

Unit-IV 09 Lecture
Hours
Write a Java program that simulates a traffic light. The program lets the user select one of
three lights: red, yellow, or green with radio buttons. On selecting a button, an appropriate
message with “Stop” or “Ready” or “Go” should appear above the buttons in selected
color. Initially, there is no message shown.

Suppose that a table named Table.txt is stored in a text file. The first line in the file is the
header, and the remaining lines correspond to rows in the table. The elements are separated
by commas. Write a java program to display the table using Labels in Grid Layout.

a) Develop an applet in Java that displays a simple message.

b) Develop an applet in Java that receives an integer in one text field, and computes its
factorial Value and returns it in another text field, when the button named “Compute” is
clicked.
Unit-V 09 Lecture
Hours
Write a Java program that simulates a Banking GUI application with facilities of deposit,
withdraw and check balance in an account.

Write a Java program that implements Quick sort algorithm for sorting a list of names in
ascending order

Write a Java program that implements Bubble sort algorithm for sorting in descending
order and also shows the number of interchanges occurred for the given set of integers.

Text Books:
2. Java Fundamentals - A Comprehensive Introduction, Illustrated Edition
ByDaleskrien, Herbert Schildt, Mcgraw-Hill Education.

Reference Books:
3. Java For Programmers, 2nd Edition By Paul Deitel And Harvey Deitel, Pearson
Education.
4. Thinking In Java, Low Price Edition By Bruce Eckel, Pearson Education
 Modes of Evaluation: Quiz/Assignment/Presentation/Extempore/ Written Examination

Examination Scheme:
Components Internal End Term
Weightage (%) 50 50

Relationship between the Course Outcomes (COs) and Program Outcomes (POs)
Mapping between COs and POs
Course Outcomes (COs) Mapped Program
Outcomes
CO1 Define classes, objects, members of a class and the relationships PO1, PSO1
among them needed for a finding the solution to specific
problem.
CO2 Illustrate object oriented modelling techniques like classes and PO1, PO2, PO3, PSO1, PS03
Instances modelling techniques
CO3 Interpret fundamentals of object-oriented programming in Java, PO1, PO2, PSO1
including defining Classes, invoking methods, using class
libraries, etc.
CO4 Construct programming solutions with exception handling and PO1, PO2, PO3, PSO1, PSO3
multi-threading concept
CO5 Solve GUI program with proper event handling techniques. PO1, PO2, PO3, PSO1, PSO3

Course Course P P P P P P P P P P P P PS PS PS
Code Title O O O O O O O O O O O O O O O
1 2 3 4 5 6 7 8 9 1 1 1 1 2 3
0 1 2
CSE12 Object 3 - 3
114 Oriented 3 3 3 - - - - - - - -
3
Program
ming Lab
 1 = Weakly Mapped
2 = Moderately Mapped
3 = Strongly Mapped

ADAMAS UNIVERSITY
SCHOOL OF ENGINEERING AND TECHNOLOGY
END-SEMESTER EXAMINATION: JULY 2020
Name of the Program: B. Tech Semester: IV Stream:
PAPER TITLE: Object Oriented Programming Lab PAPER CODE: CSE12114
Maximum Marks: 50 Time duration: 3 hours
Total No of questions: 12 Total No of Pages: 01

Instruction for the Candidate:

1. At top sheet, clearly mention Name, Univ. Roll No., Enrolment No., Paper Name & Code,
Date of Exam.
2. All parts of a Question should be answered consecutively. Each Answer should start from a
fresh page.
3. Assumptions made if any, should be stated clearly at the beginning of your answer.

Section A (attempt any two)

1. What do you understand data types? U CO1
2. Define array? R CO4
3. How user defined function reduces the no. of lines in a large program? R CO2
4. Why pointer is advantageous than array? R CO5
5. What is the size of an integer variable? R CO1
SECTION B (Attempt any Two Questions)
6. What is dimension of an array. How many types of array are there? Can you store integer
R
values and float type values in a single array, if not why? What you need to do to store CO4
such different types of values in an single array?
7. Design an user defined function in c that would return multiple values in main() function. Ap CO3
8. Suppose a paragraph is stored in a 2-D character array. Find a specific sentence in that CO2/
U
paragraph using a c program. CO4
9. State the types of data types and memory occupies. What are the ways to convert from
one data type to another data type with suitable example? U CO1

SECTION C is Compulsory
10. How is it possible to take input in a 2-D array using a single for loop? Make it possible Ap CO4
using a suitable program in c.
11. Design a program in c to determine that a text is written in English or in any other U CO4
language. If the text is written in any other language convert every character in its nearest
English alphabets.
12 Design a program to create a pointer to an integer. Allocate memories for 50 elements into U CO4
that pointer using both malloc() and calloc() function. Display the significance difference
of using those two functions to allocate memory. Also state the specific needs of these two
functions.