Seat No.: ________ Enrolment No.

___________

GUJARAT TECHNOLOGICAL UNIVERSITY

BE - SEMESTER–VII (NEW) EXAMINATION – WINTER 2023
Subject Code:3170701 Date:04-12-2023
Subject Name: Compiler Design
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.
Simple and non-programmable scientific calculators are allowed
Marks

Q.1 (a) Explain the role of linker, loader and preprocessor in the process of 03
compilation.
(b) Define lexeme, token and pattern. Identify the tokens from the following 04
program segment
void change (int c, int d)
{ int m; m = c; c= d; d = m; }
(c) Explain the phases of compiler with an example. 07

Q.2 (a) Find the Regular Expression corresponding to given statement subset of 03
{0,1}*
1) The Language of all strings containing exactly three 1’s
2) The Language of all strings begins or ends with 00
3) The Language of all strings that contain at least three 1’s

(b) What is Left Recursion? Give an example for eliminating the same 04
(c) Draw DFA for the following regular expression without construction of 07
NFA.
( a | b) * a (a | b)#
OR
(c) Explain recursive-descent parsing with suitable example. 07

Q.3 (a) Explain the stack implementation of shift reduce parser with the help of 03
example.
(b) What is inherited attribute? Explain with suitable example. 04
(c) Check the following grammar is SLR(1) or not 07
S → Aa | bAc | Bc | bBa
A→d
B→d
OR
Q.3 (a) Define the following terms: 03
1) LL(1) Grammar 2) Ambiguous Grammar 3) Operator Grammar

(b) Find out FIRST & FOLLOW set for all the Nonterminals 04
S-> 1AB | ϵ
A-> 1AC | 0C
B-> 0S
C-> 1
(c) Write a syntax directed definition for desk calculator. Using this definition 07
draw annotated parse tree for 6*3+5n

1
Q.4 (a) Explain Activation Record 03
(b) Explain panic mode and phrase level error recovery techniques. 04
(c) Explain quadruple, triple and indirect triple with suitable example. 07
OR
Q.4 (a) Explain flow graph with suitable example. 03
(b) Explain dynamic storage allocation techniques. 04
(c) Explain syntax directed definition to produce three address codes for flow 07
of control statements with suitable example.

Q.5 (a) Draw the parse tree and derive the left most derivation using the following 03
grammar for the input string: (a + a) * (a * a).
E→E+T|T
T→T*F|F
F→(E)|a
(b) Write down the algorithm for partitioning of basic blocks. 04
(c) Explain any four code optimization techniques with suitable example. 07
OR
Q.5 (a) Explain code scheduling constraints. 03
(b) Write short note on LEX. 04
(c) Explain the generic issues in the design of code generators. 07

2
Seat No.: ________ Enrolment No.___________

GUJARAT TECHNOLOGICAL UNIVERSITY

BE - SEMESTER–VII (NEW) EXAMINATION – WINTER 2022
Subject Code:3170701 Date:18-01-2023
Subject Name:Complier Design
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.
4. Simple and non-programmable scientific calculators are allowed.

MARKS

Q.1 (a) What is compiler? What is front-end and back-end of compiler? 03

(b) Write a brief note on input buffering techniques. 04
(c) Explain input, output and action performed by each phases of compiler 07
with example.

Q.2 (a) Define Handle, Handle pruning, Ambiguous grammar. 03

(b) Explain error recovery strategies. 04
(c) Define token, lexeme and pattern. Identify the lexemes that makes up the 07
tokens for the following code
const p = 10;
if( a < p)
{ a++ ;
If(a== 5)
continue ;
}
OR
(c) Construct deterministic finite automata without constructing NFA for 07
following regular expression.
(a/b)*abb*.

Q.3 (a) What is lexical analysis? Which are the tasks performed by lexical 03
analyzer.
(b) Give the rule to remove left recursive grammar. And Eliminate left 04
recursion from following grammar.
S → Aa | b
A → Ac | Sd | f
(c) Show the following grammar is LR(1) but not LALR(1). 07
S->Aa │bAc │Bc│bBa
A->d
B->d
OR
Q.3 (a) Write RE the following language.. 03
1. All string of 0’s and 1’s that do not contain 11.
2. All string of 0’s and 1’s that every 1 is followed by 00
(b) What is left factoring in CFG? Perform the Left factoring of following 04
Grammar.
S → iEtS / iEtSaS / a
E→b

1
 (c) Construct SLR parsing table for the following grammar : 07
S → (L) | a
L→ L,S | S

Q.4 (a) Define : 1) synthesized attribute 2) inherited attribute 03

(b) Construct syntax tree and DAG for following expression: 04
X = a * (b+c)- (b+c)* d
(c) Give syntax directed definition for simple desk calculator. Also show 07
annotated parse tree for 6*5+7n,
OR
Q.4 (a) Write a short note on Symbol table management. 03
(b) Explain dynamic memory allocation strategy. 04
(c) Translate the expression –(a+b)*(c+d)*(a+b*c) into Quadruples, Triples, 07
and Indirect triples

Q.5 (a) Compare: Static v/s Dynamic Memory Allocation. 03

(b) Explain Activation Record. 04
(c) Explain any three code-optimization technique in detail. 07
OR
Q.5 (a) Explain Basic Block and Flow Graph with example. 03
(b) Explain various parameter passing methods. 04
(c) Explain various issues in design of code generator. 07

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

2
Seat No.: ________ Enrolment No.___________

GUJARAT TECHNOLOGICAL UNIVERSITY

BE - SEMESTER–VII (NEW) EXAMINATION – WINTER 2021
Subject Code:3170701 Date:22/12/2021
Subject Name:Complier Design
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.
4. Simple and non-programmable scientific calculators are allowed.
MARKS
Q.1 (a) Define following terms: 03
i. Compiler
ii. Interpreter
iii.Token
(b) Explain activation tree? 04
(c) Explain a rule of Left factoring a grammar and give Example. 07

Q.2 (a) Explain input buffering methods. 03

(b) Define the following terms and give suitable example for it. 04
i. Augmented Grammar
ii. LR(0) Item
iii.LR(1) Item
(c) Draw the DFA for the regular expression (a|b)*abb using set 07
construction method only.
OR
(c) Draw NFA from regular expression using Thomson’s construction and convert 07
it into DFA. (a | b)* a b* a
Q.3 (a) Describe Ambiguous Grammar with example. 03
(b) Design FIRST and FOLLOW set for the following grammar. 04
S→ 1AB | ε
A→1AC | 0C
B→0S
C→1
(c) Explain operator grammar. Generate precedence function table for 07
following grammar.
E -> EAE | id
A -> + | *
OR
Q.3 (a) Differentiate Top Down Parsing and Bottom up parsing 03
(b) Explain error recovery strategies used by parser. 04
(c) Construct CLR parsing table for following grammar. 07
S -> aSA | €
A -> bS | c
Q.4 (a) Explain various issues in design of code generator. 03
(b) Explain the following parameter passing methods. 04
1. Call-by-value
2. Call-by-reference
3. Copy-Restore
4. Call-by-Name
(c) Explain Peephole Optimization. 07
OR
1
Q.4 (a) Draw a DAG for expression: a + a * (b – c) + (b – c) * d. 03
(b) Compare: Static v/s Dynamic Memory Allocation. 04
(c) Translate following arithmetic expression 07
- ( a * b ) + ( c + d ) - ( a + b + c + d ) into
1] Quadruples
2] Triple
3] Indirect Triple
Q.5 (a) Explain symbol table. For what purpose , compiler uses symbol table? 03
(b) Explain Basic-Block Scheduling. 04
(c) Explain synthesized attributes with the help of an example. 07
OR
Q.5 (a) Define a following: 03
i. Basic block
ii. Constant folding
iii. Handle.
(b) Write difference(s) between stack and heap memory allocation. 04
(c) Explain Pass structure of assembler. 07
************

2
 Seat No.: ________ Enrolment No.___________

GUJARAT TECHNOLOGICAL UNIVERSITY

BE- SEMESTER–VII (NEW) EXAMINATION – WINTER 2020
Subject Code:2170701 Date:19/01/2021
Subject Name:Compiler Design
Time:10:30 AM TO 12:30 PM Total Marks: 56
Instructions:
1. Attempt any FOUR questions out of EIGHT questions.
2. Make suitable assumptions wherever necessary.
3. Figures to the right indicate full marks.
MARKS

Q.1 (a) Compare and contrast compilers and interpreters. 03

(b) Write a short note on LEX Tool. 04
(c) Explain phases of compilers with suitable example. 07
Q.2 (a) Define terms: pattern, lexeme, token 03
(b) Write any one method used in lexical analyzer for buffering the input. 04
(c) Construct nondeterministic finite automata by using Thomson’s 07
Construction for following regular expression. Show the sequence of moves
made in processing the input string ababbab.
(a|b)* abb

Q.3 (a) Consider the following grammar to construct leftmost and right most 03
derivation for the sentence abab.

SaSbS|bSaS|ε

(b) Write rule(s) to check grammar is left recursive or not. Remove left 04
recursive from the following grammar.
SaBDh
BBb|c
DEF
Eg| ε
Ff| ε

(c) Construct the SLR parsing table for the following Grammar. 07
E E+T | T
T T*F | F
F (E) | id

Q.4 (a) Write rule(s) to check grammar is operator grammar or not. 03

(b) Explain any two error-recovery strategies. 04
(c) Construct LALR parsing table for the following grammar. 07

S -> CC
C -> cC
C -> d

1
Q.5 (a) Define : 1) synthesized attribute 2) inherited attribute 03
(b) Explain any two parameter passing methods. 04
(c) Write SDD for arithmetic expression and Construct annotated parse tree for 07
the input expression (4*7+1)*2 .

Q.6 (a) What is activation record? 03

(b) What is Intermediate form of the code? What are the advantages of it? 04
(c) Construct syntax directed translation scheme and definition that translate 07
arithmetic operation from infix to postfix in which an operator appears
before its operand as for example xy- is a positive notation for x-y . Give
annotated parse tree for the input 9-5+2 and 9-5*2.

Q.7 (a) Explain any two issues in design of code generator 03

(b) Compare: static v/s dynamic Memory Allocation. 04
(c) Translate the expression –(a+b)*(c+d)+(a+b+c) into 07
1. Quadruples 2. Triples 3. Indirect triples

Q.8 (a) What are the limitations of static storage allocation? 03

(b) Write a short note on Symbol table management. 04
(c) Write any two methods of code-optimization in detail. 07

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

2
Enrolment No./Seat No_____________

