IIMT COLLEGE OF ENGINEERING,

GREATER NOIDA

Department of Computer Science and Engineering

COURSE FILE

Session: 2022-2023 (Odd Semester)

Program: B. Tech.
Branch: CSE IInd yr. (AI) & AI-DS
Course: DSTL
(KCS-303)

Name of Faculty: - Mr. Rakesh Kumar

IIMT COLLEGE OF ENGINEERING, GREATER NOIDA

 Department of Computer Science & Engineering
COURSE FILE: CONTENTS

Sr. No. Content

1. IIMT Mission, Vision statement & Quality Policy – one copy
2. Department Mission & Vision – one copy
3. List of Students (All Sections) – (section wise, if applicable)
4. Faculty Introductory Class – one copy
Program Educational Objectives, Course Outcomes and Mapping with POs and PSOs – one
5. copy
6. Academic calendar – one copy
7. University Evaluation Scheme – one copy
8. University Subject Syllabus – one copy
9. Class Time Table – (section wise time table, if applicable)
10. Faculty Time Table – (for each faculty teaching the subject)
11. Lecture Plan along with Sessional Test Schedule (Full Unit/ Half Unit) – one copy
12. Lecture Delivery Schedule - (for each faculty teaching the subject)
13. Plan Summary of Assignment/ Test/ Quiz – section wise
14. Assignments/ Test/ Quiz (Minimum Five) – (section wise; if same mark it accordingly)
15. Solution of Assignment/ Test/ Quiz – (As above)
16. Assignment/ Test/ Quiz Marks – (section wise)
17. Tutorial Sheets-(if applicable)
18. Sessional Tests/ Pre-University Examination Question Papers – one copy
19. Solution of Sessional Tests/ Pre-University Examination Question Papers – one copy
20. Pre University Examination Course Outcome and PO, PSOs Attainment– one copy
21. Award Sheet (section wise)
22. List of Weak Students and their Make-up Classes (after each sessional exam) – section wise
23. Extra Classes to cover the syllabus (if any) – (section wise)
24. End of Semester Summary (Lecture, Attendance & Marks) – (for all sections one sheet)
25. Review of University Question Paper (Current Semester) – one copy
26. Previous Years Question Papers (AKTU - 4 Years) Descending Order – one copy each
Faculty Notes (Handout, PPTs in Separate File) – (for each faculty; common ppts/ notes to be
27. marked accordingly)
28. Books, web content, other than Text Book frequently referred to – (faculty wise)
29. Comparison of result vis a vis with the one in the previous session – (section wise)

IIMT COLLEGE OF ENGINEERING, GREATER

NOIDA
 VISION AND MISSION OF THE INSTITUTE

Vision
To be among the renowned institutions providing engineering and management education of
excellence, empowered with research, innovation and entrepreneurship with high ethical
values, catering to the needs of industry and society.

Mission
 To offer state of the art undergraduate and postgraduate program.

 To be a learner centric institute imbibing experimental innovation and lifelong learning

skills, addressing societal problems with high ethical values for nation building.

 To deliver changing demands of industry and academia through our stakeholders.

 To contribute as a professional leader in the growing field of entrepreneurship and

research.

IIMT COLLEGE OF ENGINEERING, GREATER

NOIDA
 VISION OF THE DEPARTMENT
To produce globally competent Computer Science engineers empowered with research aptitude
and high ethical values to cater to the emerging computing needs of the industry and society.

MISSION OF THE DEPARTMENT

To prepare graduates with

 To impart outcome based learning for emerging technologies in the field of computer
science & engineering.
 To promote creative thinking and innovations by the students and faculty.
 To develop strong industry –academia relationship.
 To nurture students and infuse professional ethics, human values and positive attitude
in the students.

IIMT COLLEGE OF
ENGINEERING, GREATER NOIDA
(Department of Computer Science & Engineering)

________________________________________________________________

PROGRAM EDUCATIONAL OBJECTIVES (PEOs)

PEO 1: To provide solid foundation in computer science engineering along with good communication and
entrepreneurship skills for tackling social issues.

PEO 2: To impart students with good scientific and engineering knowledge in order to analyze, design and create novel
products for giving practical solutions to real life problems.

PEO 3: To create engineers with sound technical knowledge for facing all sorts of challenges in industry or in
pursuance of higher studies.

PEO 4: To motivate students acquire aptitude for lifelong learning along with leadership skills, team spirit and ethical
values.

PROGRAM SPECIFIC OUTCOMES (PSOs)

PSO 1: Ability to interpret and analyze network issues in real world environment.

PSO 2: Ability to design and develop web and mobile based application under realistic constraints.

IIMT COLLEGE OF
ENGINEERING, GREATER NOIDA

Department of CSE (AI) & AI-DS

______________________________________________________________
PROGRAM OUTCOMES (POs)
Engineering Graduates will be able to:
PO1-Engineering Knowledge: Apply the knowledge of mathematics, science, engineering
fundamentals, and an engineering specialization to the solution of complex engineering problems.
PO2-Problem Analysis: Identify, Formulate, review research literature, and analyze complex
engineering problems reaching substantiated conclusions using first principles of mathematics,
natural sciences, and engineering sciences.
PO3-Design/Development of Solutions: Design solutions for complex engineering problems and
design system components or processes that meet the specified needs with appropriate consideration
for the public health and safety, and the cultural, societal, and environmental considerations.
PO4-Conduct Investigations of Complex Problems: Use research–based knowledge and research
methods including design of experiments, analysis and interpretation of data, and synthesis of the
information to provide valid conclusions.
PO5-Modern Tool Usage: Create, Select, and apply appropriate techniques, resources, and modern
engineering and IT tools including prediction and modeling to complex engineering activities with
an understanding of the limitations.
PO6-The Engineer and Society: Apply Reasoning informed by the contextual knowledge to assess
societal, health, safety, legal and cultural issues and the consequent responsibilities relevant to the
professional engineering practice.
PO7-Environment and Sustainability: Understand the impact of the professional engineering
solutions in societal and environmental contexts, and demonstrate the knowledge of, and need for
sustainable development.
PO8-Ethics: Apply Ethical Principles and commit to professional ethics and responsibilities and
norms of the engineering practice.
PO9-Individual and Team Work: Function effectively as an individual, and as a member or leader
in diverse teams, and in multidisciplinary settings
PO10-Communication: Communicate effectively on complex engineering activities with the
engineering community and with society at large, such as, being able to comprehend and write
effective reports and design documentation, make effective presentations, and give and receive clear
instructions.
PO11-Project Management and Finance: Demonstrate knowledge and understanding of the
engineering and management principles and apply these to one’s own work, as a member and leader
in a team, to manage projects and in multidisciplinary environments.
PO12-Life-Long Learning: Recognize the need for, and have the preparation and ability to engage
in independent and life-long learning in the broadest context of technological change.

