(Please write your Enrollment Number) Enrollment No. 0 2. o c, \ I ~2-o 2.

"L

End-Term Examination
(CBCS) (SUBJECTIVE TYPE) (Offline)
Course Name:< B.Tech (ECE-AI) >, Semester:< Ill >
(November-December, 2023)

Subject Code: BAI 205 Subject: Neural Networks and Artlflclal

Intelligence
Time :3 Hours Maximum Marks :60
I Note:Q.1 ls compulsory. Attempt one question each from the Units I, II, Ill & IV. I
/
)rt (2.5*8=20)
W' Discuss the issues/ challenges in design of intelligent search algorithms.
-~ Explain the process of decision making using utility functions.
~y What are the problem characteristics you need to consider while
A choosing a search technique to solve the problem ?
j<f5 Explain Greedy search Technique for problem solving.
yr What are the limitations of Predicate logic as a tool for Knowledge
representation?
(ty . Explain the concept of 'Conflict Resolution' in Al with example.
¥ Explain, what is the significance of Neural Networks in Artificial
Intelligence. '

V What is the significance of Mathematical models of neuron in NN, list

their names also.

,,t1NIT-I
Q2 (i) How Al handles reasoning under uncertainty. Explain with (5,5)
example.
(ii) Explain architecture of Expert System. Give its application
/' areas.
~ Y1 Discuss the expert system in domain of medicine using (5,5)
suitable case study.

~ Explain the concept of planning with state space

search with an suitable e~ample.
)JNIT-11
Q4 (i) what is meant by "knowledge based system' ? Describe (5,5)
the basic components of knowledge based system also
' mention its levels.
(ii) Using constraint satisfaction procedure solve the
following crypt-arithmetic problem :
CROSS
+ROADS
-----------------
~
DANGER
)6
7' Explain various approaches and properties of
knowledge presentation. Mention various techniques
of knowledg~ representation.
(5,5}

~
What are the heuristics and what Is their importance?
Describe their types with the h~ of examples.
AJNIT-111
/
(5,5)
~ jf1 Discuss the role of reasoning in Al. How predicate logic
is used to represent knowledge In Al systems.
_)U(What is Conceptual Dependency as a knowledge
representation technique ? Give conceptual

Page 1 of 2

J
'
dependency presentation for
the sentence ' I gave
book to Ram'.
Q7 (i) Express 'A car without whe
els is not valuable' in
predicate logic. (5,5)
(ii} Define semantic Net, disc
uss its advantages &
disadvantages. Construct par
titioned semantic net
representation for the senten
ce "God help those
who help themselves".
/ _/
,/

.,A'.tNIT-IV
~ J5 Differentiate between
Supervised . & Unsupervis
earning with suitable examp ed (5,5}
le and diagram (if required).
~ Exp lain, how Back Propagation Algorithm
works in
neural networks and its sign
Q9 ificance in Al.
(i) Discuss the differe
nt Learning Rules and their
respective function. Also exp (5,5}
lain their competitive learnin
paradigms. g
(ii) Define Perceptron, its wo
rking in NN. Discuss
different types of perceptron
and their limitations
with example

--

12r-J ,-.;o v •
Page 2 of 2 S?

I
 (Please writ e vour Enrollment Num
ber) Enrollment No. 0 2-o O I \ g2...0 2-2_
End-Term Examination (Regular & Rea
ppear)
(CBCS)(SUBJECTIVE TYPE)(Offllne)
Course Name:<B.Tech IT/ CSE/ MAE/
ECE/ CSE-Al/ ECE-AI/ DMAM>, Semeste
r:<3rct>
(November-December, 2023)
\ Subject Code: BCS 201 \ Subject: Data Structures
Time :3 Hours
\ Note:Q. 1 Is compulsorv. Attempt Maximum Marks :60
one question each from the Units I,
II, Ill & IV.

Assume that a binary search tree with

1000 unique data Is Implemented using
representation. It is also known that array
the constructed binary search tree
complete binary tree. If the array inde form s a
xes start with Othen find the Index
largest element of the binary search of the 3rd
tree.

Consider the given below Cfunction

mystery and the binary tree :
typedef struct node
{ Int val; struct node *!child, •rchild;
} node;
int mystery (node *p) {
int retval;
if (p==NULL) return O;
else {
retval= p->val + mystery (p-> lchild)
+ mystery (p-> rchild
);
printf ("%d", retval);
return retval;
}}

When mystery is called with a pointer

to the root node of the given binary
will it print? tree, what
What Is the worst-case time complex
ity of inserting N elements Into an emp
list, if the linked list needs to be main ty linked
tained in sorted order? Justify your answ
Consider the queues Ql containing er.
four elements and Q2 containing none
the Initial State in the figure). The only (shown as
operations allowed on these two queu
Enqueue(°' element) and Dequeue es are
(Q). What is the minimum number
operations on Q)Jequired to place of Enqueue
the elements of Ql In Q2 in reverse
as the Final State In the figure) with order (shown
out using any additional storage? Just
ify your
answer.

'd Head
lnlUa l state , Anal atate
a, 1 1 1 2 I 3 I <4 1 a, I I I I
~ .)-I__._-...L___,__. ~• \3 \2 \1 \
/
Head Head