GUJARAT TECHNOLOGICAL UNIVERSITY

BE - SEMESTER–VII (NEW) EXAMINATION – SUMMER 2024
Subject Code:3170701 Date:17-05-2024
Subject Name:Compiler Design
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.
4. Simple and non-programmable scientific calculators are allowed.

MARKS
Q.1 (a) State the applications of language processors. 03
(b) Explain input buffering techniques in brief. 04
(c) Explain cousins of compiler in detail. 07
Q.2 (a) Enlist types of compiler. Explain any two in brief. 03
(b) Explain error recovery strategies in brief. 04
(c) Explain construction of DFA from regular expression without making 07
NFA with suitable example.
OR
(c) Explain role of lexical analyzer with example in compiler design process. 07

Q.3 (a) Explain basic block with example. 03

(b) Explain Syntax-Directed Definition with example. 04
(c) Explain LL (1) parsing technique with suitable example. 07
OR
Q.3 (a) Explain quadruple with example. 03
(b) Explain left recursion removal algorithm with example. 04
(c) Explain LR (1) parsing technique with suitable example. 07
Q.4 (a) Give the difference between stack allocation and heap allocation of space. 03
(b) Explain various techniques for intermediate code representation with 04
example.
(c) Explain recursive decent parsing technique with suitable example. 07
OR
Q.4 (a) Compare various parameter passing techniques for run time environment. 03
(b) Explain various techniques used to represent the three-address code with 04
example.
(c) Explain shift-reduce parsing technique with suitable example. 07

Q.5 (a) Write a short note on activation record. 03

(b) Explain basic-block scheduling in brief. 04
(c) Describe various code optimization techniques with example. 07
OR
Q.5 (a) Write a short note on activation tree. 03
(b) Explain code scheduling constraints in brief. 04
(c) Describe various design issues of a code generator. 07
*************

1
Seat No.: ________ Enrolment No.___________

GUJARAT TECHNOLOGICAL UNIVERSITY

BE – SEMESTER- VII EXAMINATION-SUMMER 2023
Subject Code: 3170701 Date: 22/06/2023
Subject Name: Compiler Design
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.
4. Simple and non-programmable scientific calculators are al.

MARKS
Q.1 (a) Define lexemes, patterns and tokens 03
(b) Write a regular definition for: 04
1. The language of all strings containing at least one 0 and at
least one 1.
2. The language of all strings that do not end with 01.
3. The language of all strings containing 0’s and 1’s both are
even.
4. The language of all strings which are starting with 1 and
ending with 0.

(c) Explain phases of compilers with suitable example. 07

Q.2 (a) Differentiate ambiguous and unambiguous grammar. 03
(b) Write a short note on input buffering techniques. 04
(c) Construct a DFA for a given regular expression using syntax tree 07
with firstpos, lastpos and followpos function.
(a|b)*a
OR
(c) Construct the NFA for following regular expression using 07
Thompson’s construction. Apply subset construction method to
convert into DFA.
(a+b)*abb#

Q.3 (a) Give the translation scheme that convert infix to postfix notation. 03
(b) Define: Left Recursive Grammar. Check Following grammar is left 04
recursive or not, if yes, remove left recursive from it.
A → ABd / Aa / a
B → Be / b
(c) Construct an SLR Parsing table for the following grammar. 07
S  Aa | bAc | bBa
Ad
Bd
OR
Q.3 (a) Explain shift reduce parsing technique in brief. 03
(b) Differentiate top down parsing and bottom up parsing. 04
(c) Show that the following grammar 07
S  AaAb | BbBa
Aϵ
Bϵ
is LL(1) but not SLR(1).
1
Q.4 (a) Write a short note on activation record. 03
(b) Explain Symbol table management in brief. 04
(c) List and explain various storage allocation strategies. 07
OR
Q.4 (a) What do you mean by dangling references? 03
(b) Explain Error Recovery Strategies in Compiler in brief. 04
(c) Write three address code for 07
a = b*-c + b*-c

Q.5 (a) Translate the arithmetic expression (a + b) * (c + d) into 03

1. Syntax tree
2. Postfix notation
(b) Compare: Static v/s Dynamic Memory Allocation 04
(c) Explain various code optimization techniques. 07
OR
Q.5 (a) Construct a DAG for the following expression: 03
a = b*-c + b*-c
(b) Explain various parameter passing methods. 04
(c) Explain various issues in design of code generator. 07

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

2
Seat No.: ________ Enrolment No.___________

GUJARAT TECHNOLOGICAL UNIVERSITY

BE - SEMESTER–VII (NEW) EXAMINATION – SUMMER 2022
Subject Code:3170701 Date:16/06/2022
Subject Name:Complier Design
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.
4. Simple and non-programmable scientific calculators are allowed.

MARKS
Q.1 (a) Explain the roles of linker, loader and preprocessor. 03
(b) What is Input Buffering? Why it is used? 04
(c) Explain the language dependent and machine independent phases of 07
compiler. Also List major functions done by compiler.

Q.2 (a) Describe the role of lexical analyzer. 03

(b) Write the regular expression R over {0,1} or {a,b}: 04
1) The set of all strings with even number of a’s followed by an odd
number of b’s.
2) The set of all strings that consist of alternating 0’s and 1’s
(c) Explain activation record in detail. 07
OR
(c) What are conflicts in LR Parser? What are their types? Explain with an 07
example.

Q.3 (a) What do you mean by left recursion and how it is eliminated? 03
(b) What is ambiguous grammar? Show that S -> aS|Sa|a ia an ambiguous 04
grammar.
(c) Consider the following grammar: 07
S’ = S#
S -> ABC
A -> a|bbD
B -> a| Ꜫ
C -> b| Ꜫ
D -> c| Ꜫ
Construct FIRST and FOLLOW for the grammar also design LL(1)
parsing table for the grammar
OR
Q.3 (a) Differentiate between top down parser and bottom up parser. 03
(b) Explain handle and handle pruning 04
(c) Consider the following grammar 07
S -> AA
A -> aA
A -> b
And construct the LALR parsing table.

Q.4 (a) Differentiate between S attributes and L attributes 03

(b) For the following production write the semantic action: 04
1. S -> E$
1
 2. E -> E1 + E2
3. E -> E1 * E2
4. E - > digit
(c) Translate the following expression into quadruple, triple, and indirect 07
triple:
-(a+b)*(c+d)-(a+b+c)
OR
Q.4 (a) Differentiate between parse tree and syntax tree 03
(b) What is dependency graph? Explain with example. 04
(c) Generate the three address code for the following program segment: 07
While(a<c and b>d)
Do if a=1 then c = c+1
Else
While a<=d
Do a= a+b

Q.5 (a) List the issues in code generation. 03

(b) Discuss the functions of error handler. 04
(c) What is DAG? What are its advantages in context of optimization? How 07
does it help in eliminating common sub expression?
OR
Q.5 (a) What is global optimization? Name the 2 types of analysis performed 03
for global optimization.
(b) Explain the following with example 04
1) Lexical phase error
2) Syntactic phase error
(c) What is peephole optimization? Explain with example. 07

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

2
Seat No.: ________ Enrolment No.___________

GUJARAT TECHNOLOGICAL UNIVERSITY

BE - SEMESTER–VII (NEW) EXAMINATION – WINTER 2023
Subject Code:3170722 Date:06-12-2023
Subject Name: Big Data Analytics
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.
4. Simple and non-programmable scientific calculators are allowed.
MARKS

Q.1 (a) Explain various challenges of conventional system. 03

(b) What is big data? Explain four V’s of big data. 04
(c) Discuss structured, unstructured and semi-structured big data types. Give 07
proper examples.
Q.2 (a) Explain name node, data node and secondary node. 03
(b) Explain NoSQL business drivers. 04
(c) Write a short note on Hadoop ecosystem. 07
OR
(c) Explain working of following phases of Map Reduce with one common 07
example.
(i) Map Phase (ii) Combiner Phase
(iii) Shuffle and Sort Phase (iv) Reducer Phase

Q.3 (a) Explain following commands of HDFS with syntax and at least one 03
example of each.
(i) copyFromLocal (ii) mv (iii) cat
(b) Write basic wordcount program using PySPARK. 04
(c) What is transformation and actions in Apache Spark? Discuss various 07
commands available for this activity in Apache Spark?
OR
Q.3 (a) Discuss various benefits of stream processing. 03
(b) What is RDD? Explain role of RDD in Spark. 04
(c) Describe different types of NoSQL databases with the help of example. 07

Q.4 (a) Write differences between NoSQL and SQL. 03

(b) Define Hadoop. List and explain advantages of Hadoop. 04
(c) Explain Bloom’s Filter with the help of example. 07
OR
Q.4 (a) Explain NoSQL base property. 03
(b) Differentiate between Pig vs Hive. 04
(c) Discuss Flajolet-Martin Algorithm to count Distinct elements in a stream 07
with proper example.

Q.5 (a) Describe important features of Apache Spark. 03

(b) Write a short note: Stock Market Predictions 04
(c) Explain working of Hive with proper steps and diagram. 07
OR
Q.5 (a) Explain any three HiveQL DDL command with its syntax and example. 03
(b) How samples are collected from data stream? 04
(c) Discuss four ways that NoSQL system handles big data problems. 07
***********
1
Seat No.: ________ Enrolment No.___________

GUJARAT TECHNOLOGICAL UNIVERSITY

BE - SEMESTER–VII (NEW) EXAMINATION – WINTER 2022
Subject Code:3170722 Date:20-01-2023
Subject Name:Big Data Analytics
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.
4. Simple and non-programmable scientific calculators are allowed.
MARKS
Q.1 (a) What is Big data? Explain sources of big data. 03
(b) Explain types of Big data. 04
(c) Write a short note on Hadoop Architecture. 07

Q.2 (a) Explain usage of Map reduce. 03

(b) Explain methods of Map reduce of Mapper class. 04
(c) Write a short note on HDFS (Hadoop Distributed File System). 07
OR
(c) Define Social networks and Social Network Mining. 07

Q.3 (a) Give difference between SQL and NoSQL. 03

(b) Explain features and advantages of NoSQL. 04
(c) Explain different types of NoSQL. 07
OR
Q.3 (a) Give difference between master-slave model and peer-to-peer model. 03
(b) Give difference between DBMS and DSMS (Data Science Management 04
System).
(c) Explain filtering a stream in detail. 07

Q.4 (a) What is Stock Market Prediction? 03

