SAINTGITS COLLEGE OF ENGINEERING (AUTONOMOUS)

B.Tech Syllabus 2020 – Computer Science and Engineering

Semester – III

261 | P a g e
B.Tech. in Computer Science and Engineering Third Semester

COURSE DESCRIPTION
Course Code 20MAT203 Course Credit: 4
Course Name Discrete Mathematical Structures
L-T-J-P 3-1-0-0
Pre-requisite Nil
Year of Introduction 2020

COURSE OBJECTIVES
To introduce mathematical notations and concepts in discrete mathematics that is essential for
1
computer science.
2 To train on mathematical reasoning.
3 To cultivate analytical thinking and creative problem solving skills.
To understand the basic concept of propositional and predicate logic which are prerequisites for
4
subjects like formal verification, program analysis, cryptography, algorithms.
To provide a foundation of set theory, lattice theory, generating functions, recurrence relations and
5
group theory.

REVISED BLOOM’S
COURSE OUTCOMES (COs)
TAXONOMY LEVEL
At the end of the course students will be able to:
Check the validity of predicates in Propositional and Quantified
CO1 Propositional Logic using truth tables, deductive reasoning and 3
inference theory on Propositional Logic
Solve counting problems by applying the elementary counting
techniques - Rule of Sum, Rule of Product, Permutation,
CO2 3
Combination, Binomial Theorem, Pigeonhole Principle and Principle
of Inclusion and Exclusion
Classify binary relations into various types and illustrate an
CO3 2
application for each type of binary relation, in Computer Science
Illustrate an application for Partially Ordered Sets and Complete
CO4 3
Lattices, in Computer Science
Explain Generating Functions and solve First Order and Second
CO5 Order Linear Recurrence Relations with Constant 3
Coefficients
Illustrate the abstract algebraic systems - Semigroups, Monoids,
CO6 3
Groups, Homomorphism and Isomorphism of Monoids and Groups

CO-PO MAPPING
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3 2 2 2 2 - - - - 2 - 1
CO2 3 2 2 2 2 - - - - 2 - 1
CO3 3 2 2 2 2 - - - - 2 - 1
CO4 3 2 2 2 2 - - - - 2 - 1
CO5 3 2 2 2 2 - - - - 2 - 1
CO6 3 2 2 2 2 - - - - 2 - 1
Correlation levels: 1- Low; 2-Medium; 3-High; No Correlation- “-”

262 | P a g e
B.Tech. in Computer Science and Engineering Third Semester

CO-PSO MAPPING
CO1 CO2 CO3 CO4 CO5 CO6
PSO1 - 2 2 - 3 -
PSO2 - 3 3 3 - 3
PSO3 - - - - - -
Correlation levels: 1- Low; 2-Medium; 3-High; No Correlation- “-”

COURSE IMPLEMENTATION CLOCK (IN HOURS)

Course introduction with thorough briefing of Course Objectives and
1 Hr
expected Course Outcomes
Course content delivery hours 48 Hrs
Internal Test
4 Hrs
(2 Assessment Tests of two-hour duration)
Total Instructional Hours 53 Hrs

SYLLABUS
The purpose of this course is to create awareness in students about the basic terminologies used in advanced
courses in Computer Science and develop rigorous logical thinking for solving different kinds of problems in
Computer Science. This course helps the learner to apply the theory and applications of elementary Counting
Principles, Propositional Logic, Predicate Logic, Lattices, Generating Functions, Recurrence Relations and
Algebraic Structures eventually in practical applications.

COURSE CONTENT
Module-I ESE
COs Hrs.
Module Title Fundamentals of Logic Marks
Mathematical logic - Basic connectives and truth table -Statements-Logical 1 2
Connectives
Tautology -Contradiction- Logical Equivalence - The Laws of Logic -The Principle
of duality-Substitution Rules-The implication - The Contra positive-The Converse-
The Inverse. 1 3
20%
Logical Implication - Rules of Inference - The use of Quantifiers - Open Statement- 1 2
Quantifier.
Logically Equivalent – Contrapositive - Converse - Inverse - Logical equivalences 1 3
and implications for quantified statement- Implications - Negation
Module-II COs Hrs. ESE
Module Title Fundamentals of Counting Theory Marks
The Rule of Sum – Extension of Sum Rule- The Rule of Product - Extension of 2 2
Product Rule
Permutations - Combinations. 2 2
The Binomial Theorem (without proof) 2 1
Combination with repetition - The Pigeon hole Principle. 2 2 20%
The Principle of Inclusion and Exclusion Theorem (Without Proof) - 2 2
Generalization of the Principle - Derangements.
Module-III COs Hrs. ESE
Module Title Relations and Functions Marks
Cartesian Product - Binary Relation. Function – domain – range- one to one 3 2

263 | P a g e
B.Tech. in Computer Science and Engineering Third Semester

function - Image restriction

Properties of Relations - Reachability Relations - Reflexive Relations - Symmetric 3 3
Relations - Transitive relations – Anti symmetric Relations - Partial Order relations
– Equivalence Relations - Irreflexive relations 20%
Partially ordered Set – Hasse Diagram - Maximal-Minimal Element - Least Upper 4 2
Bound - Greatest Lower Bound - (Topological sorting Algorithm- excluded)-
Equivalence Relations And Partitions - Equivalence Class
Lattice - Dual Lattice - Sub lattice - Properties of glb and lub - Properties of Lattice 4 3
Special Lattice - Complete Lattice - Bounded Lattice - Complemented Lattice -
Distributive Lattice.
Module-IV ESE
COs Hrs
Module Title Generating Functions and Recurrence Relations Marks
Generating Function - Definition and Examples - Calculation techniques - 5 3
Exponential Generating function
First order linear recurrence relations with constant coefficients – Homogeneous - 5 3 20%
non-Homogeneous Solution
Second order linear recurrence relations with constant coefficients – 5 3
Homogeneous - non-Homogeneous Solution
Module-V ESE
COs Hrs.
Module Title Algebraic Structures Marks
Algebraic system-Properties - Homomorphism and Isomorphism 6 2
Semi group and monoid – cyclic monoid - sub semi group and sub monoid - 6 3
Homomorphism and Isomorphism of Semigroup and monoids
Group - Elementary properties, subgroup, symmetric group on three symbols - 6 2 20%
The direct product of two groups
Group Homomorphism – Isomorphism of groups – cyclic groups – Right cosets – 6 3
Left cosets – Lagrange‟s Theorem

TEXT BOOKS
Ralph P. Grimaldi, B V Ramana, “Discrete and Combinatorial Mathematics (An Applied Introduction),
1
5th Edition, Pearson Education Asia, New Delhi, 2004, ISBN :978-81-7758-424-0
Kenneth H. Rosen “Discrete Mathematics and its Applications with Combinatorics and Graph Theory”,
2
Seventh edition Tata McGraw -hill pub. Co. Ltd., New Delhi, 2011. ISBN:978-0-07-068188
Trembly J. P and Manohar R ,”Discrete Mathematical Structures with Applications to Computer
3
Science “, Tata McGraw -Hill Pub. Co. Ltd. New Delhi, 2003, ISBN:0-07-065142-6
REFERENCE BOOKS
Liu C. L., “Elements of Discrete Mathematics “, 2/e, McGraw-Hill Int. editions, 1998 ISBN:978-1-25-
1
900-639-5
Richard Johnsonbaugh, “Discrete Mathematics “,Eighth Edition, Pearson Education Asia, New Delhi,
2
2002, ISBN:978-0321964687
Joe L Mott, Abraham Kandel, Theodore P Baker, “Discrete Mathematics for Computer Scientists and
3
Mathematicians “, 2/e, Prentice -Hall India, 2009, ISBN:978-0835913911
Swapan Kumar Chakroborthy, Bikash Kanthi Sarkar, “Discrete Mathematics “, Oxford University Press,
4
2011, ISBN:978-0-19-806543-2
Bernard Kolman, Robert C. Busby, Sharan Cutler Ross, “Discrete Mathematical Structures”,
5
Pearson Education Pvt Ltd., New Delhi, 2003, ISBN:978-0235563986

264 | P a g e
B.Tech. in Computer Science and Engineering Third Semester

MODES OF EVALUATION SCORE WEIGHTAGE / SPLIT MARKS

Continuous Internal Evaluation 50
Internal Test - I 12.5
Internal Test - II 12.5
Assignments / Quiz / Seminars etc. 15
Attendance 10
End Semester Examination (ESE) 100
Total 150
End Semester Examination Pattern
There will be two parts; Part A and Part B. Part A contains 10 questions with 2 questions from each module,
having 3 marks for each question. Students should answer all questions. Part B contains 2 full questions from
each module of which student should answer any one. Each question can have maximum 2 sub-divisions and
carries 14 marks

265 | P a g e
 B.Tech. in Computer Science and Engineering Third Semester

Total Pages:
Register No.: Name:

SAINTGITS COLLEGE OF ENGINEERING KOTTAYAM, KERALA

(AN AUTONOMOUS COLLEGE AFFILIATED TO
APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY, THIRUVANANTHAPURAM)

THIRD SEMESTER B.TECH. DEGREE EXAMINATION, MONTH AND YEAR

Course Code: 20MAT203

Course Name: Discrete Mathematical Structures
Max. Marks: 100 Duration: 3 Hours

PART A
(Answer all Questions. Each question carries 3 Marks)

Question CO BTL MARKS

1. Show the following implication without constructing the truth table: 1 3 3
(P ^ Q) => P→Q
2. Write the negation of the following statement. “If I drive, then I will not 1 3 3
walk”
3. What is pigeon hole principle? Explain. If you select any five numbers from 2 2 3
1 to 8 then prove that at least two of them will add up to 9
4. In how many ways can the letters of the word ALLAHABAD be arranged? 2 2 3
5. Show that the divisibility relation ' / ' is a partial ordering on the set Z+. 3 2 3
6 Consider the functions given by f(x) = 2x+3 and g(x) = x2. Find (g o f) and 3 2 3
( f o g).
7 What is meant by exponential generating function? Explain. 4 3 3
8 Provide one example of linear homogeneous recurrence relation. Mention 4 3 3
the degree also.
9 What is a monoid? Explain. 6 3 3
10 Let (A,.) be a group. Show that (ab)-1 = b-1a-1 5 2 3

PART B
(Answer any one Question from each Module. Each question carries 14 Marks)

MODULE I
Show that S ⋁ R is tautologically implied by (PVQ) ⋀ (P→R) ⋀
a) 1 3 6
(Q→S)
11. Show that from
b) (i) (∃x)(F(x) ⋀ S(x)) → (y) (M(y) → W(y)).
1 3 8
(ii)(∃y) (M(y) ⋀ W(y)) the conclusion (x)(F(x) →⌝S(x)) follows.

266 | P a g e
 B.Tech. in Computer Science and Engineering Third Semester

OR
Show that (x) (P(x) ⋁ Q(x)) ⇒ ((x)P(x) ⋁ (∃x) Q(x)) using indirect
a) 2 3 6
method of proof
Discuss indirect method of proof. Show that the following premises
are inconsistent
(i) If Jack misses many classes through illness, then he fails high
12. 2 3 8
school.
b)
(ii) If Jack fails high school, then he is uneducated.
(iii) If Jack reads a lot of books, then he is not uneducated.
(iv) Jack misses many classes through illness and reads a lot of
books.
MODULE II
Explain binomial theorem. Determine the coefficient of x9y3 in the 2 2 6
a)
expansion of(x+y)12, (x+2y)12 and (2x- 3y)12 using binomial theorem.
How many 5 digit numbers can be formed from the digits 1,2,3,4,5
13.
using the digits without repetition?
b) 2 2 8
(i) How many of them are even?
(ii) How many are even and greater than 30,000?
OR
There are 8 guests in a party. Each guest brings a gift and receives
a) another gift in return. No one is allowed to receive the gift they 2 2 6
bought. How many ways are there to distribute the gifts?
Six papers are set in an examination of which two are mathematical.
14.
Only one examination will be conducted in a day. In how many
b) different orders ,can the papers be arranged so that 2 2 8
(i) Two mathematical papers are consecutive?
(ii) Two mathematical papers are not consecutive?
MODULE III
Let A = { 1,2,3,4,...11,12} and let R be the equivalence relation on A
a) x A defined by (a,b) R (c,d) if fa+d = b+c. Prove that R is an 3 3 8
15. equivalence relation and find the equivalence class of (2 ,5)
What is a chain lattice ? Explain. Also show that every chain is a
b) 3 3 6
distributive lattice.
OR
Suppose f(x) = x+2 , g(x) = x-2, and h(x) = 3x for x  R , where R is 8
a) 3 3
the set of real numbers. Find (g o f ) , ( f o g ) , (f o f) and ( g o g)
16.
Let R and S be two relations on a set A . If R and S are symmetric, 6
b) 3 3
Prove that (R∩S) is also symmetric.
MODULE IV
Solve the recurrence relation ar - 7ar-1+ 10ar-2 = 0 for r ≥ 2 ; Given a0 8
a) 4 2
= 0; a1 = 41, using generating functions.
17.
Solve the recurrence relation ar - 4ar-1 + 4ar-2 = (r+1)2 using 6
b) 4 3
generating function.
OR
18. a) Solve an - 3an-1 + 2 ; a0 = 1 n ≥ 1, using generating functions. 4 3 8

267 | P a g e
 B.Tech. in Computer Science and Engineering Third Semester

Use generating function to solve the following recurrence relation 6

b) 4 3
an = 2an-1+ 2n ;with a0 = 2.
MODULE V
Prove that the set 'Q' of rational numbers other than 1 forms an
a) abelian group with respect to the operation ' * ' defined by 5 3 8
19. a * b = a+b -ab.
b) Show that the direct product of two group is a group. 5 3 6

OR
a) Show that the subgroup of a cyclic group is cyclic. 6 2 8
20. Let (A,*) be a group. Show that (A,*) is an abelian group if and only if
b) 6 2 6
a2 * b2=(a*b)2 for all „a‟ and „b‟ in A

268 | P a g e
B.Tech. in Computer Science and Engineering Third Semester

COURSE DESCRIPTION
Course Code 20CST201 Course Credit: 4
Course Name Data Structures
L-T-J-P 3-1-0-0
Pre-requisite 20EST102 Programming in C
Year of Introduction 2020

COURSE OBJECTIVES
1 To mould the learner to understand the various data structures, their organization and
operations.
2 To help the learners to assess the applicability of different data structures and associated
algorithms for solving real world problem
3 To solve practical application problems in various fields of Computer Science where the use of data
structures is expected
4 To help the learner get a programmatic and analytical knowledge of implementing the various data
structures using C Programming Language

REVISED BLOOM’S
COURSE OUTCOMES (COs)
TAXONOMY LEVEL
At the end of the course students will be able to:
CO1 Design an algorithm for a computational task and 2
calculate the time/space complexities of that algorithm
CO2 Identify the suitable data structure (array or linked list) to 2
represent a data item required to be processed to solve a
given computational problem and write an algorithm to find the
solution of the computational problem
CO3 Write an algorithm to find the solution of a computational 3
problem by selecting an appropriate data structure (binary
tree/graph) to represent a data item to be processed
CO4 Store a given dataset using an appropriate Hash Function to enable 3
efficient access of data in the given set
CO5 Select appropriate sorting algorithms to be used in specific 2
circumstances

CO-PO MAPPING
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 1 2 3 - - 2 - - - - - 2
CO2 2 2 2 - - 2 - - - - - 3
CO3 3 1 3 - - 1 - - - - - 1
CO4 2 2 2 - - 3 - - - - - 1
CO5 2 1 3 - - 2 - - - - - 2
CO6 3 1 3 - - 1 - - - - - 3
Correlation levels: 1- Low; 2-Medium; 3-High; No Correlation- “-”

269 | P a g e
B.Tech. in Computer Science and Engineering Third Semester

CO-PSO MAPPING
CO1 CO2 CO3 CO4 CO5 CO6
PSO1 1 2 2 2 1 3
PSO2 2 3 1 3 2 2
PSO3 1 2 3 1 2 1
Correlation levels: 1- Low; 2-Medium; 3-High; No Correlation- “-”

COURSE IMPLEMENTATION CLOCK (IN HOURS)

Course introduction with thorough briefing of Course Objectives and
1Hr
expected Course Outcomes
Course content delivery hours 48 Hrs
Internal Test 4 Hrs.
(2 Assessment Tests of two-hour duration)
Total Instructional Hours 53 Hrs

SYLLABUS
This course aims at moulding the learner to understand the various data structures, their organization
and operations. The course helps the learners to assess the applicability of different data structures and
associated algorithms for solving real world problem which requires to compare and select appropriate data
structures to solve the problem efficiently. This course introduces abstract concepts for data organization
and manipulation using data structures such as stacks, queues, linked lists, binary trees, heaps and graphs for
designing their own data structures to solve practical application problems in various fields of Computer
Science.

COURSE CONTENT
Module-I ESE
CO(s) Hrs.
Module Title Basic Concepts of Data Structures Marks
System Life Cycle
Algorithms-Performance Analysis-Space Complexity- Time Complexity 1 8 20%
Asymptotic Notation- Complexity Calculation of Simple Algorithms
Module-II COs Hrs. ESE
Module Title Arrays and Searching Marks
Polynomial representation using Arrays-Sparse Matrix-Stacks
Queues-Circular Queues-Priority Queues-Double Ended Queues-Evaluation of 3 10
20%
Expressions
Linear Search and Binary Search
Module-III COs Hrs. ESE
Module Title Linked List & Memory Management Marks
Self Referential Structures- Dynamic Memory Allocation
Singly Linked List-Operations on Linked List- Doubly Linked List- Circular
Linked List
Stacks and Queues using Linked List- Polynomial representation using Linked 2 10 20%
List
Memory allocation and de-allocation-First-fit- Best-fit and Worst-fit allocation
schemes
Module-IV ESE
COs Hrs
Module Title Trees and Graphs Marks

270 | P a g e
B.Tech. in Computer Science and Engineering Third Semester

Trees, Binary Trees-Tree Operations-Binary Tree Representation-Tree

Traversals- Binary Search Trees- Binary Search Tree 5 10 20%
Operations Graphs-Representation of Graphs-Depth First Search and Breadth
First Search on Graphs-Applications of Graphs
Module-V ESE
COs Hrs.
Module Title Sorting and Hashing Marks
Sorting Techniques – Selection Sort-Insertion Sort-Quick Sort-Merge Sort and
Heap Sort 4 10 20%
Hashing- Hashing Techniques-Collision Resolution-Overflow handling- Hashing
functions – Mid square-Division-Folding-Digit Analysis

TEXT BOOKS
Ellis Horowitz, Sartaj Sahni and Susan Anderson-Freed, Universities Press, Fundamentals of
1
Data Structures in C
2 Samanta D., Classic Data Structures, Prentice Hall India.
Richard F. Gilberg, BeHrouz A. Forouzan, Data Structures: A Pseudocode Approach with C, 2/e,
3
Cengage Learning.
REFERENCE BOOKS
1 Aho A. V, J. E. Hopcroft and J. D. Ullman, Data Structures and Algorithms, Pearson Publication
Tremblay J. P. and P. G. Sorenson, Introduction to Data Structures with Applications, Tata McGraw
2
Hill.
3 Peter Brass, Advanced Data Structures, Cambridge University Press.

4 Lipschuts S., Theory and Problems of Data Structures, Schaum‟s Series.

5 Martin Barrett, Clifford Wagner, C And Unix: Tools For Software Design, John Wiley.

MODES OF EVALUATION SCORE WEIGHTAGE / SPLIT MARKS

Continuous Internal Evaluation 50
Internal Test – I 12.5
Internal Test – II 12.5
Assignments / Quiz / Seminars etc. 15
Attendance 10
End Semester Examination (ESE) 100
Total 150
End Semester Examination Pattern
There will be two parts; Part A and Part B.
Part A contains 10 questions with 2 questions from each module, having 3 marks for each question. Students
should answer all questions. Part B contains 2 full questions from each module of which student should
answer any one. Each question can have maximum 2 sub-divisions and carries 14 marks

271 | P a g e
 B.Tech. in Computer Science and Engineering Third Semester

B Total Pages:

Register No.: Name:

SAINTGITS COLLEGE OF ENGINEERING KOTTAYAM, KERALA

(AN AUTONOMOUS COLLEGE AFFILIATED TO

APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY, THIRUVANANTHAPURAM)

THIRD SEMESTER B.TECH. DEGREE EXAMINATION, MONTH AND YEAR

Course Code: 20CST201

Course Name: Data Structures
Max. Marks: 100 Duration: 3 Hours

PART A
(Answer all questions. Each question carry 3 marks)

Question CO BTL MARKS

Calculate the frequency count of the statement x = x+1; in the following code
segment
for (i = 0; i< n; i++) 1 4 3
1. for (j = 1; j< n; j*=2)
x = x + 1;
2. What is the relevance of verification in System Life Cycle? 1 2 3
3. Write an algorithm to insert a new element in a particular position of an array. 2 3 3
Convert the expression ((A/(B-D+E))*(F-G)*H) to postfix form. Show each
4. 2 4 3
step in the conversion including the stack contents
Write an algorithm to count the number of occurrences of a character in a
5. linked list (each node contains only one character) 2 6 3

6. Write an algorithm for best-fit method of memory allocation 2 3 3

Draw the binary tree whose sequential representation is given below:

3 4 3
7.

8. Differentiate a binary tree with a binary search tree. 3 2 3

9. Write an algorithm to arrange n numbers in non-increasing order. 5 4 3
Let the size of a hash table is 10. The index of the hash table varies from 0 to
9. Assume the keys 73, 54, 15, 48, 89, 66, 37, 18, 41, 22, 62 are
10. 4 4 3
mapped using modulo operator. Show how the keys are distributed using
chaining method.

PART B
272 | P a g e
 B.Tech. in Computer Science and Engineering Third Semester

(Answer any one Question from each module. Each question carries 14 Marks)

MODULE I
a) Explain the System Life Cycle in detail 1 1 8
11.
b) How the performance of an algorithm is evaluated? 1 1 6
OR
a) Between O(nlogn) and O(logn) which one is better and why? 1 3 5
12. b) Write algorithms for Linear Search and Binary Search and Compare
1 2 9
their time complexities
MODULE II
a) Write algorithms to insert and delete elements from a double ended
2 4 9
13. queue. Demonstrate with examples
b) Compare and contrast Circular Queue with a Normal Queue 2 2 5
OR
a) Write an algorithm to insert and delete elements from a Priority Queue 2 4 6
14. b) Discuss an algorithm to convert an infix expression to a prefix
2 2 8
expression
MODULE III
a) Write an algorithm to multiply two polynomials represented using linked
2 3 7
15. list
b) How doubly linked list can be used to find palindromes? 2 3 7
OR
a) How is memory compaction (de-allocation) done in memory
2 2 8
16. management?
b) Discuss the advantages and disadvantages of First-fit, Best-fit and
2 1 6
Worst-fit allocationschemes
MODULE IV
a) List the properties of Binary Search Tree. Write an algorithm to search
3 1 6
17. an element from a Binary Search Tree
b) Write an iterative algorithm for in-order traversal of a Binary Tree 3 4 8
OR
a) Give algorithms for DFS and BFS of a graph and explain with examples 3 3 9
18.
b) How graphs can be represented in a Computer? 3 4 5
MODULE V
a) Write algorithms for Merge sort and Quick Sort. 5 3 7
19.. b) Illustrate the working of Quick sort on the following input 38, 8, 0, 28,
5 4 7
45, -12, 89, 66, 42
OR
a) With examples discuss the different hash functions used for hashing 4 2 7
b) Apply the hash function h(x) = x mod 7 for linear probing on
20.
the data 2341, 4234, 2839, 430, 22, 397, 3920 and show the 4 4 7
resulting hash table

