GUJARAT TECHNOLOGICAL UNIVERSITY

Computer Engineering
Machine Learning
SUBJECT CODE: 3710216

Type of course:

Prerequisite: Data Structures, Basics of Probability and Statistics

Rationale: Machine learning is a method of data analysis that automates analytical model building. It is a
branch of artificial intelligence based on the idea that systems can learn from data, identify patterns and
make decisions with minimal human intervention. This subject will help students to learn patterns and
concepts from data without being explicitly programmed in various IOT nodes and also motivates them to
design and analyse various machine learning algorithms and techniques with a modern outlook focusing on
recent advances
Teaching and Examination Scheme:

Teaching Scheme Credits Examination Marks Total

L T P C Theory Marks Practical Marks Marks
ESE(E) PA (M) PA (V) PA (I)
3 0 2 4 70 30 30 20 150

Content:

Sr. Content Total %

No Hrs Weightage

1 Supervised Learning (Regression/Classification) 10 15%

Basic methods: Distance-based methods, Nearest-Neighbours,
Decision Trees, Naive Bayes
Linear models: Linear Regression, Logistic Regression, Generalized
Linear Models
Support Vector Machines, Nonlinearity and Kernel Methods
Beyond Binary Classification: Multi-class/Structured Outputs,
Ranking
2 Unsupervised Learning 7 15%
Clustering: K-means/Kernel K-means
Dimensionality Reduction: PCA and kernel PCA
Matrix Factorization and Matrix Completion
Generative Models (mixture models and latent factor models)
3 Evaluating Machine Learning algorithms and Model Selection, 6 20%
Introduction to Statistical Learning Theory, Ensemble Methods
(Boosting, Bagging, Random Forests)
4 Sparse Modelling and Estimation, Modelling Sequence/Time-Series 9 20%
Data, Deep Learning and Feature Representation Learning
5 Scalable Machine Learning (Online and Distributed Learning) A 9 20%
selection from some other advanced topics, e.g., Semi-supervised
Learning, Active Learning, Reinforcement Learning, Inference in
Graphical Models, Introduction to Bayesian Learning and Inference
6 Recent trends in various learning techniques of machine learning and 5 10%
classification methods for IOT applications. Various models for IOT
 applications.

References:
1. Machine Learning: A Probabilistic Perspective, Kevin Murphy, MIT Press, 2012.
2. The Elements of Statistical Learning, Trevor Hastie, Robert Tibshirani, Jerome Friedman, Springer
2009 (freely available online)
3. Machine Learning in Action, Peter Harrington, Manning, dreamtech press
4. Machine Learning for Big Data, Jason Bell, Wiley
5. Machine Learning in Python, Michael Bowles, Wiley
6. Machine Learning with TensorFlow for dummies, Matthew Scarpino, Wiley
7. Python Machine Learning By Example, Yuxi Liu, Packt
8. Advance Machine Learning with Python, John Hearty, Packt
9. Deep Learning, Ian Goodfellow, Yoshua Bengio, Aaron Courville, MIT Press
10. Pattern Recognition and Machine Learning, Christopher Bishop, Springer, 2007.

Course Outcome:

After learning the course the students should be able to:

1. Extract features that can be used for a particular machine learning approach in various IOT
applications.
2. To compare and contrast pros and cons of various machine learning techniques and to get an insight
of when to apply a particular machine learning approach.
3. To mathematically analyse various machine learning approaches and paradigms.

List of Experiments:

 Minimum 10 experiments based on the contents.

 Mini Project in a group of max. 3 students
 Writing a research paper on selected topic from content with latest research issues in that topic

Major Equipments:

- Modern System with related software

List of Open Source Software/learning website:

https://www.analyticsvidhya.com/blog/2016/01/complete-tutorial-learn-data-science-python-scratch-
2/

https://www.rstudio.com/online-learning/
 Seat No./Enrolment No.___________

GUJARAT TECHNOLOGICAL UNIVERSITY

ME - SEMESTER– 1 • EXAMINATION – SUMMER - 2024

Subject Code:3710216 Date: 27 Jun 2024

Subject Name:Machine Learning
Time:02:30 PM TO 05:00 PM Total Marks: 70
Instructions:
1. Attempt all questions.
2. Make suitable assumptions wherever necessary.
3. Figures to the right indicate full marks.

Q.1 (a) Define machine learning. What are the important objectives of Machine 07
Learning? What are the basic design issues and approaches to Machine
Learning?
(b) Differentiate between Linear regression and Logistic regression using 07
appropriate example.
Q.2 (a) Explain the concept of Bayes theorem with example. 07
(b) Define the term Gain and Entropy. How is it used to build the Decision tree in 07
algorithm? Illustrate using an example.
OR
(b) Explain CART with suitable example. 07
Q.3 (a) What do you mean by “Curse of Dimensionality”? Explain Principal 07
Component Analysis (PCA) in brief.
(b) Explain K-means clustering with example. 07
OR
Q.3 (a) What are the weaknesses of PCA? How it can be overcome by kernel PCA? 07
(b) Explain Gaussian Mixture Model. 07
Q.4 (a) Enlist the evaluation parameter for regression algorithm and explain in brief. 07
(b) Explain Brute force MAP hypothesis learner. What is Minimum Description 07
Length (MDL) principle?
OR
Q.4 (a) Enlist the evaluation parameter for classification algorithm and explain in brief. 07
(b) Differentiate Bagging and Boosting in brief with example. 07
Q.5 (a) What is the role of activation function in deep learning? How it improves the 07
performance of algorithm? Explain it with any example.
(b) Explain different types of Neural Networks used in machine learning. 07
OR
Q.5 (a) Explain in brief a Probably Approximately Correct (PAC) Learning model in 07
Machine Learning
(b) How reinforcement learning differs from supervised machine learning? Explain 07
it in brief.

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

1
 Seat No.: ________ Enrolment No.___________

GUJARAT TECHNOLOGICAL UNIVERSITY

ME - SEMESTER– 1 • EXAMINATION – WINTER - 2023

Subject Code:3710216 Date: 31 Jan 2024

Subject Name:Machine Learning
Time:10:30 AM TO 01:00 PM Total Marks: 70
Instructions:
1. Attempt all questions.
2. Make suitable assumptions wherever necessary.
3. Figures to the right indicate full marks.

Q.1 (a) Write and explain k-means clustering algorithm with example. 07
(b) Explain large margin principle with appropriate illustration. 07
Q.2 (a) Formulate a Naive Bayes model for the dataset in Table 1. Explain your reasoning 07
behind each step in the model formation. Show an example test case and how the
outcome will be estimated given the model.

Table 1: PlayBadminton Data

Day Outlook Temperature Humidity Wind PlayBadminton
D1 Sunny Hot High Weak No
D2 Sunny Hot High Strong No
D3 Overcast Hot High Weak Yes
D4 Rain Mild High Weak Yes
D5 Rain Cool Normal Weak Yes
D6 Rain Cool Normal Strong No
D7 Overcast Cool Normal Strong Yes
D8 Sunny Mild High Weak No
D9 Sunny Cool Normal Weak Yes
D10 Rain Mild Normal Weak Yes
D11 Sunny Mild Normal Strong Yes
D12 Overcast Mild High Strong Yes
D13 Overcast Hot Normal Weak Yes
D14 Rain Mild High Strong No

(b) Draw and explain Machine Learning based IoT model for healthcare. 07
OR
(b) Discuss the role of Machine Learning in Industrial IoT. 07
Q.3 (a) Explain the procedure which uses the bootstrap to improve the estimate or 07
prediction itself.
(b) Show that as the number of bootstrap samples B gets large, the OOB error 07
estimate for a random forest approaches its N-fold CV error estimate, and that
in the limit, the identity is exact.
OR
Q.3 (a) Explain the method for assessing the accuracy of a parameter estimate or a 07
prediction.
(b) Describe various parameters to evaluate Machine Learning algorithms with 07
example.
Q.4 (a) Write a short note on Sparse Bayesian Learning. 07
(b) Define Deep Belief Network with necessary equation. Also, explain features 07
of DBN.
OR

