Sem7 Second Sessional
Sem7 Second Sessional
FACULTY OF TECHNOLOGY
SECOND SESSIONAL
SUBJECT: (CE 701)ARTIFICIAL INTELLIGENCE
Examination B.Tech Semester VII Seat No.
:Monday
Date :04-09-2023 Day
Time :2.30 to 3.45 PM Max. Marks :36
INSTRUCTIONS:
1 Figures to the right indicate maximum marks for that question.
2 The symbols used carry their usual meanings.
3 Assume suitable data, if required & mention them clearly.
4 Draw neat sketches wherever necessary.
Do as directed.
|12|
Q.1 121
CO1 N (a) Between Red and Green cut is one more powerful in
pruning than the other? Justify your
answer.
[2]
COI U (b) What is the use of Cut-Fail° combination?
or False, with justification. [2|
CO3 N (c) Abductions eliminates uncertainty or doubt". State True andB.
d, e, f, g} referred to as A
COS A (d) Consider two fuzzy subsets of the set X, X= {a, b, c,B=
[2]
A= {1/a ,0.3/b ,0.2/c ,0.8/d ,0/e, 0.1/f ,0.4/g} and {0.6/a, 0.9/b ,0.1/c,0.3/d ,0.2/e ,1/f
,0/g } B.
Find cardinality and a-cut at 0.2 for A and o. (2)
COs A (e) Let R and S be two fuzzy relations defined as o.4
0.7 0.5 1 0.6 0.2 7
R= S= 0.5
0,4 J 0.7
x,1 0.8
elements
Calculate resulting relation T = Ro S, which relates elements of universe x to the
of universe z using max-min composition.
CO6 R () In alpha-beta pruning algorithm, for each node, the maximum alpha value for all its [21
max node is stored as alpha. An alpha value is the maximum value found so far in the
max node's
(i) min, descendants, ancestors
(ii) maX, descendants, descendants
(iii) min, ancestors, ancestors
(iv) min, ancestors, descendants
(V) max, ancestors, descendants
Page 1 of 2
CO2 C (a) Find a path as [6]
follows. Showusing 'A' to a goal state G. Details are
A* algorithm from a start state
all necessary steps.
Actual Cost Estimated Cost
Start Next Cost State Cost
A B 3 A 3
9
A D C 4 ABEF = 8t2t
2 D
2
9 F 2
ABFD - 3+}+ | t
D F
AGFDG =3+|++
D G
CO6 C (b) Apply alpha-beta cut-off on the game tree. Assume that the first player is the
player. maximizing [6)
1) Showthe branches of the tree which are pruned away.
2) Show the value of alpha-beta at every node in the tree.
17 -11 14 13
119192135
DHARMSINH DESAI UNIVE
FACULTY OF TECHNOLOGY
SECOND SESSIONAL
Examination :B.Tech Semester VII SUBJECT: (CE -714) Image Processing
Date Seat No.
Time :05-09-2023 :Tuesday
: 02:30 PM To 03:45 PM Day
Max, Marks :36
INSTRUCTIONS:
1
Figures to the right indicate
2 The symbols used carry theirmaximum marks for that question.
usual meanings.
3
Assume suitable data, if required & mention them
4 Draw neat sketches wherever clearly.
necessary
Q.1 Do as directed.
|12|
CO2 A (a) Why no function of finite duration can be band
CO1 N (b) limited? Justify [2)
Describe Hystresis (Double) Thresholding. [2]
CO1 R (c) How does aliasing happen in images?
Differentiate between spatial and temporal [2
aliasing.
CO1 U (d) Explain the cause of ringing effect in Ideal Low pass
CO1 E (e) Consider a 3 x 3 image (fig 1) and a 3 x 3 Filters. [2
mask (fig 2). Find the response value at [21
the center pixel of the image. -1 -1 | 2
0 1
1
-1 |2 -1
2 -1 -1
1
CO2 A (f) Prove the validity of Translation property in
FT pair given by (2]
fa,y)ej2n(orN
F(u - uo, V- Vo)
Q.2 Attempt Any TWO from the following questions.
CO1 C (a) Suppose F(u) is the fourier transform of the
|12]
of reconstructing the original function f (t) sampled dataf (t). Give the derivation (6]
derived result.
from its set of sämples. Also analyze the
[Hint: F(u) = H(u)F(u) find f(t)]
COI E (b) List and explain High Pass Filters in
CO1 E (c) frequency Domain. [6]
What is LoG operator? Derive the function for LoG operator. [2]
What should be the size of Gaussian Filter mask n xn in Marr-Hildreth edge [2
detection algorithm and why?
iii. Why LoG operator has been chosen for Marr-Hildreth edge detection [21
algorithm?
Q.3 Attempt the following. [12|
CO2 E (a) Consider a sequence f (x) given by f (x) = (-2, 2, -4, 4} for x = 0, 1, 2, 3 (06]
respectively. Calculate DFT of the given sequence.
CO1 E (b) i. Justify the statement: "Median filter is effective tool to minimize salt and pepper 031
noise" using 3x3 median filter for following segment of the image. Don't consider
the padding.
24 22 33 25 32 24
34 255 24 0 26 23
23 21 32 31 28 26
ii. Prove the duality principle of Erosion and Dilation.
(03]
OR
Q.3 Attempt the following. [12}
CO2 U (a) Consider a sequence of F(u) given by F (u) = {11, -3 +2j. -(1+0j), -(3+2)}for u= 0, 06
1,2,3 respectively. Calculate IDFT of the given sequence.
CO1 E (b) Given an input image of size 7x 7 shown below, was filtered using 3 x 3 adaptive |06
median filter with maximum allowed size of 5x 5. What are the values of the pixels
x, y and z in the output image?
33330
|3 000003
3400443 Adaptivc Mcdian
77O03 Filer
3316
3|0433|53
343|3|004
Figia)
Fig (b)
B44e 1 t1
VD
Examination
DHARMSINH DESAI UNIVERSITY, NADIAD
FACULTY OF TECHNOLOGY
SECOND SESSIONAL
SUBJECT: (CE725) BIG DATA ANALYTICS
Date :B.Tech Semester VII Seat No. CEo?3
Time :06-09-2023 Day
:2:30 P.M. to 3:45P.M. :Wednesday
Max. Marks :36
INSTRUCTIONS:
1
Figures the right indicate maximum marks for that
to
question.
2. The symbols used carry their usual
3 Assume suitable data, if required &meanings.
mention them clearly.
4 Draw neat sketches wherever necessary.
Q.1 Do as directed.
CO4 R (a) Cassandra coordinator node is trying to read the data from the node A,B,C. How [12}
2]
does cassandra ensure 100% consistency of data?
CO4 U (b) State True or False.Schema on Read uses ETL while schema on Write
uses ELT. |2|
Justify your answer.
C04 R (c) Differentiate NoSQL vs NewSQL. [2)
CO6 A (d) Determine BSON document size limit and examine the default size of Chunks in (2]
GridFS (MongoDB) over this limitation.
CO6 C (e) Design MongoDB aggregation pipeline query for the table as shown in Figure 1. [2j
to calculate the total order quantity of medium size pizzas grouped by pizza
name.
CO6 C () Develop MongoDB Aggregation MapReduce query (for the data given in Figure (2!
3.) with map,reduce,query and output functions to find the sum of salary of all
employees with the same firstName where salary < 5000.
Q.2 Attempt Any TWWOfrom the following:
CO3 N (a) [12}
1. Which ideology has led Apache Maven not to have any command like mvn 3
run" or "mvn execute" for execution of application? What is the purpose of
Archetypes supported by Maven? How to use Apache Mahout with a Maven
based java project?
2. Illustrate technical connection between Machine Learning (ML) and Big Data [3:
Analytics with examples. How can supervised machine learning labeling
processes for Big Data be handled wisefully?
CO6 E (b) Support the development of sorting needs from standalone local dataset to [6]
database to distributed storage handling Big Data volume. What is the Terasort
challenge? Summarize in detail functionality of terasort.
COS A (c) Demonstrate Apache Hadoop muti nodes cluster setup and monitoring steps 6)
with required configuration and commands.
Page
II. Select * from timeline where posted by='minesh;
II. Update timeline set posted by=dhyana' where posted month=3
AND posted time=2018-04-26T12:59:38.2262';
2.Consider the following table created in Cassandra using the following CQL. (2]
CREATE TABLE popular count ( id int PRIMARY KEY, popularity
counter);
Write a cassandra query to load the data into the popularity column. []
3.Write a cassandra query such that the data will be automatically removed
from the table after 2 hours.
OR
Q.3 Attempt the following: [12]
C04 E (a) Let suppose there are 8 nodes named(A,B,C,D,E,F,G,H) in the cassandra cluster. (6]
Node G will become the coordinator node to write the data into nodes, answer the
himts. hunds ofl
following.
The Coordinator receives the request to write the data into node A,B and
C. While writing the data to node B ,it goes down. How does Cassandra
solve this problem? Justify your answer.
II. The Coordinator receives the request to write the data into node
H,A,B.while writing the data into nodes data may reside in
commitlog,memtable and sstable.Justify your answer.
CO5 C (b) 1. Consider the following table is created in cassandra using the following query. 3]
Create table item(Item id int,Item name text,Rating set<float>,PRIMARY
KEY Item id);
What willbe output of following queries which will be executed in a sequence
I Insert into item(Item_id,Item_name,Ratings)
values(101,'iphone',(5.0,2.3, 1.5,2.3, 1.0})
Update item set Ratings=(2.3,1.0,2.0,5.0,1.0} where Item id-101;
III Update item set Ratings-Ratings -{2.3} where Item id-101
2. Consider the table Employee as shown below that already exists in [2]
cassandra. Write a Cassandra query to insert one more record for emp
name=lisa' in table employee.
Emp_id Emp_name
550e8400-e29b-4l d4-a716-446655440000 john
3. Write a query to create a keyspace named 'mykeyspace' which stores 2 copies []
of data in datacenter DC1 and other 2 copies in datacenter 2.
Figure 1 Figure 2
ID PizzaName Size Price userid posted posted time body posted
month by
Pepperoni Small 19
5 2022-03-01 My ritu
1 PepperoniMedium 20 15:30:00* post
Page 2 of 2
DHARMSINH DESAI UNIVERSITY, NADIAD
FACULTY OF TECHNOLOGY
B.TECH. SEMESTER VII [CE]
SUBJECT:(CE-718) COMPILER CONSTRUCTION
Examination
Date
:Second Sessional Seat No
:08/09/2023 Day
Time :02:30 PM to 03:45 PM :Friday
Max. Marks :36
INSTRUCTIONS:
1. Figures to the right indicate maximum marks for that
2 The symbols used carry their usual question.
3 meanings.
Assume suitable data, if required & mention them clearly.
4. Draw neat sketches wherever
necessary.
Q.1 Do as directed.
CO1-N a) Why is Regular Grammar not suitable for |12]
CO2-A Syntax Analysis ? 2
b) Is the below given grammar LL(1) ?
2
S+aAa ^
A’abS ^
CO2-R c) Which methods are used to recover
from the errors in LL(1) Parsing ? 2
CO3-U d) What is static storage atlocation? Which
criteria should be met to apply this storage 2
allocation strategy?
CO3-E e) Construct the dominator tree for the CFG in Fig. A. B0 is the starting node. 2
CO3-R f) Drawa typical activation record structure.
2
Fage 1 2.
3 8
4
CO2-A b) Resolve ambiguities present in the given CFG and convert it into LL)
S’aAb| aAA|aB | bbA
A’aAb|ab
B’bBal ba
OR
B1 s=0 B1
i=0
Bz B5 n=10
Bo B: B2
t1=a-b
B1 if t1==0 goto B4
B3
B4
B3
BA t2=j*4
S=s+i
S=s+t2
Fig. A
program MAIN; i=i+1
procedure A;
t3=n-i
procedure B;
procedure C; if t3 [=0 goto B2B5
begin D; end
begin C; end
procedure D; t4=a-b B6
begin B; end
begin B; end
begin A; end
Fig. B Fig. C
2 3
pige