273 | P a g e
B.Tech. in Computer Science and Engineering Third Semester

COURSE DESCRIPTION
Course Code 20CST203 Course Credit: 4
Course Name Logic System Design
L-T-J-P 3-1-0-0 CORRECTION IN SYLLABUS.
Pre-requisite Nil
Year of Introduction 2020
KINDLY SEE CORRIGENDUM - III

COURSE OBJECTIVES
1 To impart an understanding of basic concepts of Boolean algebra and digital systems
To outline the formal procedures for the analysis and design of combinational circuits and sequential
2
circuits.
3 To design and implement combinational circuits using basic building blocks
4 To design and implement SyncHronous sequential circuits
5 To provide an introduction to use Hardware Description Language

REVISED BLOOM’S
COURSE OUTCOMES (COs)
TAXONOMY LEVEL
At the end of the course students will be able to:
Illustrate decimal, binary, octal, hexadecimal and BCD number
systems, perform conversions among them and do the operations -
CO1 2
complementation, addition, subtraction, multiplication and division
on binary numbers
Simplify a given Boolean Function and design a combinational
CO2 3
circuit to implement the simplified function using Digital Logic Gates
Design combinational circuits - Adders, Code Convertors, Decoders,
CO3 Magnitude Comparators, Parity Generator/CheckerCORRECTION IN SYLLABUS.
and design the 3
Programmable Logic Devices - ROM and PLA. KINDLY SEE CORRIGENDUM - III
CO4 Design sequential circuits - Registers, Counters and Shift Registers. 3
Use algorithms to perform addition and subtraction on binary, BCD
CO5 2
and floating point numbers

CO-PO MAPPING
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3 3 - - - - - - - - - 2
CO2 3 3 3 3 - 2 - - - - - 2
CO3 3 3 3 3 - 2 - - - - - 2
CO4 3 3 3 3 - 2 - - - - - 2
CO5 3 3 2 - - - - - - - - 2
Correlation levels: 1- Low; 2-Medium; 3-High; No Correlation- “-”
CORRECTION IN SYLLABUS.
CO-PSO MAPPING KINDLY SEE CORRIGENDUM - III
CO1 CO2 CO3 CO4 CO5
PSO1 3 3 3 3 3
PSO2 3 3 3 3 3
PSO3 1 1 1 1 1
Correlation levels: 1- Low; 2-Medium; 3-High; No Correlation- “-”

274 | P a g e
B.Tech. in Computer Science and Engineering Third Semester

COURSE IMPLEMENTATION CLOCK (IN HOURS)

Course introduction with thorough briefing of Course Objectives and
1 Hr
expected Course Outcomes
Course content delivery hours 48 Hrs
Internal Test
4 Hrs.
(2 Assessment Tests of two-hour duration)
Total Instructional Hours 53 Hrs

SYLLABUS
Binary Arithmetic and Binary Codes – Decimal, Binary, Octal and Hexadecimal Number systems (Addition,
Subtraction, Multiplication and Division) - Basic concepts of Boolean algebra – Concepts and postulates –
Functions – Canonical and Standrad Forms – Simplification – Basic, K-Map – Don‟t care conditions -
Tabulation Method – Product Of Sum Simplification – Digital Logic Gates – Implementation of Boolean
functions using basic and universal gates - Design of simple Combinational circuits – adder, subtractor, binary
parallel adder, Carry look ahead adder, BCD Adder, Code Converter, Multiplexer, Demultiplexer, Decoder,
Magnitude Comparator, Encoder and Parity Generator/Checker – Design of Sequential logic circuits – Latches,
Flipflops, Counters– AsyncHronous and SyncHronous - Representation and arithmetic algorithms for Binary,
BCD and floating point numbers – Programmable Logic Devices – Shift Registers, ROM, PLA, PAL

COURSE CONTENT CORRECTION IN SYLLABUS.

KINDLY SEE CORRIGENDUM - III
Module-I ESE
CO(s) Hrs.
Module Title Number systems, Operations & Codes (No algorithms) Marks
Number Systems : Decimal, Binary, Octal and Hexadecimal number systems,
Number Base Conversions
Binary Arithmetic: Addition, Subtraction, Multiplication & Division of Binary
Numbers.
Addition, Subtraction, Multiplication & Division of Binary Numbers.
Representation of Negative Numbers- Complements, subtraction with
complements 1 9 20%
BCD Arithmetic: Addition and Subtraction of BCD Numbers
Octal and Hexadecimal Arithmetic: Addition & Subtraction of Octal and
Hexadecimal Numbers.
Binary Codes: Decimal Codes, Error detection codes, Reflected code, Character
Coding Schemes-ASCII, EBCDIC
Module-II ESE
COs Hrs.
Module Title Boolean Algebra Marks
Introduction to Boolean Algebra: Postulates of Boolean Algebra
Basic theorems and Properties of Boolean Algebra
Boolean Functions: Canonical and Standard Forms
Simplification of Boolean Functions: Karnaugh -Map Method (upto five variables),
Don‟t care conditions
Simplification of Boolean Functions: Karnaugh -Map Method (upto five variables), 2 9 20%
Don‟t care conditions CORRECTION IN SYLLABUS.
Product of sums simplification
KINDLY SEE CORRIGENDUM - III
Tabulation method
Digital Logic Gates: AND, OR, NOT, NAND, NOR, XOR, XNOR, Implementation
of Boolean functions using basic and universal gates. (Lecture 1)
275 | P a g e
B.Tech. in Computer Science and Engineering Third Semester

Digital Logic Gates: AND, OR, NOT, NAND, NOR, XOR, XNOR, Implementation
of Boolean functions using basic and universal gates. (Lecture 2)
Module-III ESE
COs Hrs.
Module Title Combinational Logic Circuits Marks
Design Procedure & Implementation of Combinational Circuits
Binary Adders: Implementation of Half Adder, Full Adder
Binary Subtractors: Implementation of Half Subtractor, Full Subtractor
Implementation of Binary Parallel Adder ,Carry look ahead Adder, BCD Adder
Implementation of Binary Parallel Adder ,Carry look ahead Adder, BCD Adder
3 10 20%
Implementation of Various Combinational Circuits: Code Converters, Magnitude
Comparator
Implementation of Decoder, Demultiplexer CORRECTION IN SYLLABUS.
Implementation of Encoder, Multiplexer KINDLY SEE CORRIGENDUM - III
Implementation of Parity Generator/Checker
Module-IV ESE
COs Hrs.
Module Title Sequential Logic Circuits Marks
Flip flops: SR, JK, T and D flip- flops
SR, JK, T and D flip- flops
Triggering of flip-flops- Master slave flip- flop, Edge- triggered flip-flops
Triggering of flip-flops- Master slave flip- flop, Edge- triggered flip-flops
Excitation table and characteristic equations of flip- flops
Registers- Register with parallel load 4 10 20%
Counter Design: Asynchronous counters- Binary and BCD counters- timing
sequences and state diagrams. CORRECTION IN SYLLABUS.
Asynchronous counters- Binary and BCD counters-KINDLY timing sequences and state
SEE CORRIGENDUM - III
diagrams.
Synchronous counters- Binary Up- down counter, BCD counter
Module-V ESE
COs Hrs.
Module Title Shift registers, Arithmetic algorithms & PLD’s Marks
Shift Registers - Serial In Serial Out, Serial In Parallel Out.
Bidirectional Shift Register with Parallel load
Shift register counters - Ring Counter, Johnson Counter- timing sequences and
state diagrams
Arithmetic Algorithms: Algorithm for addition and subtraction of binary numbers in
Signed magnitude and 2‟s complement representations
Algorithm for addition and subtraction of binary numbers in Signed magnitude and
4&5 10 20%
2‟ s complement representations
Algorithm for addition and subtraction of BCD numbers
Representation of floating point numbers (IEEE Standard representations)
Algorithms for floating point addition and subtraction
Programmable Logic devices - ROM CORRECTION IN SYLLABUS.
PLA, Implementation of simple circuits using PLA KINDLY SEE CORRIGENDUM - III
PLA, Implementation of simple circuits using PLA

276 | P a g e
B.Tech. in Computer Science and Engineering Third Semester

TEXT BOOKS
1 M. Morris Mano, Digital Logic & Computer Design, 4/e, Pearson Education, 2013
2 Thomas L Floyd, Digital Fundamentals, 10/e, Pearson Education, 2009
3 M. Morris Mano, Computer System Architecture, 3/e, Pearson Education, 2007
REFERENCE BOOKS
M. Morris Mano, Michael D Ciletti , Digital Design With An Introduction to the Verilog HDL, 5/e,
1
Pearson Education, 2013
2 Donald D Givone, Digital Principles and Design, Tata McGraw Hill, 2003

3 Ronald J Tocci, Digital Systems: Principles and Applications, 11/e, Pearson Education

4 David Money Harris, Sarah L Harris, Digital Design and Computer Architecture, Elsevier
Donald P Leach, Albert Paul Malvino, Goutam saha, Digital Principles and Applications, 8/e, McGraw
5
Hill

MODES OF EVALUATION SCORE WEIGHTAGE / SPLIT MARKS

Continuous Internal Evaluation 50
Internal Test - I 12.5
Internal Test - II 12.5
Assignments / Quiz / Seminars etc. 15
Attendance 10
End Semester Examination (ESE) 100
Total 150
End Semester Examination Pattern
There will be two parts: Part A and Part B.
Part A contain 10 questions with two questions from each module, having 3 marks for each question. Students
should answer all questions. Part B contains two questions from each module of which student should answer
any one. Each question can have maximum 2 sub-divisions and carry 14 marks.

277 | P a g e
 B.Tech. in Computer Science and Engineering Third Semester

Total Pages:
Register No.: Name:

SAINTGITS COLLEGE OF ENGINEERING KOTTAYAM, KERALA

(AN AUTONOMOUS COLLEGE AFFILIATED TO
APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY, THIRUVANANTHAPURAM)

THIRD SEMESTER B.TECH. DEGREE EXAMINATION, MONTH AND YEAR

Course Code: 20CST203

Course Name: Logic System Design
Max. Marks: 100 Duration: 3 Hours

PART A
(Answer All Questions. Each Question carries 3 Marks)

Question CO BTL MARKS

Represent the decimal numbers (459)10 and (859)10 in hexadecimal and 1 1 3
1.
perform addition of these hexadecimal numbers.
Subtract (1101)2 from (11010)2 using: i) 2‟s complement and ii) 1‟s 1 1 3
2.
complement arithmetic.
3. Find the dual and complement of the boolean function F = AB′ + B(A + B′) 2 1 3
4. Using K-map, reduce the expression: AB + ABC + ABC + BC 2 2 3
5. Design a half subtractor with NAND gates only 3 3 3
Design a combinational circuit that multiplies an input decimal digit by 5
6. represented in BCD. The output is also in BCD. Show that the outputs can 3 3 3
be obtained from the input lines without using any logic gates
7. Differentiate between ripple counter and synchronous counter 3 1 3
8. Construct D flip- flop using NAND gates. Also give its truth table 3 2 3
9. Explain how a shift register is used for serial data transfer? 4 2 3
10. Write short notes on ROM. 4 1 3

PART B
(Answer any one full question from each module)

MODULE I
a) Perform the following operations using 2‟ s complement arithmetic: (i)
1 1 8
(88)10 + (−37)10 (ii) (−20)10 + (−12)10
11. b) Perform the following base conversions: (i) (101011.11)2 to octal (ii)
(3F9B)16 to binary (iii) (121)10 to binary (iv) (3077)8 to binary 1 1 6
(101011.11)2
OR
a) Find the 12 bit 2‟s complement representation of the following
1 2 6
12. decimal numbers. (i) – 97 (ii) – 224 (iii) - 197.5
b) Perform the following operations (i) (520)8 + (488)8 1 2 8

278 | P a g e
 B.Tech. in Computer Science and Engineering Third Semester

(ii) (520)16 − (488)16

MODULE II
a) Prove that (i) AB + A(B + C) + B(B + C) = B + AC
2 2 4
(ii) AB + A(B + C) + B(B + D) = A
Using K-map, simplify the Boolean Function F in sum of products
13.
b) form, using the don‟t care conditions d:
F(w, x, y,z) = w′(x′y + x′y′ + x yz) + x′z′(y + w) 2 2 10
d(w, x, y,z) = w′x(y′z + yz′) + w yz
OR
a) Simplify the following expressions using Karnaugh- map method. (i)
2 2 8
F = Σ(0,2,4,6,9,11,13,15,17,21,25,27,29,31) (ii) F = Π(0,2,5,7)
Convert the following to the other canonical form:
14.
b) (i) F(x, y,z, a) = ∑(1,3,7)
(ii) F(x, y,z) = Π(0,3,6,7) 2 2 6
(iii) F(A, B, C, D) = Π(0,1,2,3,4,6,12)
MODULE III
15. a) Implement Full adder circuit using NAND gate only 3 2 4
b) Design a code converter for converting BCD to Excess 3 code 3 3 10
OR
a) With a neat diagram explain 4-bit carry look-ahead adder 3 2 6
16.
b) Design a Gray to binary code converter using a 4x1 MUX. Draw the
3 3 8
circuit diagram and explain.
MODULE IV
a) Design a counter that count the states 0,3,5,6,0… using T flip- flops. 4 3 10
17. b) Write the characteristics equation, excitation table of JK, T and D
4 1 4
flipflop.
OR
a) Explain race around condition and how it can be avoided. 4 2 6
18.
b) Design a syncHronous Binary Up-Down Counter. 4 2 8
MODULE V
a) With a neat diagram explain universal shift register 4 1 8
19.
b) Explain Johnson Counter with timing diagram. 4 1 6
OR
a) Write algorithm for floating point addition and subtraction. 5 1 8
20. b) Implement the functions. Y1 = AB′C′ + AB′C + ABC and
5 3 6
Y2 = BC + AC using minimum gates Programmable Logic Array

*********************

279 | P a g e
B.Tech. in Computer Science and Engineering Third Semester

COURSE DESCRIPTION
Course Code 20CST205 Course Credit: 4
Course Name Object Oriented Programming Using Java
L-T-J-P 3-1-0-0
Pre-requisite 20EST102 Programming in C
Year of Introduction 2020

COURSE OBJECTIVES
1 To implement Java programs using the object oriented concepts - classes, objects, constructors, data
hiding, inheritance and polymorphism.
2 To utilise data types, operators, control statements, built in packages & interfaces, Input/ Output
Streams and Files in Java to develop programs.
3 To illustrate how robust programs can be written in Java using exception handling mechanism.
4 To implement application programs in Java using multithreading and database connectivity.
5 To develop Graphical User Interface based application programs by utilising event handling features
and Swing in Java.

REVISED BLOOM’S
COURSE OUTCOMES (COs)
TAXONOMY LEVEL
At the end of the course students will be able to:
CO1 Write Java programs using the object oriented concepts - classes, 3
objects, constructors, data hiding, inheritance and polymorphism
Utilise data types, operators, control statements, built in packages &
CO2 interfaces, Input / Output Streams and Files in Java to develop 3
programs
CO3 Illustrate how robust programs can be written in Java using exception 2
handling mechanism
CO4 Write application programs in Java using multithreading and 3
database connectivity
CO5 Write Graphical User Interface based application programs by 3
utilising event handling features and Swing in Java

CO-PO MAPPING
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3 3 3 3 2 2 2 2 1 1 1 3
CO2 3 3 3 3 2 2 2 2 1 1 1 3
CO3 3 3 3 3 2 2 2 2 1 1 1 3
CO4 3 3 3 3 2 2 2 2 1 1 1 3
CO5 3 3 3 3 2 2 2 2 1 1 1 3
Correlation levels: 1- Low; 2-Medium; 3-High; No Correlation- “-”

CO-PSO MAPPING
CO1 CO2 CO3 CO4 CO5
PSO1 3 3 2 2 3
PSO2 3 3 3 3 3
PSO3 3 3 2 2 3
Correlation levels: 1- Low; 2-Medium; 3-High; No Correlation- “-”

280 | P a g e
B.Tech. in Computer Science and Engineering Third Semester

COURSE IMPLEMENTATION CLOCK (IN HOURS)

Course introduction with thorough briefing of Course Objectives and
1 Hr
expected Course Outcomes
Course content delivery hours 48 Hrs
Internal Test 4 Hrs.
(2 Assessment Tests of two-hour duration)
Total Instructional Hours 53 Hrs

SYLLABUS
Emphasis on the fundamentals of structured design with classes, including development, testing,
implementation, and documentation. Includes object-oriented programming techniques, classes, and objects.
The Java programming language is used as the teaching vehicle for this course. Students will learn how to
program in Java and use some of its most important APIs. Special importance will be assigned to the object-
oriented nature of Java and its use of polymorphism. This course demonstrates an introductory understanding
of graphical user interfaces, multithreaded programming, and event-driven programming. Hands-on labs and
exercises will enable students toward becoming highly skilled Java Application developers.

COURSE CONTENT
Module-I ESE
CO(s) Hrs.
Module Title Introduction Marks
Approaches to Software Design - Functional Oriented Design -Object Oriented
Design -Case Study of Automated Fire Alarm System.
Object Modeling Using Unified Modeling Language (UML) – Basic Object Oriented
concepts- UML diagrams -Use case model- Class diagram- Interaction diagram,
Activity diagram- State chart diagram. 1 10 20%
Introduction to Java - Java programming Environment and Runtime Environment -
Development Platforms -Standard, Enterprise.
Java Virtual Machine (JVM) - Java compiler- Byte code- Java applet- Java
Buzzwords- Java program structure- Comments-Garbage Collection- Lexical
Issues.
Module-II COs Hrs. ESE
Module Title Core Java Fundamentals Marks
Primitive Data types – Integers-Floating Point Types-Characters- Boolean. Literals
-Type Conversion and Casting -Variables- Arrays-Strings -Vector class.
Operators - Arithmetic Operators- Bitwise Operators-Relational Operators-
Boolean Logical Operators- Assignment Operator-Conditional (Ternary) Operator- 2
Operator Precedence.
Control Statements - Selection Statements-Iteration Statements and Jump
Statements.
Object Oriented Programming in Java - Class Fundamental - Declaring Objects-
Object Reference- Introduction to Methods-Constructors- this Keyword- Method
20%
Overloading-Using Objects as Parameters- Returning Objects- Recursion-Access
Control-Static Members-Final Variables-Inner Classes - Command Line 1 10
Arguments- Variable Length Arguments.
Inheritance - Super Class- Sub Class -The Keyword super - protected Members -
Calling Order of Constructors - Method Overriding- the Object class- Abstract
Classes and Methods- using final with Inheritance.

281 | P a g e
B.Tech. in Computer Science and Engineering Third Semester

Module-III COs Hrs. ESE

Module Title More features of Java Marks
Packages and Interfaces - Defining Package – CLASSPATH - Access Protection- 2
Importing Packages - Interfaces.
Exception Handling - Checked Exceptions- Unchecked Exceptions- try Block and
catch Clause - Multiple catch Clauses - Nested try Statements – throw - throws 3 9 20%
and finally.
Input/Output - I/O Basics - Reading Console Input - Writing Console Output - 2
PrintWriter Class - Object Streams and Serialization- Working with Files.
Module-IV ESE
COs Hrs.
Module Title Advanced features of Java Marks
Java Library - String Handling – String Constructors - String Length - Special
String Operations - Character Extraction - String Comparison -Searching Strings-
Modifying Strings - using value Of() - Comparison of String Buffer and String.
Collections framework - Collections overview 10 20%
Collections Interfaces- Collection Interface - List Interface.
Collections Class – Array List class- Accessing a Collection via an Iterator. 2
Event handling - Event Handling Mechanisms - Delegation Event Model -Event
Classes - Sources of Events- Event Listener Interfaces - Using the Delegation
Model.
Multithreaded Programming - The Java Thread Model - The Main Thread- 4
Creating Thread- Creating Multiple Threads- Synchronization- Suspending,
Resuming and Stopping Threads.
Module-V ESE
COs Hrs.
Module Title Graphical User Interface and Database support of Java: Marks
Swings fundamentals - Swing Key Features - Model View Controller (MVC) -
Swing Controls- Components and Containers- Swing Packages, Event Handling 5
in Swings, Swing Layout Managers
Exploring Swings – JFrame - JLabel- The Swing Buttons- JText Field 9 20%
Java Data Base Connectivity (JDBC) - JDBC overview 4
Creating and Executing Queries – create table, delete, insert, select.

TEXT BOOKS
1 Herbert Schildt, Java: The Complete Reference, 8/e, Tata McGraw Hill, 2011.ISBN: 9780071606301
2 Rajib Mall, Fundamentals of Software Engineering, 4th edition, PHI, 2014.ISBN:9788120348981
3 Paul Deitel, Harvey Deitel, Java How to Program, Early Objects, 11th Edition, Pearson, 2018.ISBN-13:
9780134743356
REFERENCE BOOKS
1 Y. Daniel Liang, Introduction to Java Programming, 7/e, Pearson, 2013.ISBN-13: 978-0-13-461103-7
2 Nageswararao R., Core Java: An Integrated Approach, Dreamtech Press, 2008.ISBN-13. 978-
8177228366
3 Flanagan D., Java in A Nutshell, 5/e, O'Reilly, 2005.ISBN: 9780596007737
4 Barclay K., J. Savage, Object Oriented Design with UML and Java, Elsevier,
2004.ISBN 9780750660983
5 Sierra K.,Head First Java, 2/e, O'Reilly, 2005.ISBN: 9780596009205

282 | P a g e
B.Tech. in Computer Science and Engineering Third Semester

6 Balagurusamy E., Programming JAVA a Primer, 5/e, McGraw Hill, 2014.ISBN-13. 978-9351343202

MODES OF EVALUATION SCORE WEIGHTAGE / SPLIT MARKS

Continuous Internal Evaluation 50
Internal Test - I 12.5
Internal Test - II 12.5
Assignments / Quiz / Seminars etc. 15
Attendance 10
End Semester Examination (ESE) 100
Total 150
End Semester Examination Pattern
There will be two parts; Part A and Part B. Part A contains 10 questions with 2 questions from each module,
having 3 marks for each question. Students should answer all questions. Part B contains 2 questions from
each module of which a student should answer any one. Each question can have maximum 2 sub-divisions
and carry 14 marks.

283 | P a g e
 B.Tech. in Computer Science and Engineering Third Semester

Total Pages:

Register No.: Name:

SAINTGITS COLLEGE OF ENGINEERING KOTTAYAM, KERALA

(AN AUTONOMOUS COLLEGE AFFILIATED TO

APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY, THIRUVANANTHAPURAM)

THIRD SEMESTER B.TECH. DEGREE EXAMINATION, MONTH AND YEAR

Course Code: 20CST205

Course Name: Object Oriented Programming using Java
Max. Marks: 100 Duration: 3 Hours

PART A
(Answer all Questions. Each question carries 3 Marks)

Question CO BTL MARKS

