CMS COLLEGE OF ENGINEERING AND TECHNOLOGY
Affiliated to Anna University, Chennai | Approved by AICTE, New Delhi
Accredited by NAAC – ‘A’ Grade | ISO : 9001:2015 Certified)
Appachigoundenpathy, Kummittipathi (PO), Coimbatore – 641 032.
DEPARTMENT OF ARITIFICAL INTELLIGENCE & DATA SCIENCE
Internal Test –I
Sub Code: AD3391 Date: 24.3.2025 (AN)
Sub Name:DATABASE DESIGN AND MANAGEMENT
Maximum Marks:60
Department: AIDS-(A)
Duration: 1 hr 30min
Year: II
Semester: III
CO1 To introduce database development life cycle and conceptual
CO2 To learn SQL for data definition, manipulation and querying a database
Part A (Answer all Questions) 5 x 2 = 10 marks
[Link] Question Marks CO# BT
1 Define database design 2 CO1 R
2 Define entity relationship model 2 CO1 U
3 What is primary key? 2 CO1 R
4 What is weak entity? 2 CO1 R
5 Define requirement collection in Database. 2 CO1 U
Part B 3X12=36
[Link] Question Marks CO# BT
Explain Database System Development Lifecycle with
a) 12 CO1 U
a diagram?
6
(OR)
b) Explain about SQL DDL Commands with example 12 CO2 R
Explain in detail about Entity Relationship model with
a) 12 CO1 U
diagram
7 (OR)
b) Explain about SQL DML Commands with examples 12 CO2 Ap
a) Discuss the UML class diagram. 12 CO1 Ap
8 (OR)
b)
Explain in detail about enhanced ER model. 12 CO2 Ap
Part C 1x14=14
Explain the following terms briefly in E-R model
entity, relationship, entity set, relationship set, one-one
9 a) 14 CO1 U
relationship, one-many, many to one ,many to many
relationship ,weak entity ,participation constraint
Faculty-in-Charge Approved by
R-Remembering U-Understanding Ap-Applying An-Analyzing Ev-Evaluating Cr-Creating
CMS COLLEGE OF ENGINEERING AND TECHNOLOGY
Affiliated to Anna University, Chennai | Approved by AICTE, New Delhi
Accredited by NAAC – ‘A’ Grade | ISO : 9001:2015 Certified)
Appachigoundenpathy, Kummittipathi (PO), Coimbatore – 641 032.
DEPARTMENT OF SCIENCE AND HUMANITIES
Internal Test –I
Sub Code: AD3251 Date: 24.3.2025 (AN)
Sub Name: Data Structures Design Maximum Marks:60
Department: AIDS-I Duration: 1 hr 30min
Year: I Semester: II
CO1 Explain abstract data types
CO2 Design, implement, and analyze linear data structures, such as lists, queues and stacks,
according to the needs of different applications
Part A (Answer all Questions) 5 x 2 = 10 marks
[Link] Question Marks CO# BT
1 Define ADT? 2 CO1 R
2 List Asymptotic notation 2 CO1 U
3 What is shallow copying? 2 CO1 R
4 What is deep copying? 2 CO1 R
5 Define class? 2 CO1 U
Part B 3X12=36
[Link] Question Marks CO# BT
a) Explain in detail about recursion. 12 CO1 U
6 (OR)
b) Explain in detail about queue with example. 12 CO2 R
a) Explain in detail about object oriented programming. 12 CO1 U
(OR)
7
Explain the various operations of the stack ADT with
b) 12 CO2 Ap
examples.
Discuss the analyzing of recursive algorithms with
a) 12 CO1 Ap
factorial program.
8 (OR)
Explain the various operations of the list ADT with
b) examples. 12 CO2 Ap
Part C 1x14=14
9 a) Explain about Asymptotic notation in detail . 14 CO1 U
Faculty-in-Charge Approved by
R-Remembering U-Understanding Ap-Applying An-Analyzing Ev-Evaluating Cr-Creating