IIMT College of Engineering, Greater Noida

Department of Computer Science and Engineering
(AI) & AI-DS
Faculty Introductory Class at the beginning of the Semester
Date:19-Sep-2022 Sem/ Sec: IInd year Period: Sub code: KCS-303
Sub Name: Discrete Structures & Theory of Logic

1. Name of the Faculty Member: Mr. Rakesh Kumar

2. Did you teach this/ similar subject earlier in any class? No
3. Class Room Management - When you enter the class observe the following: Everything is found
OK
(a) Students should get up & pay compliments; if not teach them to do so. Reply back & tell them to sit
down
(b) See that the seating arrangement is proper. If required make changes.
(c) Ask General Welfare of the students especially hosteller regarding their mess & food.
(d) In case any particular student is found not cheerful, ask the reason & do the needful.
(e) Make the students aware of General Discipline, Dress Code, Attendance and class etiquettes.
(f) Emphasize importance of taking down notes in separate copies for different subjects, keeping in
step with the class and Establish importance of asking questions.
(g) Importance of communication in English for the professionals.
4. When you find that the students are comfortable and ready to listen, then talk on the following
points: Yes
(a) Introduce yourself i.e., Name, qualification and experience in research etc. and any other infor-
mation which may influence the students to regard you as their teacher/ guide or mentor.
(b) Introduce the subject to be taught highlighting the following:
- Course Objectives
- Course Outcomes
- Expectations from the students after attending the Course
- Evaluation Scheme, Syllabus and Books
- Course Delivery to include – Total number of Units to be taught in the semester, number of
Units
to be covered up before 1st, 2nd sessional tests, sessional test schedules, duration and course
coverage in the tests, number of assignments/ quizzes, sessional marks policy etc.
- Importance and relevance of the subject in engineering field/ management.
- Its importance for career in the industry & likely career avenues, Need of the knowledge in
human
life, at national & international level.
- Brief summary of the subject taught in previous semester (to connect the current subject with
the
subject taught earlier-pre-requisites)
- Clarify doubts, if any, about the curriculum and about any other matter.
(c) Create interest amongst the students so that they will eagerly wait to attend your classes.
(d) Provide information about various co-curricular and extra-curricular activities and clubs
in the college and emphasize their importance for their overall personality development and help
in placement. Also inform the incentive schemes for their participation in such activities within
the college and outside.
(e) Provide information about technical Society/ professional magazines being promoted by the de-
partment and various Centers of Excellence in the college.
 5. Give them an assignment based on pre-requisites of the course-A set of 20 questions & random/ se-
quence of 05 questions for each student. Collect the assignment in next class to understand the level
of the class as the stepping stone for start of the new subject.
6. Just before the end of the class, enquire if they have any comments or suggestion.
7. Submit the report to the HOD after the introductory class.
Observations/ Report
. As per the instructions above, everything was done and it was observed that students are less in
number but the present students are more enthusiastic towards the learning of this subject in coming
lectures.

Name of faculty:
Mr. Rakesh Kumar HOD SCE (AI & AI-DS)
Date:19-Sep-22 Date:

IIMT COLLEGE OF ENGINEERING, GREATER NOIDA

Department of Computer Science and Engineering (AI & AI-DS)
Session: 2022-23 Semesters: IIIrd Section: CSE (AI) & AI-DS
Subject Code: KCS-303 Subject Name: DSTL
Course Outcomes:
At the end of this course, the students will be able to-
CO 1 Write an argument using logical notation and determine if the argument is or is not
valid.
CO 2 Understand the basic principles of sets and operations in sets.
CO 3 Demonstrate an understanding of relations and functions and be able to determine
their properties.
CO 4 Demonstrate different traversal methods for trees and graphs.
CO 5 Model problems in Computer Science using graphs and trees.

Program outcomes (POs) relevant to the course:

1. Engineering knowledge (PO 1)
2. Problem analysis (PO 2)
3. Design/development of solutions (PO 3)
4. Conduct investigation of complex problems (PO 4)
5. Modern tool usage (PO5)
6. The Engineering and Society (PO 6)
7. Environment and Sustainability (PO 7)
8. Ethics (PO 8)
9. Individual and Team work (PO 9)
10. Communication (PO 10)
11. Project management and finance (PO 11)
12. Lifelong learning (PO12)

Mapping of CO’s with PO’s and PSO’s

P P P PO PO PO PO PO PO PO PO PO PSO PSO
O1 O2 O3 4 5 6 7 8 9 10 11 12 1 2
CO1 2 - 2 - 2 2 - - - - 2 2 - -
CO2 1 2 2 1 2 1 - 2 2 2 1 - - -
CO3 2 - 3 2 2 1 2 2 2 - - - - -
CO4 3 2 2 - 2 2 1 2 3 - 2 2 - -
CO5 2 2 2 1 3 2 2 - 2 1 1 2 - -
AVERAGE 2 2 2.2 1.3 2.2 1.6 1.6 2 2.2 1.5 2 2 - -

Name of Faculty:
Mr. Rakesh Kumar HOD (CSE AI & AI-DS)

B. TECH.
(CSAI/CSML/CSDS/CSIOT)
COMPUTER SCIENCE AND ENGINEERING)
SEMESTER- III
 SEMESTR-III

End
Sl. Subject Periods Evaluation Scheme
Subject Semester Total Credit
No.
Codes L T P CT TA Total PS TE PE

1 KAS302 Maths IV
3 1 0 30 20 50 100 150 4
2 KAS301 Technical Communication 2 1 0 30 20 50 100 150 3

3 KCS301 Data Structure 3 1 0 30 20 50 100 150 4

4 KCS302 Computer Organization and 3 1 0 30 20 50 100 150 4