1. Briefly explain the portable, secure and robust features of Java. 1 2 3
2. Describe the concepts of object and class with a suitable Java program. 1 1 3
3. Explain the concept of method overriding with an example. 1 4 3
4. What is the use of the keyword final in Java? 3 3 3
5. Explain the concept of streams. 2 2 3
6. Explain any two applications of Serialization. 2 4 3
7. Distinguish the usage of “==” and equals() method when comparing String
2 4 3
type?
8. What are Collections in Java? Explain any one Collection interface in
2 2 3
Java.
9. Explain any two properties of Swing components in Java. 5 2 3
10. Explain JLabel component. With suitable examples explain any two of its
5 4 3
constructors.

284 | P a g e
 B.Tech. in Computer Science and Engineering Third Semester

PART B
(Answer any one question completely from each module)

MODULE I
Describe in detail any three Object Oriented Programming principles.
a) 1 1 9
Illustrate with suitable examples.
11.
Explain about Java Runtime Environment? What is the role of Java
b) 1 2 5
Virtual Machine in it?
OR
Compare and contrast Java standard edition and Java enterprise
a) 1 4 5
edition.
12.
Why is Java considered to be platform independent? What is the role
b) 1 1 9
of Bytecode in making Java platform independent?
MODULE II
a) Explain in detail the primitive data types in Java. 2 1 8
13. Explain automatic type conversion in Java with an example. What
b) 2 2 6
are the two conditions required for it?
OR
Using a suitable Java program explain the difference between private
a) 1 3 8
and public members in the context of inheritance.
14.
Is it possible to use the keyword super within a static method? Give
b) 1 5 6
justification for your answer.
MODULE III
Explain in detail about byte streams and character streams with
a) 2 2 6
15. suitable code samples.
Describe in detail about exception handling, try block and catch
b) 3 1 8
clause with the help of a suitable Java program
OR

Explain object streams in Java. Explain the role of Serializable

a) 2 2 8
16 interface with a suitable code sample.
Explain throw, throws and finally constructs with the help of a Java
b) 3 2 6
program.
MODULE IV
Describe in detail the creation of a thread using the Runnable
17. a) 4 1 10
interface and the Thread class with suitable examples.

285 | P a g e
 B.Tech. in Computer Science and Engineering Third Semester

Explain List Interface. Mention any two exceptions thrown by its

b) 2 2 4
methods.
OR
Explain in detail the Delegation Event model for event handling in
a) 4 2 7
Java.
18.
Write a simple program by extending appropriate class to
b) 4 3 7
demonstrate the working of threads in java.
MODULE V
Write a Java program to demonstrate the use of JLabel and JButton
a) 5 3 7
by adding them to JFrame.
19.
Demonstrate step-by-step procedure of using Java Data Base
b) 5 3 7
Connectivity in Java programs.
OR
a) Explain the class hierarchy of Java Swing components. 5 2 7
20. Write a Java Program to create a student table and to add student
b) 4 3 7
details to it using JDBC.

*********************

286 | P a g e
B.Tech. in Computer Science and Engineering Third Semester

COURSE DESCRIPTION
Course Code 20EST200 Course Credit: 2
Course Name Design and Engineering
L-T-J-P 2-0-0-0
Pre-requisite Nil.
Year of Introduction 2020

COURSE OBJECTIVES
1 Introduce the undergraduate engineering students the fundamental principles of design engineering.
2 Make them understand the steps involved in the design process
3 Familiarize them with the basic tools used and approaches in design.
Help students to consider aesthetics, ergonomics and sustainability factors in designs and also to
4
practice professional ethics while designing.

REVISED BLOOM’S
COURSE OUTCOMES (COs)
TAXONOMY LEVEL
At the end of the course students will be able to:
Explain the different concepts and principles involved in design
CO1 2
engineering.
CO2 Apply design thinking while learning and practicing engineering. 3
Develop innovative, reliable, sustainable and economically viable
CO3 3
designs incorporating knowledge in engineering.
CO4 Justify the importance of modular design and design optimization 3

CO-PO MAPPING
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 2 1 - - - - 1 - - 1 - -
CO2 - 2 - - - 1 - 1 - - - 2
CO3 - - 2 - - 1 1 - 2 2 - 1
CO4 - - 2 - - - - - - 2 - -
Correlation levels: 1- Low; 2-Medium; 3-High; No Correlation- “-”

CO-PSO MAPPING
CO1 CO2 CO3 CO4
PSO1 2 2 2 2
PSO2 - - 2 2
PSO3 - - 3 3
Correlation levels: 1- Low; 2-Medium; 3-High; No Correlation- “-”

287 | P a g e
B.Tech. in Computer Science and Engineering Third Semester

COURSE IMPLEMENTATION CLOCK (IN HOURS)

Course introduction with thorough briefing of Course Objectives and
1 Hr
expected Course Outcomes
Course content delivery hours 24 Hrs
Internal Test
4 Hrs
(2 Assessment Tests of two-hour duration)
Total Instructional Hours 29 Hrs

SYLLABUS
Design Process:- Introduction to Design and Engineering Design, Defining a Design Process-:Detailing
Customer Requirements, Setting Design Objectives, Identifying Constraints, Establishing Functions,
Generating Design Alternatives and Choosing a Design. Design Thinking Approach:-Introduction to Design
Thinking, Iterative Design Thinking Process Stages: Empathize, Define, Ideate, Prototype and Test. Design
Thinking as Divergent-Convergent Questioning. Design Thinking in a Team Environment. Design
Communication (Languages of Engineering Design):-Communicating Designs Graphically, Communicating
Designs Orally and in Writing. Mathematical Modeling In Design, Prototyping and Proofing the Design. Design
Engineering Concepts:-Project-based Learning and Problem-based Learning in Design. Modular Design and
Life Cycle Design Approaches. Application of Biomimicry, Aesthetics and Ergonomics in Design. Value
Engineering, Concurrent Engineering, and Reverse Engineering in Design. Expediency, Economics and
Environment in Design Engineering:-Design for Production, Use, and Sustainability. Engineering Economics in
Design. Design Rights. Ethics in Design

COURSE CONTENT
Module-I ESE
COs Hrs.
Module Title Design Process Marks
Introduction to Design and Engineering Design.
What does it mean to design something? - How is engineering design different
from other kinds of design? - Where and when do engineers design? - What are
the basic vocabulary in engineering design? - How to learn and do engineering
design.
Defining a Design Process-: Detailing Customer Requirements. - How to do
engineering design? Illustrate the process with an example. How to identify the
customer requirements of design?
Defining a Design Process-: Setting Design Objectives, Identifying constraints, 1 5 20%
Establishing Functions. - How to finalize the design objectives? - How to identify
the design constraints? How to express the functions a design in engineering
terms?
Defining a Design Process:- Generating Design Alternatives and Choosing a
Design. - How to generate or create feasible design alternatives? - How to identify
the "best possible design”?
Case Studies:- Stages of Design Process. - Conduct exercises for designing
simple products going through the different stages of design process.
Module-II ESE
Cos Hrs.
Module Title Design Thinking Approach Marks
Introduction to Design Thinking - How does the design thinking approach help
engineers in creating innovative and efficient designs? 1 5 20%
Iterative Design Thinking Process Stages: Empathize, Define, Ideate, Prototype

288 | P a g e
B.Tech. in Computer Science and Engineering Third Semester

and Test. - How can the engineers arrive at better designs utilizing the iterative
design thinking process (in which knowledge acquired in the later stages can be
applied back to the earlier stages)?
Design Thinking as Divergent-Convergent Questioning. - Describe how to create a
number of possible designs and then how to refine and narrow down to the 'best
design'.
Design Thinking in a Team Environment. - How to perform design thinking as a
team managing the conflicts?
Case Studies: Design Thinking Approach. - Conduct exercises using the design
thinking approach for designing any simple products within a limited time and
budget
Module-III
ESE
Design Communication (Languages of Engineering COs Hrs.
Module Title Marks
Design)
Communicating Designs Graphically. - How do engineering sketches and
drawings convey designs?
Communicating Designs Orally and in Writing. - How can a design be
communicated tHrough oral presentation or technical reports efficiently?
Mathematical Modelling in Design. How do mathematics and physics become a
part of the design process? 2 5 20%
Prototyping and Proofing the Design. - How to predict whether the design will
function well or not?
Case Studies: Communicating Designs Graphically. - Conduct exercises for
design communication through detailed 2D or 3D drawings of simple products with
design detailing, material selection, scale drawings, dimensions, tolerances, etc.
Module-IV ESE
COs Hrs.
Module Title Design Engineering Concepts Marks
Project-based Learning and Problem-based Learning in Design. - How
engineering students can learn design engineering through projects? - How
students can take up problems to learn design engineering?
Modular Design and Life Cycle Design Approaches. - What is modular approach
in design engineering? - How it helps? - How the life cycle design approach
influences design decisions?
Application of Bio-mimicry, Aesthetics and Ergonomics in Design. - How do
aesthetics and ergonomics change engineering designs? - How do the intelligence
3 5 20%
in nature inspire engineering designs? - What are the common examples of bio-
mimicry in engineering?
Value Engineering, Concurrent Engineering, and Reverse Engineering in Design. -
How do concepts like value engineering, concurrent engineering and reverse
engineering influence engineering designs?
Case Studies: Bio-mimicry based Designs. - Conduct exercises to develop new
designs for simple products using bio-mimicry and train students to bring out new
nature inspired designs.
Module-V
ESE
Expediency, Economics and Environment in Design COs Hrs.
Module Title Marks
Engineering

289 | P a g e
B.Tech. in Computer Science and Engineering Third Semester

Design for Production, Use, and Sustainability. - How designs are finalized based
on the aspects of production methods, life span, reliability and environment?
Engineering Economics in Design. - How to estimate the cost of a particular
design and how will economics influence the engineering designs?
Design Rights. - What are design rights and how can an engineer put it into
4 4 20%
practice?
Ethics in Design. - How do ethics play a decisive role in engineering design?
Case Studies: Design for Production, Use, and Sustainability. - Conduct exercises
using simple products to show how designs change with constraints of production
methods, life span requirement, reliability issues and environmental factors.

TEXT BOOKS
YousefHaik, SangarappillaiSivaloganathan, Tamer M. Shahin, Engineering Design Process, Cengage
1
Learning 2003, Third Edition, ISBN-10: 9781305253285
2 Voland, G., Engineering by Design, Pearson India 2014, Second Edition, ISBN 9332535051.
REFERENCE BOOKS
Philip Kosky, Robert Balmer, William Keat, George Wise, Exploring Engineering, Fourth Edition: An
1
Introduction to Engineering and Design, Academic Press 2015, 4th Edition, ISBN: 9780128012420.
Clive L. Dym, Engineering Design: A Project-Based Introduction, John Wiley & Sons, New York 2009,
2
Fourth Edition, ISBN: 978-1-118-32458-5.
Nigel Cross, Design Thinking: Understanding How Designers Think and Work, Berg Publishers 2011,
3
First Edition, ISBN: 978-1847886361
Pahl, G., Beitz, W., Feldhusen, J., Grote, K.-H., Engineering Design: A Systematic Approach, Springer
4
2007, Third Edition, ISBN 978-1-84628-319-2

MODES OF EVALUATION SCORE WEIGHTAGE / SPLIT MARKS

Continuous Internal Evaluation 50
Internal Test - I 12.5
Internal Test - II 12.5
Assignments / Quiz / Seminars etc. 15
Attendance 10
End Semester Examination (ESE) 100
Total 150
End Semester Examination Pattern
There will be two parts; Part A and Part B.
Part A : 30 marks
part B : 70 marks
Part A contains 10 questions with 2 questions from each module, having 3 marks for each question. Students
should answer all questions. Part B contains 2 case study questions from each module of which student
should answer any one. Each question carry 14 marks and can have maximum 2 sub questions.

290 | P a g e
 B.Tech. in Computer Science and Engineering Third Semester

Total Pages:
Register No.: Name:

SAINTGITS COLLEGE OF ENGINEERING KOTTAYAM, KERALA

(AN AUTONOMOUS COLLEGE AFFILIATED TO
APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY, THIRUVANANTHAPURAM)

THIRD SEMESTER B.TECH. DEGREE EXAMINATION, MONTH AND YEAR

Course Code: 20EST200

Course Name: Design and Engineering
Max. Marks: 100 Duration: 3 Hours
Instructions to Candidates
Use only hand sketches

PART A
(Answer all questions, each question carries 3 marks)

Question CO BTL MARKS

1. Write about the basic design process. 1 2 3
2. Describe how to finalize the design objectives 1 2 3
3. State the role of divergent-convergent questioning in design thinking. 1 2 3
4. Discuss how to perform design thinking in a team managing the conflicts. 1 2 3
5. Show how engineering sketches and drawings convey designs. 2 2 3
Explain the role of mathematics and physics in design engineering
6. 2 2 3
process.
Distinguish between project-based learning and problem-based learning in
7. 3 2 3
design engineering.
Describe how concepts like value engineering, concurrent engineering and
8. 3 2 3
reverse engineering influence engineering designs?
Show how designs are varied based on the aspects of production
9. 4 2 3
methods, life span, reliability and environment.
10. Explain how economics influence the engineering designs? 4 2 3

PART B
(Answer any ONE question from each module. Each question carry 14 marks.)

MODULE I
Show the designing of a wristwatch going through the various stages of
11. 1 3 14
the design process. Use hand sketches to illustrate the processes.
OR
Find the customer requirements for designing a new car showroom. Show
12. how the design objectives were finalized considering the design 1 3 14
constraints.

291 | P a g e
 B.Tech. in Computer Science and Engineering Third Semester

MODULE II
Illustrate the design thinking approach for designing a bag for college
students within a limited budget. Describe each stage of the process and
13 1 4 14
the iterative procedure involved. Use hand sketches to support your
arguments.
OR
Construct a number of possible designs and then refine them to narrow
down to the best design for a drug trolley used in hospitals. Show how the
14. 1 4 14
divergent-convergent thinking helps in the process. Provide your rationale
for each step by using hand sketches only.
MODULE III
Graphically communicate the design of a thermo flask used to keep hot
15. coffee. Draw the detailed 2D drawings of the same with design detailing,
2 4 14
material selection, scale drawings, dimensions, tolerances, etc. Use only
hand sketches.
OR
Describe the role of mathematical modelling in design engineering. Show
16. how mathematics and physics play a role in designing a lifting mechanism
2 3 14
to raise 100 kg of weight to a floor at a height of 10 meters in a
construction site.
MODULE IV
Show the development of a nature inspired design for a solar powered bus
17. waiting shed beside a highway. Relate between natural and man-made 3 3 14
designs. Use hand sketches to support your arguments.
OR
Show the design of a simple sofa and then depict how the design changes
18. when considering 1) aesthetics and 2) ergonomics into consideration. 3 3 14
Give hand sketches and explanations to justify the changes in designs.
MODULE V
Examine the changes in the design of a footwear with constraints of 1)
production methods, 2) life span requirement, 3) reliability issues and 4)
19. environmental factors. 4 5 14
Use hand sketches and give proper rationalization for the changes in
design
OR
Describe the how to estimate the cost of a particular design using ANY of
the following:
i) a website, ii) the layout of a plant, iii) the elevation of a building, iv) an
20. 4 5 14
electrical or electronic system or device and v) a car.
Show how economics will influence the engineering designs. Use hand
sketches to support your arguments.

*********************

292 | P a g e
B.Tech. in Computer Science and Engineering Third Semester

COURSE DESCRIPTION
Course Code 20MCN201 Course Credit: P/F
Course Name Sustainable Engineering
L-T-J-P 2-0-0-0
Pre-requisite Nil
Year of Introduction 2020

COURSE OBJECTIVES
1 To have an increased awareness among students on issues in areas of sustainability
2 To understand the role of engineering within sustainable development
3 To understand the role of technology within sustainable development
To establish a clear understanding of the role and impact of various aspects of engineering and
4
engineering decisions on environmental, societal, and economic problems.

REVISED BLOOM’S
COURSE OUTCOMES (COs)
TAXONOMY LEVEL
At the end of the course students will be able to:
Understand the relevance and the concept of sustainability and the
CO1 3
global initiatives in this direction
Explain the different types of environmental pollution problems and
CO2 3
their sustainable solutions
CO3 Discuss the environmental regulations and standards 3
Outline the concepts related to conventional and non-conventional
CO4 3
energy
Demonstrate the broad perspective of sustainable practices by utilizing
CO5 3
engineering knowledge and principles

CO-PO MAPPING
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 - - - - - 2 3 - - - - 2
CO2 - - - - - 2 3 - - - - 2
CO3 - - - - - 2 3 - - - - 2
CO4 - - - - - 2 3 - - - - 2
CO5 - - - - - 2 3 - - - - 2
Correlation levels: 1- Low; 2-Medium; 3-High; No Correlation- “-”

CO-PSO MAPPING
CO1 CO2 CO3 CO4 CO5
PSO1 - - - - -
PSO2 1 2 - - 1
PSO3 - 1 2 - -
Correlation levels: 1- Low; 2-Medium; 3-High; No Correlation- “-”

293 | P a g e
B.Tech. in Computer Science and Engineering Third Semester

COURSE IMPLEMENTATION CLOCK (IN HOURS)

Course introduction with thorough briefing of Course Objectives and
1Hr
expected Course Outcomes
Course content delivery hours 24 Hrs
Internal Test
4Hr
(2 Assessment Tests of two-hour duration)
Total Instructional Hours 29 Hrs

SYLLABUS
Sustainability - Need and Concept - Technology and Sustainable Development - Natural Resources and their
Pollution - Carbon Credits - Zero Waste Concept - Life Cycle Analysis - Environmental Impact Assessment
studies - Sustainable Habitat - Green Buildings - Green Materials – Energy - Conventional and Renewable
Sources - Sustainable Urbanization - Industrial Ecology

COURSE CONTENT
Module-I ESE
COs Hrs.
Module Title Sustainability Marks
Introduction – Concept - Evolution of the concept - Social, Environmental and
Economic Sustainability concepts - Sustainable development - Nexus between
Technology and Sustainable development - Millennium Development Goals 1 5 20%
(MDGs) and Sustainable Development Goals (SDGs) - Clean Development
Mechanism (CDM).
Module-II COs Hrs. ESE
Module Title Environmental Pollution and Sustainable Solutions Marks
Environmental Pollution - Air Pollution and its effects - Water pollution and its
sources - Zero waste concept and 3 R concepts in solid waste management -
Greenhouse effect - Global warming - Climate change Ozone layer depletion - 2 5 20%
Carbon credits - Carbon Trading and Carbon Foot print - Legal provisions for
environmental protection.
Module-III COs Hrs. ESE
Module Title Environmental Management Tools and Strategies Marks
Environmental management standards - ISO 14001:2015 frame work and benefits
- Scope and goal of Life Cycle Analysis (LCA) - Circular economy - Bio-mimicking
3 5 20%
- Environment Impact Assessment (EIA) - Industrial ecology and industrial
symbiosis.
Module-IV ESE
COs Hrs
Module Title Resources and its Utilisation Marks
Basic concepts of Conventional and non-conventional energy - General idea
about solar energy - Fuel cells - Wind energy - Small hydro plants - Bio-fuels - 4 5 20%
Energy derived from oceans and Geothermal energy.
Module-V ESE
COs Hrs.
Module Title Sustainability Practices Marks
Basic concept of sustainable habitat - Methods for increasing energy efficiency in
buildings - Green Engineering - Sustainable Urbanisation - Sustainable cities - 5 4 20%
Sustainable transport.

294 | P a g e
B.Tech. in Computer Science and Engineering Third Semester

TEXT BOOKS
Swarnalatha & Binu Rajan, Introduction to Sustainable Engineering, Orbit Publishers, ISBN
1
9788193211212
K. Suresh , A Text Book of Sustainable Engineering, Chess Educational Publishers, ISBN
2
9788193167007
3 R.L. Rag, Introduction to Sustainable Engineering, PHI Learning, ISBN 9788120352636
4 K Roy Varghese, Sustainable Engineering, Pentex Book Publishers, ISBN 9789352541805
5 K Shibu , Introduction to Sustainable Engineering, PKC Books
S.S. Purohit, Green Technology - An approach for sustainable environment, Agrobios publication,
6
ISBN 9788177543438
REFERENCE BOOKS
D. T. Allen and D. R. Shonnard, Sustainability Engineering: Concepts, Design and Case Studies,
1
Prentice Hall
A.S. Bradley, A. O. Adebayo, P. Maria, Engineering applications in sustainable design and
2
development, Cengage learning
3 Environment Impact Assessment Guidelines, Notification of Government of India, 2006
4 K.M. Mackenthun, Basic Concepts in Environmental Management, Lewis Publication, London, 1998
ECBC Code 2007, Bureau of Energy Efficiency, New Delhi Bureau of Energy Efficiency Publications-
5
Rating System, TERI Publications - GRIHA Rating System
Ni bin Chang, Systems Analysis for Sustainable Engineering: Theory and Applications, McGraw-Hill
6
Professional.
7 J. W. Twidell, and A. D. Weir, Renewable Energy Resources, English Language Book Society (ELBS)

MODES OF EVALUATION SCORE WEIGHTAGE / SPLIT MARKS

Continuous Internal Evaluation 50
Internal Test - I 12.5
Internal Test - II 12.5
Assignments / Quiz / Seminars etc. 15
Attendance 10
End Semester Examination (ESE) 50
Total 100
End Semester Examination Pattern
There will be one part, Part A. Part A contain 5 questions with 1 questions from each module, having 10 marks
for each question. Students should answer all questions.

295 | P a g e
 B.Tech. in Computer Science and Engineering Third Semester

Total Pages:
Register No.: Name:

SAINTGITS COLLEGE OF ENGINEERING KOTTAYAM, KERALA

(AN AUTONOMOUS COLLEGE AFFILIATED TO
APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY, THIRUVANANTHAPURAM)

THIRD SEMESTER B.TECH. DEGREE EXAMINATION, MONTH AND YEAR

Course Code: 20MCN201

Course Name: Sustainable Engineering
Max. Marks: 50 Duration: 2 Hrs.

(Read the Stories/Cases/Data set as the case may be, and answer ALL questions. Each FULL question
carries 10 Marks)

Question CO BTL MARKS

1. In a number of districts of India, Coca Cola and its subsidiaries are
accused of creating severe water shortages for the community by
extracting large quantities of water for their factories, affecting both the
quantity and quality of water. Coca Cola has the largest soft drink bottling
facilities in India. Water is the primary component of the products
manufactured by the company. There have been numerous public
protests of The Coca-Cola Company‟s operations throughout India,
involving thousands of Indian citizens and several non-governmental
organizations. Protests against the Coco Cola factories have taken place
in a number of districts including: Kala Dera in Rajasthan; Thane in
Maharashtra, Sivaganga in Tamil Nadu and Plachimada in Kerala.
a Identify how this situation affects sustainability 1 3 3
b If you have been entrusted with taking permanent solution, what all
1 3 3
measure will you take?
c Being a protestant bring out sample slogans and key message to address. 1 3 4

296 | P a g e
B.Tech. in Computer Science and Engineering Third Semester

a Identify the least and most polluted Indian city from the above table. 2 3 2
b Arrange Indian cities in the decreasing order of pollution. 2 2 2
c List out any three effects of air pollution. 2 1 3
d List out any three methods to control air pollution. 2 1 3

a What does the figure represents? 3 3 1.5