1
Q.4 (a) Write a short note on Feature Representation Learning. 07
(b) Describe the procedure for training a deep auto-encoder. 07
Q.5 (a) Discuss belief propagation algorithm using serial protocol. 07
(b) Explain how an agent can take action to move from one state to other state 07
with the help of rewards.
OR
Q.5 (a) Write and explain self-training algorithm. 07
(b) Discuss procedure to create junction tree. 07

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

2
 Seat No.: ________ Enrolment No.___________

GUJARAT TECHNOLOGICAL UNIVERSITY

ME - SEMESTER– 1 EXAMINATION – SUMMER - 2023

Subject Code:3710216 Date:19 Jul 2023

Subject Name: Machine Learning
Time:02:30 PM TO 05:00 PM Total Marks: 70
Instructions:
1. Attempt all questions.
2. Make suitable assumptions wherever necessary.
3. Figures to the right indicate full marks.

Q.1 (a) What is Machine Learning? Explain three applications of ML in details. 07

(b) Explain Linear regression with suitable example. 07

Q.2 (a) What is classification? Explain SVM 07

(b) Differentiate Bagging Vs Boosting. 07
OR
(b) Explain naïve -Bayes theorem with example. 07

Q.3 (a) How ensemble approach improves classification accuracy? Explain with 07
suitable examples.
(b) Describe principal of Support Vector Machine with suitable diagrams. 07
OR
Q.3 (a) K-mean Clustering algorithm with example. 07
(b) Short note on KNN. 07

Q.4 (a) Write a brief note on reinforcement learning. 07

(b) Explain multi-variant regression. 07
OR
Q.4 (a) Explain Deep Learning in detail. 07
(b) Explain Bayesian belief Network with example. 07

Q.5 (a) Explain PCA in detail. 07

(b) Differentiate Semi-Supervised, Active learning, and reinforcement learning. 07
OR
Q.5 (a) Discuss recent trends in various learning techniques of machine learning with 07
IOT based application.
(b) Explain Ensemble Learning with example. 07

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

1
 Seat No.: ________ Enrolment No.___________

GUJARAT TECHNOLOGICAL UNIVERSITY

ME - SEMESTER– 1 (NEW) • EXAMINATION – WINTER - 2022

Subject Code: 3710216 Date: 2 Mar 2023

Subject Name: Machine Learning
Time:10:30 AM TO 01:00 PM Total Marks: 70
Instructions:
1. Attempt all questions.
2. Make suitable assumptions wherever necessary.
3. Figures to the right indicate full marks.

Q.1 (a) Define Machine Learning. Differentiate Supervised, Unsupervised, and 07

reinforcement learning based on their characteristics.
(b) What do you mean by Regression? Explain different types of regression with 07
example in brief.
Q.2 (a) Describe the working behavior of support vector machine with suitable 07
diagram.
(b) Explain the concept of Bayes theorem with example. 07
OR
(b) Describe ID3 and explain it with suitable example. 07
Q.3 (a) List the weaknesses of K-means algorithm. How it is override by Kernel K- 07
means algorithm? Explain in brief.
(b) Describe how principal component analysis is carried out to reduce 07
dimensionality of data sets.
OR
Q.3 (a) Demonstrate the concept of Matrix Factorization techniques for the movie 07
recommendation system.
(b) Explain Gaussian Mixture Model. 07
Q.4 (a) List the evaluation parameter to measure the performance of Classification 07
algorithm. Explain them in brief with example.
(b) Draw and explain structure of single perceptron. Is XOR problem solvable 07
using single perceptron? Justify your answer with appropriate reasoning.
OR
Q.4 (a) Enlist the evaluation parameter for clustering algorithm and explain in brief. 07
(b) Define backpropagation. How neural network is reducing error using the 07
backpropagation method? Explain in brief along with necessary diagram.
Q.5 (a) How learning is happening in Reinforcement Learning? Explain in brief. 07
(b) Define Ensemble. How ensemble is useful to improve performance of machine 07
learning algorithm? Compare Bagging and Boosting in machine learning.
OR
Q.5 (a) List the commonly used activation functions in the deep learning and explain 07
each of them in brief.
(b) Define Distributed machine learning. How it is useful to overcome the 07
scalability problem of machine learning? Explain it with example.

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

1
 Seat No.: ________ Enrolment No.___________

GUJARAT TECHNOLOGICAL UNIVERSITY

ME - SEMESTER– 1 (NEW) • EXAMINATION – SUMMER - 2022

Subject Code:3710216 Date: 30 Jul 2022

Subject Name:Machine Learning
Time:02:30 PM TO 05:00 PM Total Marks: 70
Instructions:
1. Attempt all questions.
2. Make suitable assumptions wherever necessary.
3. Figures to the right indicate full marks.

Q.1 (a) What is Machine Learning? Explain steps to develop a machine learning 07
application.
(b) Differentiate between Linear regression and Logistic regression using 07
appropriate example.
Q.2 (a) Explain Principal Component Analysis (PCA) method with its advantages. 07
(b) Differentiate Supervised and Unsupervised learning based on its features. 07
OR
(b) Differentiate Bagging and Boosting. 07
Q.3 (a) What is MAP hypothesis? Explain brute force MAP learning algorithm. 07
(b) List different classifiers used in machine learning. Explain KNN and SVM 07
classifiers.
OR
Q.3 (a) What do you mean by Clustering? Explain K-means clustering algorithm 07
(b) Explain Model selection and evaluation with its required parameters 07
Q.4 (a) Explain Ensemble Learning. 07
(b) Describe CART and explain it with suitable example 07
OR
Q.4 (a) Explain reinforcement learning in detail. 07
(b) What are the issues in Decision tree learning? How to overcome them? 07
Q.5 (a) How machine learning techniques will be helpful for IOT based applications in 07
detail?
(b) Explain Naïve Bayes classifier with an example. 07
OR
Q.5 (a) Explain different types of Neural Networks used in machine learning. 07
(b) Explain Generalized Linear Models (GLM). 07

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

1
 GUJARAT TECHNOLOGICAL UNIVERSITY
Advanced Data Structures
SUBJECT CODE: 3710215

Type of course: Core

Prerequisite: UG level course in Data Structures

Rationale:

Teaching and Examination Scheme:

Teaching Scheme Credits Examination Marks Total

L T P C Theory Marks Practical Marks Marks
ESE(E) PA (M) PA (V) PA (I)
3 0 2 4 70 30 30 20 150

Content:

Sr. Content Total %

No Hrs Weightage

1 Dictionaries: Definition, Dictionary Abstract Data Type, 7 15

Implementation of Dictionaries.
Hashing: Review of Hashing, Hash Function, Collision Resolution
Techniques in Hashing, Separate Chaining, Open Addressing, Linear
Probing, Quadratic Probing, Double Hashing, Rehashing, Extendible
Hashing
2 Skip Lists: Need for Randomizing Data Structures and Algorithms, 5 10
Search and Update Operations on Skip Lists, Probabilistic Analysis of
Skip Lists, Deterministic Skip Lists
3 Trees: Binary Search Trees, AVL Trees, Red Black Trees, 2-3 Trees, 9 19
B-Trees, Splay Trees
4 Text Processing: Sting Operations, Brute-Force Pattern Matching, 12 25
The Boyer- Moore Algorithm, The Knuth-Morris-Pratt Algorithm,
Standard Tries, Compressed Tries, Suffix Tries, The Huffman Coding
Algorithm, The Longest Common Subsequence Problem (LCS),
Applying Dynamic Programming to the LCS Problem.
5 Computational Geometry: One Dimensional Range Searching, Two 10 21
Dimensional Range Searching, Constructing a Priority Search Tree,
Searching a Priority Search Tree, Priority Range Trees, Quadtrees, k-D
Trees.
6 Recent Trands in Hashing, Trees, and various computational geometry 5 10
methods for effeciently solving the new evolving problem

Reference Books:

1. Mark Allen Weiss, Data Structures and Algorithm Analysis in C++, 2nd Edition, Pearson, 2004
2. M T Goodrich, Roberto Tamassia, Algorithm Design, John Wiley, 2002.
Course Outcome:

After learning the course the students should be able to:

 Understand the implementation of symbol table using hashing techniques
 Develop and analyze algorithms for red-black trees, B-trees and Splay trees
 Develop algorithms for text processing applications
 Identify suitable data structures and develop algorithms for computational geometry problems

List of Experiments:
(Note: At least 12 Practicals should be performed from the list.)