Architecture
5 KCS303 Discrete Structures & The- 3 0 0 30 20 50 100 150 3
ory of Logic
6 KCS351 Data Structures Using C Lab 0 0 2 25 25 50 1

7 KCS352 Computer Organization Lab 0 0 2 25 25 50 1

8 KCS353 Discrete Structure & Logic 0 0 2 25 25 50 1

Lab
KCS354 Mini Project or Intern- 0 0 2 50 50 1
9 ship Assessment*

10 KNC301 Computer System Se- 2 0 0 15 10 25 50 0

curity

10 MOOCs (Essential for

Hons. Degree)
Total 950 22

Discrete Structures & Theory of Logic

(KCS-303)
Course Outcome Bloom’s Knowledge Level (KL)
(CO)
At the end of course, the student will be able to
 CO 1 K1, K2
CO 2 K2, K3
CO 3 K2, K3
CO 4 K1, K2,
CO 5 K3, K4

CO6 K2, K3
DETAILED SYLLABUS 3-0-0
Unit Topic Proposed
Lecture
Set Theory: Introduction, Combination of sets, Multisets, Ordered pairs. Proofs of some general
identities on sets. Relations: Definition, Operations on relations, Properties of relations, Compos-
I ite
Relations, Equality of relations, Recursive definition of relation, Order of relations. 08
Functions: Definition, Classification of functions, Operations on functions, Recursively defined
functions. Growth of Functions.
Natural Numbers: Introduction, Mathematical Induction, Variants of Induction, Induction with
Nonzero Base cases. Proof Methods, Proof by counter – example, Proof by contradiction.
Algebraic Structures: Definition, Groups, Subgroups and order, Cyclic Groups, Cosets, La-
II grange's theorem, Normal Subgroups, Permutation and Symmetric groups, Group Homomor- 08
phisms, Definition and elementary properties of Rings and Fields.
Lattices: Definition, Properties of lattices – Bounded, Complemented, Modular and Complete
III lattice. Boolean Algebra: Introduction, Axioms and Theorems of Boolean algebra, Algebraic 08
manipulation of Boolean expressions. Simplification of Boolean Functions, Karnaugh maps,
Logic gates, Digital circuits and Boolean algebra.
Propositional Logic: Proposition, well formed formula, Truth tables, Tautology, Satisfiability,
Contradiction, Algebra of proposition, Theory of Inference. (8)
IV Predicate Logic: First order predicate, well formed formula of predicate, quantifiers, Inference 08
theory of predicate logic.
Trees: Definition, Binary tree, Binary tree traversal, Binary search tree.
Graphs: Definition and terminology, Representation of graphs, Multigraphs, Bipartite graphs,
V Planar graphs, Isomorphism and Homeomorphism of graphs, Euler and Hamiltonian paths, 08
Graph
coloring, Recurrence Relation & Generating function: Recursive definition of functions, Recur-
sive algorithms, Method of solving recurrences.
Combinatorics: Introduction, Counting Techniques, Pigeonhole Principle
Text books:
1.Koshy, Discrete Structures, Elsevier Pub. 2008 Kenneth H. Rosen, Discrete Mathematics and Its Applications, 6/e,
McGraw-Hill, 2006.
2. B. Kolman, R.C. Busby, and S.C. Ross, Discrete Mathematical Structures, 5/e, Prentice Hall, 2004.
3.E.R. Scheinerman, Mathematics: A Discrete Introduction, Brooks/Cole, 2000.
4.R.P. Grimaldi, Discrete and Combinatorial Mathematics, 5/e, Addison Wesley, 2004
5.Liptschutz, Seymour,“ Discrete Mathematics”, McGraw Hill.
6.Trembley, J.P & R. Manohar, “Discrete Mathematical Structure with Application to Computer Science”, McGraw
Hill.
7. Deo, Narsingh, “Graph Theory With application to Engineering and Computer. Science.”, PHI.
8. Krishnamurthy, V., “Combinatorics Theory & Application”, East-West Press Pvt. Ltd., New Delhi
 Question Bank
Subject: DSTL Branch: CSE (AI) & AI-DS2nd YEAR
Subject code: KCS-303 Session: 2022-23
Semester: III

QUESTION BANK
KCS-303: DSTL
Unit-1
1. Describe the different types of operation on sets.
2. What do you mean by multisets?
3. Describe the following in set builder form:
a. A = {–4, –3, –2, –1, 0, 1, 2, 3}
a. B = {1, 8, 27, 64}
b. C = {3, 6, 9, 12, 15 ....}
c. D = {2, 3, 5, 7, 11, 13 .....}
4. List down laws of algebra of sets.
5. Let U = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}, and the ordering of elements of U has the elements in
increasing order; that is, ai = i. What bit strings represent the subset of all odd integers in U,
the subset of all even integers in U, and the subset of integers not exceeding 5 in U?
6. Describe the term relation along with its types.
7. Give properties of relation.
8. Write a short note on Equivalence and Composition Relation.
9. Describe recursive definition of relation.
10. Define the term partial order relation or partial ordering relation with a suitable example.
11. The following relation on A = {1, 2, 3, 4}. Determine whether the following:
a. R = {(1, 3), (3, 1), (1, 1), (1, 2), (3, 3), (4, 4)}
b. R = A × A
Is an equivalence relation or not?
12. Let (A, ≤) be a partially ordered set. Let ≤ be a binary relation A such that for a and b in A, a
is related to b iff b ≤ a.
i. Show that ≤ is partially ordered relation.
ii. Show that (A, ≤) is lattice or not.
13. Let X = {1, 2, 3,....., 7} and R = {(x, y)|(x – y) is divisible by 3}. Is R equivalence relation.
Draw the digraph of R.
14. Define the term function. Also, give classification of it.
15. Define the term function and explain the terms:
a. One-to-one function (Injective function)
b. Onto function (Surjective function)
c. One-to-one onto function (Bijective function)
d. Mane to one function
e. Identity function
f. Inverse function (Invertible function)

16. Explain the following:

a. Composition of functions
b. Recursive function
c. Primitive recursion
17. Write short note on growth of functions.
18. Describe mathematical induction. Solve the given problems for the same:
a) Prove that n3 + 2n is divisible by 3 using principle of mathematical induction, where
n is natural number.
a) Prove by induction: 1/(1.2) + 1/(2.3) +...+ 1/n (n + 1) = n/(n+1)
 Unit-II