b Give a brief explanation about the concept. 3 2 4
c Explain any three similar cases. 3 2 4.5
Comment on the statement, “Almost all energy that man uses comes from the
4 4 3 10
Sun”.
Discuss any three methods by which you can increase energy efficiency in
5 5 2 10
buildings.

*********************

297 | P a g e
B.Tech. in Computer Science and Engineering Third Semester

COURSE DESCRIPTION
Course Code 20CSL201 Course Credit: 2
Course Name Data Structures Lab
L-T-J-P 0-0-0-3
Pre-requisite 20EST102 Programming in C
Year of Introduction 2020

COURSE OBJECTIVES
To analyse the time and space complexities of programs using various data structures such as
1
Arrays, Linked list, Trees, Graphs etc.
2 To apply an efficient program to sort a list of records based on a given key in the record.
To apply given Data Structure to determine its space complexity and time complexity operations on
3
it.
4 To implement an efficient data structure to represent given data.
To apply time/space efficient program to convert an arithmetic expression from one notation to
5
another.
6 To apply a program using linked lists to simulate Memory Allocation and Garbage Collection.

REVISED BLOOM'S
COURSE OUTCOMES (COs)
TAXONOMY LEVEL
At the end of the course students will be able to:
Write a time/space efficient program using arrays/linked
CO1 lists/trees/graphs to provide necessary functionalities meeting a given
3
set of user requirements (Cognitive Knowledge Level: Analyse)
Write a time/space efficient program to sort a list of records based on a
CO2 3
given key in the record (Cognitive Knowledge Level: Apply)
Examine a given Data Structure to determine its space complexity and
CO3 time complexities of operations on it (Cognitive Knowledge Level:
3
Apply)
Design and implement an efficient data structure to represent given
CO4 3
data (Cognitive Knowledge Level: Apply)
Write a time/space efficient program to convert an arithmetic expression
CO5 3
from one notation to another (Cognitive Knowledge Level: Apply)
Write a program using linked lists to simulate Memory Allocation and
CO6 3
Garbage Collection (Cognitive Knowledge Level: Apply)
CO-PO MAPPING
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3 2 2 2 - 2 - 1 - 1 - 2
CO2 3 2 2 2 - - - 1 - 1 - 2
CO3 3 2 2 2 - - - 1 - 1 - 2
CO4 3 2 2 2 - - - 1 - 1 - 2
CO5 2 2 1 1 - - - 1 - 1 - 1
CO6 3 2 2 2 - - - 1 - 1 - 2
Correlation levels: 1- Low; 2-Medium; 3-High; No Correlation- “-”

298 | P a g e
B.Tech. in Computer Science and Engineering Third Semester

CO-PSO MAPPING
CO1 CO2 CO3 CO4 CO5 CO6
PSO1 3 3 3 3 2 3
PSO2 3 3 3 3 2 3
PSO3 1 - - - - -
Correlation levels: 1- Low; 2-Medium; 3-High; No Correlation- “-”

COURSE IMPLEMENTATION CLOCK (IN HOURS)

Course introduction with thorough briefing of Course Objectives and
1Hr
expected Course Outcomes
Course content delivery hours 24 Hrs
Internal Test 3Hrs
Total Instructional Hours 28 Hrs

COURSE CONTENT
List of Laboratory Experiments
COs Hours
( Minimum eight experiments are mandatory)
1 Implementation of Polynomials and Sparse matrices using arrays**. 1 2
Implementation of Stack , Queues, Priority Queues, DEQUEUE and
2 1 2
Circular Queues using arrays**.
Application problems using stacks: Conversion of expression from
3 5 2
one notation to another notation. **
4 Implementation of various linked list operations. ** 1 2
Representation of polynomials using linked list, addition and
5 3 2
multiplication of polynomials. **
Implementation of binary trees using linked lists and arrays-
6 4 2
creations, insertion, deletion and traversal. **
Implementation of sorting algorithms – bubble, insertion, selection,
7 2 2
quick, merge sort and heap sort.**
Implementation of searching algorithms – linear search, binary
8 4 2
search.**
9 Implementation of BFS and DFS for each graph representations.** 1 2
Implementation of hash table using your own mapping functions and
10 4 2
observe collisions and overflow resolving schemes.**
11 Simulation of first-fit, best-fit and worst-fit allocations 6 2
Simulation of a basic memory allocator and garbage collector using
12 6 2
doubly linked list.
** mandatory.

LABORATORY MANUAL

An internally prepared laboratory manual

299 | P a g e
B.Tech. in Computer Science and Engineering Third Semester

REFERENCE BOOKS
1 Ellis Horowitz, Sartaj Sahni and Susan Anderson-Freed, Universities Press, Fundamentals of Data
Structures in C
2 Richard F. Gilberg, BeHrouz A. Forouzan, Data Structures: A Pseudocode Approach with C, 2/e,
Cengage Learning.

MODES OF EVALUATION SCORE WEIGHTAGE / SPLIT MARKS

Continuous Internal Evaluation 75
Practical records/ outputs in regular class 20
Regular class viva voce 10
Final test 30
Attendance 15
End Semester Examination 75
Algorithm 30
Program 15
Output 15
Viva 15
Total 150

300 | P a g e
B.Tech. in Computer Science and Engineering Third Semester

COURSE DESCRIPTION
Course Code 20CSL203 Course Credit: 2
Course Name Object Oriented Programming Lab (In Java)
L-T-J-P 0-0-0-3
Pre-requisite 20EST102 Programming in C
Year of Introduction 2020

COURSE OBJECTIVES
1 Gain knowledge about basic Java language syntax and semantics to write Java programs and use
concepts such as variables, conditional and iterative execution methods etc.
2 Understand the fundamentals of object-oriented programming in Java, including defining classes,
objects, invoking methods etc.
3 Understand the principles of inheritance, packages and interfaces.
4 Understand the fundamentals of files, swings and exception handling mechanisms.

REVISED BLOOM’S
COURSE OUTCOMES (COs)
TAXONOMY LEVEL
At the end of the course students will be able to:
CO1 Implement the Object Oriented concepts - constructors, inheritance, 3
method overloading & overriding and polymorphism in Java
CO2 Implement programs in Java which use data types, operators, control 3
statements, built in packages & interfaces, Input/Output streams and
Files
CO3 Implement robust application programs in Java using exception 3
handling
CO4 Implement application programs in Java using multitHreading and 3
database connectivity
CO5 Implement Graphical User Interface based application programs by 3
utilizing event handling features and Swing in Java

CO-PO MAPPING
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3 3 3 3 3 - 2 - 2 - 1 3
CO2 3 3 3 3 3 - 2 - 2 - 1 3
CO3 3 3 3 3 3 - 2 - 2 - 1 3
CO4 3 3 3 3 3 - 2 - 2 - 1 3
CO5 3 3 3 3 3 - 2 - 2 - 1 3
Correlation levels: 1- Low; 2-Medium; 3-High; No Correlation- “-”

CO-PSO MAPPING
CO1 CO2 CO3 CO4 CO5
PSO1 2 2 2 2 2
PSO2 3 3 3 3 3
PSO3 - - - - -
Correlation levels: 1- Low; 2-Medium; 3-High; No Correlation- “-”

COURSE IMPLEMENTATION CLOCK (IN HOURS)

301 | P a g e
B.Tech. in Computer Science and Engineering Third Semester

Course introduction with thorough briefing of Course Objectives and

1Hr
expected Course Outcomes
Course content delivery hours 24 Hrs
Internal Test 3Hrs
Total Instructional Hours 28 Hrs

COURSE CONTENT
List of Laboratory Experiments COs Hours
(Minimum eight experiments are mandatory)
Write a Java Program to find the frequency of a given character in a
1 1 1
string.
2 Write a Java program to multiply two given matrices. 1 1
Write a Java program which creates a class named 'Employee'
having the following members: Name, Age, Phone number, Address,
Salary. It also has a method named 'print Salary( )' which prints the
salary of the Employee. Two classes 'Officer' and 'Manager' inherits
3 the 'Employee' class. The 'Officer' and 'Manager' classes have data
members 'specialization' and 'department' respectively. Now, assign 1
name, age, phone number, address and salary to an officer and a 2
manager by making an object of both of these classes and print the
same. (Exercise to understand inheritance).
Write a java program to create an abstract class named Shape that
contains an empty method named number of sides ( ). Provide three
classes named Rectangle, Triangle and Hexagon such that each one
4 of the classes extends the class Shape. Each one of the classes
contains only the method number_Of_Sides ( ) that shows the
1 2
number of sides in the given geometrical structures. (Exercise to
understand polymorphism).
Write a Java program that read from a file and write to file by
5 2 2
handling all file related exceptions.
Write a Java program that reads a line of integers, and then displays
each integer, and the sum of all the integers (Use String Tokenizer
6 2 2
class of java.util).
Write a Java program that shows the usage of try, catch, tHrows and
7 3 2
finally.
8 Write a Java program that shows thread synchronization. 4 2
Write a Java program that works as a simple calculator. Arrange
Buttons for digits and the + - * % operations properly. Add a text field
9 to display the result. Handle any possible exceptions like divide by 5 2
zero. Use Java Swing.
Write a Java program that simulates a traffic light. The program lets
the user select one of three lights: red, yellow, or green. When a
5 3
10 radio button is selected, the light is turned on, and only one light can
be on at a time. No light is on when the program starts.
Write a Java program for the following:
1) Create a doubly linked list of elements.
11 1 3
2) Delete a given element from the above list.
3) Display the contents of the list after deletion
Write a Java program that implements Quick sort algorithm for
12 1 2
sorting a list of names in ascending order.

302 | P a g e
B.Tech. in Computer Science and Engineering Third Semester

LABORATORY MANUAL

An internally prepared laboratory manual.

REFERENCE BOOKS
1 Herbert Schildt, Java: The Complete Reference, 8/e, Tata McGraw Hill, 2011.
2 Balagurusamy E., Programming JAVA a Primer, 5/e, McGraw Hill, 2014.

MODES OF EVALUATION SCORE WEIGHTAGE / SPLIT MARKS

Continuous Internal Evaluation 75
Practical records/ outputs in regular class 20
Regular class viva voce 10
Final test 30
Attendance 15
End Semester Examination 75
Algorithm 30
Program 15
Output 15
Viva 15
Total 150

303 | P a g e
SAINTGITS COLLEGE OF ENGINEERING (AUTONOMOUS)
B.Tech Syllabus 2020 – Computer Science and Engineering

Semester - IV

322 | P a g e
B.Tech. in Computer Science and Engineering Fourth Semester

COURSE DESCRIPTION
Course Code 20MAT206 Course Credit: 4
Course Name Graph Theory
L-T-J-P 3-1-0-0
Pre-requisite 20MAT203 Discrete Mathematical Structures
Year of Introduction 2020

COURSE OBJECTIVES
1 Students will be able to understand and prove theorems and relevant results in graph theory
2 Students will be able to apply theoretical knowledge acquired to solve realistic problems in real life.
3 Students will be able to improve the proof writing skills.
4 Students will be able to model real world problems using graph theory

REVISED BLOOM’S
COURSE OUTCOMES (COs)
TAXONOMY LEVEL
At the end of the course students will be able to:
Explain vertices and their properties, types of paths, classification of 2
CO1
graphs and trees & their properties.
Demonstrate the fundamental theorems on Eulerian and 2
CO2
Hamiltonian graphs.
Illustrate the working of Prim‟s and Kruskal‟s algorithms for finding
minimum cost spanning tree and Dijkstra‟s and Floyd-Warshall 3
CO3
algorithms for finding shortest paths
Explain planar graphs, their properties and an application for planar 3
CO4
graphs.
Explain the Vertex color problem in graphs and illustrate an example 3
CO5
application for vertex coloring

CO-PO MAPPING
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3 3 2 - - - - - - 1 - 1
CO2 3 3 2 - - - - - - 1 - 1
CO3 3 3 2 - - - - - - 1 - 1
CO4 3 3 2 - - - - - - 1 - 1
CO5 3 3 2 - - - - - - 1 - 1
Correlation levels: 1- Low; 2-Medium; 3-High; No Correlation- “-”

CO-PSO MAPPING
CO1 CO2 CO3 CO4 CO5
PSO1 1 - - 2 -
PSO2 - 2 3 - 2
PSO3 - - - - -
Correlation levels: 1- Low; 2-Medium; 3-High; No Correlation- “-”

323 | P a g e
B.Tech. in Computer Science and Engineering Fourth Semester

COURSE IMPLEMENTATION CLOCK (IN HOURS)

Course introduction with thorough briefing of Course Objectives and
1Hr
expected Course Outcomes
Course content delivery hours 48Hrs
Internal Test
4 Hrs.
(2 Assessment Tests of two-hour duration)
Total Instructional Hours 53 Hrs

SYLLABUS
Finite and infinite graphs- bipartite graphs- Paths and circuits, Isomorphism, Sub graphs, walks- Connected
graphs, Disconnected graphs and components- Euler graphs- Hamiltonian paths and circuits- Directed graphs-
Trees – properties- Rooted and binary tree, Counting trees, Spanning trees, Fundamental circuits- Vertex
Connectivity, Edge Connectivity, Cut set and Cut Vertices- Planar graphs- Matrix representation of graphs-
Adjacency matrix, Incidence Matrix, Circuit Matrix, Path Matrix- Colouring- chromatic number, Chromatic
polynomial- Four colour problem and five colour problem.

COURSE CONTENT
Module-I ESE
CO(s) Hrs.
Module Title Introduction to Graphs Marks
Introduction- Basic definition – Application of graphs – finite and
infinite graphs, bipartite graphs,
Incidence and Degree – Isolated vertex, pendent vertex and Null graph
Paths and circuits, Isomorphism, Sub graphs, walks 1 9 20%
Paths and circuits
Connected graphs, Disconnected graphs and components
Module-II ESE
COs Hrs.
Module Title Eulerian and Hamiltonian graphs Marks
Euler graphs, Operations on graphs
Hamiltonian paths and circuits
Travelling salesman problem 2 10 20%
Directed graphs – types of digraphs, Digraphs and binary relation, Directed paths
Fleury‟s algorithm
Module-III ESE
COs Hrs.
Module Title Trees and Graph Algorithms Marks
Trees – properties
pendent vertex, Distance and centres in a tree
Rooted and binary tree, Counting trees, Spanning trees, Fundamental circuits 3 11 20%
Prim‟s algorithm, Kruskal‟s algorithm
Dijkstra‟s shortest path algorithm, Floyd-Warshall shortest path algorithm
Module-IV ESE
COs Hrs
Module Title Connectivity and planer graph Marks
Vertex Connectivity, Edge Connectivity, Cut set and Cut Vertices
Fundamental circuits
Planar graphs 4 9 20%
Kuratowski‟s theorem, Different representations of planar graphs, Euler's theorem,
Geometric dual
Module-V ESE
COs Hrs.
Module Title Graph Representations and Vertex Colouring Marks
Matrix representation of graphs- Adjacency matrix, Incidence Matrix, Circuit

324 | P a g e
B.Tech. in Computer Science and Engineering Fourth Semester

Matrix, Path Matrix

Colouring- chromatic number, chromatic polynomial 5 9 20%
Matching, Covering
Four colour problem and five colour problem,
Greedy colouring algorithm.

TEXT BOOKS
1 Narsingh Deo, Graph theory, PHI,1979
2 Douglas B. West, Introduction to Graph Theory, Prentice Hall India Ltd.,2001
3 Robin J. Wilson, Introduction to Graph Theory, Longman Group Ltd.,2010
REFERENCE BOOKS
R. Diestel, Graph Theory, free online edition, 2016: diestel-graph-theory.com/
1
basic.html.
2 J.A. Bondy and U.S.R. Murty. Graph theory with Applications

3 R Balakrishnan and K Ranganathan, A text book of Graph theory, Springer

4 Frank Harary, Graph Theory, Narosa Publishing House (2001)

5 John Clark, Derek Allan Holton, A first look at Graph Theory, World Scientific

MODES OF EVALUATION SCORE WEIGHTAGE / SPLIT MARKS

Continuous Internal Evaluation 50
Internal Test - I 12.5
Internal Test - II 12.5
Assignments / Quiz / Seminars etc. 15
Attendance 10
End Semester Examination (ESE) 100
Total 150
End Semester Examination Pattern
There will be two parts; Part A and Part B.
Part A contains 10 questions with 2 questions from each module, having 3 marks for each question. Students
should answer all questions. Part B contains 2 questions from each module of which student should answer
anyone. Each question can have maximum 2 sub-divisions and carries 14 marks.

325 | P a g e
 B.Tech. in Computer Science and Engineering Fourth Semester

Total Pages:
Register No.: Name:

SAINTGITS COLLEGE OF ENGINEERING KOTTAYAM, KERALA

(AN AUTONOMOUS COLLEGE AFFILIATED TO
APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY, THIRUVANANTHAPURAM)

FOURTH SEMESTER B.TECH. DEGREE EXAMINATION, MONTH AND YEAR

Course Code: 20MAT206

Course Name: Graph Theory
Max. Marks: 100 Duration: 3 Hrs

PART A
(Answer all questions)

Question CO BTL MARKS

1. Construct a simple graph of 12 vertices with two of them having degree 1, 1 3 3
three having degree 3 and the remaining seven having degree 10.
2. What is the largest number of vertices in a graph with 35 edges, if all 1 2 3
vertices are of degree at least 3 ?
3. Define a Euler graph. Give an example of Eulerian graph which is not 2 2 3
Hamiltonian
4. Give an example of a strongly connected simple digraph without a directed 2 3 3
Hamiltonian path.
5. What is the sum of the degrees of any tree of n vertices? 3 2 3
6 Define spanning tree with an example 3 1 3
7 Show that in a simple connected planar graph G having V-vertices, E- 4 2 3
edges, and no triangles
8 Define Planer Graph with an example 4 1 3
Consider the circuit matrix Band incidence matrix A of a simple connected
9 graph whose columns are arranged using the same order of edges. Prove 5 2 3
that every row of B is orthogonal to every row of A?
A graph is critical if the removal of any one of its vertices (and the edges
10 adjacent to that vertex) results in a graph with a lower chromatic number. 5 2 3
Show that Kn is critical for all n > 1.

PART B
(Answer any one Question from each module. Each question carries 14 Marks)

MODULE I
a) Prove that for any simple graph with at least two vertices has two
1 1 6
vertices of the same degree.
11.
b) Prove that in a complete graph with n vertices there are (n-1)/2 edge
1 2 8
disjoint Hamiltonian circuits and n >= 3
OR

326 | P a g e
 B.Tech. in Computer Science and Engineering Fourth Semester

Is it possible to construct a graph with 12 vertices such that two of

a) the vertices have degree 3 and the remaining vertices have degree
1 3 6
12 4? Justify
b) Prove that a simple graph with n vertices and k components can
1 2 8
have atmost (n-k) (n-k+1)/2 edges
MODULE II
Let S be a set of 5 elements. Construct a graph G whose vertices are
subsets of S of size 2 and two such subsets are adjacent in G if they
a) are disjoint.
i. Draw the graph G.
ii. How many edges must be added to G in order for G to have a 2 3 8
13.
Hamiltonian cycle?
Let G be a graph with exactly two connected components, both being
b) Eulerian. What is the minimum number of edges that need to be
2 2 6
added to G to obtain an Eulerian graph?
OR
a) Show that a k-connected graph with no Hamiltonian cycle has an
2 2 8
independent set of size k + 1.
i. Let G be a graph that has exactly two connected components, both
14. b) being Hamiltonian graphs. Find the minimum number of edges that
one needs to add to G to obtain a Hamiltonian graph.
ii. For which values of n the graph Qn (hyper-cube on n vertices) is 2 3 6
Eulerian.
MODULE III
a) A tree T has at least one vertex v of degree 4, and at least one vertex
3 2 6
15 w of degree 3. Prove that T has at least 5 leaves.
b) Explain Floyd Warshall algorithm. 3 1 8
OR
a) Define pendent vertices in a binary tree? Prove that the number of
3 2 6
16 pendent vertices in a binary tree with n vertices is (n+1)/2.
b) Prove that a tree with n vertices has n-1 edges. 3 2 8
MODULE IV
i. State and prove Euler's Theorem relating the number of faces,
a) edges and vertices for a planar graph.
ii. If G is a 5-regular simple graph and |V| = 10, prove that G is non- 4 2 8
17.
planar.
b) Let G be a connected graph and e an edge of G. Show that e is a
4 2 6
cut-edge if and only if e belongs to every spanning tree.
OR
a) Define edge connectivity, vertex connectivity and separable graphs.
4 1 8
Give an example for each.
18.
b) Let G be a connected graph and e an edge of G. Show that e
4 2 6
belongs to a loop if and only if e belongs to no spanning tree.
MODULE V
a) Define the circuit matrix B(G) of a connected graph G with n vertices
5 2 8
and e edges with an example. Prove that the rank of B(G) is e-n+1
19. b) Give the definition of the chromatic polynomial PG(k). Directly from
the definition, prove that the chromatic polynomials of Wn and Cn 5 2 6
satisfy the identity PWn(k) = k PCn-1 (k – 1).
OR

327 | P a g e
 B.Tech. in Computer Science and Engineering Fourth Semester

Define the incidence matrix of a graph G with an example. Prove that

a) the rank of an incidence matrix of a connected graph with n vertices 5 2 8
is n-1.
20.
A graph G has chromatic polynomial PG(k) = k4-4k3+5k2-2k. How
b) many vertices and edges does G have? Is G bipartite? Justify your 5 3 6
answers.

*********************

328 | P a g e
B.Tech. in Computer Science and Engineering Fourth Semester

COURSE DESCRIPTION
Course Code 20CST202 Course Credit: 4
Course Name Computer Organization and Architecture
L-T-J-P 3-1-0-0
Pre-requisite 20CST203 Logic System Design
Year of Introduction 2020

COURSE OBJECTIVES
1 To impart an understanding of the internal organization and operations of a computer.
2 To introduce the concepts of processor logic design and control logic design.
3 To impart an understanding of how data is organised in memory module and mapping in a
computer.
4 To impart knowledge about the basic instructions that can be used for problem solving .

REVISED BLOOM’S
COURSE OUTCOMES (COs)
TAXONOMY LEVEL
At the end of the course students will be able to:
CO1 Recognize and express the relevance of basic components, I/O 1
organization and pipelining schemes in a digital computer
CO2 Explain the types of memory systems and mapping functions used in 1
memory systems
CO3 Demonstrate the control signals required for the execution of a given 3
instruction
CO4 Illustrate the design of Arithmetic Logic Unit and explain the usage of 3
registers in it
CO5 Explain the implementation aspects of arithmetic algorithms in a digital 3
computer
CO6 Develop the control logic for a given arithmetic problem 4

CO-PO MAPPING
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 1 1 - - - - - - - - - 1
CO2 1 2 - - 1 - - - - - - 1
CO3 1 1 1 - 1 - - - - - - 1
CO4 1 1 - - 1 - - - - - 1 1
CO5 1 1 - - - - - - - - - 1
CO6 1 1 - 1 - - - - - - - 1
Correlation levels: 1- Low; 2-Medium; 3-High; No Correlation- “-”

CO-PSO MAPPING
CO1 CO2 CO3 CO4 CO5 CO6
PSO1 1 2 1 1 - 1
PSO2 - - - - - 2
PSO3 - 1 1 - 1 -
Correlation levels: 1- Low; 2-Medium; 3-High; No Correlation- “-”

329 | P a g e
B.Tech. in Computer Science and Engineering Fourth Semester