1. Write a program which creates Binary Search Tree. And also implement recursive and non-
recursive tree traversing methods inorder, preorder and post-order for the BST.
2. Write a program to implement any two hashing methods. Use any one of the hashing method to
implement Insert, Delete and Search operations for Hash Table Management.
3. Explain Dictionary as an Abstract Data Type. Implement Dictionary using suitable Data Structure.
4. Write a program which creates AVLTree. Implement Insert and Delete Operations in AVL Tree.
Note that each time the tree must be balanced.
5. Implement Red-Black Tree.
6. Implement 2-3 Tree.
7. Implement B Tree.
8. Implement a program for String Matching using Boyer-Moore Algorithm on a text file content.
9. Implement a program for String Matching using Knuth-Morris-Pratt Algorithm on a text file
content.
10. Implement Huffman-Coding Method. Show the result with suitable example.
11. Implement Longest Common Subsequence(LCS) Problem using Dynamic Programming Method.
Show the DP table and also find the particular solution of given strings.
12. Implement One Dimensional and Two Dimensional Range Searching in any language.
13. Write a program which creates Priority Search Tree. Implement Insert and Search Operations in this
Tree.
14. Write a program which creates Skip Lists. Implement Insert, Search and Update Operations in
Skip-Lists.
15. Design a simple search engine to display the possible websites upon entering a search query. Use
suitable data structure for storage and retrieval.
16. Prepare a Report/Presentation on Recent trends on Hashing/Trees/Computational Geometry to
solve ay of recent evolving problem in real world.
 Seat No./Enrolment No.___________

GUJARAT TECHNOLOGICAL UNIVERSITY

ME - SEMESTER– 1 • EXAMINATION – SUMMER - 2024

Subject Code:3710215 Date: 21 Jun 2024

Subject Name:Advanced Data Structures
Time:02:30 PM TO 05:00 PM Total Marks: 70
Instructions:
1. Attempt all questions.
2. Make suitable assumptions wherever necessary.
3. Figures to the right indicate full marks.

Q.1 (a) Explain Boyer Moore Pattern matching algorithm with example. 07
(b) Define Red-Black tree. Also discuss solution of various cases of violations that 07
occur while inserting a node in Red-Black tree.

Q.2 (a) Write algorithm for Searching in Priority Search Tree. 07

(b) Explain Hopscotch Hashing with suitable example. 07
OR
(b) What are the properties of BST? Describe an algorithm to search largest node in 07
BST.

Q.3 (a) Describe how LCS problem can be solved using dynamic programming 07
(b) Draw the 11-item hash table resulting from hashing the keys 12, 44, 13, 88, 23, 94, 07
11, 39, 20, 16, and 5 using the hash function h(i) = (2i + 5) mod 11 and assuming
collisions are handled by quadratic probing, up to the point where the method fails
because no empty slot is found.
OR
Q.3 (a) What are the different types of imbalances that occur while deleting a node from 07
AVL trees? Explain with an example for each type of imbalance?
(b) Discuss Huffman coding method. Explain it with an example. 07

Q.4 (a) Write Knuth-Morris-Pratt Algorithm. Also compute its time complexity. 07
(b) What is Hash function? What are the collision resolution techniques? 07
OR
Q.4 (a) Discuss two dimensional range searching algorithm in detail 07
(b) Discuss Standard Tries and Compressed Tries. 07

Q.5 (a) Explain Rehashing in Brief with Example. 07

(b) What is dictionary? Demonstrate the applications of dictionary. 07
OR
Q.5 (a) What is Skip list? Write pseudo code for inserting a node in skip list. 07
(b) What is B-Tree? Discuss advantage of using it. Show one example of such tree of 07
order 4.

***************
Seat No.: ________ Enrolment No.___________

GUJARAT TECHNOLOGICAL UNIVERSITY

ME - SEMESTER– 1 • EXAMINATION – WINTER - 2023

Subject Code:3710215 Date: 24 Jan 2024

Subject Name:Advanced Data Structures
Time:10:30 AM TO 01:00 PM Total Marks: 70
Instructions:
1. Attempt all questions.
2. Make suitable assumptions wherever necessary.
3. Figures to the right indicate full marks.
 Seat No.: ________ Enrolment No.___________

GUJARAT TECHNOLOGICAL UNIVERSITY

ME - SEMESTER– 1 EXAMINATION – SUMMER - 2023

Subject Code:3710215 Date:14 Jul 2023

Subject Name: Advanced Data Structures
Time:02:30 PM TO 05:00 PM Total Marks: 70
Instructions:
1. Attempt all questions.
2. Make suitable assumptions wherever necessary.
3. Figures to the right indicate full marks.

Q.1 (a) Explain with example the process of searching an element in skip list. 07
(b) What are the properties of BST? Describe an algorithm to traverse node in preorder. 07
Q.2 (a) Construct a tree for the given inorder and postorder traversals Inorder 07
DGBAHEICFand Postorder GDBHIEFCA
(b) Insert the following letters into an empty B-tree of order 5: C N G A H E K Q M F W L 07
TZDPRXYS
OR
(b) Build an AVL tree for inserting 13, 16, 10, 8, 5, 4, 15, 12, 9 values. After this insertion 07
delete 53 and 11. Show the step by step construction
Q.3 (a) What is hash table and hash function? Discuss and analyze various ways to define hash 07
function?
(b) What is 2-3 tree? How is it better than other search trees? Construct a 2-3 B tree for the 07
list I,N,T,E,R,N,E,T
OR
Q.3 (a) Why rehashing is needed? State different ways in which rehashing can be implemented. 07
Write a procedure to implement dictionary using suitable data structure.
(b) Construct Red and Black tree for keys 10,20,-10,15,17,40,50,60. 07
Q.4 (a) Construct the open hash table (separate chaining) and closed hash table (open addressing 07
– use linear probing) for the input: 42, 10, 36, 67, 50, 91, 64, 77, 57, 91 using the hash
function h(k) = k mod 10. Explain each step in detail.
(b) Given two sequences, find the length of longest subsequence present in both of 07
them. Find LCS for input sequences “HUMAN” and “CHIMPANZEE”
OR
Q.4 (a) Explain The Knuth-Morris-Pratt Algorithm with example. 07
(b) What is K-D Tree? Create K-D Tree for inserting (2, 5), (16, 14), (12, 14), (5, 11), (8, 07
1), (3, 7), (10, 19) values. Delete (12, 16) and (3, 7). Draw tree after each operation.
Q.5 (a) Consider the following list of string to create tries :cat,bat,ball,rat,cap,be. 07
(b) A file contains the following characters with the frequencies as shown. If 07
Huffman Coding is used for data compression, determine-
1. Huffman Code for each character
2. Average code length
3. Length of Huffman encoded message (in bits)
Characters A E I O U S T
Frequencies 10 15 12 3 4 13 1
OR
Q.5 (a) What is one dimensional range searching? Describe an algorithm of creating one 07
dimensional range search.
(b) What is priority search tree? Explain how Searching in a Priority Search Tree 07
performed.

1
 Seat No.: ________ Enrolment No.___________

GUJARAT TECHNOLOGICAL UNIVERSITY

ME - SEMESTER– 1 (NEW) • EXAMINATION – WINTER - 2022

Subject Code: 3710215 Date: 24 Feb 2023

Subject Name: Advanced Data Structures
Time:10:30 AM TO 01:00 PM Total Marks: 70
Instructions:
1. Attempt all questions.
2. Make suitable assumptions wherever necessary.
3. Figures to the right indicate full marks.

Q.1 (a) What is Open addressing in hashing? Discuss various methods of doing it. 07
(b) Where can Dictionary be used and how? Explain different ways of 07
implementing Dictionaries.
Q.2 (a) Discuss Priority range trees. 07
(b) Discuss one dimension and two dimension range searching. 07
OR
(b) Explain Quad tree. 07
Q.3 (a) What is meant by a search tree? Discuss 2-3 Tree. 07
(b) Discuss creation of K-D tree with an example. 07
OR
Q.3 (a) Discuss algorithm of Insert operation in the Skip list. 07
(b) How does a red black tree ensure balance? Explain with an example. Label R 07
for a Red node and B for a Black node in the explanation.
Q.4 (a) Discuss Brute-Force pattern matching algorithm. Count total number of 07
comparison to search Pattern (P) from the Text (T), as given below:
T: abacaabaccabacabaabb
P: abacab
Show all intermediate comparisons.
(b) Discuss AVL tree and different rotations while performing insertion in the tree. 07
OR
Q.4 (a) What are applications of pattern matching algorithms? Discuss Boyer Moore 07
algorithm.
(b) Discuss Splay tree and its three cases which are considered while restructuring 07
the tree. Also, for the following part of tree, apply Zig-Zig rotation considering
newly added node is x.