1. What is algebraic structure? List properties of algebraic system
2. Write short notes on:
a) Group
b) Abelian Group
c) Order of Group
d) Finite and infinite group
3. Describe Subgroup with example.
4. Define identity and zero elements of a set under a binary operation *. What do you mean by an
inverse element?
5. Prove that (Z6,(+6)) is an abelian group of order 6, where Z6 = (0, 1, 2, 3, 4, 5, 6).
 6. Let G = {1, -1, i, -i} with the binary operation multiplication be an algebraic structure, where i =
√-1. Determine whether G is an abelian or not.
7. Prove that inverse of each element in a group is unique.
8 Define cyclic group with suitable example.
Show that group (G, +5) is a cyclic group where G = (0, 1, 2, 3, 4). What are generators?
9. Define cosets. Explain with a suitable example.
10. State and prove Lagrange’s theorem for group. Is the converse true?
11. Consider the group Z of integers under addition and the subgroup H = {……,-10, -5,
0, 5, 10,……} considering the multiple of 5.
a. Find the cosets of H in Z.
b. What is the index of H in Z?
12. Write short notes on:
a. Normal Subgroup
b. Permutation group
13. Discuss homomorphism and isomorphism group.
14. Give the definitions of rings, integral domains and fields.
15. If the permutation of the elements of {1, 2, 3, 4, 5} are given by a = (1 2 3) (4 5), b =
(1) (2) (3) (4 5), c = (1524) (3). Find the value of x, if ax = b. and also prove that the Z 4 =
(0, 1, 2, 3) is a commutative ring with respect to the binary modulo operation +4 and *4.

UNIT-3
1. Define Lattice. Give its properties.
2. Explain types of lattice.
3. If the lattice is represented by the Hasse diagram given:
a. Find all the complements of ‘e’

4. Draw the Hasse diagram of [P (a, b, c), ⊆] (Note: ‘⊆’ stands for subset). Find thee
greatest element, least element, minimal element and maximal element.
5. The directed graph G for a relation R on a set A = {1, 2, 3, 4} is shown below:
 a. Verify that (A, R) is a poset and find its Hasse diagram.
b. Is this a lattice?
c. What are the minimal and maximal elemtns?
6. In a lattice a ≤ b ≤ c, then show that
a. a ˅ b = b ˄ c
b. (a ˅ b) ˅ (b ˄ c) = (a ˅ b) ˄ (a ˄ c) = b

7. Draw the Hasse diagram of (a, ≤), where,

A = {3, 4, 12, 24, 48, 72} and relation ≤ be such that a ≤ b if a divides b.
8. For any positive integer D36, then find whether (D36, ‘/’) is a lattice or not?
9. What is Boolean algebra? Write the axioms of Boolean algebra. Also, describe the of it.
10. Simplify the following Boolean functions using three variable maps:
a. F (x, y, z) = ∑ (0, 1, 5, 7)
b. F (x, y, z) = ∑ (1, 2, 3, 6, 7)
11.Simplify the following Boolean expressions using K-map:
a. Y = ((AB)’ + A’ + AB)’
b. A’ B’ C’ D’ + A’B’C’ D +A’ B’ C D + A’B’C D’ = A’B’
12.Draw the logic network corresponding to the following Boolean expression:
a. xy + xy’
b. xy’z’ + x’yz + xy’
13. Consider the Boolean function:
a. F(a, b, c, d) = a + (b. (a’+ d) + c. (b’ + d’))
 Simplify f algebraically
 Draw the logic circuit of the f and the reduction of the f.

UNIT-4

1. Define the term proposition. Also, explain compound proposition with example.
2. Discuss the connectives with truth tables.
3. Explain the following terms with suitable example:
a. Conjunction
b. Disjunction
c. Conditional
 d. Converse
e. Contrapositive
f. First order logic
g. Quantifiers
4. Discuss theory of inference in propositional logic.
5. Prove that the statement (p⟶q) ↔(∼q⟶∼p) is a tautology.
6. Is (r s) (s r) a tautology?
7. Is the following statement a tautology? [(p q) ~p] q.
8. “If the labour market is perfect then the wages of all persons in a particular employment will
be equal. But it is always the case that wages for such persons are not equal therefore the
labour market is not perfect”. Test the validity of this argument using truth table.
9. What is Tautology, contradiction and contingency? Show that (p q) (~p r)(q r) is
tautology, contradiction and contingency.
10. What is JDBC and define its structure in brief and also define JDBC drivers.
1. Define java database connectivity steps.
2. Design the registration form and create its connectivity with example.

Unit-5
1. Explain the following terms with example:
a. Tree
b. Forest
c. Binary tree
d. Complete Binary Tree
e. Full Binary Tree
2. Construct a tree whose inorder and preorder traversal are as follows:
Inorder: Q, B, A, G, C, P, E, D, R
Preorder: G, B, Q, A, P, C, D, E, R
3. Define servlet life cycle.
4.
5. Define handling HTTP request and response with example.
6. What is JSP? Define its architecture and uses.
7. Define JSP tags with example.
8. What is implicit object? Define with example
9. What is error page handle in JSP. Connect java beans with JSP.
 IIMT College of Engineering, Greater Noida
Department of CSE AI & AI-DS
Plan Summary of Assignment

Session: 2022-2023 Course/Semester: B. Tech. CSE (AI) & AI-DS/III

Subject Code: KCS-303 Subject Name: Discrete Structures & Theory of Logic
 S. No. Assignment Planned Date Actual date

1. Assignment 1 01/10/2022 07/10/2022

2. Assignment 2 17/10/2022

3. Assignment 3 01/11/2022

4. Assignment 4 18/11/2022

5. Assignment 5 02/12/2022

Prof. Rakesh Kumar Signature of the HOD:

Date: Date:

IIMT COLLEGE OF ENGINEERING

GREATER NOIDA
Assignment-1
Discrete Structures & Theory of Logic (KCS-303)

1. Let P and Q be two multisets {4.a, 3.b, 1.c} and {3.a, 3.b, 2.d} respectively. Find:
i. P∪Q, ii. P∩Q, iii. P – Q, iv. Q – P, v. P + Q.
2. Describe each of following in roster form:
i. A = {x: x is an even prime}