COURSE IMPLEMENTATION CLOCK (IN HOURS)

Course introduction with thorough briefing of Course Objectives and
1 Hr
expected Course Outcomes
Course content delivery hours 48 Hrs
Internal Test
4 Hrs.
(2 Assessment Tests of two-hour duration)
Total Instructional Hours 53 Hrs

SYLLABUS
Fundamental building blocks and functional units of a computer. Execution phases of an instruction. Arithmetic
Algorithms. Design of the processing unit – how arithmetic and logic operations are performed. Design of the
control unit – hardwired and micro programmed control. I/O organisation – interrupts, DMA, different interface
standards. Memory Subsystem – different types

COURSE CONTENT
Module-I ESE
CO(s) Hrs.
Module Title Basic Structure of computers Marks
Functional units –basic operational concepts –bus structures –software.
Memory locations and addresses – memory operations
Instructions and instruction sequencing – addressing modes –Basic Processing
unit 1,3 9 20%
Instruction cycle – execution of a complete instruction - single bus and multiple
bus organization
Module-II COs Hrs. ESE
Module Title Register transfer logic and Processor logic design Marks
Inter register transfer – arithmetic, logic and shift micro operations.
Processor organization – Arithmetic logic unit
Design of arithmetic circuit - design of logic circuit - Design of arithmetic logic unit 4 11 20%
Status register – design of shifter - processor unit – design of accumulator.
Module-III COs Hrs. ESE
Module Title Arithmetic algorithms and Pipelining Marks
Algorithms for multiplication and division (restoring method) of binary numbers
Array multiplier - Booth‟s multiplication algorithm
Pipelining- Basic principles 5 10 20%
Classification of pipeline processors- instruction and arithmetic
pipelines (Design examples not required)
Hazard detection and resolution
Module-IV ESE
COs Hrs
Module Title Control Logic Design Marks
Control organization – Hard_wired control-micro program control
Control of processor unit - Microprogram sequencer 6 9 20%
Microprogrammed CPU organization - horizontal and vertical microinstructions.
Module-V ESE
COs Hrs.
Module Title I/O organization and Memory system Marks
Accessing of I/O devices – interrupts
Interrupt hardware -Direct memory access
Memory system-basic concepts – semiconductor RAMs 2 9 20%

330 | P a g e
B.Tech. in Computer Science and Engineering Fourth Semester

Memory system considerations – ROMs - Content addressable memory

Cache memories - mapping functions

TEXT BOOKS
1 Hamacher C., Z. Vranesic and S. Zaky, Computer Organization, 5/e, McGraw Hill, 2011.
2 Mano M. M., Digital Logic & Computer Design, 4/e, Pearson Education, 2013.
Patterson D.A. and J. L. Hennessey, Computer Organization and Design, 5/e, Morgan Kauffmann
3
Publishers, 2013.
REFERENCE BOOKS
William Stallings, Computer Organization and Architecture: Designing for Performance, Pearson, 9/e,
1
2013.
2 Chaudhuri P., Computer Organization and Design, 2/e, Prentice Hall, 2008

3 KaiHwang, Faye Alye Briggs, Computer architecture and parallel processing McGrawHill, 1984

4 Messmer H. P., The Indispensable PC Hardware Book, 4/e, Addison-Wesley, 2001

MODES OF EVALUATION SCORE WEIGHTAGE / SPLIT MARKS

Continuous Internal Evaluation 50
Internal Test - I 12.5
Internal Test - II 12.5
Assignments / Quiz / Seminars etc. 15
Attendance 10
End Semester Examination (ESE) 100
Total 150
End Semester Examination Pattern
There will be two parts; Part A and Part B.
Part A contains 10 questions with 2 questions from each module, having 3 marks for each question. Students
should answer all questions. Part B contains 2 questions from each module of which a student should answer
any one. Each question can have maximum 2 sub-divisions and carries 14 marks.

331 | P a g e
 B.Tech. in Computer Science and Engineering Fourth Semester

Total Pages: 2
Register No.: Name:

SAINTGITS COLLEGE OF ENGINEERING KOTTAYAM, KERALA

(AN AUTONOMOUS COLLEGE AFFILIATED TO
APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY, THIRUVANANTHAPURAM)

FOURTH SEMESTER B.TECH. DEGREE EXAMINATION, APRIL AND 2022

Course Code: 20CST202

Course Name: Computer Organization and Architecture
Max. Marks: 100 Duration: 3 Hrs

PART A
(Answer all Questions. Each question carries 3 Marks)

Question CO BTL MARKS

1. Give the significance of instruction cycle 3 1 3
Distinguish between big endian and little endian notations. Also give the 1 3 3
2.
significance of these notations.
3. Compare I/O mapped I/O and memory mapped I/O 3 2 3
4. Give the importance of interrupts in I/O interconnection. 1 1 3
5. Justify the significance of status register. 6 3 3
6 How does the arithmetic circuitry perform logical operations in an ALU. 4 1 3
7 Illustrate divide overflow with an example. 5 3 3
8 Write notes on arithmetic pipeline. 5 1 3
9 Briefly explain the role of micro program sequence. 6 1 3
10 Differentiate between horizontal and vertical micro instructions 6 2 3

PART B

(Answer any one Question from each module. Each question carries 14 Marks)

MODULE I
a) Write the control sequence for the instruction DIV R1,[R2] in a three
1 3 10
bus structure
6.
b) What is the significance of addressing modes in computer
3 1 4
architecture
OR

7. Explain the concept of a single bus organization with help of a diagram.

3 3 14
Write the control sequence for the instruction ADD [R1],[R2].
MODULE II
8. Explain various register transfer logics. 4 1 14
OR

332 | P a g e
 B.Tech. in Computer Science and Engineering Fourth Semester

Design a 4 bit combinational logic shifter with 2 control signals H1

and H2 that perform the following operations (bit values given in
a) parenthesis are the values of control variable H1 and H2
9. respectively.) : Transfer of 0‟s to S (00), shift right (01), shift left (10), 4 4 5
no shift (11).
b) Design an ALU unit which will perform arithmetic and logic operation
4 3 9
with a given binary adder
MODULE III
a) Give the logic used behind Booth‟s multiplication algorithm 5 2 4
10. b) Identify the appropriate algorithm available inside the system to
perform the multiplication between -14 and -9. Also trace the 5 4 10
algorithm for the above input
OR
a) List and explain the different pipeline hazards and their possible
11. 5 1 4
solutions
b) Design a combinational circuit for 3x2 multiplication. 5 4 10
MODULE IV
Design a hardwared control unit used to perform addition/subtraction of 2
12. 6 3 14
numbers represented in sign magnitude form
OR
Give the structure of the micro program sequencer and its role in
13. 6 2 14
sequencing the micro instructions
MODULE V
a) Explain the various mapping functions available in cache memory. 2 1 9
14.
b) Briefly explain content addressable memory 2 1 5
OR
a) Explain the different ways in which interrupt priority schemes can be
2 1 9
15. implemented
b) Give the structure of SRAM cell. 2 2 5

*********************

333 | P a g e
B.Tech. in Computer Science and Engineering Fourth Semester

COURSE DESCRIPTION
Course Code 20CST204 Course Credit: 4
Course Name Database Management Systems
L-T-J-P 3-1-0-0
Pre-requisite 20CST201 Data Structures, 20EST102 Programming in C
Year of Introduction 2020

COURSE OBJECTIVES
1 To impart the basic understanding of the theory and applications of database management systems.
2 To give basic level understanding of internals of database systems.
3 To understand and use data manipulation language to query, update, and manage a database.
4 To expose to some of the recent trends in databases.

REVISED BLOOM’S
COURSE OUTCOMES (COs)
TAXONOMY LEVEL
At the end of the course students will be able to:
Summarize and exemplify fundamental nature and characteristics of
CO1 2
database systems
Model real world scenarios given as informal descriptions, using
CO2 3
Entity Relationship diagrams.
Model and design solutions for efficiently representing and querying
CO3 4
data using relational model
Demonstrate the features of indexing and hashing in database
CO4 3
applications
Discuss and compare the aspects of Concurrency Control and
CO5 3
Recovery in Database systems
CO6 Explain various types of NoSQL databases 2

CO-PO MAPPING
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3 3 3 - - - - - - - - 3
CO2 3 3 3 3 - - - - - - - 3
CO3 3 3 3 3 - - - - - - - 3
CO4 3 3 3 - - - - - - 3 - 3
CO5 3 2 3 - - - - - - 2 - 2
CO6 3 2 3 - 2 - - - - 2 - 2
Correlation levels: 1- Low; 2-Medium; 3-High; No Correlation- “-”

CO-PSO MAPPING
CO1 CO2 CO3 CO4 CO5 CO6
PSO1 2 3 3 3 3 3
PSO2 2 2 2 2 2 2
PSO3 - - - - - -
Correlation levels: 1- Low; 2-Medium; 3-High; No Correlation- “-”

334 | P a g e
B.Tech. in Computer Science and Engineering Fourth Semester

COURSE IMPLEMENTATION CLOCK (IN HOURS)

Course introduction with thorough briefing of Course Objectives and
1Hr
expected Course Outcomes
Course content delivery hours 48Hrs
Internal Test
4 Hrs.
(2 Assessment Tests of two-hour duration)
Total Instructional Hours 53Hrs

SYLLABUS
This course provides a clear understanding of fundamental principles of Database Management Systems
(DBMS) with special focus on relational databases to the learners. The topics covered in this course are basic
concepts of DBMS, Entity Relationship (ER) model, Relational Database principles, Relational Algebra,
Structured Query Language (SQL), Physical Data Organization, Normalization and Transaction Processing
Concepts. The course also gives a glimpse of the alternative data management model, NoSQL. This course
helps the learners to manage data efficiently by identifying suitable structures to maintain data assets of
organizations and to develop applications that utilize database technologies.

COURSE CONTENT
Module-I ESE
CO(s) Hrs.
Module Title Introduction & Entity Relationship (ER) Model Marks
Concept & Overview of Database Management Systems (DBMS) - Characteristics
of Database system, Database Users, structured, semi-structured and
unstructured data. Data Models and Schema - Three Schema architecture.
Database Languages, Database architectures and classification. 1, 2 9 20%
ER model - Basic concepts, entity set & attributes, notations, Relationships and
constraints, cardinality, participation, notations, weak entities, relationships of
degree 3.
Module-II ESE
COs Hrs.
Module Title Relational Model Marks
Structure of Relational Databases - Integrity Constraints, Synthesizing ER
diagram to relational schema
Introduction to Relational Algebra - select, project, cartesian product operations, 3 10 20%
join - Equi-join, natural join. query examples, introduction to Structured Query
Language (SQL), Data Definition Language (DDL), Table definitions and
operations – CREATE, DROP, ALTER, INSERT, DELETE, UPDATE.
Module-III
ESE
Module Title SQL DML (Data Manipulation Language), Physical Data COs Hrs.
Marks
Organization
SQL DML (Data Manipulation Language) - SQL queries on single and multiple
tables, Nested queries (correlated and non-correlated), Aggregation and grouping,
Views, assertions, Triggers, SQL data types.
Physical Data Organization - Review of terms: physical and logical records, 3, 4 9 20%
blocking factor, pinned and unpinned organization. Heap files, Indexing, Single
level indices, numerical examples, Multi-level-indices, numerical examples, B-
Trees and B+-Trees (structure only, algorithms not required), Extendible Hashing,
Indexing on multiple keys – grid files.
Module-IV COs Hrs. ESE

335 | P a g e
B.Tech. in Computer Science and Engineering Fourth Semester

Module Title Normalization Marks

Different anomalies in designing a database, The idea of normalization, Functional
dependency, Armstrong‟s Axioms (proofs not required), Closures and their
computation, Equivalence of Functional Dependencies (FD), Minimal Cover
(proofs not required). First Normal Form (1NF), Second Normal Form (2NF), Third 3 10 20%
Normal Form (3NF), Boyce Codd Normal Form (BCNF), Lossless join and
dependency preserving decomposition, Algorithms for checking Lossless Join (LJ)
and Dependency Preserving (DP) properties.

Module-V ESE
COs Hrs.
Module Title Transactions, Concurrency and Recovery, Recent Topics Marks
Transaction Processing Concepts - overview of concurrency control, Transaction
Model, Significance of concurrency Control & Recovery, Transaction States,
System Log, Desirable Properties of transactions.

Serial schedules, Concurrent and Serializable Schedules, Conflict equivalence

and conflict serializability, Recoverable and cascade-less schedules, Locking,
Two-phase locking and its variations. Log-based recovery, Deferred database 5, 6 10 20%
modification, check-pointing.

Introduction to NoSQL Databases, Main characteristics of Key-value DB

(examples from: Redis), Document DB (examples from: MongoDB)

Main characteristics of Column - Family DB (examples from: Cassandra) and

Graph DB (examples from : ArangoDB)

TEXT BOOKS
Elmasri R. and S. Navathe, Database Systems: Models, Languages, Design and Application
1
Programming, Pearson Education, 2013.
2 Silberschatz A., H. F. Korth and S. Sudarshan, Database System Concepts, 6/e, McGraw Hill, 2011
REFERENCE BOOKS
1 Adam Fowler, NoSQL for Dummies, John Wiley & Sons, 2015
NoSQL Data Models: Trends and Challenges (Computer Engineering: Databases and Big Data),
2
Wiley, 2018
3 Web Resource: https://www.w3resource.com/redis/

4 web Resource: https://www.w3schools.in/category/mongodb/

5 Web Resource: https://www.tutorialspoint.com/cassandra/cassandra_introduction.htm

6 Web Resource : https://www.tutorialspoint.com/arangodb/index.htm

336 | P a g e
B.Tech. in Computer Science and Engineering Fourth Semester

MODES OF EVALUATION SCORE WEIGHTAGE / SPLIT MARKS

Continuous Internal Evaluation 50
Internal Test - I 12.5
Internal Test - II 12.5
Assignments / Quiz / Seminars etc. 15
Attendance 10
End Semester Examination (ESE) 100
Total 150
End Semester Examination Pattern
There will be two parts; Part A and Part B. Part A contains 10 questions with 2 questions from each module,
having 3 marks for each question. Students should answer all questions. Part B contains 2 questions from
each module of which a student should answer any one. Each question can have maximum 2 sub-divisions
and carries 14 marks.

337 | P a g e
 B.Tech. in Computer Science and Engineering Fourth Semester

Total Pages: 4
Register No.: Name:

SAINTGITS COLLEGE OF ENGINEERING KOTTAYAM, KERALA

(AN AUTONOMOUS COLLEGE AFFILIATED TO
APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY, THIRUVANANTHAPURAM)

FOURTH SEMESTER B.TECH. DEGREE EXAMINATION, MONTH AND YEAR

Course Code: 20CST204

Course Name: Database Management Systems
Max. Marks: 100 Duration: 3 Hours

PART A

(Answer all Questions. Each question carries 3 Marks)

Question CO BTL MARKS

1. List out any three salient features of a database systems. 1 2 3
2. When is multi-valued composite attribute used in ER modelling? 2 3 3
3. For the SQL query, SELECT A, B FROM R WHERE B=‟apple‟ AND C =
„orange‟ on the table R(A, B, C, D), where A is a key, write any two 3 3 3
equivalent relational algebra expressions.
4. Outline the concept of theta-join. 3 2 3
5. How is the purpose of where clause is different from that of having clause? 3 2 3
6 What is the use of a trigger? 3 2 3
7 When do you say that a relation is not in 1NF? 3 2 3
8 Given the FDs P→Q, P→R, QR→S, Q→T, QR→U, PR→U, write the 3
sequence of Armstrong‟s Axioms needed to arrive at a. P → T b. PR → S 3 3
9 What is meant by the lost update problem? 5 1 3
10 What is meant by check pointing? 5 1 3

PART B

(Answer any one Question from each module. Each question carries 14 Marks)

MODULE I
Design an ER diagram for the following scenario: There is a set of
a) teams, each team has an ID (unique identifier), name, main stadium,
and to which city this team belongs. Each team has many players,
and each player belongs to one team. Each player has a number
11.
(unique identifier), name, DoB, start year, and shirt number that he
uses. Teams play matches, in each match there is a host team and a
guest team. The match takes place in the stadium of the host team.
For each match we need to keep track of the following: The date on

338 | P a g e
 B.Tech. in Computer Science and Engineering Fourth Semester

which the game is played The final result of the match. The players 2 3 14
participated in the match. For each player, how many goals he
scored, whether or not he took yellow card, and whether or not he
took red card. During the match, one player may substitute another
player. We want to capture this substitution and the time at which it
took place. Each match has exactly three referees. For each referee
we have an ID (unique identifier), name, DoB, years of experience.
One referee is the main referee and the other two are assistant
referee.
OR
Interpret the the following ER diagram.

a) 2 3 8
12.

b) Distinguish between physical data independence and logical data

4 3 6
independence with suitable examples.
MODULE II
EMPLOYEE(ENO, NAME, ADDRESS, DOB, AGE, GENDER,
SALARY, DNUM, SUPERENO)
DEPARTMENT(DNO, DNAME, DLOCATION, DPHONE, MGRENO)
PROJECT(PNO, PNAME, PLOCATION, PCOST, CDNO)

DNUM is a foreign key that identifies the department to which an

employee belongs. MGRENO is a foreign key identifying the
employee who manages the department. CDNO is a foreign key
13. identifying the department that controls the project. SUPERENO is a
foreign key identifying the supervisor of each employee.
a)
Write relational algebra expressions for the following queries:-
3 3 14
(a) Names of female employees whose salary is more than 20000.
(b) Salaries of employee from „Accounts‟ department
(c) Names of employees along with his/her supervisor's name (d) For
each employee return name of the employee along with his
department name and the names of projects in which he/she works
(e) Names of employees working in all the departments
OR
Write SQL DDL statements for the the following (Assume suitable
14.
domain types):

339 | P a g e
 B.Tech. in Computer Science and Engineering Fourth Semester

i) Create the tables STUDENT (ROLLNO, NAME, CLASS,

SEM, ADVISER), FACULTY(FID, NAME, SALARY, DEPT). Assume 3 3 10
that ADVISER is a foreign key referring FACULTY table.
a) ii. Delete department with name „CS‟ and all employees of the
department.
iii. Increment salary of every faculty by 10%.
b) Illustrate foreign key constraint with a typical example. 3 3 4
MODULE III
For the relation schema below, give an expression in SQL for each of the
queries that follows:

employee(employee-name, street, city)

works(employee-name, company-name, salary), company(company-
name, city)
manages(employee-name, manager-name)

15. a) Find the names, street address, and cities of residence for all 3 3 14
employees who work for the Company „RIL Inc.' and earn more than
$10,000. b) Find the names of all employees who live in the same cities as
the companies for which they work. c) Find the names of all employees
who do not work for „KYS Inc.‟. Assume that all people work for exactly
one company. d) Find the names of all employees who earn more than
every employee of „SB Corporation'. Assume that all people work for at
most one company. e) List out number of employees company-wise in the
decreasing order of number of employees.
OR
Consider an EMPLOYEE file with 10000 records where each record
is of size 80 bytes. The file is sorted on employee number (15 bytes
long), which is the primary key. Assuming unspanned organization
and block size of 512 bytes compute the number of block accesses
a) 4 3 9
needed for selecting records based on employee number if,
16. i. No index is used
ii. Single level primary index is used
iii. Multi-level primary index is used
Assume a block pointer size of 6 bytes.
b) Illustrate correlated and non-correlated nested queries with real
3 3 5
examples.
MODULE IV

a) Illustrate 3NF and BCNF with suitable real examples. 3 3 6

. Given a relation R(A1,A2,A3,A4,A5) with functional dependencies
17. b) 3 4 8
A1→A2A4 and A4→A5, check if the decomposition R1(A1,A2,A3),
R2(A1,A4), R3(A2,A4,A5) is lossless.
OR
Consider the un-normalized relation R(A, B, C, D, E, F, G) with the
18. a) 3 4 7
FDs A→B , AC→G, AD→EF, EF→G, CDE→AB. Trace the

340 | P a g e
 B.Tech. in Computer Science and Engineering Fourth Semester

normalization process to reach 3NF relations.

b) Illustrate Lossless Join Decomposition and Dependency Preserving
3 3 7
Decomposition with typical examples.
MODULE V

a) Discuss the four ACID properties and their importance. 5 2 7

Determine if the following schedule is conflict serializable. Is the
schedule recoverable? Is the schedule cascade-less? Justify your
answers.
19. b) 5 3 7
r1(X), r2(Z), r1(Z), r3(X), r3(Y ), w1(X), c1, w3(Y), c3, r2(Y), w2(Z),
w2(Y), c2
(Note: ri(X)/wi(X) means transaction Ti issues read/write on item X; ci
means transaction Ti commits.)
OR

a) Discuss the main characteristics of Key-value DB and Graph DB. 6 2 7

Illustrate two-phase locking with a schedule containing three
20. b) transactions. Argue that 2PL ensures serializability. Also argue that 5 3 7
2Pl can lead to deadlock.

341 | P a g e
B.Tech. in Computer Science and Engineering Fourth Semester

COURSE DESCRIPTION
Course Code 20CST206 Course Credit: 4
Course Name Operating Systems
L-T-J-P 3-1-0-0
Pre-requisite 20CST201 Data Structures, 20EST102 Programming in C
Year of Introduction 2020

COURSE OBJECTIVES
1 To understand the services provided by and the design of an operating system.
2 To understand the structure and organization of the file system.
3 To understand what a process is and how processes are synchronized and scheduled.
4 To understand different approaches to memory management.

REVISED BLOOM’S
COURSE OUTCOMES (COs)
TAXONOMY LEVEL
At the end of the course students will be able to:
CO1 Explain the relevance, structure and functions of Operating Systems 2
in computing devices.
CO2 Illustrate the concepts of process management and process 2
scheduling mechanisms employed in Operating Systems.
Explain process synchronization in Operating Systems and illustrate
CO3 process synchronization mechanisms using Mutex Locks, 2
Semaphores and Monitors
CO4 Explain any one method for detection, prevention, avoidance and 2
recovery for managing deadlocks in Operating Systems.
CO5 Explain the memory management algorithms in Operating Systems. 2
CO6 Explain the security aspects and algorithms for file and storage 2
management in Operating Systems.

CO-PO MAPPING
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3 2 2 - - - - - - 2 - 2
CO2 2 2 2 2 - - - - - 2 - 2
CO3 1 2 2 2 - - - - - 2 - 2
CO4 3 2 2 2 - - - - - 2 - 2
CO5 2 2 2 2 - - - - - 2 - 2
CO6 3 2 2 2 - - - - - 2 - 2
Correlation levels: 1- Low; 2-Medium; 3-High; No Correlation- “-”

CO-PSO MAPPING
CO1 CO2 CO3 CO4 CO5 CO6
PSO1 2 - 1 1 1 2
PSO2 2 2 2 2 2 2
PSO3 2 - - - - -
Correlation levels: 1- Low; 2-Medium; 3-High; No Correlation- “-”

342 | P a g e
B.Tech. in Computer Science and Engineering Fourth Semester

COURSE IMPLEMENTATION CLOCK (IN HOURS)

Course introduction with thorough briefing of Course Objectives and
1Hr
expected Course Outcomes
Course content delivery hours 48 Hrs
Internal Test
4 Hrs.
(2 Assessment Tests of two-hour duration)
Total Instructional Hours 53 Hrs