Q.5 (a) Discuss Longest common subsequence problem along with its applications and 07
a way to find/solve it.
(b) Discuss Standard Trie and Compressed Trie. 07
1
 OR
Q.5 (a) Is KMP algorithm better than Boyer Moore algorithm? Justify your answer. 07
(b) Create a Binary Search Tree for the given input sequence : 500, 300, 400, 350, 07
375, 360. What would be the worst case time required to search a node in such
type of tree (having similar pattern of inputs)?

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

2
 Seat No.: ________ Enrolment No.___________

GUJARAT TECHNOLOGICAL UNIVERSITY

ME - SEMESTER– 1 (NEW) • EXAMINATION – SUMMER - 2022

Subject Code:3710215 Date: 27 Jul 2022

Subject Name:Advanced Data Structures
Time:02:30 PM TO 05:00 PM Total Marks: 70
Instructions:
1. Attempt all questions.
2. Make suitable assumptions wherever necessary.
3. Figures to the right indicate full marks.

Q.1 (a) Explain k-D tree. 07

(b) What is dictionary? Demonstrate the applications of dictionary. 07
Q.2 (a) Discuss Insert algorithm for Insert operation in Binary Search Tree. Also give 07
one example to explain it.
(b) What is hash table and hash function? Discuss and analyze various ways to 07
define hash function?
OR
(b) What is skip lists? Describe about various operation performed on skip lists 07
with examples.
Q.3 (a) Explain Quad tree. 07
(b) Define B-tree. Explain with example how B-tree is constructed. 07
OR
Q.3 (a) Explain Brute-Force Pattern Matching algorithm. 07
(b) Explain with example an algorithm to construct the Huffman code. 07
Q.4 (a) Write Knuth-Morris-Pratt Algorithm. Also compute its time complexity. 07
(b) Explain priority search tree with example. 07
OR
Q.4 (a) Explain Boyer Moore Pattern matching algorithm with example. 07
(b) Explain how to find out Longest Common Subsequence of two strings using 07
Dynamic Programming method. Find any one Longest Common Subsequence
of given two strings using Dynamic Programming.
X=abbacdcba and Y=bcdbbcaa.
Q.5 (a) Which Data structures can be used for 1-D Range searching? Explain any three 07
with example.
(b) Consider the insertion of items with the following keys (in the given order) into 07
an initially empty AVL tree: 44, 17, 32, 78, 50, 88, 48, 62, 54. Draw step by
step tree.
OR
Q.5 (a) Explain Two Dimensional Range Searching. 07
(b) List out various recent trends in hashing and explain one of them in detail. 07

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

1
 GUJARAT TECHNOLOGICAL UNIVERSITY
Computer Engineering (Software Engineering)
Distributed Systems
SUBJECT CODE: 3710213

Type of course: Elective

Prerequisite: Operating System, Computer Network,Data Structures and Algorithms

Rationale: This subject will give introduction to traditional and distributed computing system. Students
will be introduced to various issues in design of distributed system. They will also learn how to mitigate
those risks and attacks.

Teaching and Examination Scheme:

Teaching Scheme Credits Examination Marks Total

L T P C Theory Marks Practical Marks Marks
ESE(E) PA (M) PA (V) PA (I)
3 0 2 4 70 30 30 20 150

Content:

Sr. Content Total % Weightage

No Hrs

1 Introduction to DS: Introduction to Distributed Systems, 3 8%

Distributed system models, Design issues in DS

2 Communication in Distributed System:Inter process 7 15%

communication: Message passing model, Remote procedure call
and implementation issues, Point to point and Group communication
, Client Server model & its implementation, Socket programming,
Case Studies: SUN RPC, DEC RPC

3 Synchronization in distributed systems: Introduction, Temporal 8 15%

ordering of events, Clock synchronization, mutual exclusion,
Deadlock in distributed systems, Election algorithms

4 Remote Method Invocation: Introduction, Java RMI Architecture, 3 8%

API for Java RMI, Client Callback, Stub downloading

5 Common Object Request Broker Architecture: Introduction, 4 10%

Interface, Inter-ORB Protocol, Object server and object client,
Naming service, Object service,

6 Processes and processors in distributed systems: Threads, system 8 15%

model, processor allocation, scheduling in distributed systems: Load
balancing and sharing approach, fault tolerance, Real time
distributed systems, Process migration and related issues
7 Distributed File Systems: Introduction, features & goal of 8 15%
distributed file system, file models, file accessing models, file
sharing semantics, file caching scheme, file replication, fault
tolerance, trends in distributed file system, case study- HDFS.

8 Distributed Shared Memory: Introduction, general architecture of 5 10%

DSM systems, design and implementation issues of DSM,
granularity, structure of shared memory space, consistency models,
replacement strategy, thrashing

9 Advanced Topics: Simple Object Access Protocol, Distributed 2 4%

Computing Paradigm (Message queue system, mobile agent, object
spaces)

Reference Books:

1. “Distributed Computing – Principles and Applications”, M. L. Liu, Pearson.

2. “Distributed Operating Systems Concepts and Design” , Pradeep K Sinha, PHI
3. “Distributed Systems Concepts and Design “ George Colouris, Jean Dollimore, Tim Kindberg, Pearson

Course Outcome:

After learning the course the students should be able to:

 Understand the difference between traditional client server architecture and distributed architecture
 Understand the importance and issues of distributed system
 Implement socket programing, RMI and CORBA

List of Experiments:
1. Write a Program to implement Concurrent Echo Client Server Application.
2. Write a Program to implement Concurrent Day Time Server Application.
3. Write a program to solve Producer-Consumer Problem using thread.
4. Write a program to implement Calculator using Socket in java.
5. Implement RPC Programming.
6. Implementation of Server that adds given two values by the clients using Java RMI.
7. Write a program to create CORBA based client server application
8. Implementing Bully Election algorithm for synchronization
9. Implementing Ring Election algorithm for synchronization
10. Write a Program to Increment a Counter in Shared Memory.
 ssSeat No./Enrolment No.___________

GUJARAT TECHNOLOGICAL UNIVERSITY

ME - SEMESTER– 1 • EXAMINATION – SUMMER - 2024

Subject Code:3710213 Date: 24 Jun 2024

Subject Name:Distributed Systems
Time:02:30 PM TO 05:00 PM Total Marks: 70
Instructions:
1. Attempt all questiossns.
2. Make suitable assumptions wherever necessary.
3. Figures to the right indicate full marks.

Q.1 (a) Explain all forms of transparency parameter in distributed operating 07

systems.
(b) Briefly explain the concept of stateful and stateless servers with diagram 07

Q.2 (a) Explain IPC Synchronization in detail. 07

(b) Explain circuit switching and packet switching. Mention the differences 07
between circuit switching and packet switching.
OR
(b) Differentiate between monolithic kernel and microkernel approaches for 07
designing distributed operating system.

Q.3 (a) Explain the significance of wait-for graph with respect to 07

deadlock.
(b) Explain Berkley clock Synchronization algorithm with an example. 07
OR
Q.3 (a) What will happen in a bully algorithm for electing a coordinator 07
when two or more process almost simultaneously discover that the
coordinator has crashed? Suggest some suitable mechanism.
(b) What is a RPC? Explain RPC Execution process in detail with 07
diagram.

Q.4 (a) Differentiate RMI and RPC with example in detail. 07

(b) What is the role of “binding agent” in client server binding? Explain 07
types of binding in detail.
OR
Q.4 (a) Which are the different techniques to avoid deadlock in 07
Distributed Operating System?
(b) Explain name space and name server. 07

Q.5 (a) Which are the different types of process scheduling techniques? Explain 07
desirable features for good scheduling algorithm.
(b) Explain the technique to avoid the faults in distributed systems 07
OR
Q.5 (a) Explain the causal consistency model for a distributed shared memory 07
system.
(b) What is load balancing? List the load balancing techniques and discuss 07
any two of them.

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