(b) What is Hbase and Hive? 04
(c) Discuss about How E-Commerce is Using Big Data to Improve Business 07
in detail.
OR
Q.4 (a) Explain 5V's of Big Data. 03
(b) Give list of HBase Commands. 04
(c) What is a Zookeeper? What are the benefits of using a zookeeper? 07

Q.5 (a) Why is big data analytics important? 03

(b) Explain HIVE data types in brief. 04
(c) Explain modules of Hadoop. 07
OR
Q.5 (a) Explain advantages of Big Data Processing. 03
(b) Explain different challenges of Big Data. 04
(c) Explain Spark Architecture. 07

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

1
Seat No.: ________ Enrolment No.___________

GUJARAT TECHNOLOGICAL UNIVERSITY

BE - SEMESTER–VII (NEW) EXAMINATION – WINTER 2021
Subject Code:3170722 Date:23/12/2021
Subject Name:Big Data Analytics
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.
4. Simple and non-programmable scientific calculators are allowed.

MARKS

Q.1 (a) Explain types of Big Data 03

(b) Describe Traditional vs. Big Data business approach. 04
(c) What is Big Data? Explain Challenges of Conventional System. 07

Q.2 (a) Explain basic Components of Analyzing the Data with Hadoop. 03
(b) What is Map Reduce and explain How Map Reduce Works? 04
(c) Brief Anatomy of a Map Reduce Job run and Failures. 07
OR
(c) Describe Map Reduce Types and Formats. 07
Q.3 (a) Explain NoSQL data architecture. 03
(b) Elaborate Key-value stores, Graph stores, Column family stores & 04
Document stores.
(c) Describe analyzing big data with a shared-nothing architecture. 07
OR
Q.3 (a) Difference between master-slave versus peer-to-peer distribution models. 03
(b) What is a big data NoSQL? Explain in details. 04
(c) Which Four ways that NoSQL systems handle big data problems. 07
Q.4 (a) What is Stream Computing and Sampling Data in a Stream. 03
(b) Write the application of RTAP. 04
(c) Explain Stream Data Model and Architecture. 07
OR
Q.4 (a) How Graph Analytics used in Big Data. 03
(b) Write a short note on Decaying Window. 04
(c) Explain with example: How to perform Real Time Sentiment Analysis of 07
any product.
Q.5 (a) What is the use of Pig and Hive in Big Data? 03
(b) Describe data processing operators in Pig. 04
(c) Describe HBase and ZooKeeper in details. 07
OR
Q.5 (a) Explain HIVE services. 03
(b) Write application of writing Spark. 04
(c) Describe any application that you know related to enhance particular 07
business using big data and explain how it is important as a business
prospective.

*******

1
Seat No.: ________ Enrolment No.___________

GUJARAT TECHNOLOGICAL UNIVERSITY

BE - SEMESTER–VII (NEW) EXAMINATION – SUMMER 2022
Subject Code:3170722 Date:18/06/2022
Subject Name:Big Data Analytics
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.
4. Simple and non-programmable scientific calculators are allowed.

Q.1 (a) What is Big data Analytics? List applications of it. 03

(b) Explain 4 V’s of Big data. 04
(c) What is Hadoop? Briefly explain the core components of it. 07

Q.2 (a) How is Big data and Hadoop related? 03

(b) How HDFS is different from traditional NFS? 04
(c) Draw and Explain HDFS architecture. How can you restart 07
NameNode and all the daemons in Hadoop?
OR
(c) What is MapReduce? Explain working of various phases of 07
MapReduce with appropriate example and diagram.
Q.3 (a) What do you mean by job scheduling in Hadoop? List different 03
schedulers in Hadoop.
(b) What are WAL, MemStore, Hfile and Hlog in HBase? 04
(c) Explain the architecture of HBase. 07
OR
Q.3 (a) What is Zookeeper? 03
(b) Differentiate between HIVE and HBASE. 04
(c) What is NoSQL database? List the differences between NoSQL and 07
relational databases. Explain in brief various types of NoSQL
databases in practice.

Q.4 (a) What is Pig? 03

(b) What are the features of MongoDB? 04
(c) Explain the concept of regions in HBase and storing Big data with 07
HBase.
OR
Q.4 (a) How MongoDB is better than SQL database? 03
(b) Explain the Data Model of HBase. 04
(c) Explain Pig data Model in detail and Discuss how it will help for 07
effective data flow.

Q.5 (a) Write a short note on Spark. 03

(b) Write difference between MongoDB and Hadoop. 04
(c) Explain CRUD operations in MongoDB. 07
OR
Q.5 (a) What are the features of MongoDB? 03
(b) Explain Replication and scaling feature of MongoDB. 04
(c) What is RDD? State and Explain RDD operations. 07
***********

1
Seat No.: ________ Enrolment No.___________

GUJARAT TECHNOLOGICAL UNIVERSITY

BE – SEMESTER- VII EXAMINATION-SUMMER 2023
Subject Code: 3170722 Date: 23/06/2023
Subject Name: Big Data Analytics
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.
4. Simple and non-programmable scientific calculators are allowed.

Q.1 (a) List various application of big data. 03

(b) Explain the difference between structure and unstructured data. 04
(c) Define Big Data and also Explain Characteristicis of Big Data. 07

Q.2 (a) List various configuration files used in Hadoop Installation. What is use 03
of mapred.
(b) Explain the difference between structure and unstructured data. 04
(c) Discuss Big Data in Healthcare,Trasportation & Medicine. 07
OR
(c) Discuss Hadoop YARN in detail with failures in classic MapReduce. 07

Q.3 (a) Explain advantages and disadvantages of big data analytics. 03

(b) Discuss role of Data node and Name node in HDFS. 04
(c) Explain working of Hive with proper steps and diagram. 07
OR
Q.3 (a) Compare Raw oriented and Column Oriented database structures. 03
(b) Differentiate: Apache pig Vs Map Reduce. 04
(c) Define join and explain types of join. 07

Q.4 (a) Difference between master-slave versus peer-to-peer distribution 03

models.
(b) What is Stream Computing and Sampling Data in a Stream. 04
(c) What is Apache Spark? What are the advantages of using Apache Spark 07
over Hadoop? Explain in brief four major libraries of Apache Spark.
OR
Q.4 (a) Write a short note on Decaying Window 03
(b) Write a short note on RTAP. 04
(c) Explain the HiveQL-Select-Order By with suitable example. 07

Q.5 (a) Write application of writing Spark. 03

(b) Write difference between MangoDB and Hadoop. 04
(c) Define NoSQL and where is it used? (b) i) Document Oriented Database 07
ii) Graph based Database.
OR
Q.5 (a) Describe data processing operators in Pig. 03
(b) Write differences between NoSQL and SQL. 04
(c) What is Zookeeper? List the benefits of it. 07

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

GUJARAT TECHNOLOGICAL UNIVERSITY

BE - SEMESTER–VII (NEW) EXAMINATION – SUMMER 2024
Subject Code: 3170722 Date:20-05-2024
Subject Name: Big Data Analytics
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.
4. Simple and non-programmable scientific calculators are allowed.
MARKS
Q.1 (a) Give difference between traditional data and big data. 03
(b) What is Big data Analytics? Explain any one case study of it. 04
(c) Explain 4 V’s of Big data. 07

Q.2 (a) List various configuration files used in Hadoop Installation 03

(b) How HDFS is different from traditional NFS? 04
(c) What is Hadoop? Briefly explain the core components of it. 07
OR
(c) What is MapReduce? Explain working of various phases of 07
MapReduce with appropriate example and diagram.

Q.3 (a) Discuss role of Data node and Name node in HDFS. 03
(b) Explain features and advantages of NoSQL. 04
(c) What is data stream mining? Explain stream data model and its 07
architecture in detail.
OR
Q.3 (a) What do you mean by job scheduling in Hadoop? List different 03
schedulers in Hadoop.
(b) What is NoSQL database? List the differences between NoSQL and 04
relational databases.
(c) Explain Counting oneness in a Window and Decaying Window of 07
mining data stream in detail.

Q.4 (a) Explain the Data Model of HBase. 03

(b) How HBase uses Zookeeper to Build Applications? Explain in 04
detail.
(c) Explain Pig data Model in detail and Discuss how it will help for 07
effective data flow.
OR
Q.4 (a) Explain the HiveQL-Select-Order By with suitable example. 03
(b) Compare Hive and Pig query language. 04
(c) Explain briefly on Hbase architecture with neat diagram. 07

Q.5 (a) Justify spark is faster than mapReduce. 03

(b) Define various Actions in Spark. 04
(c) Generalize how is data analysis used in 07
a) Stock market predictions.
b) Weather forecasting predictions.
 OR
Q.5 (a) What are the components of spark? Also state the features of 03
spark.
(b) What does a Spark Engine do? What is GraphX? 04
(c) What is RDD? State and Explain RDD operations. 07

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

GUJARAT TECHNOLOGICAL UNIVERSITY

BE - SEMESTER–VII (NEW) EXAMINATION – WINTER 2023
Subject Code:3170710 Date:08-12-2023
Subject Name: Mobile Computing and Wireless Communication
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.
4. Simple and non-programmable scientific calculators are allowed.
MARKS

Q.1 (a) Explain LAN, MAN and WAN. 03

(b) Differentiate: Circuit Switching and Packet Switching. 04
(c) Explain GSM architecture and role of it components. 07
Q.2 (a) Define IMSI, IMEI and MS-ISDN and write their use. 03
(b) What is GPRS? How is billing and charging done in GPRS? 04
(c) Define channel capacity. Write Shannon and Nyquist capacity 07
formula. State the key factors that affect channel capacity.
OR
(c) What is fading? Differentiate 07
i. Fast and slow fading
ii. Flat and selective fading.

Q.3 (a) What is hidden terminal problem? How it can be avoided? 03

(b) Write a short note on selective repeat ARQ. 04
(c) Discuss the network elements in GPRS that are different from GSM. 07
Also discuss applications and limitations of GPRS.
OR
Q.3 (a) Explain the Wireless Session Protocol Primitives and Parameters. 03
(b) Define the term Multiplexing. Explain the FDM and TDM with one 04
example each.
(c) Draw and Explain the IEEE 802.11 Architecture in Details? 07

Q.4 (a) Write a note on Transmission Media. 03

(b) Discuss DECT frame format. 04
(c) Explain Mobile IP. 07
OR
Q.4 (a) Write a note on piconet and scatternet. 03
(b) Differentiate the GSM and GPRS. 04
(c) Draw and explain Bluetooth Protocol Architecture? 07

Q.5 (a) Shortly explain handover in GSM. 03