SYLLABUS
Operating system overview – Operations, Functions, Service – System calls, Types – Operating System structure -
Simple structure, Layered approach, Microkernel, Modules – System boot process. Process states, Process control
block, threads, scheduling, Operations on processes - process creation and termination – Inter-process
communication - shared memory systems, Message passing systems. Process Scheduling – Basic concepts-
Scheduling criteria -scheduling algorithms- First come First Served, Shortest Job Firs, Priority scheduling, Round
robin scheduling. Race conditions – Critical section problem – Peterson‟s solution, Synchronization hardware, Mutex
Locks, Semaphores, Monitors – Synchronization problems - Producer Consumer, Dining Philosophers and Readers-
Writers. Deadlocks: Necessary conditions, Resource allocation graphs, Deadlock prevention, Deadlock avoidance –
Banker‟s algorithms, Deadlock detection, Recovery from deadlock. Memory Management: Concept of address
spaces, Swapping, Contiguous memory allocation, fixed and variable partitions, Segmentation, Paging. Virtual
memory, Demand paging, Page replacement algorithms.

COURSE CONTENT
Module-I
COs Hrs. ESE Marks
Module Title Introduction
Operating system overview – Operations, Functions, Service
System calls, Types
Operating System structure - Simple structure, Layered approach, Microkernel, 1 8 20%
Modules
System boot process.
Module-II ESE
COs Hrs.
Module Title Processes and Process Scheduling Marks
Process states
Process control block, threads
Scheduling
Operations on processes: process creation and termination
Inter-process communication: Shared memory systems, Message Passing 2 10 20%
Process Scheduling – Basic concepts, Scheduling Criteria
Scheduling algorithms – Basics
First come First Served, Shortest Job First
Priority scheduling, Round Robin Scheduling
Module-III
COs Hrs. ESE Marks
Module Title Process synchronization and Dead locks
Process synchronization, Race conditions
Critical Section problem, Peterson‟s solution
Synchronization hardware, Mutex Locks
Semaphores, Monitors
3 10 20%
Synchronization problem examples
Deadlocks: Necessary conditions, Resource Allocation Graphs
Deadlock prevention, Deadlock avoidance
Banker‟s algorithm

343 | P a g e
B.Tech. in Computer Science and Engineering Fourth Semester

Deadlock detection, Deadlock recovery

Module-IV
COs Hrs. ESE Marks
Module Title Memory Management
Memory Management: Concept of Address spaces
Swapping
Contiguous memory allocation, fixed and variable partitions
Segmentation.
Paging (Lecture 1) 4 10 20%
Paging (Lecture 2)
Virtual memory, Demand Paging
Page replacement algorithms (Lecture 1)
Page replacement algorithms (Lecture 2) - Belady‟s Anomaly
Module-V
COs Hrs. ESE Marks
Module Title File and Disk management
File concept, Attributes, Operations, types, structure
Access methods
Protection
File-System implementation
Directory implementation 5,6 10 20%
Allocation methods
Magnetic disks, Solid-state disks, Disk structure
Disk scheduling
Disk formatting

TEXT BOOKS
Abraham Silberschatz, Peter Baer Galvin, Greg Gagne, ' Operating System Concepts' 9th
1
Edition, Wiley India 2015.
2 Andrew S Tanenbaum, “Modern Operating Systems” , 4th Edition, Prentice Hall, 2015.
3 William Stallings, “Operating systems”, 6th Edition, Pearson, Global Edition, 2015.
REFERENCE BOOKS
Garry Nutt, Nabendu Chaki, Sarmistha Neogy, “Operating Systems”, 3rd Edition, Pearson
1
Education.
2 D.M.Dhamdhere, “Operating Systems”, 2nd Edition, Tata McGraw Hill, 2011.
3 Sibsankar Haldar, Alex A Aravind, “Operating Systems”, Pearson Education.
4 Eric S. Raymond, "The Art of UNIX Programming", Addison-Wesley, ISBN 0-13-142901-9, 525 pp
5 Operating Systems: Principles and Practice, Second Edition, 2014, by Anderson and Dahlin

MODES OF EVALUATION SCORE WEIGHTAGE / SPLIT MARKS

Continuous Internal Evaluation 50
Internal Test - I 12.5
Internal Test - II 12.5
Assignments / Quiz / Seminars etc. 15
Attendance 10
End Semester Examination (ESE) 100
Total 150
End Semester Examination Pattern
There will be two parts: Part A and Part B. Part A contain 10 questions with two questions from each module, having
3 marks for each question. Students should answer all questions. Part B contains two questions from each module of
which student should answer any one. Each question can have maximum 2 sub-divisions and carry 14 marks.

344 | P a g e
 B.Tech. in Computer Science and Engineering Fourth Semester

Total Pages:
Register No.: Name:

SAINTGITS COLLEGE OF ENGINEERING KOTTAYAM, KERALA

(AN AUTONOMOUS COLLEGE AFFILIATED TO
APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY, THIRUVANANTHAPURAM)

FOURTH SEMESTER B.TECH. DEGREE EXAMINATION, MONTH AND YEAR

Course Code: 20CST206

Course Name: Operating Systems
Max. Marks: 100 Duration: 3 Hours

PART A
(Answer all Questions. Each Question carries 3 Marks)

Question CO BTL MARKS

1. How does hardware find the Operating System kernel after system switch-on? 1 1 3
2. What is the purpose of system call in operating system? 1 1 3
3. Why is context switching considered as an overhead to the system? 2 1 3
4. How is inter process communication implement using shared memory? 2 2 3
5. Describe resource allocation graph for the following. 3 1 3
a) with a deadlock b) with a cycle but no deadlock.
6. What is critical section? What requirement should be satisfied by a solution to the 3 1 3
critical section problem?
7. Consider the reference string 1, 2, 3, 4, 2, 1, 5, 6, 2, 1, 2, 3, 7, 6, 3, 2, 1, 2, 3, 6. 4 3 3
How many page faults occur while using FCFS for the following cases.
a) frame=2 b) frame=3
8. Differentiate between internal and external fragmentations. 4 1 3
9. Compare sequential access and direct access methods of storage devices. 5 2 3
10. Define the terms (i) Disk bandwidth (ii) Seek time. 5 1 3

PART B
(Answer any one full question from each module)

MODULE I
a) Compare functional and imperative programming languages. 1 2 7
11. b) Under what circumstances would a user be better of using a time-sharing
1 2 7
system than a PC or a single user workstation?
OR
What is the main advantage of the micro kernel approach to system design?
a) How do user program and system program interact in a microkernel 1 2 7
12.
architecture?
b) Describe the differences between symmetric and asymmetric 1 2 7

345 | P a g e
 B.Tech. in Computer Science and Engineering Fourth Semester

multiprocessing? What are the advantages and disadvantages of

multiprocessor systems?
MODULE II
a) Define process. With the help of a neat diagram explain different states of
2 1 7
13. process.
b) Explain how a new process can be created in Unix using fork system call. 2 1 7
OR
a) Find the average waiting time and average turnaround time for the processes
given in the table below using:-
i) SRT scheduling algorithm ii) Priority scheduling algorithm
Process Arrival Time (ms) CPU Burst Time (ms) Priority
2 3 7
P1 0 5 3
14.
P2 2 4 1
P3 3 1 2
P4 5 2 4
b) What is a Process Control Block? Explain the fields used in a Process
2 2 7
Control Block.
MODULE III
Consider a system with five processes P0 tHrough P4 and tHree resources
of type A, B, C. Resource type A has 10 instances, B has 5 instances and C
has 7 instances. Suppose at time t0 following snapshot of the system has
been taken:
i) What will be the content of the Need matrix? Is the system in a safe state?
If Yes, then what is the safe sequence?
iii)What will happen if process P1 requests one additional instance of
15. resource type A and two instances of resource type C? 3 3 14
Process Allocation Max Available
ABC ABC ABC
P0 010 753 ABC
P1 200 322 332
P2 302 902
P3 211 222
P4 002 433
OR
a) State dining philosopher‟s problem and give a solution using semaphores. 3 1 7
16. b) What do you mean by binary semaphore and counting semaphore? With C
3 1 7
struct, explain implementation of wait () and signal ().
MODULE IV
Consider the following page reference string 1, 2, 3, 4, 2, 1, 5, 6, 2, 1, 2, 3, 7,
6, 3, 2, 1, 2, 3, 6. Find out the number of page faults if there are 4 page
17. a) 4 3 7
frames, using the following page replacement algorithms i) LRU ii) FIFO iii)
Optimal
b) Explain the steps involved in handling a page fault. 4 1 7
OR
18. a) With a diagram, explain how paging is done with TLB. 4 1 7

346 | P a g e
 B.Tech. in Computer Science and Engineering Fourth Semester

Memory partitions of sizes 100 kb, 500 kb, 200 kb, 300 kb, 600 kb are
available, howwould best, worst and first fit algorithms place processes of
b) 4 3 7
size 212 kb, 417 kb, 112 kb,426 kb in order. Rank the algorithms in terms of
how efficiently they use memory.
MODULE V
Suppose that a disk drive has 5000 cylinders, numbered 0 to 4999. the drive
currentlyservices a request at cylinder 143, and the previous request was at
cylinder 125. the queueof pending request in FIFO order is 86, 1470, 913,
1774, 948, 1509, 1022, 1750, 130.Starting from the current position, what is 5 3 7
19. a)
the total distance (in cylinders) that the disk armmoves to satisfy all pending
requests for each of the following algorithms
i) FCFS ii) SSFT iii) SCAN iv) LOOK v) C-SCAN
b) What is the use of access matrix in protection mechanism? 6 1 7
OR
a) Explain the different file allocation operations with advantages and
5 1 7
20. disadvantages.
b) Explain the following i) file types ii) file operation iii) file attributes 5,6 1 7

*********************

347 | P a g e
B.Tech. in Computer Science and Engineering Fourth Semester

COURSE DESCRIPTION
Course Code 20HUT200 Course Credit: 2
Course Name Professional Ethics
L-T-J-P 2-0-0-0
Pre-requisite NIL
Year of Introduction 2020

COURSE OBJECTIVES
1 To enable students to create awareness on ethics
2 To enable students to create awareness on human values

REVISED BLOOM’S
COURSE OUTCOMES (COs)
TAXONOMY LEVEL
At the end of the course students will be able to:
CO1 Understand the core values that shape the ethical behaviour of a 2
professional.
CO2 Adopt a good character and follow an ethical life. 2
CO3 Explain the role and responsibility in technological development by 3
keeping personal ethics and legal ethics.
CO4 Solve moral and ethical problems through exploration and 3
assessment by established experiments.
CO5 Apply the knowledge of human values and social values to 3
contemporary ethical values and global issues.

CO-PO MAPPING
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 - - - - - - - 2 - - 2 -
CO2 - - - - - - - 2 - - 2 -
CO3 - - - - - - - 3 - - 2 -
CO4 - - - - - - - 3 - - 2 -
CO5 - - - - - - - 3 - - 2 -
Correlation levels: 1- Low; 2-Medium; 3-High; No Correlation- “-”

CO-PSO MAPPING
CO1 CO2 CO3 CO4 CO5
PSO1 - - 1 - -
PSO2 - - - - -
PSO3 3 3 3 3 3
Correlation levels: 1- Low; 2-Medium; 3-High; No Correlation- “-”

348 | P a g e
B.Tech. in Computer Science and Engineering Fourth Semester

COURSE IMPLEMENTATION CLOCK (IN HOURS)

Course introduction with thorough briefing of Course Objectives and
1Hr
expected Course Outcomes
Course content delivery hours 24 Hrs
Internal Test
4 Hrs.
(2 Assessment Tests of two-hour duration)
Total Instructional Hours 29 Hrs

SYLLABUS
Human Values.- Engineering Ethics and Professionalism.- Engineering as social Experimentation -
Responsibilities and Rights- Global Ethical Issues.

COURSE CONTENT
Module-I ESE
CO(s) Hrs.
Module Title Human Values Marks
Morals, values and Ethics, Integrity, Academic Integrity, Work Ethics
Service Learning, Civic Virtue, Respect for others, Living peacefully
1 5 20%
Caring and Sharing, Honesty, Courage, Co-operation commitment
Empathy, Self Confidence, Social Expectations
Module-II ESE
COs Hrs.
Module Title Engineering Ethics and Professionalism Marks
Senses of Engineering Ethics, Variety of moral issues, Types of inquiry
Moral dilemmas, Moral Autonomy, Kohlberg‟s theory
Gilligan‟s theory, Consensus and Controversy, Profession & Professionalism, 2 5 20%
Models of professional roles, Theories about right action
Self interest-Customs and Religion, Uses of Ethical Theories
Module-III ESE
COs Hrs.
Module Title Engineering as Social Experimentation Marks
Engineering as Experimentation, Engineers as responsible Experimenters
Codes of Ethics, Plagiarism, A balanced outlook on law 3 5 20%
Challenger case study, Bhopal gas tragedy
Module-IV ESE
COs Hrs.
Module Title Responsibilities and Rights Marks
Collegiality and loyalty, Managing conflict, Respect for authority
Collective bargaining, Confidentiality, Role of confidentiality in moral integrity,
4 5 20%
Conflicts of interest
Occupational crime, Professional rights, Employee right, IPR, Discrimination
Module-V ESE
COs Hrs.
Module Title Global Ethical Issues Marks
Multinational Corporations, Environmental Ethics, Business Ethics, Computer
Ethics 20%
Role in Technological Development, Moral leadership 5 4
Engineers as Managers, Consulting Engineers, Engineers as Expert witnesses
and advisors

TEXT BOOKS
M Govindarajan, S Natarajan and V S Senthil Kumar, Engineering Ethics, PHI Learning Private Ltd,
1
New Delhi,2012.
2 R S Naagarazan, A text book on professional ethics and human values, New age international

349 | P a g e
B.Tech. in Computer Science and Engineering Fourth Semester

(P) limited ,New Delhi,2006.

REFERENCE BOOKS
Mike W Martin and Roland Schinzinger, Ethics in Engineering,4th edition, Tata McGraw Hill Publishing
1
Company Pvt Ltd, New Delhi,2014.
Charles D Fleddermann, Engineering Ethics, Pearson Education/ Prentice Hall of India, New
2
Jersey,2004.
Charles E Harris, Michael S Protchard and Michael J Rabins, Engineering Ethics- Concepts and
3
cases, Wadsworth Thompson Learning, United states,2005.
4 http://www.slideword.org/slidestag.aspx/human-values-and-Professional-ethics.

MODES OF EVALUATION SCORE WEIGHTAGE / SPLIT MARKS

Continuous Internal Evaluation 50
Internal Test – I 12.5
Internal Test – II 12.5
Assignments / Quiz / Seminars etc. 15
Attendance 10
End Semester Examination (ESE) 100
Total 150
End Semester Examination Pattern
There will be two parts; Part A and Part B.
Part A contains 10 questions with 2 questions from each module, having 3 marks for each question. Students
should answer all questions. Part B contains 2 questions from each module of which student should answer
any one. Each question can have maximum 2 sub-divisions and carry 14 marks.

350 | P a g e
 B.Tech. in Computer Science and Engineering Fourth Semester

Total Pages:
Register No.: Name:

SAINTGITS COLLEGE OF ENGINEERING KOTTAYAM, KERALA

(AN AUTONOMOUS COLLEGE AFFILIATED TO
APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY, THIRUVANANTHAPURAM)

FOURTH SEMESTER B.TECH. DEGREE EXAMINATION, MONTH AND YEAR

Course Code: 20HUT200

Course Name: Professional Ethics
Max. Marks: 100 Duration: 3 Hrs.

PART A
(Answer all questions, each question carries 3 marks)

Question CO BTL MARKS

1. Define empathy and honesty. 1 1 3
2. Briefly explain about morals, values and ethics. 1 2 3
3. Interpret the two forms of self-respect. 1 3 3
4. List out the models of professional roles. 2 2 3
5. Indicate the advantages of using standards. 2 2 3
6 Point out the conditions required to define a valid consent. 3 2 3
7 Identify the conflicts of interests with an example. 4 3 3
8 Recall confidentiality. 4 2 3
9 Conclude the features of biometric ethics. 4 3 3
10 Name any three professional societies and their role relevant to engineers. 5 2 3

PART B
(Answer one full question from each module, each question carries 14 marks)

MODULE I
a) Classify the relationship between ethical values and law? 1 2 7
11.
b) Compare between caring and sharing. 1 2 7
OR
a) Exemplify a comprehensive review about integrity and respect for
1 2 7
12. others.
b) Discuss about co-operation and commitment. 1 2 7
MODULE II
a) Explain the three main levels of moral developments, deviced by
2 3 7
13. Kohlberg.
b) Differentiate moral codes and optimal codes. 2 3 7
OR
14. a) Extrapolate the duty ethics and right ethics. 2 3 7

351 | P a g e
 B.Tech. in Computer Science and Engineering Fourth Semester

b) Discuss in detail the three types of inquiries in engineering ethics 2 3 7

MODULE III
a) Summarize the following features of morally responsible engineers.
15. 3 3 7
(i) Moral autonomy (ii) Accountability
b) Explain the rights of employees 3 3 7
OR
16. a) Explain the reasons for Chernobyl mishap ? 3 3 7
b) Describe the methods to improve collegiality and loyalty. 3 3 7
MODULE IV
a) Execute collegiality with respect to commitment, respect and
4 3 7
17. connectedness.
b) Identify conflicts of interests with an example. 4 3 7
OR
a) Explain in detail about professional rights and employee rights. 4 3 7
18.
b) Exemplify engineers as managers. 4 3 7
MODULE V
a) Evaluate the technology transfer and appropriate technology. 5 3 7
19.
b) Explain about computer and internet ethics. 5 3 7
OR
a) Investigate the causes and effects of acid rain with a case study. 5 3 7
20.
b) Conclude the features of ecocentric and biocentric ethics. 5 3 7

*********************

352 | P a g e
B.Tech. in Computer Science and Engineering Fourth Semester

COURSE DESCRIPTION
Course Code 20MCN202 Course Credit: P/F
Course Name Constitution of India
L-T-J-P 2-0-0-0
Pre-requisite Nil
Year of Introduction 2020

COURSE OBJECTIVES
1 The study of their own country constitution and studying the importance environment as well as
understanding their own human rights help the students to concentrate on their day to day discipline.
2 It also gives the knowledge and strength to face the society and people.

REVISED BLOOM’S
COURSE OUTCOMES (COs)
TAXONOMY LEVEL
At the end of the course students will be able to:
Explain the background of the present constitution of India and
CO1 2
features.
CO2 Utilize the fundamental rights and duties. 2
Understand the working of the union executive, parliament and
CO3 3
judiciary.
Understand the working of the state executive, legislature and
CO4 3
judiciary.
CO5 Utilize the special provisions and statutory institutions. 3
Show national and patriotic spirit as responsible citizens of the
CO6 2
country

CO-PO MAPPING
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 - - - - - 2 2 2 - 2 - -
CO2 - - - - - 3 3 3 - 3 - -
CO3 - - - - - 3 2 3 - 3 - -
CO4 - - - - - 3 2 3 - 3 - -
CO5 - - - - - 3 2 3 - 3 - -
Correlation levels: 1- Low; 2-Medium; 3-High; No Correlation- “-”

CO-PSO MAPPING
CO1 CO2 CO3 CO4 CO5
PSO1 - - - - -
PSO2 - - - - -
PSO3 1 1 1 1 1
Correlation levels: 1- Low; 2-Medium; 3-High; No Correlation- “-”

353 | P a g e
B.Tech. in Computer Science and Engineering Fourth Semester

COURSE IMPLEMENTATION CLOCK (IN HOURS)

Course introduction with thorough briefing of Course Objectives and
1Hr
expected Course Outcomes
Course content delivery hours 24 Hrs
Internal Test 4 Hrs.
(2 Assessment Tests of two-hour duration)
Total Instructional Hours 29 Hrs

SYLLABUS
Definition, historical back ground, features, preamble, territory, citizenship - State, fundamental rights, directive
principles, duties.-The machinery of the union government - Government machinery in the states - The federal
system, Statutory Institutions, miscellaneous provisions.

COURSE CONTENT
Module-I ESE
COs Hrs.
Module Title Constitution Marks
Definition of constitution, historical background, salient features of the constitution
Preamble of the constitution, union and its territory. 1 5 20%
Meaning of citizenship, types, termination of citizenship.
Module-II ESE
COs Hrs.
Module Title Fundamental Rights Marks
Definition of state, fundamental rights, general nature, classification, right to
equality ,right to freedom , right against Exploitation
Right to freedom of religion, cultural and educational rights, right 2 5 20%
to constitutional remedies. Protection in respect of conviction for offences.
Directive principles of state policy, classification of directives, fundamental duties.
Module-III ESE
COs Hrs.
Module Title Parliament Marks
The Union executive, the President, the vice President, the council of
ministers, the Prime minister, Attorney-General, functions.
The parliament, composition, Rajya sabha, Lok sabha, qualification and 3 5 20%
disqualification of membership, functions of parliament.
Union judiciary, the supreme court, jurisdiction, appeal by special leave.
Module-IV ESE
COs Hrs
Module Title State Legislature Marks
The State executive, the Governor, the council of ministers, the Chief minister,
advocate general, union Territories.
The State Legislature, composition, qualification and disqualification of 4 5 20%
membership, functions.
The state judiciary, the high court, jurisdiction, writs jurisdiction.
Module-V ESE
COs Hrs.
Module Title Union and States Marks
Relations between the Union and the States, legislative relation, administrative
relation, financial Relations, Inter State council, finance commission.
Emergency provision, freedom of trade commerce and inter course, comptroller
and auditor general of India, public Services, public service commission, 5 4 20%
administrative Tribunals.
Official language, elections, special provisions relating to certain classes,
amendment of the Constitution.

354 | P a g e
B.Tech. in Computer Science and Engineering Fourth Semester

TEXT BOOKS
D D Basu, Introduction to the constitution of India, Lexis Nexis, New Delhi, 24e, 2019 2 PM Bhakshi, The
constitution of India, Universal Law, 14e, 2017
REFERENCE BOOKS
Ministry of law and justice, The constitution of India, Govt of India, New Delhi, 2019. 2 JN Pandey, The
constitutional law of India, Central Law agency, Allahabad, 51e, 2019 3 MV Pylee, India‟s Constitution, S
Chand and company, New Delhi, 16e, 2016

MODES OF EVALUATION SCORE WEIGHTAGE / SPLIT MARKS

Continuous Internal Evaluation 50
Internal Test - I 12.5
Internal Test - II 12.5
Assignments / Quiz / Seminars etc. 15
Attendance 10
End Semester Examination (ESE) 50
Total 100
End Semester Examination Pattern
There will be two parts; Part A and Part B.
Part A contain 5 questions with 1 question from each module, having 3 marks for each question. Students
should answer all questions. Part B contains 2 questions from each module of which student should answer
any one. Each question can have maximum 2 sub-divisions and carry 7marks.

355 | P a g e
 B.Tech. in Computer Science and Engineering Fourth Semester

Total Pages:
Register No.: Name:

SAINTGITS COLLEGE OF ENGINEERING KOTTAYAM, KERALA

(AN AUTONOMOUS COLLEGE AFFILIATED TO
APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY, THIRUVANANTHAPURAM)

FOURTH SEMESTER B.TECH. DEGREE EXAMINATION, MONTH AND YEAR

Course Code: 20MCN202