1
Seat No.: ________ Enrolment No.___________

GUJARAT TECHNOLOGICAL UNIVERSITY

ME - SEMESTER– 1 • EXAMINATION – WINTER - 2023

Subject Code:3710213 Date: 25 Jan 2024

Subject Name:Distributed Systems
Time:10:30 AM TO 01:00 PM Total Marks: 70
Instructions:
1. Attempt all questions.
2. Make suitable assumptions wherever necessary.
3. Figures to the right indicate full marks.
 Seat No.: ________ Enrolment No.___________

GUJARAT TECHNOLOGICAL UNIVERSITY

ME - SEMESTER– 1 EXAMINATION – SUMMER - 2023

Subject Code:3710213 Date:15 Jul 2023

Subject Name: Distributed Systems
Time:02:30 PM TO 05:00 PM Total Marks: 70
Instructions:
1. Attempt all questions.
2. Make suitable assumptions wherever necessary.
3. Figures to the right indicate full marks.

Q.1 (a) List out the advantages & disadvantages of Distributed System (DS). 07
(b) Define Thread. Explain User Level Thread & Kernel Level Thread. 07
Q.2 (a) Briefly explain the concept of stateful and stateless servers with suitable diagram. 07
(b) Explain the various issues in designing Load Sharing Algorithms. 07
OR
(b) Explain Berkley clock Synchronization algorithm with an example. 07
Q.3 (a) What is process migration? List out the advantages of process migration. 07
(b) Explain how mutual exclusion is handled in distributed system. 07
OR
Q.3 (a) List out various types of Consistency Models in Distributed Shared Memory 07
(DSM) and explain any two of them with suitable diagram.
(b) Write a short note on Hadoop Distributed File System (HDFS). 07
Q.4 (a) What is the need of Load Balancing in Distributed System? List out various load 07
balancing techniques.
(b) Describe the Distributed Deadlock Detection Algorithms. 07
OR
Q.4 (a) Define Thrashing. Explain various approaches to solve Thrashing in DSM. 07
(b) What is Stub? How a Stub can be generated? Also explain how stub helps user 07
in making RPC mechanism transparent.
Q.5 (a) What is the goal of Election Algorithms? Explain Bully Election Algorithm in 07
depth.
(b) Explain JAVA RMI Architecture. 07
OR
Q.5 (a) Explain File Caching. Compare it with File Replication. List out the advantages 07
of file replication in Distributed File System (DFS).
(b) Write a short note on CORBA – ORB Architecture. 07

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

1
 Seat No.: ________ Enrolment No.___________

GUJARAT TECHNOLOGICAL UNIVERSITY

ME - SEMESTER– 1• EXAMINATION – WINTER - 2022

Subject Code: 3710213 Date: 27 Feb 2023

Subject Name: Distributed Systems
Time:10:30 AM TO 01:00 PM Total Marks: 70
Instructions:
1. Attempt all questions.
2. Make suitable assumptions wherever necessary.
3. Figures to the right indicate full marks.

Q.1 (a) Define distributed system. What is main motivation of distributed system? 07
Explain advantages and disadvantages of distributed systems.
(b) Explain IPC Synchronization in detail. 07
Q.2 (a) What is RMI? What are the main features of Java RMI? Discuss the various 07
components and the process of RMI execution.
(b) What is threading? Explain Thread model in distributed System. 07
OR
(b) Explain CORBA – ORB Architecture. 07
Q.3 (a) What is ordered message delivery? Discus different types of message ordering 07
(b) Explain Berkley clock Synchronization algorithm with an example 07
OR
Q.3 (a) Differentiate between monolithic kernel and microkernel approaches for 07
designing distributed operating system.
(b) Why mutual exclusion is more complex in distributed systems? Categorize and 07
compare mutual exclusion algorithms.
Q.4 (a) List file Accessing models. Discuss any two of them. 07
(b) Explain the general architecture of DSM. 07
OR
Q.4 (a) What is process migration? Explain address transport mechanism with freezing 07
technique.
(b) Which are the different techniques to avoid deadlock in Distributed Operating 07
System.
Q.5 (a) What is the main cause of threshing in a DSM system? Discuss the methods to 07
resolve threshing problem in DSM system
(b) Explain various file sharing semantics. 07
OR
Q.5 (a) Write the advantages of distributed shared memory. Define HDSM and explain 07
Ring based multi-processor.
(b) Explain the technique to avoid the faults in distributed systems. 07

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

1
Seat No.: ________ Enrolment No.___________

GUJARAT TECHNOLOGICAL UNIVERSITY

ME - SEMESTER– 1 (NEW) • EXAMINATION – SUMMER - 2022

Subject Code:3710213 Date: 28 Jul 2022

Subject Name:Distributed Systems
Time:02:30 PM TO 05:00 PM Total Marks: 70
Instructions:
1. Attempt all questions.
2. Make suitable assumptions wherever necessary.
3. Figures to the right indicate full marks.

Q.1 (a) List out the Design issues in Distributed System. Explain Scalability in 07
detail.
(b) Compare Centralized and Distributed System and Discuss real time 07
applications of distributed system.
Q.2 (a) Differentiate between monolithic kernel and microkernel approaches for 07
designing distributed operating system.
(b) Explain IPC Synchronization in detail. 07
OR
(b) Explain Election Algorithm for Synchronization in Distributed System. 07

Q.3 (a) Explain RPC implementation. Also explain various methods of 07

generating stubs.
(b) Which are the different techniques to avoid deadlock in Distributed 07
Operating System?
OR
Q.3 (a) Differentiate between primitive and non primitive process migration. 07
What are their relative advantages and disadvantages?
(b) What is the role of “binding agent” in client server binding? Explain types 07
of binding in detail.

Q.4 (a) Explain the issues in designing load sharing algorithms. 07

(b) Explain the DSM system architecture. How does granularity affect DSM 07
system performance?
OR
Q.4 (a) What is ordered message delivery? Discus different types of message 07
ordering
(b) Explain the technique to avoid the faults in distributed systems 07

Q.5 (a) Define Thrashing in DSM. Explain methods for solving thrashing in 07
DSM.
(b) Explain various file sharing semantics. 07
OR
Q.5 (a) Explain SOAP with its architecture. 07
(b) Explain the causal consistency model for a distributed shared memory 07
system.
*************

1
 GUJARAT TECHNOLOGICAL UNIVERSITY
Mathematical Foundation of Computer Science
SUBJECT CODE: 3710214

Type of course: Core

Prerequisite: Discrete Mathematics

Rationale:

Teaching and Examination Scheme:

Teaching Scheme Credits Examination Marks Total

L T P C Theory Marks Practical Marks Marks
ESE(E) PA (M) PA (V) PA (I)
3 0 2 4 70 30 30 20 150

Content:

Sr. Content Total % Weightage

No Hrs

1 Probability mass, density, and cumulative distribution functions, 7 15

Parametric families of distributions, Expected value, variance,
conditional expectation, Applications of the univariate and
multivariate Central Limit Theorem, Probabilistic inequalities,
Markov chains
2 Random samples, sampling distributions of estimators, Methods of 7 15
Moments and Maximum Likelihood
3 Statistical inference, Introduction to multivariate statistical models: 8 16
regression and classification problems, principal components
analysis, The problem of overfitting model assessment
4 Graph Theory: Isomorphism, Planar graphs, graph colouring, 11 23
hamilton circuits and euler cycles. Permutations and Combinations
with and without repetition. Specialized techniques to solve
combinatorial enumeration problems
5 Computer science and engineering applications: Data mining, 10 21
Network protocols, analysis of Web traffic, Computer security,
Software engineering, Computer architecture, operating systems,
distributed systems, Bioinformatics, Machine learning
6 Recent Trands in various distribution functions in mathmatical field 5 10
of computer science for varying fields like bioinformatic, soft
computing, and computer vision

Reference Books:

1. John Vince, Foundation Mathematics for Computer Science, Springer

2. K. Trivedi.Probability and Statistics with Reliability, Queuing, and Computer Science Applications.
Wiley.
3. M. Mitzenmacher and E. Upfal.Probability and Computing: Randomized Algorithms and Probabilistic
Analysis
4. Alan Tucker, Applied Combinatorics, Wiley