(b) Describe the Error Control Coding in detail. 04
(c) Define Android layout. Explain various Android layouts. 07
OR
Q.5 (a) What are HLR and VLR? Describe its functions in Call Routing and 03
Roaming.
(b) Shortly explain 1G, 2G, 2.5G and 3G Mobile communications 04
(c) Explain Android application framework with its components. 07
*************

1
Seat No.: ________ Enrolment No.___________

GUJARAT TECHNOLOGICAL UNIVERSITY

BE - SEMESTER–VII (NEW) EXAMINATION – WINTER 2022
Subject Code:3170710 Date:10-01-2023
Subject Name:Mobile Computing and Wireless Communication
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.
4. Simple and non-programmable scientific calculators are allowed.

MARKS
Q.1 (a) Compare LAN and WAN. 03
(b) Differentiate GSM and GPRS. 04
(c) Define channel capacity. Explain Nyquist and Shannon’s criteria to find 07
Channel Capacity.
capacity
Q.2 (a) Compare FDM vs TDM. 03
(b) Compare Packet Switching and Circuit switching. 04
(c) Describe GSM Authentication and security. 07
OR
(c) Draw and explain GSM Network Architecture. 07

Q.3 (a) Compare HLR and VLR. 03

(b) Discuss any Error detection technique in brief. 04
(c) Describe Discovery, Registration, and tunneling process in Mobile IP. 07
OR
Q.3 (a) Explain : MSISDN, IMEI and IMSI 03
(b) Discuss GSM call routing in brief. 04
(c) Explain Automatic repeat request in detail. 07

Q.4 (a) Discuss Space Division Multiple Access. 03

(b) Draw and explain IEEE 802.11 Architecture. 04
(c) Describe Direct Sequence Spread Spectrum Technique. 07
OR
Q.4 (a) Explain Propagation Modes in brief. 03
(b) Define Android Activity and Write Android Activity Life cycle. 04
(c) Describe Frequency Hopping Spread Spectrum Technique. 07

Q.5 (a) Compare Wi-Fi and Wi-Max. 03

(b) What is Intents? Explain the types of Intents. 04
(c) Explain Bluetooth protocol stack. 07
OR
Q.5 (a) Discuss Piconet and Scatternet in brief. 03
(b) Describe Android Button View Control and Text View Control 04
(c) Discuss various Android Layouts. 07
*************

1
Seat No.: ________ Enrolment No.___________

GUJARAT TECHNOLOGICAL UNIVERSITY

BE - SEMESTER–VII (NEW) EXAMINATION – WINTER 2021
Subject Code:3170710 Date:15/12/2021
Subject Name:Mobile Computing and Wireless communication
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.
4. Simple and non-programmable scientific calculators are allowed.
MARKS
Q.1 (a) Explain any three addresses and identifiers used in GSM with 03
example.
(b) Differentiate packet switching and circuit switching. 04
(c) Explain Mobile IP. 07

Q.2 (a) Given a channel with an intended capacity of 50 Mbps, the 03

bandwidth of the channel is 5 MHz What signal-tonoise ratio is
required to achieve this capacity?
(b) Write a short note on selective repeat ARQ. 04
(c) Write a note on stop-and-wait and selective repeat ARQ. 07
OR
(c) Explain various signal multiplexing techniques 07

Q.3 (a) Explain L2CAP protocol of Bluetooth. 03

(b) Explain handover process in cellular system. 04
(c) Explain DFWMAC-DCF using CSMA/CA 07
OR
Q.3 (a) Differentiate infrastructure and ad-hoc network. 03
(b) What is Handover? Explain types of it in brief 04
(c) Explain IEEE 802.11 architecture and its services. 07

Q.4 (a) Define ASK, FSK & PSK. 03

(b) What are HLR and VLR? Describe its functions in call routing 04
and roaming.
(c) State the applications of Bluetooth and differentiate between 07
Piconet and Scatternet with neat diagram.
OR
Q.4 (a) Compare Paging and Location update in GSM. 03
(b) Differentiate Amplitude, Frequency and Phase Shift Keying in 04
Digital Modulation with proper diagram.
(c) Explain in detail the Direct Sequence Spread Spectrum (DSSS). 07

Q.5 (a) Explain the power saving states of Bluetooth device. 03

(b) Explain the IEEE 802.11 Architecture with the neat diagram. 04
(c) Enlist & explain common layouts available in android. 07
OR
Q.5 (a) Explain types of Intents. 03
(b) Write a note on DECT frame format. 04
(c) Define the Android Layout. Explain the various Android 07
Layouts.

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

GUJARAT TECHNOLOGICAL UNIVERSITY

BE - SEMESTER–VII (NEW) EXAMINATION – SUMMER 2022
Subject Code:3170710 Date:08/06/2022
Subject Name:Mobile Computing and Wireless communication
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.
4. Simple and non-programmable scientific calculators are allowed.

MARKS
Q.1 (a) Enlist various multiplexing techniques and explain any one. 03
(b) Compare Packet switching and Circuit Switching. 04
(c) Define channel capacity and various factors which affect it. State 07
Nyquist and Shannnon criteria.

Q.2 (a) Define Scattering, Refraction and Reflection. 03

(b) Describe Hamming code in brief. 04
(c) Explain Direct Sequence Spread Spectrum with example. 07
OR
(c) Explain Frequency Hopping Spread Spectrum. 07

Q.3 (a) Enlist types of Antenna and Explain any one of them. 03
(b) Describe CRC in brief. 04
(c) Compare 1G,2G,3G and 4G technology. 07
OR
Q.3 (a) Explain Piconet and Scatternet. 03
(b) Describe WAP in brief. 04
(c) Describe Multiple Access with Collision Avoidance and explain 07
how hidden terminal problem can be solved by it.

Q.4 (a) Define IMSI,MSISDN and LMSI. 03

(b) Draw GPRS protocol stack and write the functions of GTP,LLC 04
protocols.
(c) Draw and describe GSM Architecture. 07
OR
Q.4 (a) Define TMSI,LAI and IMEI. 03
(b) Enlist types of Handover and explain any one. 04
(c) Write short note on Mobile IP. 07

Q.5 (a) Discuss type of Intents. 03

(b) Compare Wi fi and Wi Max 04
(c) Draw and explain Android Architecture. 07
OR
Q.5 (a) Compare HLR and VLR. 03
(b) Draw and describe Bluetooth protocol architecture in brief. 04
(c) Enlist various Android layouts and explain them. 07
*************

1
Seat No.: ________ Enrolment No.___________

GUJARAT TECHNOLOGICAL UNIVERSITY

BE – SEMESTER- VII EXAMINATION-SUMMER 2023
Subject Code: 3170710 Date: 26/06/2023
Subject Name: Mobile Computing and Wireless Communication
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.
4. Simple and non-programmable scientific calculators are allowed.

MARKS
Q.1 (a) Describe IMSI,IMEI, MSRN in brief. 03
(b) Compare Packet Switching and Circuit Switching. 04
(c) Describe the factors that affect Channel Capacity. Explain Nyquist 07
and Shannon Criteria for finding Channel Capacity.

Q.2 (a) Describe Hamming Distance with example. 03

(b) Compare GSM and GPRS. 04
(c) Describe Direct Sequence Spread Spectrum. 07
OR
(c) Describe Multiple Access with Collision Avoidance. 07

Q.3 (a) Compare HLR and VLR. 03

(b) Describe IEEE 802.11 Architecture in brief. 04
(c) What is Signal Propagation? Describe various Propagation Modes. 07

OR
Q.3 (a) Describe various Transmission Media in brief. 03
(b) Compare 1G, 2G , 3G and 4G Technology. 04
(c) Write needs of ARQ. Explain ARQ in detail. 07

Q.4 (a) Define Handover and explain types of handover in brief. 03

(b) Describe Mobile IP in brief. 04
(c) Write a note on Cyclic Redundancy Check. 07
OR
Q.4 (a) How billing and charging is done in GPRS? 03
(b) Differentiate Wi-Fi and Wi-Max. 04
(c) Draw and explain GSM Architecture. 07

Q.5 (a) Explain Android TextView control with an example. 03

(b) Enlist various Android layouts and explain in brief. 04
(c) Describe Bluetooth Protocol stack. 07
OR
Q.5 (a) Discuss types of Intents. 03
(b) Describe Activity Life Cycle in Android. 04
(c) Describe Android Application Framework with their components. 07

*************
1
 Enrolment No./Seat No_____________

GUJARAT TECHNOLOGICAL UNIVERSITY

BE - SEMESTER–VII (NEW) EXAMINATION – SUMMER 2024
Subject Code:3170710 Date:22-05-2024
Subject Name:Mobile Computing and Wireless Communication
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.
4. Simple and non-programmable scientific calculators are allowed.

MARKS

Q.1 (a) Define IMSI,MSRN and MSISDN. 03

(b) Compare Packet Switching and Circuit Switching. 04
(c) Define Channel Capacity. Describe Nyquist and Shannon 07
criteria to find Channel Capacity.

Q.2 (a) Compare TDM and FDM. 03

(b) Describe different types of Antennas. 04
(c) Draw and Describe GSM Architecture. 07
OR
(c) Describe Mobile IP. 07
Q.3 (a) Describe Multi path Propagation and fading. 03
(b) Compare HLR and VLR. 04
(c) Describe Spread Spectrum Technology. 07
OR
Q.3 (a) Describe billing and charging in GPRS. 03
(b) Describe Propagation Modes in Wireless Communication. 04
(c) Describe Frequency Hopping Spectrum Technology. 07

Q.4 (a) Write Architectural Difference in GSM and GPRS. 03

(b) Enlist various Multiple Access Technology and Describe 04
CDMA.
(c) Describe Automatic Repeat Request. 07
OR
Q.4 (a) Enlist various error detection techniques and explain any one. 03
(b) Describe Multiple Access with Collision Avoidance. 04
(c) Describe Wireless Application Protocol. 07

Q.5 (a) Write use of Manifest file. 03

(b) Enlist Various Android Layouts. Describe any one. 04
(c) Draw and Describe Bluetooth Protocol Architecture. 07
OR
Q.5 (a) Differentiate Wi-fi and Wi-Max. 03
(b) Describe Piconets and scatternet. 04
(c) Describe Android Architecture. 07

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

1
Seat No.: ________ Enrolment No.___________

GUJARAT TECHNOLOGICAL UNIVERSITY

BE - SEMESTER–VII (NEW) EXAMINATION – WINTER 2023
Subject Code:3170716 Date:14-12-2023
Subject Name: Artificial Intelligence
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.
4. Simple and non-programmable scientific calculators are allowed.