iii. C = {x ∈ R: x2 – 1 = 0}
ii. B = {x: x is a positive integral divisor of 60}

iv. D = {x: x2 – 2x + 1 = 0}
v. E = {x: x is multiple of 3 or 5}
3. Write down the general identities on sets and prove any five identities.
4. Let U = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}, and the ordering of elements of U has the elements in
increasing order; that is, ai = i. What bit strings represent the subset of all odd integers in U,
the subset of all even integers in U, and the subset of integers not exceeding 5 in U?
5. If A and B are two subsets of universal set, then prove the following:
a. (A – B) = (B – A) iff A = B
 b. (A – B) = A iff A ∩ B = ϕ
6. Describe the term relation along with its types and also explain the properties of relation.
7. The following relation on A = {1, 2, 3, 4}. Determine whether the following:
a. R = {(1, 3), (3, 1), (1, 1), (1, 2), (3, 3), (4, 4)}
b. R = A × A
Is an equivalence relation or not?
10. Prove by mathematical induction
a. n4 – 4n2 is divisible by 3 for all n > = 2.

ASSIGNMENT-2
1. Write short notes on:
a. Normal subgroup
b. Permutation group
2. What is algebraic structure? List properties of algebraic system.
3. Write short notes on:
i. Group ii. Abelian group
iii. Finite and infinite group iv. Order of group and v. Groupoid
4. Write the properties of group. Show that the set (1, 2, 3,4, 5) is not group under addition and
multiplication modulo 6.
5. Let G = {a, a2, a3, a4, a5, a6 = e}. Find the order of every element.
6. Define cyclic group with suitable example.
7. Define cosets. Write and prove properties of cosets.
8. State and prove Lagrange’s theorem for group. Is the converse true?

ASSIGNMENT-3

1. Define lattice. Give its properties and what are the types of lattices?
2. Draw the Hasse diagram of [P (a, b, c), ⊆] (Note: ‘⊆’ stands for subset). Find greatest element,
least element, minimal element and maximal element.
3. The directed graph G for a relation R on set A = {1, 2, 3, 4} is shown below:

i. Verify that (A, R) is a POSET and find its Hasse diagram.

ii. Is this a lattice?
iii. What are the maximal and minimal elements?
4. Explain modular lattice, distributive lattice and bounded lattice with example and diagram.
5. For any positive integer D36, then find whether (D36, ‘|’) is lattice or not?

a. Absorption law: Prove that ∀a, b, ∈ B

6. Prove the following theorems:

i. a.(a + b) = a

b. Idempotent law: Prove that ∀ a∈ B, a + a = a and a.a = a.

ii. a + a.b = a

c. De Morgan’s law: Prove that ∀ a, b, ∈ B

i. (a + b)’ = a’. b’
ii. (a. b)’ = a’ + b’
d. Prove that 0’ = 1 and 1’ = 0
e. Prove that (a + b)’ = a’.b using De Morgan’s:
7. Define a Boolean function of degree n. Simplify the following Boolean expression using Kar-
naugh maps:
xyz + xy'z + x'y'z + x'yz + x'y'z'

8. Find the Boolean algebra expression for the given system.

 ASSIGNMENT-4
1. ∼(p → q) ∨ (∼p ∨ (p ∧ q)) prove that the given statement is Tautology by the truth table
and Boolean algebra mechanism.
2. Discuss connectives in detail with truth tables.
3. Explain the following terms with suitable example:
i. Conjunction
ii. Disjunction
iii. Conditional
v. Contrapositive
4. Write a short note on
i. First order logic

4. Prove that the statement is [ (p → q) ∧ (q → r) ] ∧ ( p ∧ ∼r) contradiction by using the

ii. Quantifiers.

truth table and also by using the Boolean algebra.

5. Explain rules of inference in predicate logic.
6. Express the following statements using quantifiers and logical connectives.
a. Mathematics book that is published in India has a blue cover.
b. All animals are mortal. All human being are animal. Therefore, all human being
are mortal.
c. There exists a mathematics book with a cover that is not blue.
d. He eats crackers only if he drinks milk.
e. There are mathematics books that are published outside India.
f. Not all books have bibliographies.
7. Show that the premises “It is not sunny this afternoon and it is colder than yesterday,” “We
will go swimming only if it is sunny,” “If we do not go swimming, then we will take a canoe trip.”
And “If we take a canoe trip, then we will be home by sunset” lead to the conclusion “We will be
home by sunset.

ASSIGNMENT-5

1. Explain the following terms:

i. Tree
ii. Forest
iv. Complete binary tree
v. Full binary tree
2. Define a binary tree. A binary tree has 11 nodes. It’s inorder and preorder traversals node se-
quences are:
Preorder: A B D H I E J L C F G
Inorder: H D I B J E K A F C G
Draw the tree.
1. Given the inorder and postorder traversal of a tree T: Inorder: HFEABIGDC Postorder: BE-
HFACDGI Determine the tree T and it's Preorder.
2. What is a binary search tree?
3. Write algorithm for following:
i. Searching and inserting a node in BST
ii. Deleting a node in BST
 4. Draw a binary search tree by inserting following integers 55, 20, 63, 10, 28, 60, 93, 5, 11,
40, 68, 25.
5. Discuss representation of graph.
6. Write short notes on:
a. Simple and multigraph
b. Complete graph and regular graph
c. Bipartite Graph and its types also
d. Planar Graph
9. Explain the following terms with example:
i. Homomorphism and Isomorphism graph
ii. Euler graph and Hamiltonian graph
10.. Solve the following functions:
i) ar – 6ar-1 + 8ar-2 = n4r, where a0=8 and a1= 1.
ii) an+2 – 5an+1 + 6an =2, where a0=3 and a1=7.
iii)

IIMT College of Engineering, Greater Noida

Department of CSE (AI) and AI-DS
End of Semester Summary (Lecture, Attendance & Marks)

Session: 2022-2023 Course/Semester: B.Tech/III Section: Subject

code: KCS-303 Subject Name: DSTL
Lecture Summary
 Unit No of Lectures Planned No of Lectures Delivered
1
2
3
4
5

Attendance Summary
S. No. Attendance No. of Students

1 Total Number of Students

2 More than 95%