Course Outcome:

After learning the course the students should be able to:

 To understand the mathematical fundamentals that is prerequisites for avariety of courses like Data
mining, Network protocols, analysis of Web traffic, Computer security, Software engineering,
Computer architecture, operating systems, distributed systems, Bioinformatics, Machine learning
 To developthe understanding ofthe mathematical and logical basis to many modern techniques in
information technology like machine learning, programming language design, and concurrency
 To study various sampling and classification problems.

List of Experiments:
1. Analyze the concpt of randomization. Implement a program in a language that supports graphics to
Push the balls from left and right allowing random movement and then let them fall in rectangle
bins.Show graphically how they form curve
2. Consider that there are two parties party1 and party2 contesting for elections. Consider candidate
from either party1 or party2. Consider voting population and ask them about their likelihood to vote
for the candidate from party1. Now Ask the population again to show their likelihood for candidate
after candidate gives speech. Now again rate the candidate through voting population. Implement a
program to do this. Use WEKA tool to simulate this.
3. Write a program that takes two inputs- size of the house(no of rooms) and location of the house and
accordingly give price of the house. Classify the house as very costly,costly,affordable,cheap.
4. Consider website of your institute. Represent the link structure by directed graph. Apply and
implement algorithm to traverse the graph and to reach a faculty's web page in your department
5. Graph theory problem – there are k aircrafts and have to be assigned n flights. The time interval of
ith flight is (ti1,ti2). If the time interval overlaps for the flights the same aircraft cannot be assigned
to both the flights.Vertices of the graph are flights.Two vertices are connected if the corresponding
time intervals overlap. Simulate the problem by applying graph theory. Use simulation tool to
simpulate or programming language to implement graph
 Seat No./Enrolment No.___________

GUJARAT TECHNOLOGICAL UNIVERSITY

ME - SEMESTER– 1 • EXAMINATION – SUMMER - 2024

Subject Code:3710214 Date: 20 Jun 2024

Subject Name:Mathematical foundations of Computer Science
Time:02:30 PM TO 05:00 PM Total Marks: 70
Instructions:
1. Attempt all questions.
2. Make suitable assumptions wherever necessary.
3. Figures to the right indicate full marks.
MARKS
Q.1 (a) Assume a random variable X denotes the no of neurons in an 07
experiment on a human brain. If the random variable X takes the
values 1, 2, 3 and 4 such that 2P(X=1)=3P(X=2)=P(X=3)=5P(X=4),
find the probability distribution function and cumulative distribution
function of X.
(b) Discuss the importance of the Central Limit Theorem (CLT) in 07
probability theory. Provide examples of how the CLT is applied in
various fields, including finance or quality control.
Q.2 (a) Compare and contrast the Method of Moments and Maximum 07
Likelihood Estimation as methods for estimating population
parameters. Provide examples where each method is more suitable.
(b) Define a random sample and explain its significance in statistical 07
analysis. Also find out following: A manufacturer of watches has
determined from experience that 3% of the watches he produces are
defective. If a random sample of 300 watches is examined, what is
the probability that, the proportion defective between 0.02 and
0.035.
OR
(b) If two proportions 10% of machine produced by a company A are 07
defective and 5% of machine produced by a company B are
defective. A random sample of 250 machines are taken from
company A and has the random sample of 300 machines from
company B. what is the probability that the difference in sample
proportion is <=0.02?
Q.3 (a) Differentiate between regression and classification problems within 07
multivariate statistical models. Provide examples of each problem
type.
(b) Explain the concept of Soft Computing and its relationship with 07
distribution functions. How are distribution functions integrated into
soft computing techniques for problem-solving?
OR
Q.3 (a) Discuss the notion of overfitting in statistical modeling. How does it 07
affect model assessment and the generalization of results?
(b) Discuss the role of distribution functions in the context of Computer 07
Vision. How do recent trends in Computer Vision leverage
distribution functions for tasks like image processing and object
recognition?
Q.4 (a) Define graph isomorphism and explain the concept of isomorphic 07
graphs. Walk through the principles of graph isomorphism,
highlighting the conditions that determine whether two graphs are
isomorphic or not. Provide a step-by-step example.
1
 (b) Define graph coloring, its relationship to the four-color theorem, and 07
the importance of this theorem in map coloring.
OR
Q.4 (a) Explain the characteristics of planar graphs, the core concept of 07
planarity, and the relationship between Kuratowski's theorem and
planarity.Explain the conditions under which a graph is considered
to be planar and discuss Kuratowski's theorem in detail.
(b) Define Hamiltonian circuits in a graph. Provide an example of a 07
graph with a Hamiltonian circuit and explain its properties.
Q.5 (a) Define data mining and clarify the significance of probability within 07
data mining. Additionally, elucidate the concepts of support and
confidence in the context of data mining.
(b) A Discuss the role of mathematical algorithms and techniques in 07
bioinformatics for tasks like sequence alignment and gene
expression analysis.
OR
Q.5 (a) Discuss the utilization of mathematical models in software 07
engineering, specifically for tasks such as software testing and
quality assurance.
(b) Explain the significance of modular arithmetic in computer security 07
and provide a statement and proof of Fermat's theorem. Additionally,
describe the application of Fermat's theorem in computer security.
************

2
 Seat No.: ________ Enrolment No.___________

GUJARAT TECHNOLOGICAL UNIVERSITY

ME - SEMESTER– 1 • EXAMINATION – WINTER - 2023

Subject Code:3710214 Date: 23 Jan 2024

Subject Name:Mathematical foundations of Computer Science
Time:10:30 AM TO 01:00 PM Total Marks: 70
Instructions:
1. Attempt all questions.
2. Make suitable assumptions wherever necessary.
3. Figures to the right indicate full marks.