Marks
Q.1 (a) What is “Artificial Intelligence and Artificial Intelligence Technique”? 03
(b) Explain the algorithm for steepest hill climbing. 04
(c) Enumerate Classical “Water jug Problem”. Describe the state space for this 07
problem and also give the solution.
Q.2 (a) Differentiate prepositional & predicate logic. 03
(b) What is clausal form? How is it useful? 04
(c) What is A* search? Explain various stages of A* search with an example. 07
OR
(c) Define constraint satisfaction problem (CSP). How CSP is formulated as a 07
search problem?

Q.3 (a) Define Non monotonic reasoning. 03

(b) What is learning? Explain various learning techniques. 04
(c) Write unification algorithm and explain resolution in predicate logic. 07
OR
Q.3 (a) Describe Bayes theorem. 03
(b) Explain local maxima, plateau, and ridge in detail. 04
(c) Differentiate forward chaining and backward chaining with suitable example. 07

Q.4 (a) Explain connectionist models. What is perceptron? 03

(b) Explain mean-end analysis approach to solve AI problems. 04
(c) Describe the Expert System Development Procedure. 07
OR
Q.4 (a) Explain different defuzzification methods. 03
(b) Explain Inference Rules in Propositional Calculus. 04
(c) Explain the Alpha-Beta Cutoffs Procedure in Game Playing. 07

Q.5 (a) Explain morphological and syntax analysis phases of NLP. 03

(b) Explain the algorithm for Backpropagation in Neural Networks. 04
(c) Demonstrate the use of Cut and Fail Predicates in Prolog with example. 07
OR
Q.5 (a) Explain about the basic operators in genetic algorithms. 03
(b) Describe the various steps of Natural language Processing. 04
(c) What are the Applications, Features and Limitations of Prolog? 07
*************

1
Seat No.: ________ Enrolment No.___________

GUJARAT TECHNOLOGICAL UNIVERSITY

BE - SEMESTER–VII (NEW) EXAMINATION – WINTER 2022
Subject Code:3170716 Date:05-01-2023
Subject Name:Artificial Intelligence
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.
4. Simple and non-programmable scientific calculators are allowed.
Marks
Q.1 (a) Explain Turing test. 03
(b) What is production system? Discuss the component of production system. 04
(c) What is artificial intelligence? Explain application of AI. 07

Q.2 (a) Write an algorithm for the breadth first search. 03

(b) Why hill climbing is better than generate and test? Write algorithm for 04
simple hill climbing.
(c) Explain the state space search with the use of 8 Puzzle Problem 07
OR
(c) Explain AI Problem characteristics in detail. 07

Q.3 (a) What is heuristic search? Discuss with an example. 03

(b) Explain Problem Reduction using “AND-OR” graph. 04
(c) What do you mean by constraint satisfaction problems? Explain constraint 07
propagation algorithm using suitable example.
OR
Q.3 (a) Differentiate procedural and declarative knowledge. 03
(b) Write a short note on non monotonic reasoning. 04
(c) Write and explain algorithm for resolution in propositional logic with 07
suitable example.

Q.4 (a) Explain forward and backward reasoning. 03

(b) Demonstrate the use of Repeat Predicate in Prolog with example. 04
(c) Explain the various method of knowledge representation with suitable 07
example.
OR
Q.4 (a) Briefly explain perceptron. 03
(b) Explain morphological and syntax analysis phases of NLP. 04
(c) Explain the architecture of expert system with suitable sketch. 07

Q.5 (a) Explain Probability and Bay’s Theorem. 03

(b) Explain the components of planning system. 04
(c) Explain the MiniMax search procedure for Game Playing. Also explain 07
alpha and Beta cut-offs to improve the performance of MinMax procedure.
OR
Q.5 (a) Explain supervised and unsupervised learning. 03
(b) Explain about the basic operators in genetic algorithms. 04
(c) Write following prolog programs: 07
1) To find factorial of a given number.
2) To find the nth element of a given list.
***************
1
Seat No.: ________ Enrolment No.___________

GUJARAT TECHNOLOGICAL UNIVERSITY

BE - SEMESTER–VII (NEW) EXAMINATION – WINTER 2021
Subject Code:3170716 Date:13/12/2021
Subject Name:Artificial Intelligence
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.
4. Simple and non-programmable scientific calculators are allowed.

Q.1 (a) What is a “control strategy” and what are its characteristics? 03
(b) Describe in brief how Min-Max search procedure works. 04
(c) Enlist and discuss major task domains of Artificial Intelligence. 07
Q.2 (a) Discuss briefly backward reasoning with example. 03
(b) Explain with example how recursive predicate is defined in Prolog? 04
(c) State Water Jug problem. Give its state space representation 07
OR
(c) Explain A* algorithm. What happens if h’ underestimates h and 07
overestimates h?
Q.3 (a) Explain local maxima, plateau and ridge in brief 03
(b) Discuss the approaches to knowledge representation 04
(c) Demonstrate briefly the steps to convert given wff into clause form 07
OR
Q.3 (a) Differentiate Informed & Uninformed search. Give examples. 03
(b) Explain best first search algorithm. 04
(c) Consider the following facts: 07
* Hemant only likes easy courses.
* Science courses are hard.
* All the courses in basketweaving department are
easy.
* BK301 is a basketweaving course.
Use resolution to answer the question,”What course would Hemant
like?”
Q.4 (a) What is certainty factor? 03
(b) Discuss Bayesian network and its application. 04
(c) Explain connectionist models. What is perceptron? What is the concept 07
of back propagation for ANNs?
OR
Q.4 (a) What do you mean by Expert Systems? List out its four applications. 03

(b) Discuss Goal Stack planning 04

(c) Write about various defuzzification methods 07
Q.5 (a) Discuss cut and fail predicate in prolog 03
(b) Describe working principle of Genetic Algorithm 04
(c) What is nonmonotonic reasoning? Explain logics for nonmonotonic 07
reasoning.
OR
Q.5 (a) Write a prolog program to append two given lists into third 03
(b) List out the genetic operators. Describe them briefly 04
(c) Write a note on Natural Language Processing 07

1
 Enrolment No./Seat No_____________

GUJARAT TECHNOLOGICAL UNIVERSITY

BE - SEMESTER–VII (NEW) EXAMINATION – SUMMER 2024
Subject Code:3170716 Date:28-05-2024
Subject Name:Artificial Intelligence
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.
4. Simple and non-programmable scientific calculators are allowed.

MARKS

Q.1 (a) Define the term: Artificial Intelligence. State various applications of 03
Artificial Intelligence.
(b) Enlist and briefly discuss the major task domains of Artificial Intelligence. 04
(c) Explain AI problem characteristics in detail. 07

Q.2 (a) What is meant by control strategy? State the requirements of a good control 03
strategy.
(b) Explain the nonmonotonic reasoning. 04
(c) Consider the water jug problem stated below: 07
You are given two jugs, a 5-litre one and a 4-litre one. Neither has any
measuring marker on it. There is a pump that can be used to fill the jugs
with water. How can you get exactly 2-litre of water into the 4-litre jug?

Explain how this problem can be solved using State Space Search. Also,
give the production rules to solve this problem and derive a feasible
solution using the same.
OR
(c) In the missionaries and cannibals problem, three missionaries and three 07
cannibals must cross a river using a boat which can carry at most two
people, under the constraint that, number of cannibals should be lesser
than or equal to the missionaries on either side. The boat cannot cross the
river by itself with no people on board.

For the above mentioned problem, describe state space representation,

actions, start and end state.

Q.3 (a) Translate these sentences into formulas in predicate logic. 03

1. John likes all kinds of food.
2. Apples are food.
3. Chicken is food.
4. Anything anyone eats and isn’t killed-by is food.
5. Bill eats peanuts and is still alive.
6. Sue eats everything Bill eats.
(b) Discuss the following terms with respect to fuzzy logic theory: 04
- Membership function
- Linguistic variable
(c) Write an objective of hill climbing method. Discuss any one type of hill 07
climbing in detail with its algorithm.

OR
1
Q.3 (a) Write the proposed solution(s) for the problems occurred in hill climbing. 03
(b) Explain the natural language processing steps in brief. 04
(c) Explain forward and backward reasoning with suitable example(s). 07

Q.4 (a) Explain problem reduction using “AND-OR” graph. 03

(b) Discuss goal stack planning in brief. 04
(c) Consider the following facts: 07
(1) Steve only likes easy courses.
(2) Science courses are hard.
(3) All the courses in the HaveFun department are easy.
(4) BK301 is a HaveFun department course.
Use resolution to answer the question “What course would Steve like?”

OR
Q.4 (a) Write the basic differences between declarative and procedural knowledge. 03

(b) Solve the following cryptarithmetic problem using constraint 04

satisfaction.
LEO + LEE = ALL
(c) Explain the minimax search procedure for game playing using suitable 07
example. What is the significance of alpha-beta cut-offs?

Q.5 (a) Write a brief note on best-first Search. 03

(b) Write a prolog program to count the number of elements present in the 04
given list.
(c) Discuss different types of learning in artificial neural networks. Also write 07
the differences between/among them.
OR
Q.5 (a) State the factors which may make understanding of natural language 03
difficult for a computer.

(b) Write a prolog program to demonstrate the use of cut and fail predicates. 04

(c) Explain Hopfield networks. 07

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

2
Seat No.: ________ Enrolment No.___________

GUJARAT TECHNOLOGICAL UNIVERSITY

BE – SEMESTER- VII EXAMINATION-SUMMER 2023
Subject Code: 3170716 Date: 28/06/2023
Subject Name: Artificial Intelligence
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.
4. Simple and non-programmable scientific calculators are allowed.

MARKS
Q.1 (a) Explain the “Turing test”. 03
(b) Explain the different issues in Knowledge representation. 04
(c) Enlist and discuss major task domains of Artificial Intelligence. 07

Q.2 (a) Define i) Local Maximum ii) Plateau iii) Ridge 03

(b) Explain Best First Search method. 04
(c) Discuss and Analyze Tower of Hanoi problem with respect to the 07
seven problem characteristics
OR
(c) Explain Water Jug Problem With Example. 07
Q.3 (a) Explain the Backward Reasoning. 03
(b) Discuss with example: Constraint Satisfaction Problem. 04
(c) Explain Semantic Net & Frame with suitable example. 07
OR
Q.3 (a) List out the property of Non monotonic reasoning. 03
(b) Explain the steps of unification in predicate logic. 04
(c) State the Bayes theorem. Illustrate how a Bayesian Network can 07
be used to represent causality relationship among attributes.