If preorder traversal of a given binary

search tree Is 15, 10. 12, 11, 20, 18, 16,
find the postorder traversal of the same 19 then
binary search tree? Justify your answ
Let G be any connected, weighted, undi er.
rected graph:
i. G has a unique minimum spanning
tree, If no two edges of G have the same
weight.
ii. G has a unique minimum spanning
tree, If for every cut G, there is a uniq
minimum weight edge crossing the cut. ue
•
Which of the above two statements is/ar
e TRUE? Justify your answer
Page 1 of 2

I
 If a binary search tree Tis constructed using N unique elements the prove that the time
complexity of picking an element In T that Is smaller than the maximum element In T Is
8(1) I.e., constant time. Use suitable example to prove/ Justify your answer.

Consider a 13 elements hash table for which f(key)=key mod 13 Is used with Integer
keys. Assuming linear probing Is used for collision resolution, at which location would
the key 103 be inserted, if the keys 661, 182, 24 and 103 are Inserted In that order?
Justify your answer
NIT-I
Q2 (10)
How two dimensional arrays are stored in the memory ? Derive the
formula for accessing two dimensional array if the base address is B,
size of each element is E and the size of array is NxN.

Suggest a strategy to check if a string is palindrome or not. Use suitable (10)

data structure.

Write an algorithm to insert an element into a Doubly Link List at (i) First (10)
position (ii) Last Position and (iii) Nth Position.

QS Write an algorithm to print the middle element of Linked List without (10)
using any integer variables. Do not assume number of nodes is given.
• NIT-Ill
Q6 How quick sort and merge sort are different from each other? Compare (10)
their complexities and discuss about their suitability for the computer
applications.
Construct AVL tree for the following data (10)
21,26,30,9,4,14,28,18,15,10,2,~,7 and show the progress of each step
clearly in the resultant tree.

QS How DFS is different from BFS? Show the DFS and BFS for the given below graph, (10)
starting at Vertex A.

Consider the given below graph and show the minimum spanning tree (10)
using both Prims and Kruskal algorithm.

Page 2 of 2
 (Please write your Enrollment Number) Enrollment No. 02.00 ll8 2-02--2--
End-Term Examination
(CBCS)(SUBJECTIVE TYPE)(Offllne)
B.Tech ECE/ECE-AI lllrd SEM
(November-December, 2023)

I Subject Code: BEC 205 I Subject: Network analysis and synthesis

Time :3 Hours Maximum Marks :60
I Note:Q. 1 is compulsory. Attempt one question each from the Units I, II, Ill & IV. I
Ql ,I
I (2.s•s=20)
(M"Q.erive hybrid parameters in terms. of Z parameter.
v(!>('How do you find Thevinin's resistance?
~ A heater elements draws 20 A when connected to a 230-V line. How long does it
lit' take to consume 60 kJ?
lJetf Differentiate analysis and synthesis and specify their importance with relevant
~xpression.
l.)P{ A series RL circuit has R= 10 KO, L = 10 Mh and C = 1 µF. Find the transfer function
of the circuit.
l)ff" Derive the expression of Maximum power for the network under maximum power
transfer condition.
~ Derive an expression for the decay current in an RC circuit excited by a unit step
voltage. What is the time constant of the circuit?
(j:)y'Discuss Telegan's theorem.
/
/1

A
•¢IT-I
(10)
~ If two circuits X and Y are to be connected in cascade. Give the two port
parameters of the combination with diagram of cascade combination
Using nodal analysis find all branch currents (10)
Q3
for the following circuit

•.,,•,,,''v' l
I

,~~,::.-- j{s
1
~
1111,· f?

111'1\.(
'. -

·1·
.......

,/
.:
. - ..
~ (')

::L!
1'\f-,J'./
--
~::..i.1.~

~
"'" i
UNIT-II
/f
A series RLC circuit with R = 2 ohm, L = 1 H and C = 0.5 Farad with the (10)
~ applied voltage V {t) = sin t. Find i {t) if the switch is closed at t= 0. Use
Laplace transform method.
A voltage pulse of magnitude 8 Volts and duration 2 seconds extending (10)
QS
from t=2 seconds to t=4 seconds is applied to a series Rl circuit. Obtain
the expression for the current i{t).
J}NIT-111
(10)
~

I~ Explain Hybrid and Transmission parameters with examples.

Explain the concept of interconnection of Two-Port networks. Show that {10)
Q7
H=Ha + Hb for two Two-Port networks, when these are connected in
series-parallel connection. /

;tlNIT-IV
(10)
QS How is a physical network realized by considering the driving point
~
admittance function. Discuss.
Find the first and second Cauer forms of LC networks for the given driving {10)
~ point impedance function
3
Z(s) = (s 4 + 10s2 + 9) / (s +4s)
(Please write your Enrollment Number) Enrollment No. 0 2-0 0 l J g 2.022...

End-Term Examination
(CBCS)(SUBJECTIVE TYPE)(Offllne)
Course Name:<B. Tech CSE/IT/MAE/ECE/DMAM /ECE-AI >, Semester:<3rd::it
(November-Decem ber, 2023)

I
Subject Code: BIT 201 ISubject: DBMS
Time :3 Hours Maximum t,iarks ;60

Note:Q. 1 is compulsory. Attempt one question each from the Units I, II, Ill & IV.

~ (4*5=2p)

.J(oefine database management system and what are it's various

applications? What are the different anomalies in designing a database?

,9¥What is atomicity of a transaction? Explain with example.

.What are the various functionalities of a typical database management

Asystem?
i(

• j ) What do you understand by conflict serializability? Explain with the h~lp

of an example.

/NIT-I

Q2 List and explain various data models used for database design. (10)

y What is Entity set and also define Relationship set. List and explain the
symbols used to draw ER Diagram.
{10)

/NIT-II

Q4 Write SQL Queries for following set of tables: (10)

EMPLOYEE (EmpNo, Name, DoB, Address, Gender,
..
Salary, DNumber)
DEPARTMENT (DNumber, Dname, ManagerEmpNo,
M nagerStartDate ).
i) Display the Age of 'male 'employees.
ii) Display all employees in Department named
'Marketing'.
I

iii) Display the name of highest salary paid 'female

employee.
iv) Which employee is oldest manger in company?
v) Display the name of department of the employee
'SMITH'.
 /