Q.1 (a) The length of time, in minutes, that a customer queues in a Post Office is a 07
random variable T ,with probability density function
2
𝑓(𝑡) = {𝑐(81 − 𝑡 ) 0 ≤ 𝑡 ≤ 9
0 𝑂𝑡ℎ𝑒𝑟𝑤𝑖𝑠𝑒
Where c is a constant,
1. Find the value of c.
2. Find cumulative distribution function F(t).
(b) The probability is 0.02 that an item produced by a factory is defective. A 07
shipment of 10,000 items is sent to its warehouse. Find the sum of the expected
number of defective items and the standard deviation.
Q.2 (a) A random variable x has the following probability distribution. 07
X=x -2 -1 0 1 2 3
P(x) 0.1 k 0.2 2k 0.3 k

Find the value of k & calculate mean and variance of x.

(b) Random samples of 400 men and 600 women were asked whether they would 07
like to have a flyover near their residence. 200 men and 325 women were in
favour of the proposal. Test the hypothesis that proportions of men and women
in favour of the proposal are same at 5% level.
OR
(b) The guaranteed average life of a certain type of electric light bulbs is 1000 hours 07
with a standard deviation of 125 hours.It is proposed to sample the output so as
to assure that 90% of the bulbs do not fall short of the guaranteed average by
more than 2.5%. What should be the minimum size of the sample? (The area
under standard normal curve from to is 0.4)
Q.3 (a) Out of 800 families with 5 children each, how many would you expect to have 07
(i) 3 boys
(ii) 5 girls
(iii) Either 2 or 3 boys
Assume equal probabilities for boys and girls.
(b) Define following terms: 07
1. Walk
2. Eular Path
3. Hamilton Path
4. Sub Graph
5. Circuit
6. Complete Graph
7. Planer Graph
OR

1
Q.3 (a) The probability of a man hitting a target is 1/3. 07
(i) If he fires 5 times, What is the probability of his hitting the targer at
least twice?
(ii) How many times must he fire so that the probability of his hitting the
target at least once is more than 90%?
(b) Define Vertex coloring and Region coloring. Determine whether the following 07
graphs are isomorphic. If yes, justify your answer.

Q.4 (a) From the following resuits, obtain the two regression equations and estimate the 07
yield when the rainfall is 29 cm and the rainfall, when the yield is 600 kg:
Yield in kg Rainfall in cm
Mean 508.4 26.7
Standard Deviation 36.8 4.6
The coefficient of correlation between yield and rainfall is 0.52.
(b) Describe each layers of OSI model in computer networks. 07
OR
Q.4 (a) The following data represents rainfall(x) and yield of paddy per hectare (y) in a 07
particular area. Find the linear regression of x on y.
x 113 102 95 120 140 130 125
y 1.8 1.5 1.3 1.9 1.1 2.0 1.7
(b) Describe how mathematics is significant to machine learning. 07
Q.5 (a) Explain Spiral model and Prototype model of software engineering and which 07
model among these two is better? Justify your answer.
(b) Discuss the use of probability distribution in computer vision. 07
OR
Q.5 (a) Discuss the use of probability distribution in Bioinformatics. 07
(b) What is Operating system? Explain any three types of operating system in details. 07

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

2
 Seat No.: ________ Enrolment No.___________

GUJARAT TECHNOLOGICAL UNIVERSITY

ME - SEMESTER– 1 EXAMINATION – SUMMER - 2023

Subject Code:3710214 Date:13 Jul 2023

Subject Name: Mathematical foundations of Computer Science
Time:02:30 PM TO 05:00 PM Total Marks: 70
Instructions:
1. Attempt all questions.
2. Make suitable assumptions wherever necessary.
3. Figures to the right indicate full marks.

Q.1 (a) Answer the following:- 07

1. A man draws 3 balls from an urn containing 5 white and 7 black balls. He gets
Rs. 10 for each white ball and Rs. 5 for each black ball. Find his expectation.
2. In how many ways can a group of eight people be divided into committees,
subject to the constraint that each person must belong to exactly one committee,
and each committee must contain at least two people?
(b) The specifications for a certain kind of ribbon call for a mean breaking strength 07
of 180 pounds. If five pieces of the ribbon(randomly selected from different rolls)
have a mean breaking strength of 169.5 pounds with a standard deviation of 5.7
pounds, test the null hypothesis μ = 180 pounds against the alternative hypothesis
μ < 180 pounds at the 0.01 level of significance. Assume that the population
distribution is normal.
Q.2 (a) Explain regression and classification in details. 07
(b) I. Define the following terms: null-graph, isolated vertex, complete graph, Euler 07
circuit.
II. Define an isomorphism between two graphs. Write the conditions under which
two graphs cannot be isomorphic
OR
(b) Four losses are observed from a Gamma distribution. The observed losses are 07
200, 300, 350 and 450. Find a method of moments estimate for α.
Q.3 (a) I. Show that K5 is nonplanar. 07
II. How many different 8-digit binary sequences are there with six 1s and two 0s?
(b) What is the significance of building a model?Explain the problem of model over- 07
fitting. Howto avoid over-fitting problem?
OR
Q.3 (a) If a person of age 48 years take a loan amount of Rs 142000, classify the 07
probability of person falling in the defaulter class based on the previous
experience.
Age 25 35 45 20 35 52 23 40 60 48 33
Loan 40 60 80 20 120 18 95 62 100 220 150
(thousand)
Defaulter N N N N N N Y Y Y Y Y
(b) Use the following data to find the multiple linear regression 07
y = a0 + a1 x1 + a2x2 using least square method.
Y 5 10 9 0 3 27
X1: 0 2 2.5 1 4 7
X2; 0 1 2 3 6 2
Q.4 (a) Solve the following crime problem with graph theory: 07

1
 4 people named as A B C and D are being investigated. Only one person is telling
the
truth. From the statements of these 4 find out who is the thief.
1) A says “ I ‘m not the thief”
2) B says “ A is the thief”
3) C says “ I ‘m not the thief”
4) D says “ B is the thief”.
(b) What is the role of Modular arithmetic in Computer security? State and prove 07
Fermat’s theorem and it’s application in Computer security
OR
Q.4 (a) Find the value of c and CDF of x if a Random variable X has the PDF f(x) given 07
by
f(x) = cx, x>0
0, x<=0
(b) List and explain the metrics to evaluate Machine Learning Application 07
algorithms
Q.5 (a) Write a short note on mathematics used in computer architecture 07
(b) Write a short note on computer vision. List mathematics used in computer vision. 07
OR
Q.5 (a) Explain application of mathematics in the field of software engineering 07
(b) Write a short note on mathematical tools of Soft Computing. 07

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

2
 Seat No.: ________ Enrolment No.___________

GUJARAT TECHNOLOGICAL UNIVERSITY

ME - SEMESTER– 1 (NEW) • EXAMINATION – WINTER - 2022

Subject Code: 3710214 Date: 23 Feb 2023

Subject Name: Mathematical foundations of Computer Science
Time:10:30 AM TO 01:00 PM Total Marks: 70
Instructions:
1. Attempt all questions.
2. Make suitable assumptions wherever necessary.
3. Figures to the right indicate full marks.

Q.1 (a) Define the following terms with suitable example. 07

1) Probability Distributions and Probability Mass
2) Cumulative Distribution function
(b) For the case of the thin copper wire, suppose that the number of flaws follows a 07
Poisson distribution with a mean of 2.3 flaws per millimeter. 1) Determine the
probability of exactly two flaws in 1 millimeter of wire. 2) Determine the
probability of 10 flaws in 5 millimeters of wire. 3) Determine the probability of
at least one flaw in 2 millimeters of wire.
Q.2 (a) Suppose that during any hour in a large department store, the average number of 07
shoppers is 448, with a standard deviation of 21 shoppers. What is the
probability that a random sample of 49 different shopping hours will yield a
sample mean between 441 and 446 shoppers? (Take Probability .4901, -.2486
for respective z values -2.33,-0.67)

(b) Each sample of water has a 10% chance of containing a particular organic 07
pollutant. Assume that the samples are independent with regard to the presence
of the pollutant. Find the probability that the next 18 samples,
1) exactly 2 samples contain the pollutant
2) at least 4 samples contain the pollutant
OR
(b) A certain lottery works by picking 6 numbers from 1 to 49. It costs $1.00 to 07
play the lottery, and if you win, you win $2 million after taxes.
1) If you play the lottery once, what are your expected winnings or losses?
2) If you play the lottery every week for 10 years, what are your expected
winnings or losses?
Q.3 (a) What is the significance of building a model? Explain the problem of model 07
over-fitting. How to avoid over-fitting problem?
(b) What is data mining? Explain the role of probability in data mining. 07
Also, explain what is support and confidence in data mining?
OR
Q.3 (a) Write down the steps of PCA algorithm. Explain each step in brief. 07
(b) How mathematical concepts are being used to implement security 07
algorithms? Explain in detail.
Q.4 (a) Explain any three Scheduling algorithm of operating system. 07

1
 (b) Define isomorphism in graph theory. List out several applications of 07
isomorphism. Also prove that the given graphs are isomorphic.

OR
Q.4 (a) Write short notes on how mathematics is useful in computer vision. 07
(b) Define planer graph. List out the properties of Planar Graphs. Prove that 07
complete graph K4 is planar.

Q.5 (a) Explain Permutations with Repetition with the help of example. If there are 4 07
chocolate chips, 2 oatmeal, and 2 double chocolate cookies in a box, in how
many different orders is it possible to eat all of these cookies?
(b) Suppose that a day’s production of 850 manufactured parts contains 50 parts 07
that do not conform to customer requirements. Two parts are selected at
random, without replacement, from the batch. Let the random variable X equal
the number of nonconforming parts in the sample. What is the cumulative
distribution function of X? Also plot the graph of cumulative distribution
function of X.
OR
Q.5 (a) Explain Combination without Repetition with the help of example. In a bucket 07
there are 10 balls, every ball is numbered from 1 to 10, if somebody pulls out 3
of this balls randomly, how many combination of could he take.
(b) Define Hamilton Circuit and Hamilton Path. Describe the role of Hamilton 07
Circuit in computer science with example in brief.

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

2
 Seat No.: ________ Enrolment No.___________

GUJARAT TECHNOLOGICAL UNIVERSITY

ME - SEMESTER– 1 (NEW) • EXAMINATION – SUMMER - 2022

Subject Code:3710214 Date: 26 Jul 2022

Subject Name:Mathematical foundations of Computer Science
Time:02:30 PM TO 05:00 PM Total Marks: 70
Instructions:
1. Attempt all questions.
2. Make suitable assumptions wherever necessary.
3. Figures to the right indicate full marks.