Q.4 (a) What is State Space of a Problem? 03

(b) What are the limitations of Propositional Logic? 04
(c) Consider the following sentences: 07
• Raj likes all kinds of food.
• Apples are food.
• Anything anyone eats and isn’t killed by is food.
• Sachin eats peanuts and is still alive.
• Vinod eats everything Sachin eats. Now, attempt following:
i. Translate these sentences into formulas in predicate
logic.
ii. Use resolution to answer the question, “What food does
Vinod eat?”
OR
Q.4 (a) Compare Fuzzy Vs Crisp Logic. 03
(b) Explain alpha-beta cut off search with and example 04
(c) Simulate the working of Tic-tac-toe problem with Minimax 07
technique.

Q.5 (a) Explain Hopfield Network. 03

(b) Explain Steps of Natural Language Processing. 04
(c) Write a prolog program to find minimum number from the given 07
input list.
1
 OR
Q.5 (a) Explain Expert System Shells. 03
(b) Explain Cut and Fail Predicate With Example. 04
(c) Explain Various Types of Cross Over Operators in Genetic 07
Algorithm.
*************

2
Seat No.: ________ Enrolment No.___________

GUJARAT TECHNOLOGICAL UNIVERSITY

BE - SEMESTER–VII (NEW) EXAMINATION – SUMMER 2022
Subject Code:3170716 Date:03/06/2022
Subject Name:Artificial Intelligence
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.
4. Simple and non-programmable scientific calculators are allowed.

Q.1 (a) Define AI. What are the task domains of AI? 03
(b) Explain Water Jug problem with Sate Space Search method. 04
(c) Explain Best First Search with suitable example. 07

Q.2 (a) Define the following. 03

1. Modus Ponens 2. Horn Clause 3. Existential Quantifier
(b) Explain Semantic Net with example. 04
(c) Consider the following sentences: 07
 Rita likes all kinds of food.
 Apples are food.
 Anything anyone eats and isn’t killed by is food.
 Rahi eats peanuts and is still alive.
 Tanvi eats everything Rahi eats.

i. Translate these sentences into formulas in predicate logic.

ii. Use resolution to answer the question, “What food does Tanvi eat?”
OR
(c) Explain Forward Reasoning and Backward Reasoning with example. 07

Q.3 (a) Explain Expert System Shell with example. 03

(b) Explain MiniMax search procedure. 04
(c) Explain Artificial Neural Network. 07
OR
Q.3 (a) Draw and explain architecture of Expert System. 03
(b) Show the use of Alpha-Beta pruning. 04
(c) Explain Backpropagation algorithm in Neural Network. 07

Q.4 (a) Briefly explain any one application of Natural Language Processing. 03
(b) A bag I contains 4 white and 6 black balls while another Bag II contains 4 04
white and 3 black balls. One ball is drawn at random from one of the bags,
and it is found to be black. Find the probability that it was drawn from Bag
I.
(c) Explain Roulette-Wheel selection method of genetic algorithm. 07
OR
Q.4 (a) Enlist and describe different phases involved in Natural Language 03
Processing.
(b) The task is to recognize English alphabetical characters (F, E, X, Y, I, T) 04
in an image processing system. Define two fuzzy sets 𝐼̃ and 𝐹̃ to represent
the identification of characters I and F.
𝐼̃={(F, 0.4), (E, 0.3), (X, 0.1), (Y, 0.1), (I, 0.9), (T, 0.8)}
𝐹̃ ={(F, 0.99), (E, 0.8), (X, 0.1), (Y, 0.2), (I, 0.5), (T, 0.5)}
1
 Find the following.
1. 𝐼̃ ∪ 𝐹̃
2. 𝐼̃ − 𝐹̃
(c) Describe the phases of genetic algorithm. 07

Q.5 (a) Explain planning problem. 03

(b) Explain limitations of Hill Climbing algorithm. 04
(c) Explain Cut and Fail predicates in Prolog. 07
OR
Q.5 (a) Explain how planning is different from search procedure? 03
(b) Compare DFS and BFS. 04
(c) Write a Prolog program to merge two sequentially ordered (ascending) lists 07
into one ordered list.

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

2
GVA
Seat No.: ________ Enrolment No.___________

GUJARAT TECHNOLOGICAL UNIVERSITY

BE - SEMESTER–VII (NEW) EXAMINATION – WINTER 2023
Subject Code:3170725 Date:16-12-2023
Subject Name: Digital forensics
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.
4. Simple and non-programmable scientific calculators are allowed.

Q.1 (a) Explain forensic science. 03

(b) What is digital forensics explain the process of digital forensics? 04
(c) Explain Locard’s Exchange Principle with suitable scenario. 07

Q.2 (a) Explain functional model of IoT 03

(b) Describe forensic cloning of evidence. 04
(c) Draw and explain Control Unit of basic computer. 07
OR
(c) Explain order of volatility in brief. 07

Q.3 (a) Describe techniques to remove metadata. 03

(b) Give the advantages of live collection 04
(c) Explain Main Memory and Auxiliary Memory with example. 07
OR
Q.3 (a) Explain branches of digital forensics. 03
(b) Explain Challenges of Digital Forensics. 04
(c) Write a note on Electronics discovery. 07

Q.4 (a) What is data preservation in cyber forensics? 03

(b) Define and differentiate Live and dead system forensic. 04
(c) Explain Hashing concepts to maintain the integrity of evidence. 07
OR
Q.4 (a) Discuss e-mail header forensic in brief 03
(b) How to restore your deleted or modified folders or files from Shadow Copies. 04
(c) Discuss techniques of hibernating files 07

Q.5 (a) Explain Digital forensic elements. 03

(b) Write Case study of social networking sites. 04
(c) Documenting the scene and evidence, maintaining the chain of custody. 07
OR
Q.5 (a) What is the main purpose of digital forensics? 03
(b) Explain the role of a cyber forensic investigator. 04
(c) What is an example of a network forensic technique? 07
Seat No.: ________ Enrolment No.___________

GUJARAT TECHNOLOGICAL UNIVERSITY

BE - SEMESTER–VII (NEW) EXAMINATION – WINTER 2022
Subject Code:3170725 Date:07-01-2023
Subject Name:Digital forensics
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.
4. Simple and non-programmable scientific calculators are allowed.

MARKS
Q.1 (a) What is your understanding of the term “chain of custody” in the context 03
of digital forensics?
(b) What is digital forensics explain the process of digital forensics? 04
(c) Define: hibernating files, examining window registry, recycle bin operation 07
Operation.
Q.2 (a) Explain forensic science. 03
(b) Describe forensic cloning of evidence. 04
(c) What is locard's exchange principle and how does it apply to digital forensics? 07
OR
(c) Explain order of volatility in brief. 07

Q.3 (a) What types of tools can be selected for use in mobile device 03
investigations?
(b) Why it is important in the forensic investigation to work on duplicate image? 04
(c) Describe techniques to remove metadata. 07
OR
Q.3 (a) What is hashing explain hashing concepts to maintain the integrity of 03
evidence?
(b) Write a note on Electronics discovery. 04
(c) Discuss e-mail header forensic in brief. 07

Q.4 (a) What are the legal provisions against cyber crime? 03
(b) Explain tool validation in context of quality assurance. 04
(c) Explain Hashing concepts to maintain the integrity of evidence. 07
OR
Q.4 (a) What are three types of tools used by digital forensic examiners? 03
(b) What relevance does metadata have to the evidence collected? 04
(c) Define and differentiate Live and dead system forensic. 07

Q.5 (a) How to restore your deleted or modified folders or files from Shadow 03
Copies.
(b) What is the most important legal features about digital evidence? 04
(c) What is an example of a network forensic technique? 07
OR
Q.5 (a) What information analyst could get from email header? 03
(b) Discuss techniques of hibernating files. 04
(c) Documenting the scene and evidence, maintaining the chain of custody. 07

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

1
Seat No.: ________ Enrolment No.___________

GUJARAT TECHNOLOGICAL UNIVERSITY

BE - SEMESTER–VII (NEW) EXAMINATION – WINTER 2021
Subject Code: 3170725 Date:27/12/2021
Subject Name: Digital forensics
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.
4. Simple and non-programmable scientific calculators are allowed.

MARKS
Q.1 (a) What is Digital forensics? 03
(b) List any four types of web attacks. How are these web attacks 04
investigated?
(c) Explain Locard’s Exchange Principle with suitable scenario. 07

Q.2 (a) Draw and explain Control Unit of basic computer. 03

(b) Explain Flynn’s classification of computers. 04
(c) What is cache memory? Explain direct mapping of cache memory with 07
example.
OR
(c) Explain Main Memory and Auxiliary Memory with example. 07
Q.3 (a) What are the main challenges of investigating computer-related crime? 03
(b) Give the advantages of live collection. 04
(c) Explain forensic cloning process of evidence with appropriate example. 07
OR
Q.3 (a) Explain order of volatility in brief. 03
(b) What is the difference between digital evidence, electronic evidence, and 04
computer evidence?
(c) Explain Hashing concepts to maintain the integrity of evidence. 07
Q.4 (a) Define sleep, Hibernation and Hybrid sleep. 03
(b) Explain recycle bin operation. 04
(c) Describe techniques to remove metadata. 07
OR
Q.4 (a) Define restore points and shadow copies. 03
(b) Explain registry structure in brief. 04
(c) Describe techniques to find deleted data. 07
Q.5 (a) Write a brief note on eDiscovery. 03
(b) Explain tool validation in context of quality assurance. 04
(c) Explain the use of digital forensic in social networking sites. 07
OR
Q.5 (a) Write a short note on The Electronic Communications Privacy Act. 03
(b) Explain various tool selection methods in context of digital forensic. 04
(c) Explain e-mail header forensic in detail. 07
*************

1
 GUJARAT TECHNOLOGICAL UNIVERSITY
BE - SEMESTER–VII (NEW) EXAMINATION – SUMMER 2024
Subject Code:3170725 Date:30-05-2024
Subject Name:Digital forensics
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.
4. Simple and non-programmable scientific calculators are allowed.

MARKS

Q.1 (a) What is Digital Forensics? List out uses of Digital Forensics. 03
(b) What are the 4 steps of the forensic process? Describe it. 04
(c) Explain Locard’s Exchange Principle with suitable example. 07

Q.2 (a) Draw and explain Control Unit of basic computer. 03