3 Between 95% & 75%

4 Between 75% & 60%

5 Less than 60%

6 Average attendance of the students (%)

Summary of Assignment Sessional Exam Marks

S. No. Activity Average Marks Max Marks Min Marks
1 Assignments
2 Sessional Test 1
3 Sessional Test 2
4 PUE/PUT

Mr. Rakesh Kumar Signature of the HOD:

Date: Date:
IIMT College of Engineering, Greater Noida
Department of Computer Science
Review of AKTU Question Paper

(A copy of this completed form should be placed in course file)

Session: 2022-2023 Course/Semester: B. Tech. /III Section: (AI) & AI-DS

Subject Code: KCS- 303 Subject Name: DSTL

(A) Difficulty level of question paper (Difficult/ Moderate/ Easy): Moderate

(B) Any portion beyond of the syllabus (indicate question no.): Not Applicable

(C) (i) Any unit given under weightage:

 (ii) Any unit given over weightage:
(D) Anomaly in choices given as compared to old pattern (or University guidelines): Not Applicable

(E) Questions having mistakes or are incomplete (indicate only the question numbers): Not Applicable

Distribution of questions unit wise and comparison with PUE

UNIT Weightage of Units in Weightage of Units in Similar Questions from UPTU & ST-1,ST-2 and PUE Ques-
UPTU Question Paper PUE Question Paper tion Papers

UPTU Question.
Marks Question. No. Marks Marks PUE Question. No. Marks
Question. No. No.
(b) (c) (d) (f) (g) (h)
(a) (e)
1
2
3
4
5
Beyond Syl- - - - -
labus
Total : Total : Total : Total :
Any other
Complete paper is theoretical and weightage of numerical is zero. Application based questions are zero.
observation

% of university question paper covered in PUE/PUT = Total (f) X 100 =

Total (b)

Mr. Rakesh Kumar Signature of the HOD:

Date: Date:

Action recommended or action taken, if any, at the Department level:

Note: HOD will send a statement containing summary of the subjects of the department to the
Directorate on Form No. Acad – 013.

IIMT College of Engineering, Greater Noida

Department of CSE (AI) & AI-DS
Comparison of result with the one in the previous session

Program: B. Tech. Semester: III Section: CSE (AI) & AI-DS

Subject Code: KCS-303 Subject Name: DSTL
Average
Pass Average Highest Faculty Signature Remarks
Session Marks (%) of
(%) Marks (%) Marks (%) Name of Faculty of the HOD
all Sections
2020-21

2021-22

2022-23

IIMT College of Engineering, Greater Noida

Department of Computer Science and Engineering
List of Weak Students and their Make-up Classes

Session: 2022-2023 Course/Semester: B. Tech/III Section:

Subject Code: KCS-303 Subject Name: DSTL

Name of Faculty: Rakesh Kumar

List of weak students
S.no. Roll Name Marks obtained (less Remarks
No. than < 40 % of Sessional
test)
 1.

2.

3.
4.
5.
6.
7.
8.

A. Arrangement of Make-up Classes with dates

Make-up
Planned Date Actual Date Topics Discussed
class
I

II

III

IV

VI

VII

Prof. Rakesh Kumar Signature of the HOD:

Date: Date:

OLD Question PAPER

Subject: DSTL Branch: CSE (AI)s & AI-DS 2nd YEAR
Subject code: KCS-303 Session: 2022-23
Semester: III
 Subject Code: KCS303
Roll No:

B TECH
(SEM-III) THEORY EXAMINATION 2020-21
DISCRETE STRUCTURE & THEORY OF
LOGIC
Time: 3 Hours Total Marks: 100
Note: 1. Attempt all Sections. If require any missing data; then choose suitably.
SECTION A
1. Attempt all questions in brief. 2 x 10 = 20
Q no. Ques- Marks CO
tion
a. Check whether the function f(x) = x2 - 1 is injective or not for 2 CO
f : R→R. 3
b. Let R be a relation on set A with cardinality n. Write down 2 CO
the number of reflexive and symmetric relation on set A. 2
c. Define group. 2 CO
3
d. Define ring. 2 CO
3
e. Let A = {1, 2, 3, 4, 6, 8, 9, 12, 18, 24} be ordered by the re- 2 CO
lation ‘a divides b’. Find the Hasse diagram. 3
f. If L be a lattice, then for every a and b in L prove that a ˄ b = 2 CO
a if and only if a ≤ b. 3
g. Write the negation of the following statement: 2 CO
“If I wake up early in the morning, then I will be healthy.” 1
h. Express the following statement in sym- 2 CO
bolic form: “All flowers are beautiful.” 1
i. Define complete and regular graph. 2 CO
4
j. Prove that the maximum number of vertices in a binary tree 2 CO
of height h is 2h+1, h ≥ 0. 4
SECTION B

2. Attempt any three of the following:

Q no. Question Marks CO
a. If f : R → R, g : R → R and h : R → R de- 10 CO3
fined by f(x) = 3x2 +2, g(x) = 7x – 5
and h(x) = 1/x.
Compute the following composition functions
i. (fogoh)(x)
ii. (gog)(x)
iii. (goh)(x)
iv. (hogof)(x)
b. State and prove Lagrange theorem for group. 10 CO3
c. Prove that in any lattice the following distributive inequalities 10 CO3
hold
i. a ˄ (b ˅ c) ≥ (a ˄ b) ˅ (a ˄ c)
ii. a ˅ (b ˄ c) ≤ (a ˅ b) ˄ (a ˅ c)
d. Prove the validity of the following argument 10 CO1
“If I get the job and work hard, then I will get promoted. If I
get promoted, then I will be happy. I will not be happy.
Therefore, either I will not get the job, or I will not work
hard.”
e. If a connected planar graph G has n vertices, e edges and r 10 CO5
region, then n – e
+ r = 2.

SECTION C
3. Attempt any one part of the following:
 a. Prove by mathematical induction for all positive 10 CO2
integers that 3.52n+1 + 23n+1 is divisible by 17.
b. Find the numbers between the 100 to1000 that are divisible 10 CO2
by 3 or 5 or 7.

4. Attempt any one part of the following:

a. A subgroup H of a group G is a normal subgroup if and only if 10 CO3

g- 1hg ϵ H for every h ϵ and g ϵ G.