Q.1 (a) A manufacturer of watches has determined from experience that 3% of the watches he 03
produces are defective. If a random sample of 300 watches is examined, what is the
probability that, the proportion defective between 0.02 and 0.035.
(b) Define Isomorphic graph. Are the two graphs given in the figure, is isomorphic? 04

(c) Suppose that X is a discrete random variable with the following probability mass 07
function: where 0 ≤ θ ≤ 1 is a parameter. The following 10 independent observations

were taken from such a distribution: (3,0,2,1,3,2,1,0,2,1). What is the maximum

likelihood estimate of θ.
Q.2 (a) What is Chromatic number? Compute the chromatic number (vertex colouring 07
number) of the following graph. Justify your answer!

Graph G Graph H
(b) Assume a random variable X denotes the no of neurons in an experiment on a human 07
brain. If the random variable X takes the values 1, 2, 3 and 4 such that
2P(X=1)=3P(X=2)=P(X=3)=5P(X=4), find the probability distribution function and
cumulative distribution function of X.
OR
(b) A box contains 4 white and 6 black balls. A man draws 2 balls and is given Rs. 140 for 07
every white ball and Rs.70 for every black ball. What is his expectation?
Q.3 (a) A random variable X has the following probability function : 07

X 0 1 2 3 4
P(x) k 3k 5k 7k 9k

Find :1) The value of k 2) P(X<3) and P(0<X<4) 3) The distribution function of x.
1
 (b) Explain regression and classification in details. 07
OR
Q.3 (a) Use the following data to find the multiple linear regression 07

(b) Explain significance of Mathematics in Machine learning. 07

Q.4 (a) If two proportions 10% of machine produced by a company A are defective and 5% of 07
machine produced by a company B are defective. A random sample of 250 machines
are taken from company A and has the random sample of 300 machines from company
B. what is the probability that the difference in sample proportion is <=0.02?
(b) What is data mining? Explain the role of probability in data mining. Also, explain 07
what is support and confidence in data mining?
OR
Q.4 (a) Explain principal component analysis in brief. 03
(b) Define Hamiltonian path, Hamiltonian cycle and Hamiltonian graph. Show that given 04
graph G has no Hamiltonian cycle but the graph has a Hamiltonian path and draw it.

(c) List and explain the metrics to evaluate Machine Learning Application algorithms 07
Q.5 (a) Write a short note on mathematical tools of Soft Computing. 07
(b) What is the role of Modular arithmetic in Computer security? State and prove 07
Fermat’s theorem and it’s application in Computer security
OR
Q.5 (a) Explain the problem of over fitting model assessment in details. 07
(b) Explain application of mathematics in the field of software engineering. 07

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

2
 GUJARAT TECHNOLOGICAL UNIVERSITY
MASTER OF ENGINEERING SYLLABUS
SUBJECT NAME : RESEARCH METHODOLOGY AND IPR

Semester :1
Category of the Course : MLC
Course Name & Code : Research Methodology and IPR (3710001)

Rationale:
The purpose of this subject is to orient the students to the scientific methodology of research and presenting their
thesis. Research constitutes primarily of literature review, giving critical comments on the literature reviewed and
identifying the gap, problem formulation, modeling in either an analytical or experimental setup, validating the
model and solving the problem you set for yourself.

In the end, the student should be able to present and defend the solution he/she has found, simply and easily.
Communicating the research outcomes is an art wherein, you do not want to either undermine or over emphasize
the content, within the short time limit given for such presentations. The balance of critical technicality and overall
outcomes is the key to an effective presentation. The language, content and articulation should be such as to
convey in a unified manner, the gist of your work.

Course Scheme:
Teaching Scheme Total Credits Assessment Pattern and Marks
Theory Practical Total
L T PR C Marks
ESE (E) PA(M) ESE (V) PA (I)

01 00 02 02 00 00 80 20 100

Course Content:
No of
Unit Course Content
Hours
1 Unit 1: Starting Research 6
Find what is expected of you - Identify specific requirements for evaluation/review and what
constitutes the completion of your work, Find where the source is available, Establish proper
methods for finding the relevant material from the source

Analyse the question - Identify key areas in your field, Determine the nature and extension
of papers that you should read

Identify the gaps - Learn to Critique existing knowledge and how to find the gap

Formulate the Problem Statement - Understand what should be the key aspects of your
problem statement, your problem statement, examples of effective and ineffective Titles

Page 1
 GUJARAT TECHNOLOGICAL UNIVERSITY
MASTER OF ENGINEERING SYLLABUS
SUBJECT NAME : RESEARCH METHODOLOGY AND IPR

Validation - Identify a problem and experimental/theoretical data for comparison with your
model, Learn how to extrapolate/scale data for validation, Find what is the acceptable level
of error and justification thereof
2 Unit 2 Finding Good Literature 6
Decide which sources you will need - Differentiate between journals, conferences, books,
magazines and their quality, Understand how to establish their quality and authenticity

Finding Information - How to conduct effective searches, How to find relevant papers related
to your area of research, How to capture critical information

Identify main ideas in scholarly literature - Understand and identify the bias, theoretical
position and evidence produced

Write notes to organize your ideas - Compare ideas and concepts from different papers
3 Unit 3 Writing and Presenting your Work 7
Effective technical writing - How to write Report, Paper, Developing a Research Proposal,
Format of research proposal

Build your argument - Recognise the importance of emphasizing your point, Distinguish
between your point and the evidence available, Acknowledge the evidence

Review and finalize your work - Know and follow the Process of reviewing and proofreading
your work, Use feedback to improve your work

Check the logistics of your presentation- Identify the key message of your presentation,
Understand the expectations and what will be the key review points

Develop the structure of your presentation - Understand the key components of an oral
presentation, Know the usual structure of a good presentation

Prepare for delivery of your Oral presentation- Rehearse and time your presentation, prepare
to answer questions from the audience: Fundamental concepts should be spoken from
memory as the reviewer will be looking for evidence of your thorough understanding., Read
more than the content you are presenting; keep sources ready on hand for reference
4 Unit 4 Intellectual Property 8
Patents, Designs, Trade and Copyright - Process of Patenting and Development:
Technological research innovation, patenting, development.

International Scenario - International cooperation on Intellectual Property. Procedure for

grants of patents, Patenting under PCT

Page 2
 GUJARAT TECHNOLOGICAL UNIVERSITY
MASTER OF ENGINEERING SYLLABUS
SUBJECT NAME : RESEARCH METHODOLOGY AND IPR

Patent Rights - Scope of Patent Rights. Licensing and transfer of technology. Patent
information and databases. Geographical Indications

New Developments in IPR - Administration of Patent System. New developments in IPR;

IPR of Biological Systems, Computer Software etc. Traditional knowledge Case Studies

Reference Books:
1. Stuart Melville and Wayne Goddard, “Research methodology: an introduction for science & engineering
students”
2. Ranjit Kumar, 2nd Edition, “Research Methodology: A Step by Step Guide for beginners”
3. Halbert, “Resisting Intellectual Property”, Taylor & Francis Ltd,2007.
4. Mayall, “Industrial Design”, McGraw Hill, 1992.
5. Niebel, “Product Design”, McGraw Hill, 1974.
6. Asimov, “Introduction to Design”, Prentice-Hall, 1962.
7. Robert P. Merges, Peter S. Menell, Mark A. Lemley, “ Intellectual Property in New Technological Age”,
2016.
8. T. Ramappa, “Intellectual Property Rights Under WTO”, S. Chand, 2008

Page 3
 GUJARAT TECHNOLOGICAL UNIVERSITY
MASTER OF ENGINEERING SYLLABUS
SUBJECT NAME : RESEARCH METHODOLOGY AND IPR

Course Outcome:
After completion of the course, students will be able:
No Course Outcomes RBT Level*

01 To infer technical research documents along with various ethical aspects of research. UN

02 To determine the research gap by reviewing existing research work. AN

03 To select different research methodologies for technical research work. AP

04 To write and present a significant technical report/document. AP

05 To critique research work in the form of patent and copyright. EL

*RM: Remember, UN: Understand, AP: Apply, AN: Analyze, EL: Evaluate, CR: Create

List of Laboratory/Learning Resources Required:

 List of Open Source Tools/Simulator
a. LaTeX
b. Overleaf
 List of Useful websites/MOOCs

Page 4