(b) Explain Bits, Bytes and Numbering scheme. 04
(c) What are the requirements to set up a workstation for digital 07
forensics?
OR
(c) Explain role of the forensic examiner in judicial system. 07
Q.3 (a) Explain three different types of storage in digital world? 03
(b) Differentiate Volatile vs. Non-volatile Memory. 04
(c) Explain importance of photography and notes for documenting 07
the scene.
OR
Q.3 (a) What tools do digital forensic scientists use? 03
(b) Explain forensic cloning of evidence. 04
(c) Explain hashing algorithms can be used to verify forensic 07
integrity?
Q.4 (a) Describe forensic recovery of deleted data? 03
(b) What is the difference between a restore point and a shadow 04
copy?
(c) What is the knowledge of legal issues and how they affect 07
digital forensics?
OR
Q.4 (a) How do you write a digital forensic investigation report? 03
(b) How is quality assurance crucial to the investigation of digital 04
forensic evidence?
(c) Explain the following: 07
(a) IaaS (b) PaaS (c) SaaS
Q.5 (a) What is Recycle Bin and its operation? 03
(b) Electronic data discovery: What is it? How it functions. 04
(c) What three categories of tools do digital forensic investigators 07
use? Explain it.
OR
Q.5 (a) Define sleep, Hibernation and Hybrid sleep. 03
(b) Differentiate Accreditation vs Certification. 04
(c) Name four different forms of web attacks. How are these web- 07
based attacks examined?
*************
1
Seat No.: ________ Enrolment No.___________

GUJARAT TECHNOLOGICAL UNIVERSITY

BE – SEMESTER- VII EXAMINATION-SUMMER 2023
Subject Code: 3170725 Date: 30/06/2023
Subject Name: Digital forensics
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.
4. Simple and non-programmable scientific calculators are allowed.

MARKS
Q.1 (a) What is Digital Forensic? 03
(b) List any four types of web attacks. How are these attacks 04
investigated?
(c) Explain Digital Forensic Process in brief. 07

Q.2 (a) Draw and explain control unit of basic computer. 03

(b) Explain Flynn’s Classification of computer. 04
(c) What is Locard’s exchange principle and how does it apply 07
to digital forensics?
OR
(c) Explain order of volatility. 07
Q.3 (a) What is main memory explain with example. 03
(b) What are the main challenges of investigating computer 04
related crime?
(c) Discuss e-mail header forensic in brief. 07
OR
Q.3 (a) What is cache memory explain with example. 03
(b) Give the advantages of live collection. 04
(c) Discuss legal aspects and their impacts on digital forensic. 07

Q.4 (a) What is chain of custody in context of digital forensic? 03

(b) Explain Quality assurance in detail. 04
(c) Describe technique to remove metadata. 07
OR
Q.4 (a) What is forensic cloning of evidence. 03
(b) Write a short note on Report writing. 04
(c) Explain Hashing concepts to maintain integrity. 07

Q.5 (a) Explain Digital evidence. 03

(b) Write a brief note on eDiscovery. 04
(c) Explain the use of digital forensic in social networking sites. 07
OR
Q.5 (a) Explain electronic evidence. 03
(b) Explain recycle bin operation. 04
(c) Write a Short note on the electronic communication 07
privacy.

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

1
Seat No.: ________ Enrolment No.___________

GUJARAT TECHNOLOGICAL UNIVERSITY

BE - SEMESTER–VII (NEW) EXAMINATION – SUMMER 2022
Subject Code:3170725 Date:06/06/2022
Subject Name:Digital forensics
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.
4. Simple and non-programmable scientific calculators are allowed.
MARKS
Q.1 (a) Define metadata and recycle bin operation. 03
(b) Explain Memory organization in brief. 04
(c) Explain the use of digital forensic in social networking sites. 07

Q.2 (a) Explain forensic science. 03

(b) Explain Quality assurance in detail. 04
(c) Explain Locard’s Exchange Principle with suitable scenario. 07
OR
(c) Explain The digital forensic process in brief. 07

Q.3 (a) Define Hardware and Software tools for digital forensics. 03
(b) Give the advantages of live collection. 04
(c) Discuss legal aspects and their impact on digital forensics. 07
OR
Q.3 (a) Discuss forensic cloning of evidence. 03
(b) Write a note on Electronics discovery. 04
(c) Discuss e-mail header forensic in brief. 07

Q.4 (a) Which are the computer-related crime? 03

(b) Explain tool validation in context of quality assurance. 04
(c) Explain Hashing concepts to maintain the integrity of evidence. 07
OR
Q.4 (a) What are the main challenges of investigating computer-related crime? 03
(b) Explain Report drafting. 04
(c) Define and differentiate Live and dead system forensic. 07

Q.5 (a) Explain Digital evidence. 03

(b) Discuss techniques of Finding deleted data. 04
(c) What is cache memory? Explain direct mapping of cache memory with 07
example.
OR
Q.5 (a) Explain electronic evidence. 03
(b) Discuss techniques of hibernating files. 04
(c) Describe techniques to remove metadata. 07

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

GVA

1
 Seat No.: ________ Enrolment No.___________

GUJARAT TECHNOLOGICAL UNIVERSITY

BE - SEMESTER–VII (NEW) EXAMINATION – WINTER 2023
Subject Code:3170720 Date:19-12-2023
Subject Name: Information security
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.
4. Simple and non-programmable scientific calculators are allowed.
Marks

Q.1 (a) Explain Caesar Cipher technique with Example. 03

(b) Explain with example any two principles of Security. 04
(c) Define the following terms related to Information Security: i. Cryptography ii. 07
Cryptanalysis iii. Sniffing iv. Spoofing v. Interception vi. Fabrication vii.
Masquerade
Q.2 (a) Differentiate between Block Cipher and Stream Cipher. 03
(b) Explain One-Time Pad Substitution technique with the help of example. 04
(c) Explain in detail single round of DES algorithm. 07
OR
(c) Explain in detail single round of AES algorithm. 07

Q.3 (a) What is meet in the middle attack? 03

(b) Explain Electronic Code Book and Cipher Block Chaining Mode in detail. 04
(c) In a Diffie-Hellman Key Exchange, Alice and Bob have chosen prime value q = 07
17 and primitive root = 5. If Alice’s secret key is 4 and Bob’s secret key is 6,
what is the secret key they exchanged? Explain it with proper steps.
OR
Q.3 (a) Define Hash function in Cryptographic and list its application. 03
(b) Differentiate between Symmetric key cryptography and Asymmetric key 04
cryptography.
(c) Explain RSA algorithm with example in detail. 07

Q.4 (a) What is MAC? State the main difference between MAC & Hash function. 03
(b) Explain hill cipher algorithm with example. 04
(c) Explain Message Digest Generation Using SHA-512. 07
OR
Q.4 (a) Explain the types of attacks are addressed by message authentication? 03
(b) What are the requirements for a Cryptographic Hash Function? 04
(c) Explain with the diagrams Basic Uses of Message Authentication code (MAC). 07

Q.5 (a) What is the role of Key Distribution Centre? Give the several techniques for the 03
distribution of public keys.
(b) Give the difference between Session key and Master key. 04
(c) Explain with neat diagram Digital Signature Algorithm. 07
OR

1
Q.5 (a) What is the role of AS and TGS in Kerberos? 03
(b) Draw X.509 certificate format. 04
(c) Explain SSL Architecture with neat diagram. 07

2
Seat No.: ________ Enrolment No.___________

GUJARAT TECHNOLOGICAL UNIVERSITY

BE - SEMESTER–VII (NEW) EXAMINATION – WINTER 2022
Subject Code:3170720 Date:12-01-2023
Subject Name:Information security
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.
4. Simple and non-programmable scientific calculators are allowed.
MARKS

Q.1 (a) List and explain various types of attacks? 03

(b) What is Hill Cipher? Generate a Cipher text for plain text “hi” using key 04
“jefh” using hill cipher.
(c) List various mode of cryptographic operation. Explain any one with the 07
help of diagram.

Q.2 (a) List advantages of asymmetric cryptography over symmetric key 03

cryptography.
(b) Explain encryption and decryption of RSA algorithm 04
(c) Explain avalanche effect in DES algorithm. 07
OR
(c) Does DES algorithm Secure? Discuss security of DES. 07

Q.3 (a) List the requirements of public key cryptography. 03

(b) List application of RSA algorithm. 04
(c) Discuss security of Diffie Hellman Key exchange algorithm with the help 07
of example.
OR
Q.3 (a) Using diagram explain how RSA algorithm can be used to digitally sign 03
the message.
(b) Compute public key and private key of RSA with p-11, q=17 and e = 7. 04
(c) Compute Inverse of b=550 mod m=1759 using Euclid algorithm 07

Q.4 (a) Explain cryptanalysis attack on cryptographic hash function. 03

(b) Explain pre-image resistance and second pre-image resistance. 04
(c) Write a note on birthday attack. 07
OR
Q.4 (a) What is collision resistance property of hash function? 03
(b) Explain a simple hash function and its limitation. 04
(c) What is block size and message digest size in SHA 512? With the help of 07
diagram explain a round of SHA-512 algorithm

Q.5 (a) Explain mutual authentication using symmetric key cryptography 03

(b) Compare authentication and authorization. 04
(c) Explain Schnorr algorithm for digital signature. 07
OR
Q.5 (a) Explain one way authentication using symmetric key cryptography 03
(b) Compare link encryption and end to end encryption 04
(c) Explain NIST Digital signature algorithm 07
************

1
Seat No.: ________ Enrolment No.___________

GUJARAT TECHNOLOGICAL UNIVERSITY

BE - SEMESTER–VII (NEW) EXAMINATION – WINTER 2021
Subject Code:3170720 Date:29/12/2021
Subject Name:Information security
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.
4. Simple and non-programmable scientific calculators are allowed.
MARKS
Q.1 (a) Define the following terms: 03
(i) Non-repudiation (ii) Data integrity (iii) Confidentiality

(b) Distinguish between passive and active security attacks? Define the type 04
of Security attack in each of the following cases:
(i) A student breaks into a professor’s office to obtain a copy of the next
day’s test.
(ii) A student gives a check for $10 to buy a used book. Later she finds
that the check was cashed for $100.
(iii) A student sends hundreds of e-mails per day to another student using
a phony return e-mail address.
(c) List and explain various block cipher modes of operation with the help of 07
diagram.

Q.2 (a) What is the purpose of S-boxes in DES? Explain the avalanche effect. 03
(b) Construct a Playfair matrix with the key “engineering”. And encrypt the 04
message “test this Balloon”.
(c) Let K = 133457799BBCDFF1 be the key in hexadecimal. Derive K1 the 07
first round sub key using a single round version of DES.
Permuted Choice One (PC-1) Permuted Choice Two (PC-2)