b. In a group (G, *) 10 CO3
prove that i. (a-1)-
1
=a
ii. (ab)-1 = b-1a-1

5. Attempt any one part of the following:

a. Simplify the Boolean function 10 CO3
F (A, B, C, D) = ∑ (0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 11)
Also draw the logic circuit of simplified F.
b. Simplify the following Boolean expressions using Boolean al- 10 CO3
gebra
i. xy + x΄z +yz
ii. C(B + C)(A + B + C)
iii. A + B(A + B) + A(A΄ + B)
iv. XY + (XZ)΄ + XY΄Z(XY + Z)

6. Attempt any one part of the following:

a. Define tautology, contradiction and contingency? Check 10 CO1
whether (p ˅ q) ˄ (
~ p ˅ r) → (q ˅ r) is a tautology, contradiction or contingency.
b. Translate the following statements in symbolic form 10 CO1
i. The sum of two positive integers is always positive.
ii. Everyone is loved by someone.
iii. Some people are not admired by everyone.
iv. If a person is female and is a parent, then this per-
son is someone’s mother.

7. Attempt any one part of the following:

a. Construct the binary tree whose inorder and preorder traver- 10 CO4
sal is given below. Also, find the postorder traversal of the
tree.
Inorder: d, g, b, e, i, h, j, a, c, f
Preorder: a, b, d, g, e, h, i, j, c, f
b. Solve the following recurrence relation 10 CO3
an – an – 1 + 20an – 2 = 0 where a0 = – 3 , a1 = – 10
 Subject Code: KCS303
Roll No:

BTECH
(SEM III) THEORY EXAMINATION 2021-22
DISCRETE STRUCTURES & THEORY OF LOGIC

Time: 3 Hours Total Marks: 100

Note: 1. Attempt all Sections. If require any missing data; then choose suitably.
SECTION A
1. Attempt all questions in brief. 2x10 = 20
Qno. Question Marks CO
a. Let A = {1,2,3,4,5,6} be the set and R = {(1,1) (1,5) (2,2) 2 1
(2,3) (2,6) (3,2)
(3,3,) (3,6) (4,4) (5,1) (5,5) (6,2) (6,3) (6,6)} be the relation
defined on set A.
Find Equivalence classes induced by R.
b. Solve Ackerman Function A (2,1). 2 1
c. State and justify “Every cyclic group is an abelian group”. 2 2
d. State Ring and Field with example. 2 2
e. Differentiate complemented lattice and distributed lattice. 2 3
f. State De Morgan’s law and Absorption Law. 2 3
g. Translate the conditional statement “If it rains, then I will 2 4
stay at home” into contrapositive, converse and inverse
statement.
h. State Universal Modus Ponens and Universal Modus Tollens 2 4
laws.
i. Explain Euler’s formula. Determine number of regions if a 2 5
planar graph has 30 vertices of degree 3 each.
j. Explain pigeonhole principle with example. 2 5
SECTION B
2. Attempt any three of the following: 3x10 =30
Qno. Question Marks CO
a. Justify that for any sets A, B, and C: 10 1
i) (A – (A ∩ B)) = A – B ii) (A – (B ∩ C)) = (A – B) ᴜ (A – C)
b. Explain Cyclic group. Let H be a subgroup of a finite group 10 2
G. Justify the statement “the order of H is a divisor of the or-
der of G”.
c. Solve E(x,y,z,t) = ∑ (0,2,6,8,10,12,14,15) using K-map. 10 3
d. Construct the truth table for the following statements: 10 4
i) (P→Q’)→P’ ii) P↔(P’˅Q’).
e. Solve the recurrence relation using generating function. 10 5
an+2- 5an+1 +6an =2, with a0=3 and a1=7.
SECTION C
3. Attempt any one part of the following: 1x10 =10
Qno. Question Marks CO
a. State Principle of Duality. Let A denote the set of real 10 1
numbers and a relation R is defined on A such that
(a,b)R(c,d) if and only if a2 + b2 = c2 +
d2. Justify that R is an equivalence relation.
b. i) Let R = {(1,2) (2,3) (3,1)} defined on A = {1,2,3}. Find 10 1
the transitive closure of R using Warshall’s algorithm.
ii) Justify that “If f: A→B and g: B→C be one-to-one onto
functions, then gof is also one to one onto and (gof)-1= f -1o
g -1”.

4. Attempt any one part of the following: 1x10 =10

Qno. Question Marks CO
a. Define the binary operation * on Z by x*y=x + y + 1 for all 10 2
x,y belongs to
set of integers. Verify that (Z,*) is abelian group? Discuss the
properties of abelian group.
b. i) Justify that “The intersection of any two subgroup of a 10 2
group (G,*) is again a subgroup of (G,*)”.
ii) Justify that “If a,b are the arbitrary elements of a group
G then (ab)2 = a2b2 if and only if G is abelian.
5. Attempt any one part of the following: 1x10 =10
Qno. Question Marks CO
a. Define Modular Lattice. Justify that if ‘a’ and ‘b’ are the 10 3
elements in a bounded distributive lattice and if ‘a’ has com-
plement a′. then
I) a ˅ (a′˄ b)=a˅ bII ) a˄ (a′˅ b)=a˄ b
b. i)
Justify that (D36,\) is lattice. 10 3
ii)
Let L1 be the lattice defined as D6 and L2 be the lattice
(P(S), ≤), where P(S) be the power set defined on set S=
{a, b}. Justify that the two lattices
are isomorphic.
6. Attempt any one part of the following: 1x10 =10
Qno. Ques- Marks CO
tion
a. Use rules of inference to Justify that the three hypotheses 10 4
(i) “If it does not rain or if it is not foggy, then the sailing
race will be held and the lifesaving demonstration will go
on.” (ii) “If the sailing race is held, then the trophy will be
awarded.” (iii) “The trophy was not awarded.” imply the
conclusion
(iv) “It rained.”
b. Justify that the following premises are inconsistent. (i) If Nir- 10 4
mala misses many classes through illness then he fails high
school. (ii) If Nirmala fails high school, then he is uneducated.
(iii) If Nirmala reads a lot of books then he is not uneducated.
(iv) Nirmala misses many classes through illness and
reads a lot of books.
7. Attempt any one part of the following: 1x10 =10
Qno. Question Marks CO
a. Explain the following terms with example: 10 5
i. Graph coloring and chromatic number.
ii. How many edges in K7 and K3,3
iii. Isomorphic Graph and Hamiltonian graph.
iv. Bipartite graph.
v. Handshaking theorem.
b. i. Justify that “In a undirected graph the total number 10 5
of odd degree vertices is even”.
ii. Justify that “The maximum number of edges in a
simple graph is n(n-1)/2”.
 Printed Page 1 of Sub