Course Name: Constitution of India
Max. Marks: 50 Duration: 2 Hrs

PART A
(Answer all questions, each question carries 3 marks)

Question CO BTL MARKS

1. Define and explain the term constitution. 1 2 3
2 What is directive principle of state policy? 2 2 3
3 List the functions of Attorney general of India. 5 2 3
4 List the qualifications of Governor. 4 2 3
5 Explain the powers of public service commission. 5 2 3

PART B
(Answer one full question from each module, each question carries 7 marks)

MODULE I
6. Discuss the various methods of acquiring Indian citizenship. 1 2 7
OR
7. Examine the salient features of the Indian constitution. 1 2 7
MODULE II
A high court passes a judgement against X. X desires to file a writ petition in the
8. supreme court under Art32, on the ground that the judgement violates his fundamental 3 3 7
rights. Advise him whether he can do so.
OR
9. What is meant by directive principles of State policy? List the directives. 2 3 7
MODULE III
10. Describe the procedure of election and removal of the President of India.
3 3 7
OR
11. Supreme court may in its discretion grant special leave to appeal. Examine the
3 3 7
situation.
MODULE IV
12. Discuss the powers of Governor. 4 3 7
OR

356 | P a g e
 B.Tech. in Computer Science and Engineering Fourth Semester

X filed a writ petition under Art 226, which was dismissed. Subsequently, he filed a writ
petition under Art 32 of the constitution, seeking the same remedy. The Government
13. 3 3 7
argued that the writ petition should be dismissed, on the ground of res judicata.
Decide.
MODULE V
14. Examine the scope of the financial relations between the union and the states. 5 3 7
OR
15. Discuss the effects of proclamation of emergency. 5 3 7

*********************

357 | P a g e
B.Tech. in Computer Science and Engineering Fourth Semester

COURSE DESCRIPTION
Course Code 20CSL202 Course Credit: 2
Course Name Digital Lab
L-T-J-P 0-0-0-3
Pre-requisite 20CST203 Logic System Design
Year of Introduction 2020

COURSE OBJECTIVES
1 Learners to get familiarized with Digital Logic Design through the implementation of Logic Circuits
using ICs of basic logic gates & flip flops.
2 Learners to get familiarized with Hardware Description Language based Digital Design.
3 Learners to design hardware systems in areas such as games, music, digital filters, wireless
communications and graphical displays.
4 Learners to implement hardware systems in various application areas.

REVISED BLOOM’S
COURSE OUTCOMES (COs)
TAXONOMY LEVEL
At the end of the course students will be able to:
CO1 Design and implement combinational logic circuits using Logic Gates. 3
CO2 Design and implement sequential logic circuits using Integrated 3
Circuits.
CO3 Simulate functioning of digital circuits using programs written in a 3
Hardware Description Language.
CO4 Function effectively as an individual and in a team to accomplish a 3
given task of designing and implementing digital circuits.

CO-PO MAPPING
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3 3 3 2 - - - 1 - - - 3
CO2 3 3 3 2 - - - 1 - - - 3
CO3 3 3 3 2 2 - - 1 - - - 3
CO4 3 3 3 2 - - - 1 3 - - 3
Correlation levels: 1- Low; 2-Medium; 3-High; No Correlation- “-”

CO-PSO MAPPING
CO1 CO2 CO3 CO4
PSO1 - - - -
PSO2 2 2 2 2
PSO3 - - - -
Correlation levels: 1- Low; 2-Medium; 3-High; No Correlation- “-”

358 | P a g e
B.Tech. in Computer Science and Engineering Fourth Semester

COURSE IMPLEMENTATION CLOCK (IN HOURS)

Course introduction with thorough briefing of Course Objectives and
1Hr
expected Course Outcomes
Course content delivery hours 24 Hrs
Internal Test 3Hrs
Total Instructional Hours 28 Hrs

COURSE CONTENT
List of Laboratory Experiments COs Hours
(Minimum eight experiments are mandatory)
PART A (Any 8 Experiments)
Realization of functions using basic and universal gates (SOP and
1 1,4 2
POS forms).
Design and realization of half adder, full adder, half subtractor and
2 1,4 2
full subtractor using: a) basic gates (b) universal gates.
Code converters: Design and implement BCD to Excess 3 and
3 2,4 2
Binary to Gray code converters.
Design and implement 4 bit adder/subtractor circuit and BCD adder
4 2,4 2
using IC7483.
Implementation of Flip Flops: SR, D, T, JK and Master Slave JK Flip
5 2,4 2
Flops using basic gates.
Asynchronous Counter: Design and implement 3 bit up/down
6 2,4 2
counter.
Asynchronous Counter: Realization of Mod N counters (At least one
7 2,4 2
up counter and one down counter to be implemented).
8 Synchronous Counter: Realization of 4-bit up/down counter. 2,4 2
Synchronous Counter: Realization of Mod-N counters and sequence
9 generators. (At least one mod N counter and one sequence 2,4 2
generator to be implemented)
Realization of Shift Register (Serial input left/right shift register), Ring
10 2,4 2
counter and Johnson Counter using flipflops.
11 Realization of counters using IC‟s (7490, 7492, 7493). 2,4 2
12 Design and implement BCD to Seven Segment Decoder. 2,4 2
13 Realization of Multiplexers and Demultiplexers using gates. 1,4 2
Realization of combinational circuits using MUX & DEMUX ICs
14 2,4 2
(74150, 74154).
To design and set up a 2-bit magnitude comparator using basic
15 1,4 2
gates.
PART B (Any 4 Experiments)
Experiment 1. Realization of Logic Gates and Familiarization of
Verilog
(a) Familiarization of the basic syntax of Verilog
1 (b) Development of Verilog modules for basic gates and to verify 3,4 2
truth tables.
(c) Design and simulate the HDL code to realize three and four
variable Boolean functions
Experiment 2: Half adder and Full adder
2 3,4 2
(a) Development of Verilog modules for half adder in 3 modeling

359 | P a g e
B.Tech. in Computer Science and Engineering Fourth Semester

styles (dataflow/ structural/behavioural).

(b) Development of Verilog modules for full adder in structural
modeling using half adder.
Experiment 3: Design of code converters
Design and simulate the HDL code for
3 3,4 2
(a) 4- bit binary to gray code converter
(b) 4- bit gray to binary code converter
Experiment 4: Mux and Demux in Verilog
4 (a) Development of Verilog modules for a 4x1 MUX. (b) Development 3,4 2
of Verilog modules for a 1x4 DEMUX.
Experiment 5: Adder/Subtractor
5 (a) Write the Verilog modules for a 4-bit adder/subtractor 3,4 2
(b) Development of Verilog modules for a BCD adder
Experiment 6: Magnitude Comparator
6 3,4 2
Development of Verilog modules for a 4 bit magnitude comparator
Experiment 7: Flipflops and shift registers
7 (a) Development of Verilog modules for SR, JK, T and D flip flops. 3,4 2
(b) Development of Verilog modules for a Johnson/Ring counter
Experiment 8: Counters
(a) Development of Verilog modules for an asynchronous decade
8 counter. 3,4 2
(b) Development of Verilog modules for a 3 bit synchronous up-down
counter.

LABORATORY MANUAL

An internally prepared laboratory manual.

REFERENCE BOOKS
1 Mano M. M., Digital Logic & Computer Design, 6/e, Pearson Education, 2016. ISBN: 9789332542525
2 Floyd T. L., Digital Fundamentals, 10/e, Pearson Education, 2009. ISBN-13: 9780132359238

MODES OF EVALUATION SCORE WEIGHTAGE / SPLIT MARKS

Continuous Internal Evaluation 75
Practical records/ outputs in regular class 20
Regular class viva voce 10
Final test 30
Attendance 15
End Semester Examination 75
Algorithm / Design 30
Program / Implementation 15
Output 15
Viva 15
Total 150

360 | P a g e
B.Tech. in Computer Science and Engineering Fourth Semester

COURSE DESCRIPTION
Course Code 20CSL204 Course Credit: 2
Course Name Operating Systems Lab
L-T-J-P 0-0-0-3
Pre-requisite 20CST201 Data Structures , 20EST102 Programming in C
Year of Introduction 2020

COURSE OBJECTIVES
1 To impart fundamental understanding of Linux commands and basic structure and functions of
operating system.
2 To study the process management and scheduling.
3 To understand the concepts and implementation of memory management policies.
4 To understand the concepts in deadlock handling and disk storage management.

REVISED BLOOM’S
COURSE OUTCOMES (COs)
TAXONOMY LEVEL
At the end of the course students will be able to:
CO1 Illustrate the use of systems calls in Operating Systems. 2
Implement Process Creation and Inter Process Communication in
CO2 3
Operating Systems.
Implement Fist Come First Served, Shortest Job First, Round Robin
CO3 3
and Priority based CPU Scheduling Algorithms.
Illustrate the performance of First In First Out, Least Recently Used and
CO4 3
Least Frequently Used Page Replacement Algorithms.
Implement modules for Deadlock Detection and Deadlock Avoidance in
CO5 3
Operating Systems
Implement modules for Storage Management and Disk Scheduling in
CO6 3
Operating Systems.

CO-PO MAPPING
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3 3 2 - - - - 2 - 2 - 3
CO2 3 3 2 - - - - 2 - 2 - 3
CO3 2 2 2 1 - - - 2 - 2 - 3
CO4 2 2 1 1 - - - 2 - 2 - 3
CO5 2 2 1 1 - - - 2 - 2 - 3
CO6 2 2 1 1 - - - 2 - 2 - 3
Correlation levels: 1- Low; 2-Medium; 3-High; No Correlation- “-”

CO-PSO MAPPING
CO1 CO2 CO3 CO4 CO5 CO6
PSO1 2 2 2 2 2 2
PSO2 3 3 3 3 3 3
PSO3 1 1 1 1 1 1
Correlation levels: 1- Low; 2-Medium; 3-High; No Correlation- “-”

361 | P a g e
B.Tech. in Computer Science and Engineering Fourth Semester

COURSE IMPLEMENTATION CLOCK (IN HOURS)

Course introduction with thorough briefing of Course Objectives and
1Hr
expected Course Outcomes
Course content delivery hours 24 Hrs
Internal Test 3Hrs
Total Instructional Hours 28 Hrs.

COURSE CONTENT
List of Laboratory Experiments COs Hours
(Minimum eight experiments are mandatory)
1 Basic Linux commands 1 1
2 Shell programming -Command syntax 1 2
-Write simple functions with basic tests, loops, patterns
3 System calls of Linux operating system: fork, exec, getpid, exit, wait, 1 2
close, stat, opendir, readdir
4 Write programs using the I/O system calls of Linux operating system 1 2
(open, read, write)
5 Implement programs for Inter Process Communication using Shared 2 2
Memory
6 Implementation of CPU scheduling algorithms. a) Round Robin b) 3 2
SJF c) FCFS d) Priority
7 Implementation of the Memory Allocation Methods for fixed partition 4 2
a) First Fit b) Worst Fit c) Best Fit
8 Implement page replacement algorithms a) FIFO b) LRU c) LFU 4 2
9 Implement the banker‟s algorithm for deadlock avoidance. 5 2
10 Implementation of Deadlock detection algorithm 5 2
11 Simulate file allocation strategies. b) Sequential b) Indexed c) 6 2
Linked
12 Simulate disk scheduling algorithms. c) FCFS b)SCAN c) C-SCAN 6 3

LABORATORY MANUAL

An internally prepared laboratory manual.

REFERENCE BOOKS
1 Abraham Silberschatz, Peter Baer Galvin, Greg Gagne, ' Operating System Concepts' 9th Edition,
Wiley India 2015. ISBN:978-1118063330
2 Universal Command Guide: For Operating Systems – April 15, 2002 ,by Guy Lotgering ISBN: 978-0-
764-54833-8

362 | P a g e
B.Tech. in Computer Science and Engineering Fourth Semester

MODES OF EVALUATION SCORE WEIGHTAGE / SPLIT MARKS

Continuous Internal Evaluation 75
Practical records/ outputs in regular class 20
Regular class viva voce 10
Final test 30
Attendance 15
End Semester Examination 75
Algorithm 30
Program 15
Output 15
Viva 15
Total 150

363 | P a g e
B.Tech. in Computer Science and Engineering Fourth Semester

Honours

383 | P a g e
B.Tech. in Computer Science and Engineering Fourth Semester

COURSE DESCRIPTION
Course Code 20CST292 Course Credit: 4
Course Name Number Theory
L-T-J-P 4-0-0-0
Pre-requisite Nil
Year of Introduction 2020

COURSE OBJECTIVES
1 To explore foundations of number theory
3 To provide the mathematical platform for the detailed study on cryptographic systems
3 To enable the learners to understand and utilize mathematical functions
4 To implement Number Theoretic algorithms using a programming language

REVISED BLOOM’S
COURSE OUTCOMES (COs)
TAXONOMY LEVEL
At the end of the course students will be able to:
CO1 Illustrate modular arithmetic operations, methods and techniques 2
Use the methods - Induction, Contraposition or Contradiction to
CO2 3
verify the correctness of mathematical assertions
Utilize theorems and results about prime numbers, congruences,
CO3 quadratic residues and integer factorization for ensuring security in 4
computing systems
Illustrate uses of Chinese Remainder Theorem & Euclidean
CO4 3
algorithm in Cryptography and Security
CO5 Explain applications of arithmetic functions in Computer Science 2
Implement Number Theoretic algorithms using a programming
CO6 3
language

CO-PO MAPPING
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3 3 3 3 - - - - - 3 - 3
CO2 3 3 3 3 - - - - - - - 3
CO3 3 3 3 3 - 2 - - - - - 3
CO4 3 3 3 3 - 2 - - - - - 2
CO5 3 3 3 3 - - - - - 3 - 3
CO6 3 3 3 3 3 - - 2 - - - 3
Correlation levels: 1- Low; 2-Medium; 3-High; No Correlation- “-”

CO-PSO MAPPING
CO1 CO2 CO3 CO4 CO5 CO6
PSO1 2 2 - - 2 -
PSO2 - - 3 3 - 3
PSO3 - - - - - -
Correlation levels: 1- Low; 2-Medium; 3-High; No Correlation- “-”

384 | P a g e
B.Tech. in Computer Science and Engineering Fourth Semester

COURSE IMPLEMENTATION CLOCK (IN HOURS)

Course introduction with thorough briefing of Course Objectives and
1Hr
expected Course Outcomes
Course content delivery hours 48 Hrs
Internal Test
4 Hrs.
(2 Assessment Tests of two-hours duration)
Total Instructional Hours 53 Hrs

SYLLABUS
This is the foundational course for awarding B. Tech. Honours in Computer Science and Engineering with
specialization in Security in Computing- Divisibility & Modular Arithmetic – Primes & Congruences –
Congruences with a Prime – Power Modulus & Euler's Function – Quadratic Residues and Arithmetic
Functions – Sum of Squares and Continued Fractions. Concepts in Number Theory help the learner to apply
them eventually in practical applications in Computer Organization & Security – Coding & Cryptography –
Random Number Generation – Hash Functions – Graphics.

COURSE CONTENT
Module – I ESE
COs Hrs.
Module Title Divisibility and Modular Arithmetic Marks
Finite Fields – Groups, Rings and Fields.
Divisibility – Divisibility and Division Algorithms, Well ordering Principle, Bezout‟s
Identity.
1 10 20%
Modular Arithmetic – Properties, Euclid's algorithm for the Greatest Common
Divisor, Extended Euclid‟s Algorithm, Least Common Multiple, Solving Linear
Diophantine Equations, Modular Division.
Module – II ESE
COs Hrs.
Module Title Primes and Congruences Marks
Prime Numbers – Prime Numbers and Prime Power Factorization, Fermat and
Mersenne Primes, Primality Testing and Factorization.
2, 4 10 20%
Congruences – Linear Congruences, Simultaneous Linear Congruences, Chinese
Remainder Theorem, Fermat‟s Little Theorem, Wilson's Theorem.
Module – III
ESE
Congruences with a Prime – Power Modulus and Euler's COs Hrs.
Module Title Marks
Function
Congruences with a Prime – Power Modulus, Arithmetic Modulo p, Pseudoprimes
and Carmichael Numbers, Solving Congruences Modulo Prime Powers.
Euler's Function – Euler‟s Totient Function, Applications of Euler‟s Totient
3 10 20%
Function, Traditional Cryptosystem, Limitations.
The Group of units – The Group Un, Primitive Roots, Existence of Primitive Roots,
Applications of Primitive Roots.
Module-IV ESE
COs Hrs
Module Title Quadratic Residues and Arithmetic Functions Marks
Quadratic Residues – Quadratic Congruences, The Group of Quadratic Residues,
Legendre Symbol, Jacobi Symbol, Quadratic Reciprocity.
3, 5 9 20%
Arithmetic Functions – Definition and Examples, Perfect Numbers, Mobius
Function and its Properties, Mobius Inversion Formula, The Dirichlet Products.
Module-V ESE
COs Hrs.
Module Title Sum of Squares and Continued Fractions Marks
Sum of Squares – Sum of Two Squares, The Gaussian Integers, Sum of THree
Squares, Sum of Four Squares.
6 9 20%
Continued Fractions – Finite Continued Fractions, Infinite Continued Fractions,
Pell's Equation, Solution of Pell‟s Equation by Continued Fractions.

385 | P a g e
B.Tech. in Computer Science and Engineering Fourth Semester

TEXT BOOKS
1 G.A. Jones and J.M. Jones, Elementary Number Theory, Springer UTM, 2007.
2 Joseph Silverman, A Friendly introduction to Number Theory, Pearson Ed., 2009.
REFERENCE BOOKS
1 William Stallings, Cryptography and Network Security Principles and Practice, Pearson Ed.,2013
Tom M.Apostol, Introduction to Analytic Number Theory, Narosa Publishing House Pvt. Ltd, New Delhi,
2
1996.
3 Neal Koblitz, A course in Number Theory and Cryptography, 2nd Edition, Springer ,2004.

MODES OF EVALUATION SCORE WEIGHTAGE / SPLIT MARKS

Continuous Internal Evaluation 50
Internal Test - I 12.5
Internal Test - II 12.5
Assignments / Quiz / Seminars etc. 15
Attendance 10
End Semester Examination (ESE) 100
Total 150
End Semester Examination Pattern
There will be two parts; Part A and Part B. Part A contains 10 questions with 2 questions from each module,
having 3 marks for each question. Students should answer all questions. Part B contains 2 questions from
each module of which a student should answer any one. Each question can have maximum 2 sub-divisions
and carries 14 marks.

386 | P a g e
 B.Tech. in Computer Science and Engineering Fourth Semester

Total Pages: 2
Register No.: Name:

SAINTGITS COLLEGE OF ENGINEERING KOTTAYAM, KERALA

(AN AUTONOMOUS COLLEGE AFFILIATED TO
APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY, THIRUVANANTHAPURAM)

FOURTH SEMESTER B.TECH. (HONOURS) DEGREE EXAMINATION, MONTH AND YEAR

Course Code: 20CST292

Course Name: Number Theory
Max. Marks: 100 Duration: 3 Hours

PART A

(Answer all Questions. Each question carries 3 Marks)

Question CO BTL MARKS

1. State and prove well ordering principle. 1 2 3
Find gcd d of x=525 and y=231 and express d as ax + by where a and b
2. 1 2 3
are integers.
3. Solve the congruence equation 103 x≡ 57 (mod 211). 2 3 3
4. Use Fermat‟s Little theorem to show that 91 is not a prime. 4 3 3
5. If m is relatively prime ton, show that Φ(mn) = Φ(m) Φ(n). 3 4 3
6. Explain how public key cryptography can be used for digital signatures. 3 4 3
7. Define Mobius function and prove Mobius function is a multiplicative. 5 2 3
8. State and prove Dirichlet product. 5 2 3
Show that every prime of the form 4k+1 can be represented uniquely as
9. 6 3 3
the sum of two squares.
10. Find the continued fraction representation of the rational number 55/89. 6 3 3

PART B

(Answer any one Question from each module. Each question carries 14 Marks)

MODULE I
a) State the Euclidean algorithm and its extension with an example. 1 2 7
11.
b) Find all the solutions of 24x + 34 y = 6. 1 2 7
OR
a) Describe the properties of modular arithmetic and modulo operator. 1 2 7
12. Explain Extended Euclidean algorithm. Using the algorithm find the
b) 1 2 7
multiplicative inverse of 135 mod 61
MODULE II

387 | P a g e
 B.Tech. in Computer Science and Engineering Fourth Semester

a) State and prove Wilson‟s theorem 2 3 7

13.
b) Explain Fermat‟s factorization method and use it to factor 809009 2 3 7
OR
Using Chinese remainder theorem, solve the system of congruences,
a) 4 3 7
x ≡2(mod 3), x ≡3(mod 5), x ≡2(mod 7)
14.
Define Fermat primes. Show that any two distinct Fermat numbers
b) 2 3 7
are Relatively prime.
MODULE III
Distinguish between public key and private key encryption
a) 3 4 7
15. techniques. Also point out the merits and demerits of both.
Define Carmichael number and show that a Carmichael number
b) 3 3 7
must be the product of at least three distinct primes.
OR
Define a pseudo prime to a base and find all non-trivial bases for
a) 3 6
which 15 is a pseudo prime. 3
16.
Find an element of
b) i) order 5 modulo 11 ii) order 4 modulo 13, 4 8
3
iii) order 8 modulo 17 iv) order 6 modulo 19.
MODULE IV
Determine the quadratic residues and non-residues modulo 17. Also
a) determine whether 219 is a quadratic residue or non-residue of the 3 4 8
prime 383.
17.
State the law of quadratic reciprocity. Determine those odd primes p
b) for which 3 is a quadratic residue and those for which it is a non- 3 4 6
residue.
OR
a) State and prove properties of Legendre‟s symbol. 5 2 7
18. State the law of reciprocity for Jacobi symbols and using it determine
b) 3 4 7
whether 888 is a quadratic residue or non-residue of the prime 1999.
MODULE V
Prove that the equation y = x - 2 has only the integer solution
2 3
a) 6 3 7
19. (3,±5).
b) Define a Gaussian integer. Factorize the Gaussian integer 440 − 55i. 6 3 7
OR
If m and n can be expressed as sum of four squares, then show that
a) 6 3 7
20. mn can also be expressed the sum of four squares.
b) Find all the solutions of the Diophantine equation x2 – 6 y2 =1. 6 3 7

*********************

388 | P a g e
B.Tech. in Computer Science and Engineering Fourth Semester

COURSE DESCRIPTION
Course Code 20CST294 Course Credit: 4
Course Name Computational Fundamentals for Machine Learning
L-T-J-P 4-0-0-0
Pre-requisite Nil
Year of Introduction 2020

COURSE OBJECTIVES
1 To understand the basic concept of mathematics for machine learning.
2 To understand various techniques for solving a problems.
3 To understand the design concept of machine learning algorithms.
4 To understand the optimization techniques for machine learning algorithms.

REVISED BLOOM’S
COURSE OUTCOMES (COs)
TAXONOMY LEVEL
At the end of the course students will be able to:
Make use of the concepts, rules and results about linear equations,
matrix algebra, vector spaces, eigenvalues & eigenvectors and 3
CO1
orthogonality and diagonalization to solve computational problems.
Perform calculus operations on functions of several variables and
CO2 3
matrices, including partial derivatives and gradients
Utilize the concepts, rules and results about probability, random
variables, additive & multiplicative rules, conditional probability,
3
CO3 probability distributions and Bayes‟ theorem to find solutions of
computational problems
Train Machine Learning Models using unconstrained and
CO4 3
constrained optimization methods
Illustrate how the mathematical objects - linear algebra, probability,
CO5 2
and calculus can be used to design machine learning algorithms

