Sem 6 Question Papers
Sem 6 Question Papers
Q. Sub. co
Question Marks Mapp BL Pl
No. Q.
in_g
1 Solve any two
a Describe various phases of Compiler. C03 1,2 2.3.1
Differentiate between System program and Application program
b cot 1,2 1.1.4
'B~ E,
b
5~ cs) l£ 5 C04 3 4.4.2
I
.-
V
fGHAACA
FOUlflATKlN
GHARDA INSTITUT EOFTECH NOLOGY
Departmen t of Computer Engineerin g
Second Sessionnl Exnminntion -2022-23 (Even Sem)
GIT/: ~
Subject:
System Programming & Compiler Construction
Sem: ' Date:20/04/2 023
VI
Year: Time: 11 TO 12.00
TE Max Marks: 20
Q. Sub. co
No. Q. Question Marks Mapp PO
1 ing
Solve any two
.> Explain various functions ofloader.
CO2 2
y What are different features of macro?
CO2 2
10
C Write a short note on macro expansion. C03 2
OR
Sub
Q.
.Q.N Question
No.
0
Markii co PO
,,,;a How does PGP achieve confidentiality and authentication In emails? 10 C03 POl,3,5
Explain IPsec Authentication Header and Encapsulating Security
b
Payload?
to C03 POl,3,5
l
J?!! Gm:
GHARDA INSTITUTE OF TECHNOLOGY
Computer Engineering
First Sessional Examination-2022-23 (IA-I-FH-2023)
Subject: Mobile Computine Date 3 March2023
Sem: VI Time 1 3 PMto4pm
Class TE Max Marks: I 120 I
I
Q.
No.
1
Sub.
Q.N
0
Questions
10
a Compare 3G & 4G 5 cos L2 10.1.1
b What is mobile computing ? 5 CO2 Ll 10.1.2
C Draw & explain Electromagnetic spectrum for communication · 5 COl L2 1.4.1
d Enlist the characteristics of SIM(Subscriber Identity Module) 5 CO3 i:.1 8.1.1
2 Attempt any~ s
a What is frequency reuse concept in cellular communication ? 5 COl L3 1.3.1
OR
3 Attempt any~ 5 I I
a Discuss multiplexing in wireless communication ) 5 jco1I L6 I 1.3.1
OR
Sub.
Q.
No.
Q.N Questions Marks co PO
0
2 Attempt any~ s
a How is power management utilized in an 802.11 infrastructure
network to optimize energy consumption and extend the battery life of 5 C04 P02
w ireless devices?
~' Expla in the 4G LTE architecture with neat diagram. 5 cos POlO
-..,.
3 Attempt any~ s
a Analyze the Bluetooth architecture and Its layered protocol stack,
outlining the specific functions and Interactions of each layer, as well s C04 P02
as the overall system design and how It facilitates communication
between Bluetooth-enabled devices .
OR
I.; Discuss how tunneling works for mobile IP uslnl! IP In IP Encaosulation. s CO2 POlO
GHAR□A GHARDA INSTITUTE OF TECHNOLOG Y
FOUNDATION Department of Computer Engineering GIT/E :
First Scssionnl Examination-202 2-23 (Even Sem)
b Summarize properties of task enviroment with the help of example 5 COl P02
a Apply RBFS algorithm to find the path from Arad to Bucharest 5 CO2 POS
UK
b Apply A* algorithm to find the path from Arad to Bucharest 5 CO2 POS
I Subject:
Sem:
Class (Year):
Artificial lntellil!ence
VI
TE Computer
Date: 19-04-2023
Time: 11.00-12.00
Max Marks: 20
b Elaborate phases ofNLP? Explain Steps to build an NLP pipeline. s cos P03
Illustrate with example Bayes' rule and its use. Also explain
C
semantics of Bayesian network.
s cos P03
OR
b Differentiate between STRIPS and AOL s cos POS
OR
Create the partial order plan for the following blocks-world
b s C04 POS
problem(fig 1).
C 8
S~ssionnl I ExamlnaUon-2022-23
-
S1 bject:
Son:
ta 'JJ
Internet of Things
VI
TE
Date:4/ 03/ 23
nme:11 TO 12
Max Marks: 20
" Q. Sub.
No. [Link]
Question Marks co BL Pl
OR
B Define smut object and list the different trends in smart objt--cts in brief. 5 CO2 LI 2.2.2
OR
C Write a short note on oneM2M IoT Architecture. i 5 COi L2 1.3.1
I
2 Attempt any one 5
A Compare Edge, Fog and Cloud computing. 5 COi u 2.2.4
OR l
~
✓
,
/
✓ GUAllDA INSTITUTE OF TECHNOLOGY
Name of Department-COMPUTER
Sessional II Examination-2022-23
Internet of Things Date:21/04/23
GIT •n~=
'Gffii!CA
r'°1.W.!Aif
/ VI Time:11 TO 12
,ear) TE Max Marks: 20
'-
Sub.
[Link]
Question Marks co BL Pl
,, 1 Attempt any Iw.o 5
~ A Explain the Layer I of Core JoT Functional Stack 5 CO2 L2 1.3.l
OR
B Define SCADA and mention in brief about Adapting SCADA for IP. 5 CO2 LI 2.2.2
OR
C Write a short note on generic web-based protocols. 5 COi u 1.3.l
2 Attempt any one 5
A Compare COAP and MQTT. 5 COi IA 2.2.4
OR
B Explain in brief the different categories ofloT application protocols. 5 CO2 L5 3.2.1
3 Attempt any one 5
A Discuss the specifications of BeagleboneBlack. 5 CO2 L6 5.4.l
OR
B Make use of an [Link] to explain Domain Specific IoT:Home Automation. 5 COi L3 2.1.1
PnpH I s_ul>jl•ct Code: 89281 / Systl'll1 Progrn111111ing ,~ Compiler Construction
I•
. l,
Q.2. A. Construct SLR parser fo r the fo llowi ng grammar and parse the input 10
..<)< r: s - <S)s IE.
8. State and explain with examples, different types of statements used in Ill
assemblers with respect to system programming.
A. Explain the concept of basic blocks and flow graph with example the 10
Q.3.
three-address code.
8. Ex plain with help or a llowcharl , the first pass of two-pass macro 10
processor.
_.PA. A. Explain the phases of a ·compiler. Discuss the uccion taken in various JO
phases to compile the statement:
a=b* c+IO, where. a, b, c arc of type real.
Write short note on: lO
8.
(i ) Synta x-directed Translati on. (ii) Macro facilities
What is code optimiza tion? Ex plain with example. the following code 10
A.
optimiza tion techniques:
(i) Common sub-expression elimination (ii)Codc motion
(iii) Dead code eliminati on (iv)Constant prop:igation
in suitable example. 10
8. Explain Direct Linking Loader
It)
A. Test whether fo llowing grammar is LL( I) or not. Ir it is LL( I). cnnstrul!I
parsi ng table for th\! same:
S ➔ I A B )c
A ➔ I ACIOC
O ➔ OS
C➔ I
B. Draw and explain thl! flowdrnrt or Pass-I or two pass assl!mbk:r with 10
sui tabll! exarnp h.:.
27651 Puge I of I
_ a Eab..n x- the stq)S of key ~ using the RSA algorithm. In RSA system the [ I OJ
'('Uh:~ 'L:cy tE. 1'.1) of use A is defined as (7, 187). Calculate Cl>(N) and private key 'D'.
\\[Link] is the cipher re..xt for M=IO using the public key.
./l a "~ are digiw <X:rtificates and signatures required? What is the role of digital signature [IO]
a d:pul <X:rtificatcs'? Explain any one digital signature algorithm.
b H.- docs PGP a..::hie\'C confidentiality and authentication in emails? [IO]
5 a State dlC rules for finding Euler's phi function. Calculate [IO]
a. rq,(JJ )
b. rq>(49)
c.. (p(240)
b [Link] "-'.crbcros. \\by is it [Link] as SSO? [ l O]
6 a Enlist ~ vanous functions of the different protocols of SSL. Explain the phases of [ l OJ
~ [Link]
b H-,. tS adue\'cd in Tnnspon and Tunnel modes oflPSEC'? Explain the role of
socuril) [10)
AH and ESP.
18998 Page I of I
5)..\INS:49f~018R798C3D8'.!4B8D329B7
Paper/ Subject Code: 8'J28J / Mobile Computing
Duration: Jhrs
fMu Mark,:HOJ
2 a Explain in short different algorithm used for authentication and privacy in GSM. (101
b What is the use of different interfaces used in global system for mobile (101 '
communication (GSM) with diagram? i'
I
3 a Explain hidden station and exposed station problem with solution in WLAN. (10)
b How is packet delivery achieved to and from mobile node? (10)
4 a Explain snooping TCP and mobile TCP with their merits and demerits. (101
b Explain the process of registration in Mobile IP. (101
2H390 Page 1 of 1
76D2All24AC49F0116A5047F4D6AA09EB8
Paper/ Subject Code: 89284 / Artificial Intelligence
MIN
~
H
D ~ F
Go, ., GGoo
MAX '\
K L M N 0 p Q R s T u V w X y z a
Q3)
a) Consider the following statements: [10]
a) All people who arc earning are happy
b) All happy people smile
c) Someone is earning
Perform the following tasks:
i) Represent above statements in FOL
ii) Conven each to CNF
iii) Prove that someone is smiling using resolution technique. Draw the resolution tree
b) What do you understand by forward chaining and backward chaining. Explain in detail
[ 10]
26341 Page 1 of 3
Q.4
a) For the given graph, the table below indicntcs the path costs and the heuristic values. S is the
start node and GI , G2 nnd G3 arc the goal nodes. Perform A• search to find the shortest distance
path from S to any of the goal nodes. [JO]
cp
0
/ ·
Edge Cost Edge Cost Edge Cost
SA 5 BA 2 DS 1
SB 9 BC 1 DC 2
SD 6 cs 6 DE 2
AB 3 CG2 5 EG3 7
AGl 9 CF 7 FD 2
FG3 8
b) What is planning in AJ? Discuss partial order planning and hierarchical planning in detail [IO]
26341 Page 2 of 3
(20)
~ Write short notes on :
~pplications of AI
~imulated annealing
26341 Page 3 of 3
Time: 3 hours
Instructions:
I) Solw :my FOUR questions .
2) All qu~t ion carrks equal marks .
.3) Figun.-s to l~ right indicate foll marks.
4) Assume suitable additional data. if necessary nnd clearly state ii.
•••••••••••
27003