57 49 41 33 25 17 9 14 17 11 24 1 5 3 28
1 58 50 42 34 26 18 15 6 21 10 23 19 12 4
10 2 59 51 43 35 27 26 8 16 7 27 20 13 2
19 11 3 60 52 44 36 41 52 31 37 47 55 30 40
63 55 47 39 31 23 15 51 45 33 48 44 49 39 56
7 62 54 46 38 30 22 34 53 46 42 50 36 29 32
14 6 61 53 45 37 29
21 13 5 28 20 12 4

OR

(c) Let M =3243F6A8885A308D313198A2E0370734 be the plain text 07

message and K=2B7E151628AED2A6ABF7158809CF4F3C be the key
in hexadecimal. Perform the following operation using AES.
(a) Add round key.
(b) Shift row transformation on output of (a)

Q.3 (a) What is a nonce? What is the difference between a session key and a 03
master key?
1
 (b) Differentiate between hashing and encryption. What are the practical 04
applications of hashing?
(c) Explain Diffie Hellman key exchange algorithm with example. 07

OR

Q.3 (a) What is public key cryptography? What are the principal elements of a 03
public-key cryptosystem?
(b) Perform encryption and decryption using the RSA algorithm for p=5, 04
q=11, e=3, M=9.
(c) What do you mean by key distribution? Give at least one method for key 07
distribution with proper illustration.

Q.4 (a) Explain the triple DES scheme with two keys. 03
(b) Differentiate between Conventional encryption and Public-key 04
encryption.
(c) Discuss X.509 Certificates. 07

OR

Q.4 (a) Why not Double DES? What is a meet-in-the-middle attack? 03

(b) Discuss message digest generation using SHA-512. 04
(c) What is message authentication code? What is the difference between a 07
Message authentication code and a one-way hash function? Write the basic
uses of Message authentication code.

Q.5 (a) Encrypt the message “ Asymmetric key cryptography is fun” using 03
Transposition cipher with key (3,2,6,1,5,4)
(b) Write difference between (i) block cipher and stream cipher (ii) 04
monoalphabetic cipher and polyalphabetic cipher
(c) Discuss generic model of digital signature process. 07

OR

Q.5 (a) Using the Viennese cipher, encrypt the word “explanation” using the key 03
leg.
(b) Discuss four general categories of schemes for the distribution of public 04
keys.
(c) Explain Kerberos in detail. 07

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

2
Enrolment No./Seat No_____________

GUJARAT TECHNOLOGICAL UNIVERSITY

BE - SEMESTER–VII (NEW) EXAMINATION – SUMMER 2024
Subject Code:3170720 Date:01-06-2024
Subject Name:Information security
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.
4. Simple and non-programmable scientific calculators are allowed.
MARKS
Q.1 (a) List and explain different types of attacks. 03
(b) Explain Caesar cipher algorithm with the help of example. 04
(c) List and explain different mode of operation used for encryption and 07
decryption.

Q.2 (a) List use of public key cryptography 03

(b) Write steps for sub key generation in DES 04
(c) Explain DES encryption. 07
OR
(c) List and explain possible attacks on DES. 07

Q.3 (a) List requirements of public key cryptography. 03

(b) How same key can be calculated in diffi hellman key exchange 04
algorithm.
(c) Explain key generation of RSA algorithm 07
OR
Q.3 (a) Write Euclid algorithm. 03
(b) Discuss security of diffi hellman key exchange algorithm. 04
(c) Write down the algorithm used for calculation exponentiation 07
efficiently. Also give example.

Q.4 (a) What is authentication? How can we implement message 03

authentication?
(b) List and explain requirements of secure hash function 04
(c) List basic uses of Hash function. 07
OR
Q.4 (a) Define weak collision resistance and strong collision resistance. 03
(b) Draw message digest generation using SHA 512 algorithm. 04
(c) Explain message authentication based on DES. 07
Q.5 (a) Define Mutual authentication with example. 03
(b) How public key cryptography can be used for Digital signature? 04
Explain.
(c) Draw and explain DSS approach for digital signature. 07
OR
Q.5 (a) List and explain various key distribution approach of symmetric key 03
cryptography.
(b) Discuss the security of digital signature. 04
(c) What is replay attack? How can we avoid this attack using digital 07
signature?
************

1
 Seat No.: ________ Enrolment No.___________

GUJARAT TECHNOLOGICAL UNIVERSITY

BE – SEMESTER- VII EXAMINATION-SUMMER 2023
Subject Code: 3170720 Date: 19/06/2023
Subject Name: Information security
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.
4. Simple and non-programmable scientific calculators are allowed.
MARKS

Q.1 (a) Explain following terms: non-repudiation, integrity, masquerade 03

(b) Encrypt the message “attc” with the following key using Hill cipher. 04

(c) Explain playfair cipher. Encrypt the plain-text message “helloe jassmin” using 07
playfair cipher. Use the keyword “cipherj”. (There is no ‘j’ in the table. Any
‘j’ in the plaintext is replaced by ‘i’.)

Q.2 (a) Discuss Electronic Code Book mode and Counter mode in detail. 03
(b) Write difference between Block vs Stream Ciphers. Explain following terms 04
in context of cryptography: confusion and diffusion
(c) Explain DES round structure in detail. 07
OR
(c) Write a note on Advanced Encryption Standard(AES). 07

Q.3 (a) Write difference between conventional encryption and public-key encryption 03
(b) Explain man-in-the middle attack on Diffie-Hellman key exchange. 04
(c) Explain RSA algorithm in detail. Perform encryption and decryption using 07
RSA algorithm for prime numbers p=3 & q=11, plaintext message m is 2.
OR
Q.3 (a) Explain following terms: Avalanche Effect, Cryptanalysis 03
(b) Discuss possible approaches to attack RSA. 04
(c) Explain the Deffie Hellman key exchange scheme in detail. In a Diffie- 07
Hellman Key Exchange, Alice and Bob have chosen prime value q = 17 and
primitive root = 5. If Alice’s secret key is 4 and Bob’s secret key is 6, what is
the secret key they exchanged?

Q.4 Compare and contrast – MAC VS Encryption functions. In MAC, if 80-bit key
(a) 03
is used and the tag is 32 bits, then after how many rounds attacker will produce
a key, which must be the one used by the sender ?
(b) Explain working of Cipher-based Message Authentication Code and Data 04
Authentication Algorithm.
(c) Explain the working of Secure Hash Algorithm-512 in detail. 07
OR
Q.4 (a) Discuss three applications of hash functions. 03

1
 (b) Discuss Hash function and its requirements. 04
(c) Write the algorithm for message authentication code based on HASH 07
functions. Also discuss its efficient implementation approach.

Q.5 Draw X.509 certificate format. Enlist the reasons to revoke the certificate
(a) 03
before expiry.
(b) Explain different ways to distribute symmetric key using symmetric and 04
asymmetric encryptions.
(c) Enlist requirements of Kerberos. Enlist and explain roles of various servers are 07
used in Kerberos. Explain through diagram, how Kerberos can communication
with other administrative domains for providing trusted services to the clients.
OR
Q.5 (a) Explain briefly: Linear and Differential Cryptanalysis 03
(b) Explain various general categories of schemes for the distribution of public 04
keys.
(c) Define Digital signature. Explain digital signature algorithm. 07

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

2
Seat No.: ________ Enrolment No.___________

GUJARAT TECHNOLOGICAL UNIVERSITY

BE - SEMESTER–VII (NEW) EXAMINATION – SUMMER 2022
Subject Code:3170720 Date:10/06/2022
Subject Name:Information security
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.
4. Simple and non-programmable scientific calculators are allowed.
MARKS
Q.1 (a) Define the following terms: 03
(i) Security Attack (ii) Security Services (iii) Security Mechanism
(b) Answer following questions. 04
(i) 15 parties want to exchange messages securely using symmetric key
encryption algorithm. The number of distinct key values required
will be_________.
(ii) 15 parties want to exchange messages securely using asymmetric
key encryption algorithm. The number of distinct key values
required will be_________.
(iii) Total number of s-box used in DES is_________.
(iv) How many AES rounds are required for 128-bit key size?
(c) List and explain various types of attacks on encrypted message. 07

Q.2 (a) Encrypt the message “CORONA” using Hill Cipher with key [9 4] 03
5 7
(b) Discuss different techniques for public-key distribution. 04
(c) Elaborate DES encryption with neat sketches. 07
OR
(c) Elaborate AES encryption with neat sketches. 07

Q.3 (a) Discuss Meet-in-the-Middle Attack. 03

(b) Discuss Cipher Block Chaining (CBC) modes of operation with the help 04
of diagram.
(c) What is KDC? With the help of diagram explain how KDC do key 07
distribution.
OR
Q.3 (a) Discuss Man-in-the-Middle Attack. 03
(b) Discuss Cipher Feedback (CFB) block cipher modes of operation with the 04
help of diagram.
(c) Discuss briefly the working of KERBEROS authentication protocol. 07

Q.4 (a) Decipher the message ”KBSTZPEGBWNDGQHWQWC” Using 03

Vigenere cipher with key “confidential”
(b) Explain the following properties of hash function 04
(i) One way property
(ii) Weak collision resistance
(c) P and Q are two prime numbers. P=17, and Q=31. Take public key E=7. 07
If plain text value is 2, then what will be the private key and cipher text
value according to RSA algorithm? Explain in detail.

1
 OR

Q.4 (a) Encrypt the message “WE ARE DISCOVERED FLEE AT ONCE” 03
using Rail fence cipher with rail = 3
(b) Explain the triple DES scheme with two keys and write about proposed 04
attacks on 3DES
(c) For Diffie-Hellman algorithm, two publically known numbers are prime 07
number 23 and primitive root (g) of it is 9. A selects the random integer
4 and B selects 3. Compute the public key of A and B. Also compute
common secret key.

Q.5 (a) Define the following terms: 03

(i) Cryptography (ii) Cryptanalysis (iii) Brute-force attack
(b) Discuss SSL protocol stack. 04
(c) Discuss Secure Hash Algorithm (SHA) 07
OR

Q.5 (a) Illustrate variety of ways in which MAC code can be used to provide 03
Message authentication.
(b) Consider ElGamal cryptosystem in Z17 with generator 6. If the message 04
is 13 and the randomness chosen is 10, then find the ciphertext computed
using the public key 7.
(c) Discuss X.509 authentication service. 07

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

GVA