,rs Create the E-R diagram for a university database and
stepwise convert it {10)
into a relational database using the mapping algorithm
.
.,.

~-Ill
Q6 Normalize following relation up to 3NF:
{10)
Bank(acno, cust_name, ac_type, bat, int_rate, cust_c
ity, branchld,
bra nch_nm, br_city)

C. V What do you understand by functional dependencies?

R( A, B, C, D) and Functional Dependency set FD= { AB
Given a relation
➔ CD, B ➔ C },
{10)

determine wheth er the given R is in 2NF? If not conve

rt it into 2 NF.

~IT- IV
QS List and explain the various issues while
transactions are running {10)
concurrently in DBMS.

~ Explain Concurrency contro l with locking methods.

{10)
 (Please writ e you r Enrollment Num
-
ber) Enrollment No. 0 Z. 0 0 I I 8 2 02,. 2-
End-Term Examination (Regular & Rea
ppear)
{CBCS){SUBJECTIVE TYPE){Offllne)
Course Name:<B.Tech ECE Al>, Sem
ester:<3>
(November-December, 2023)

ISubject Code: BEC 211 ISubject: Communication Systems

Time :3 Hours
I Note :Q.1 1s compulsory. Atte mpt
one question each from the Units
Max imum Marks :60
I, II, Ill & IV. I
~ .
y Find the standard deviation of X serie
two series X and Y is 0.35 and thei
I (2.5*8=20)
s, if coefficient of correlation betw
r covariance in 10.5 and variance of
een
is 56.25. Y series
~) The distribution function of a rand
om variable is given by :
f(x) = 1-(l+x)ex;x>0,
Find mean and variance.

l?
,
An AM signal has the outp ut :
X(t) = 10cos(2nx250t)+3cos(2nx21
Determine modulation index and effic
0t)+9cos(2nx180t)
iency.
ifir _ State the limitations of DSB-FC mod
ulation scheme.
M Differentiate between frequency and
phase deviation.
~ Explain Carson's rule.
'uef Demonstrate the PSD and PDF of whit
.~w
, Explain the noise figure mathematical
e gaussian noise.
ly.

tp(iT-1
Q2 Explain random process with ex~
ple of gaussian process and
diffe rent iate between strict sens (10}
e stationary and wide sense
-"' stat iona ry random process.

~ If join t PDF of X,Y is:

(10)
f(x, y) = {~;x > O,y
> O,x + y < 2
0; elsewhere
Find P(X < 1, Y S 1), P(X + Y <
l)an d P(X > 3Y).
, )JNIT-11
1(4 Explain the DSB-SC wave with
its mathematical equation and
dem onst rate the block diagram and
working of its modulators.
LIO)
QS Demonstrate the generation and
detection of VSB-AM with side
band shaping filte r designing. (10)
~

))NIT-Ill
;at, Diffe rent iate between NBFM antf
WBFM using thei r mathematical
~
analysis. (10}
Q7 Briefly explain the following:
(a) Properties of Bessel function (10)
(b} FM Detector with block diagram.

- State the Importance of Pre-Emph

J)MT-IV
ases and De-Emphasis in FM
with thei r block diagram. (10}
Q9 Demonstrate the time domain repr
esentation and properties of
narr ow band noise. {10)