CO-PO MAPPING
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3 3 2 1 - - - - - - - 1
CO2 3 2 2 - - - - - - - 1
CO3 3 2 2 2 - - - - - - - 1
CO4 2 2 3 3 2 - - - - - 1
CO5 3 3 3 3 2 2 - - - 3 - 1
Correlation levels: 1- Low; 2-Medium; 3-High; No Correlation- “-”

CO-PSO MAPPING
CO1 CO2 CO3 CO4 CO5
PSO1 3 3 3 3 3
PSO2 3 3 3 3 3

389 | P a g e
B.Tech. in Computer Science and Engineering Fourth Semester

PSO3 1 1 1 1 1
Correlation levels: 1- Low; 2-Medium; 3-High; No Correlation- “-”
COURSE IMPLEMENTATION CLOCK (IN HOURS)
Course introduction with thorough briefing of Course Objectives and
1Hr
expected Course Outcomes
Course content delivery hours 48 Hrs
Internal Test 4 Hrs.
(2 Assessment Tests of two-hour duration)
Total Instructional Hours 53 Hrs

SYLLABUS
This is the foundational course for awarding B. Tech. Honours in Computer Science and Engineering with
specialization in Machine Learning. The purpose of this course is to introduce mathematical foundations of
basic Machine Learning concepts among learners, on which Machine Learning systems are built. This course
covers Linear Algebra, Vector Calculus, Probability and Distributions, Optimization and Machine Learning
problems. Concepts in this course help the learners to understand the mathematical principles in Machine
Learning and aid in the creation of new Machine Learning solutions, understand & debug existing ones, and
learn about the inherent assumptions & limitations of the current methodologies.

COURSE CONTENT
Module-I ESE
CO(s) Hrs.
Module Title Linear Algebra Marks
Systems of Linear Equations – Matrices, Solving Systems of Linear Equations.
Vector Spaces –Vector Spaces, Linear Independence, Basis and Rank. Linear
1,2 10 20%
Mappings – Matrix Representation of Linear Mappings. Basis Change, Image and
Kernel
Module-II ESE
COs Hrs
Module Title Analytic Geometry, Matrix Decompositions Marks
Norms, Inner Products, Lengths and Distances, Angles and Orthogonality,
Dimensional Subspaces, Projection onto General Subspaces, Gram-Schmidt
Orthogonalization. Determinant and Trace, Eigenvalues and Eigenvectors,
1,2 10 20%
Cholesky Orthonormal Basis, Orthogonal Complement, Orthogonal Projections –
Projection into One Decomposition, Eigen decomposition and Diagonalization,
Singular Value Decomposition
Module-III ESE
COs Hrs.
Module Title Vector Calculus Marks
Differentiation of Univariate Functions - Partial Differentiation and Gradients,
Gradients of Vector Valued Functions, Gradients of Matrices, Useful Identities for
3 9 20%
Computing Gradients. Back propagation and Automatic Differentiation – Gradients
in Deep Network.
Module-IV ESE
COs Hrs
Module Title Probability and Distributions Marks
Construction of a Probability Space - Discrete and Continuous Probabilities, Sum
Rule, Product Rule, and Bayes‟ Theorem. Summary Statistics and Independence 3 9 20%
– Gaussian Distribution.
Module-V COs Hrs. ESE

390 | P a g e
B.Tech. in Computer Science and Engineering Fourth Semester

Module Title Optimization Marks

Optimization Using Gradient Descent - Gradient Descent with Momentum,
Stochastic Gradient Descent. Constrained Optimization and Lagrange Multipliers - 4,5 10 20%
Convex Optimization - Linear Programming - Quadratic Programming.

TEXT BOOKS
Mathematics for Machine Learning by Marc Peter Deisenroth, A. Aldo Faisal, and Cheng Soon Ong
1
published by Cambridge University Press
REFERENCE BOOKS
1 Linear Algebra and Its Applications, 4th Edition by Gilbert Strang
Introduction to Applied Linear Algebra by Stephen Boyd and Lieven Vandenberghe, 2018 published by
2
Cambridge University Press
Convex Optimization by Stephen Boyd and Lieven Vandenberghe, 2004 published by Cambridge
3
University Press
Learning with Kernels – Support Vector Machines, Regularization, Optimization, and Beyond by
4
Bernhard Scholkopf and Smola, Alexander J Smola, 2002, bublished by MIT Press
5 Machine Learning: A Probabilistic Perspective by Kevin P Murphy, 2012 published by MIT Press.

MODES OF EVALUATION SCORE WEIGHTAGE / SPLIT MARKS

Continuous Internal Evaluation 50
Internal Test - I 12.5
Internal Test - II 12.5
Assignments / Quiz / Seminars etc. 15
Attendance 10
End Semester Examination (ESE) 100
Total 150
End Semester Examination Pattern
There will be two parts: Part A and Part B.
Part A contain 10 questions with two questions from each module, having 3 marks for each question. Students
should answer all questions. Part B contains two questions from each module of which student should answer
any one. Each question can have maximum 2 sub-divisions and carry 14 marks.

391 | P a g e
 B.Tech. in Computer Science and Engineering Fourth Semester

Total Pages: 5
Register No.: Name:

SAINTGITS COLLEGE OF ENGINEERING KOTTAYAM, KERALA

(AN AUTONOMOUS COLLEGE AFFILIATED TO
APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY, THIRUVANANTHAPURAM)

FOURTH SEMESTER B.TECH. DEGREE EXAMINATION, MONTH AND YEAR

Course Code: 20CST294

Course Name: Computational Fundamentals for Machine Learning
Max. Marks: 100 Duration: 3 Hrs

PART A
(Answer all questions)

Question CO BTL MARKS

Show that with the usual operation of scalar multiplication but with addition
1. 1 3 3
on reals given by x # y = 2(x + y) is not a vector space.
Find the eigenvalues of the following matrix in terms of k. Can you find an
eigenvector corresponding to each of the eigenvalues?
2. 1 2 3

Let f(x, y, z) = xyer, where r = x2+z2-5. Calculate the gradient of f at the point
3. 2 3 3
(1, 3, -2).
For a scalar function f(x, y, z) = x2 +3y2 +2z2, find the gradient and its
4. 2 3 3
magnitude at the point (1, 2, -1)
Let X be a continuous random variable with probability density function on 0
5. 3 3 3
<= x <= 1 defined by f(x) = 3x2. Find the pdf of Y = X2.
Show that if two events A and B are independent, then A and B' are
6 3 2 3
independent.
7 Explain the principle of the gradient descent algorithm. 4 1 3
Briefly explain the difference between (batch) gradient descent and
8 stochastic gradient descent. Give an example of when you might prefer one 4 2 3
over the other.
Consider the update equation for stochastic gradient descent. Write down
9 4 2 3
the update when we use a mini-batch size ofone.
Find the angle between the following vectors:
10 5 2 3

PART B
(Answer any one full question from each module)

392 | P a g e
B.Tech. in Computer Science and Engineering Fourth Semester

MODULE I
a) 1. Find all solutions to the system of linear equations
-4x+5z=-2
6
-3x-3y-5z=3 1 5
-x+2y+2z=-1
11. 2. Prove that all vectors orthogonal to [2, −3, 1] T forms a subspace W
of R3. What is dim (W) and why?
A set of n linearly independent vectors in Rn forms a basis. Does the
b) set of vectors (2, 4, −3), (0, 1, 1), (0, 1, −1) form a basis for R3? 1 5 8
Explain your reasons.
OR

) 2 2 6

12.
Consider the transformation T (x, y) = (x + y, x + 2y, 2x + 3y).
b) Obtain ker T and use this to calculate the nullity. Also find the 1 5 8
transformation matrix for T.
.
MODULE II
Use the Gramm-Schmidt process to find an orthogonal basis for the
column space of the following matrix.

13. 3 4 8
a)

b) Find the SVD of the matrix. 3 3 6

OR
Let L be the line through the origin in R2 that is parallel to the vector
[3, 4] T. Find the standard matrix of the orthogonal projection onto L.
Also find the point on L which is closest to the point (7, 1) and find the
point on L which is closest to the point (-3, 5). 2 4 8
a)
b) 1. Find an orthonormal basis of R3 consisting of eigenvectors for the
14. following matrix. 2 1 6

2. Find a 3×3 orthogonal matrix S and a 3×3 diagonal matrix D

393 | P a g e
B.Tech. in Computer Science and Engineering Fourth Semester

such that A = SDST

MODULE III
A skier is on a mountain with equation z=100–0.4x2–0.3y2, where z
denotes height. i. The skier is located at the point with xy-coordinates
(1, 1), and wants to ski downhill along the steepest possible path. In
which direction (indicated by a vector (a, b) in the xy-plane) should the 3 2 6
15. a) skier begin skiing. ii. The skier begins skiing in the direction given by
the xy-vector (a, b) you found in part (i), so the skier heads in a
direction in space given by the vector (a, b, c). Find the value of c
Find the linear approximation to the function f(x, y) = 2 - sin (-x - 3y) at
the point (0, π), and then use your answer to es imate f (0.001, π). 3 4 8
b)
OR
a)

16. 3 3 8

.
b) Find the second order Taylor series expansion for f(x,y) =e-(x2+y2)
cos(xy) bout (0, 0). 3 3 6
MODULE IV
a) There are two bags. The first bag contains four mangos and two 3 3 8
apples; the second bag contains four mangos and four apples. We
also have a biased coin, which shows “heads” with probability 0.6 and
“tails” with probability 0.4. If the coin shows “heads”. we pick a fruit at
random from bag 1; otherwise, we pick a fruit at random from bag 2.
Your friend flips the coin (you cannot see the result), picks a fruit at
random from the corresponding bag, and presents you a mango.
What is the probability that the mango was picked from bag 2?
17.
Consider the following probability distribution

b) 3 6

where θ is a parameter and x is a positive real number. Suppose you

get m samples xi drawn from this distribution. Compute the maximum
likelihood estimator for θ based on these samples.
OR
Two dice are rolled.
A = „sum of two dice equals 3‟
8
18. a) B = „sum of two dice equals 7‟ 4 4
C = „at least one of the dice shows a 1‟
i. What is P(A|C)?

394 | P a g e
B.Tech. in Computer Science and Engineering Fourth Semester

ii. What is P(B|C)?

iii. Are A and C independent? What about B and C?
b) Consider the following bivariate distribution p(x,y) of two discrete
random variables X and Y .

3 4 6

Compute: i. The marginal distributions p(x) and p(y). ii. The

conditional distributions p(x|Y = y1) and p(y|X = x3).
MODULE V
Find the extrema of f(x,y,z) = x - y + z subject to g(x,y,z) = x2 + y2 + z2
a) =2 3 4 7

b)

19.
3 4 7

OR
Derive the gradient descent training rule assuming that the target
function is represented as od = w0 + w1x1 + ... + wnxn. Define
explicitly the cost/ error function E, assuming that a set of training
a) examples D is provided, where each training example d D is 1,4,5 3 8
20.
associated with the target output td

b) Find the maximum value of f(x,y,z) = xyz given that g(x,y,z) = x + y + z 4,5 4 6
= 3 and x,y,z>=0.

*********************

395 | P a g e
B.Tech. in Computer Science and Engineering Fourth Semester

COURSE DESCRIPTION
Course Code 20CST296 Course Credit: 4
Course Name Principles of Program Analysis and Verification
L-T-J-P 3-1-0-0
Pre-requisite 20MAT203 Discrete Mathematical Structures
Year of Introduction 2020

COURSE OBJECTIVES
1 Represent the data states of a given program and propose a sound abstract interpretation framework
to do a given analysis on the program
2 Illustrate methods for doing intraprocedural Data flow Analysis for a given Program Analysis problem.
3 Illustrate the Interprocedural Data Flow Analysis using the tool WALA.
4 Illustrate the working of Kildall‟s algorithm to do Intraprocedural Available Expression Analysis on a
program.
5 Illustrate the process of obtaining verification conditions (VCs) using weakest precondition analysis.
6 Using the tool VCC prove that a given code segment satisfies a given property.

REVISED BLOOM’S
COURSE OUTCOMES (COs)
TAXONOMY LEVEL
At the end of the course students will be able to:
CO1 Explain the concepts and results about Lattices, Chains, Fixed Points, 2
Galois Connections, Monotone and Distributive Frameworks, Hoare
Triples, Weakest Preconditions, Loop Invariants and Verification
Conditions to perform analysis and verification of programs.
CO2 Illustrate methods for doing intraprocedural/interprocedural Data flow 4
Analysis for a given Program Analysis problem.
CO3 Formulate an Abstract Interpretation framework for a given Dataflow 4
Analysis problem and perform the analysis using the tool WALA.
Use Kildall‟s Algorithm to perform Abstract Interpretation of Programs and
CO4 compare the results obtained by the Algorithm on Monotone and 3
Distributive Frameworks.
Explain the concept of Loop Invariants and use them in Hoare Triple based
CO5 Weakest Precondition analysis to verify the total correctness of a code 3
segment.
CO6 Use the tool VCC to specify and verify the correctness of a C Program with 4
respect to a given set of properties.

CO-PO MAPPING
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3 3 2 2 - 1 - - - 1 - 1
CO2 2 3 3 2 - 1 - - - 1 - 1
CO3 3 3 3 2 3 1 - - - - - 1
CO4 2 3 3 2 - 1 - - - - - 1
CO5 2 3 3 2 - 1 - - - 1 - 1
CO6 3 3 3 2 3 1 - - - - - 1
Correlation levels: 1- Low; 2-Medium; 3-High; No Correlation- “-”

396 | P a g e
B.Tech. in Computer Science and Engineering Fourth Semester

CO-PSO MAPPING
CO1 CO2 CO3 CO4 CO5 CO6
PSO1 3 2 2 1 1 2
PSO2 2 1 2 2 1 1
PSO3 1 1 - - - -
Correlation levels: 1- Low; 2-Medium; 3-High; No Correlation- “-”

COURSE IMPLEMENTATION CLOCK (IN HOURS)

Course introduction with thorough briefing of Course Objectives and
1Hr
expected Course Outcomes
Course content delivery hours 48 Hrs
Internal Test
4 Hrs.
(2 Assessment Tests of two-hour duration)
Total Instructional Hours 53 Hrs

SYLLABUS
This is the foundational course for awarding B. Tech. Honours in Computer Science and Engineering with
specialization in Formal Methods. Program Analysis and Program Verification are two important areas of study,
discussing Methods, Technologies and Tools to ensure reliability and correctness of software systems. The
syllabus for this course is prepared with the view of introducing the Foundational Concepts, Methods and Tools in
Program Analysis and Program Verification.

COURSE CONTENT
Module-I ESE
COs Hrs.
Module Title Mathematical Foundations Marks
Mathematical Foundations – Partially Ordered Set, Complete Lattice, Construction
1 8 20%
of Complete Lattices, Chains, Fixed Points, Knaster-Tarski Fixed Point Theorem.
Module-II ESE
COs Hrs.
Module Title Introduction to Program Analysis Marks
Introduction to Program Analysis – The WHILE language, Reaching Definition
Analysis, Data Flow Analysis, Abstract Interpretation, Algorithm to find the least 2 8 20%
solutions for the Data Flow Analysis problem.
Module-III ESE
COs Hrs.
Module Title Intraprocedural DataFlow Analysis Marks
Intraprocedural DataFlow Analysis - Available Expressions Analysis, Reaching
Definitions Analysis, Very Busy Expressions Analysis, Live Variable Analysis,
Derived Data Flow Information, Monotone and Distributive Frameworks, Equation
Solving - Maximal Fixed Point (MFP) and Meet Over all Paths (MOP) solutions.
3 12 20%
Interprocedural Data Flow Analysis - Structural Operational Semantics,
Intraprocedural versus Interprocedural Analysis, Making Context Explicit, Call
Strings as Context, Flow Sensitivity versus Flow Insensitivity, Implementing
Interprocedural Data-flow Analysis using the Tool WALA.
Module-IV ESE
COs Hrs
Module Title Abstract Interpretation Marks
Abstract Interpretation - A Mundane Approach to Correctness, Approximations of
4 9 20%
Fixed Points, Galois Connections, Systematic Design of Galois Connections,

397 | P a g e
B.Tech. in Computer Science and Engineering Fourth Semester

Induced Operations, Kildall‟s Algorithm for Abstract Interpretation.

Module-V ESE
COs Hrs.
Module Title Program Verification Marks
Program Verification - Why should we Specify and Verify Code, A framework for
software verification - A core programming Language, Hoare Triples, Partial and
Total Correctness, Program Variables and Logical Variables, Proof Calculus for 5,6 11 20%
Partial Correctness, Loop Invariants, Verifying code using the tool VCC (Verifier
for Concurrent C).

TEXT BOOKS
Flemming Nielson, Henne Nielson and Chris Kankin, Principles of Program Analysis,
1
Springer (1998).
Michael Hutch and Mark Ryan, Logic in Computer Science - Modeling and Reasoning
2
About Systems, Cambridge University Press, Second Edition.
REFERENCE BOOKS
Julian Dolby and Manu Sridharan, Core WALA Tutorial (PLDI 2010), available online at
1
http://wala.sourceforge.net/files/PLDI_WALA_Tutorial.pdf
Ernie & Hillebrand, Mark & Tobies, Stephan (2012), Verifying C Programs: A VCC
2
Tutorial.

MODES OF EVALUATION SCORE WEIGHTAGE / SPLIT MARKS

Continuous Internal Evaluation 50
Internal Test - I 12.5
Internal Test - II 12.5
Assignments / Quiz / Seminars etc. 15
Attendance 10
End Semester Examination (ESE) 100
Total 150
End Semester Examination Pattern
There will be two parts : Part A and Part B.
Part A contain 10 questions with two questions from each module, having 3 marks for each question. Students
should answer all questions. Part B contains two questions from each module of which student should answer
any one. Each question can have maximum 2 sub-divisions and carry 14 marks.

*********************

398 | P a g e
 B.Tech. in Computer Science and Engineering Fourth Semester

Total Pages: 3
Register No.: Name:

SAINTGITS COLLEGE OF ENGINEERING KOTTAYAM, KERALA

(AN AUTONOMOUS COLLEGE AFFILIATED TO
APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY, THIRUVANANTHAPURAM)

FOURTH SEMESTER B.TECH. DEGREE EXAMINATION, MONTH AND YEAR

Course Code: 20CST296

Course Name: Principles of Program Analysis and Verification
Max. Marks: 100 Duration: 3 Hrs

PART A
(Answer all Questions. Each question carries 3 Marks.)

Question CO BTL MARKS

1 What is a complete lattice? Give an example of a complete lattice. 1 1 3
2 Show that every chain is a lattice 1 1 3
3 Write a program in while language to find the factorial of a number. Explain 2 3 3
the statements of your program.
2 3 3
4
Consider a program that calculates xy through repeated multiplications.
Draw the flow graph of the program.
What is Available Expression (AE) analysis? Give an application for AE 3 2 3
analysis.
6 What is Live variable (LV) analysis? Give an application for LV analysis. 3 1 3
Let P be a program analysis problem (like LV, AE etc.) and (A,FA,γAC) and
7 (B,FB,γBC) be two abstract interpretations such that B is more abstract 4 3 3
than A . Let α and γ be the abstraction and concretization functions
between A and B. Then, what are the conditions required for α and γ to
form a Galois Connection?
8 When is Kildall‟s algorithm for abstract interpretation guaranteed to 4 2 3
terminate? Justify your answer.
9 Is it possible to verify total correctness of a program using Hoare Logic? If 5 2 3
yes, how is it possible?
10 Define loop invariant. Show a simple loop with a loop invariant 5 1 3

PART B
(Answer any one Question from each module. Each question carries 14 Marks)

MODULE I
11. What is an infinite ascending chain in a lattice? Show an example

399 | P a g e
 B.Tech. in Computer Science and Engineering Fourth Semester

a) lattice with an infinite ascending chain. Is it possible for a complete 1 1 7

lattice to contain an infinite ascending chain?
b) State and prove Knaster-Tarski fixed point theorem 1 2 7
OR
Consider the lattice (N,≤). Let f: N N , be a function defined as
follows: when x<100 , f(x)=x+1 when x>100 , f(x)=x-1 , otherwise
12.
a) f(x)=x Then, show the following for f : (i) the set of all fixpoints, (ii) the
1 3 7
set of all pre-fixpoints and (iii) the set of all post-fixpoints.
b) Let (D,≤)be a lattice with a least upper bound for each subset of D .
1 3 7
Then, prove that every subset of D has a greatest lower bound.
MODULE II
a) With a suitable example, explain the equational approach in Data
2 2 7
Flow Analysis.
13.
b) With a suitable example, explain how you obtain the collecting
2 2 7
semantics of a program point.
OR
a) With an example, explain the Constrained Based Approach in Data
2 1 7
Flow Analysis.
14. b) Discuss the properties of an algorithm to solve the problem of
computing the least solution to the program analysis problems in 2 1 7
Data Flow Analysis.
MODULE III
Using Intraprocedural Reaching Definition Analysis, find the
assignments killed and generated by each of the blocks in the
program
a) [x:=5]1;
[y:=1]2;
3 3 7
while [x>1]3do
15.
([y:=x*y]4; [x:=x-1]5)
Analyse the following program using Intraprocedural Very Busy
Expression analysis
if [a>b]1 then
b) ([x: =b-a]2; [y: =a-b]3)
else 3 3 7
([y: =b-a]4; [x: =a-b]5)
OR
a) Find Maximal Fixed Point (MFP) solution for the program
[x: =a+b]1;
[y: =a*b]2;
16. 7
while [y>a+b]3do 3 3
([a: =a+l]4; [x: =a+b]5)
b) With examples, explain the difference between flow sensitive and
3 1 7
flow insensitive analysis.
MODULE IV
17. a) Prove that (L, α, γ, M) is an adjunction if and only if (L, α, γ, M) is 4 2 7

400 | P a g e
 B.Tech. in Computer Science and Engineering Fourth Semester

a Galois connection.
Prove that if α : L → M is completely additive then there exists γ :
b) M → L suchthat (L, α, γ, M) is a Galois connection. Similarly, if γ :
M → L is completely multiplicative then there exists α : L → M 4 2 7
such that (L, α, γ, M) is a Galois connection.
OR
Show that if (Li, αi, γi, Mi) are Galois connections and βi : Vi ➝ Li
a) are representation functions then
18. 4 2 7
((α1 o β1) ↠ (α2 o β2)) (↝) = α2 o ((β1↠β2) (↝)) o γ1
b) Briefly explain Kildall‟s algorithm for abstract interpretation 4 1 7
MODULE V
a) Briefly explain the need of specification and verification of code. 5 2 7
Argue that Hoare Logic is sound. When Hoare Logic is complete?
19. b) Let {A} P {B} be a Hoare triple such that Hoare Logic is complete for
the program P. Then, is it always possible to check the validity of the 5 3 7
Hoare Triple? If not, what is the difficulty?
OR
a) With suitable examples, show the difference between partial and
6 2 7
total correctness.
20.
b) With a suitable example, show how a basic program segment can be
6 2 7
verified using the tool VCC.

401 | P a g e