2
Paper Id: 110505 Roll
Code:RCS052
No:
B. TECH.
(SEM V) THEORY EXAMINATION 2019-20
WEB TECHNOLOGIES
Time: 3 Hours Total Marks: 70
Note: 1. Attempt all Sections. If require any missing data; then choose suitably.

SECTION A

1. Attempt off questions in 2 x 7 = 14

brief.
a. Define Path in JDK. How path is different from Class path?
b. Define webpage with its type. Discuss responsive webpage with example.
c. Define box model in CSS with block diagram.
d. Describe garbage collection and demonstrate how it is functioning?
e. Define DHTML with suitable example.
f. Compare JDBC and ODBC. List the different types of JDBC drivers.
g. Discuss about tomcat server. How to set the Classpath for servlet in tomcat
server?
SECTION B
www.aktuon1ine .co

2. Attempt any three of the following: 7 x 3 = 21

a. Compare object-one object-based programming with
example. List the fe d programming.Write a program
Java to demonstrate in onstructor.
b. Define thread. How va? Write a program that exe-
two threads. One th cutes n numbers and another
m

print odd numbers thread will

fr
c. Discuss XML. Whic to define the structure of XML
document? Explain and demonstrate with an example.
d. Discuss Socket and ServerSocket in java with its package.Write a program in
java to demonstrate, how the communication is, establish between client and
server?
e. Discuss EJB. Explain EJB architecture. What are its various types?

SECTION C
3. Attempt any one part of the following: 7x1=7
(a) Explain AWT and its controls. How the layout manager manage the AWT
controls? Write a program to demonstrate graphics (i.e. line, circle, rectangle
etc.) using Frame, Panel, and layout manager.
(b) Explain Applet with its life cycle. Write a program to demonstrate simple java
applet to display any image. Compare Applets over HTML.
Printed Page 2 of Sub
2
Paper Id: 110505 Roll
Code:RCS052
No:
4. Attempt any one part of the following: 7x1=7
(a) Discuss DTD. How the DTD is different from XSD? Demonstrate to create a
XML document of 10 students of third year. Add their roll numbers, marks
obtained in 5 subjects, total marks and percentage and validate using DTD.
(b) Explain CSS. What are the CSS frameworks? Explain in brief. What are the
different ways of using the stylesheet? Write a CSS rule that makes all the
text
2.5 times larger than the base font of the system.

5. Attempt any one part of the following: 7x1=7

(a) Discuss AJAX. Explain the application of AJAX with the help of suitable
examples.
(b) Compare Java and JavaScript. Explain and demonstrate 5 different types of
objects in JavaScript with example.

6. Attempt any one part of the following: 7x1=7

(a) Explain JDBC application architecture. List the various types of JDBC driv-
ers. Discussthe steps to connect database with the web application using JD-
BC.Write a program to demonstrate how to retrievethe data from a table us-
ing JDBC API.
(b) Explain JavaBeans. Why they are used? Discuss setter and getter method with
java code.

7. Attempt any one part of the following: 7x1=7

(a) Explain Servlets with its life cycle. How its life cycle is different from the life
cycle of JSP? Explain with an example.
(b) Discuss JSP in details What are JSP directives? Explain various types of di-
rectives with suita
 B. TECH
(SEM-V) THEORY EXAMINATION 2020-
21 WEB TECHNOLOGY
Time: 3 Hours Total Marks:
100
Note: 1. Attempt all Sections. If require any missing data; then choose suitably.

SECTI
ON A
1. Attempt all questions in brief. 2 x 10 =
20
Q No. Question Marks CO
a. How is object created in Java? 2 1
b. Compare between JDK, JRE and JVM? 2 1
c. Differentiate between HTML and XML? 2 2
d. Write a program with external style sheet with CSS. 2 2
e. Compare between Internet and WWW? 2 3
www.aktuon1ine .co

f. How HTTPS is different from HTTP. 2 3

g. Difference between JDBC and ODBC? 2 4
h. What are JAR and Manifest files? 2 4
i. Compare doGet() and doPost() method? 2 5
j. Write Difference JSP and Servlet? 2 5
m

SECTI
ON B

2. Attempt any three of the following:

a. How Exception handled in java? Differentiate between throw and 10 1
throws.
b. Explain the HTML tags for Tables, Frames, and Forms with the help of 10 2
Suitable example.
c. What is the need for dynamic webpage? What are the advantages and 10 3
issue involved in dynamic web page?
d. Write down the steps to connect database with web application using 10 4
JDBC.
e. Explain Request Dispatcher. Also Describe different ways to get the 10 5
object of request dispatcher.

SECTI
ON C

3. Attempt any one part of the following:

a. What do you understand by web technology? Prove the name of 10 1
protocols which help in web and explain working of that protocol.
b. What is Inheritance? List out various type Inheritance with example 10 1
 4. Attempt any one part of the following:
a. Write the HTML code to design a registration form. (Assume fields are 10 2
as per your actual registration form in B.Tech.)
b. Describe the Document type Definition (DTD) in XML. What is 10 2
difference between Internal and External DTD.

5. Attempt any one part of the following:

a. Compare Java and JavaScript? Write a JavaScript program to find 10 3
largest among five numbers.
b. Explain the concept of URL and IP address. How is an IP Address 10 3
assigned to host?

6. Attempt any one part of the following:

a. Describe JDBC application architecture. List out the various type of 10 4
JDBC drivers.
b. Discuss EJB and its architecture. Differentiate Stateful and Stateless 10 4
EJB.

7. Attempt any one part of the following:

a. Explain Servlets with its Life Cycle. How its lifecycle is different from 10 5
the life cycle of JSP? Explain with an example
b. JSP is an extension of Servlets not replacement. Justify? What problems 10 5
of Servlets technology can JSP is supposed to solve?