|| Jai Sri Gurudev ||

BGSKH Education Trust(R.) - A unit of Sri Adichunchanagiri Shikshana Trust(R.)

BGS College Of Engineering and Technology

VTU – Dec.2024 / Jan. 2025 – V Sem Question Papers

2022 - Scheme
 V Semester Question Papers Dec.2024/Jan - 2025

Sl.No Name of the Subject Subject Code

1 Software Engineering and Project BCS501

Management
2 Computer Networks BCS502
3 Theory of Computation BCS503
4 Computer vision BA1515A
5 Data Warehousing BAD515B
6 Artificial Intelligence BCS515B
7 Research Methodology and IPR BRMK557
 pm
USN BCS501

Fifth Semester B.E./B.Tech. Degree Examination, Dec.2024/Jan.2025

4
:0
Software Engineering and Project Management

6
Time: 3 hrs. Max. Marks: 100

:4
Note: 1. Answer any FIVE full questions, choosing ONE full question from each module.

01

P
2. M : Marks , L: Bloom’s level , C: Course outcomes.

-M
Module – 1 M L C

5
Q.1 a. Explain software process and software engineering practices. 10 L2 CO1

02

P
b. Explain the waterfall model and incremental model, with diagram. 10 L2 CO1

-M
-2 OR
Q.2 a. Explain Boehm Spiral process model with a neat diagram. Mention its 10 L2 CO1

P
advantages and disadvantages.
01

-M
b. Explain the five activities of a generic process framework for software 10 L2 CO1
engineering.
8-

Module – 2
P
-0

Q.3 a. Explain the distinct tasks of requirement engineering. 10 L2 CO2

-M
b. Illustrate the UML use case diagram for safe home system. 10 L2 CO2
U

OR
VT

Q.4 a. Explain Class-Responsibility-Collaborator(CRC) modeling and data 10 L2 CO2

m
-M

modeling with an example.

2p
b. Explain the elements of analysis model in requirement modeling. 10 L2 CO2
Module – 3

P
P

:4

Q.5 a. Explain the principles of agile process development. -M 10 L2 CO3

-M

b. Explain the following : 10 L2 CO3

58

i) Adaptive software development

P
P

ii) SCRUM
:

-M
-M

01

OR
Q.6 a. Explain the concepts of extremes programming with a neat diagram. 10 L2 CO3
P

b. Explain design modeling principles that guide the respective framework 10 L2 CO3
P

25

-M

activity.
-M

Module – 4
20

Q.7 a. Illustrate the project management life cycle with a neat diagram. 10 L2 CO4
P
P

b. Explain : i) Different ways of categorizing software projects 10 L2 CO4

-M
1-
M

ii) Smart objectives

OR
-0

Q.8 a. Explain the difference between traditional versus modern project 10 L3 CO4
08

-M

management practices along with the role of management.

b. Explain software development life cycle (ISO 12207) with a neat diagram. 10 L2 CO4
Module – 5
P

Q.9 a. Explain Quality Management System with principles of BS EN ISO-9001- 10 L2 CO5

-M

2000.
b. Explain the following : 10 L2 CO5
P

i) McCall model ii) Garvin’s Quality Dimensions.

-M

OR
Q.10 a. Describe six generic functions allowed in automated estimation techniques 10 L3 CO5
of software projects.
P

b. Explain COCOMO II model. 10 L2 CO5

-M

*****
P
M
 pm
USN BCS502

Fifth Semester B.E./B.Tech. Degree Examination, Dec.2024/Jan.2025

8
:2
Computer Networks

0
Time: 3 hrs. Max. Marks: 100

:1
Note: 1. Answer any FIVE full questions, choosing ONE full question from each module.

01

P
2. M : Marks , L: Bloom’s level , C: Course outcomes.

-M
Module – 1 M L C

5
Q.1 a. What is data communication? List and explain characteristics and 06 L1 CO1

02

P
components of communication model.

-M
b. Define switching. Explain Circuit Switched Network and Packet Switched
-2 06 L2 CO1
Network.
c. With neat sketch, explain different layers of TCP/IP protocol suite. 08 L2 CO1

P
01

-M
OR
3-

Q.2 a. What are guided transmission media? Explain twisted pair cable in detail. 06 L1 CO1
P
-1

b. What is Virtual Circuit Network (VCN)? With neat diagram, explain three 08 L1 CO1
-M
phases involved in VCN.
U

c. Write a note on Encapsulation and decapsulation at Source Host for TCP/IP 06 L2 CO1
VT

protocol suite.
m
-M

2p
Module – 2
Q.3 a. Define Redundancy. Explain CRC encoder and CRC decoder operation 08 L2 CO2

P
P

:4

with block diagram. -M

-M

b. Distinguish between Flow Control and Error Control. Explain Stop and 08 L2 CO2
25

Wait Protocol.
P
P

c. List and explain Control Fields of I-frames, S-frames and U-frames. 04 L2 CO2
:

-M
-M

01

OR
Q.4 a. What is Hamming distance? With example, explain Parity Check Code. 06 L1 CO2
P
P

25

Define Framing. Explain character oriented framing and bit-oriented

-M

b. 06 L1 CO2
-M

framing.
20

c. With flow diagram, explain CSMA/CA. 08 L2 CO2

P
P

-M
1-
M

Module – 3
Q.5 a. Explain virtual-circuit approach to route the packets in packet-switched 10 L2 CO3
-0

network.
P
13

-M

b. Illustrate the working of OSPF and BGP. 10 L3 CO3

OR
P

Q.6 a. Explain IPv6 datagram format. 10 L2 CO3

-M

b. Write an Dijikstra’s algorithm to compute shortest path through graph. 06 L1 CO3

c. Write a note on Routing Information Protocol (RIP) algorithm. 04 L2 CO3
P
-M

Module – 4
Q.7 a. Explain Go-Back-N protocol working. 10 L2 CO4
b. With neat sketch, explain three-way handshaking of TCP connection 10 L2 CO4
P

establishment.
-M

1 of 2
P
M
 BCS502

pm
OR
Q.8 a. With an outline, explain selective repeat protocol. 10 L2 CO4

8
b. List and explain various services provided by User Datagram Protocol 10 L2 CO4

:2
(UDP).

0
Module – 5

:1
Q.9 a. Briefly explain Secure Shell (SSH). 10 L2 CO4

01
b. Write a note on Request message and response message formats of HTTP. 10 L2 CO4

P
-M
OR

5
Q.10 a. With neat diagram, explain the basic model of FTP. 04 L2 CO4

02

P
b. Describe the architecture of electronic mail (e-mail). 06 L3 CO4

-M
c. Briefly explain Recursive Resolution and Iterative Resolution in DNS.
-2 10 L2 CO4



P
01

-M
3-

P
-1

-M
U
VT

m
-M

2p

P
P

:4

-M
-M

25

P
P

-M
-M

01

P
P

25

-M
-M

20

P
P

-M
1-
M

-0

P
13

-M
P
-M
P
-M
P
-M

2 of 2
P
M
 pm
USN BCS503

2
Fifth Semester B.E./B.Tech. Degree Examination, Dec.2024/Jan.2025

:5
Theory of Computation

1
:1
Time: 3 hrs. Max. Marks: 100

01

P
Note: 1. Answer any FIVE full questions, choosing ONE full question from each module.

-M
2. M : Marks , L: Bloom’s level , C: Course outcomes.

5
Module – 1 M L C

02

P
Q.1 a. Define the following with example : 3 L1 CO1

-M
i) Language ii) String iii) Power of an alphabet.
-2
b. Define DFA. Draw a DFA to accepts. 10 L3 CO1

P
01
i) The set of all strings that contain a substring aba.

-M
ii) To accept the stings of a’s and b’s that contain not more than there b’s.
7-

iii) L = {w {a, b}* : No 2 consecutive characters are same in w}.

P
-1

Convert the following NFA to DFA.

-M
c. 7 L2 CO1
U

0 1
VT

→ p {p, q} {p}
m
-M

q {r} {r}
2p
r {s} ϕ
 s {s} {s}

P
P

:0

-M
-M

OR
28

Q.2 a. Define the following with example : 3 L1 CO1

P
P

i) Alphabet
:

-M
-M

ii) Reversal of string

01

iii) Concatenation of Languages.

P
P

25

b. Design a DFA for the Language : 7 L3 CO1

-M
-M

L = {w  {0, 1}* : w is a string divisible by 5}.

20

c. Define NFA. Obtain an  - NFA which accepts strings consisting of 0 or 10 L2 CO1

P

-M

more a’s , followed by 0 or more b’s followed by 0 or more C’s. Also

1-
M

convert it to DFA.
-0

Module – 2
17

-M

Q.3 a. Define Regular expression. Write the regular expression for the following 10 L2 CO2
languages :
i) Strings of a’s and b’s starting with a and ending with b.
P

ii) Set of strings that consists of alternating 0’s and 1’s.

-M

iii) L = {an bm , (n + m) is even}.

iv) L = {w : / w / mod 3 = 0 , where w {a, b}*}.
P
-M

1 of 3
P
-M
P
M
 BCS503

pm
b. Minimize the following finite automata using Table filling algorithm : 10 L2 CO2

2
δ a b

:5
→ A B A
B A C

1
C D B

:1
* D D A

01
E D F

P
F G E

-M
G F G

5
H G D

02

P
-M
OR
Q.4 -2
a. Construct  - NFA for the following Regular expression : 6 L1 CO2
i) (0 + 1) 0 1(1 + 0) ii) 1(0 + 1)* 0 iii) (0 + 1)* 0 1 1*

P
01

-M
b. Obtain the Regular expression that denotes the language accepted by 6 L3 CO2
7-

Fig. Q4(b).
P
-1

-M
Fig. Q4(b)
U
VT

Using Kleene’s theorem.

P

m
-M

c. State the Pumping Lemma for the Regular Languages. And also prove that 8 L1 CO2
2p
the following languages are note regular.

P
P

i) L = {0n 1m | n  m} ii) L = {0n 1 m 2n | n, m ≥ 1}.

:0

-M
-M

28

Module – 3
Q.5 a. Design CFG for the following languages : 10 L3 CO3
P
P

i) L = {an b n+3 , n ≥ 0}
:

-M
-M

01

ii) L = {ai bj ck , j = i + k , i ≥ 0 , k ≥ 0}
iii) L = {w / /w/ mod 3 > 0 where w {a}*}
iv) L = {am bn / m  n}
P
P

25

-M

v) Palinderomes over 0 and 1.

-M

20

b. Consider the grammar G with productions. 10 L2 CO3

P
P

S→Ab B/A/B ; A → aA /  ; B → a B / b B / .
-M
1-
M

Obtain LMD , RMD and parse tree for the string aaabab.
Is the given grammar ambiguous?
-0

OR
17

-M

Q.6 a. Define the following with example : 4 L1 CO3

i) Context free grammar ii) Left most Derivation
iii) Parse tree iv) Ambiguous grammar.
P
-M

b. Design PDA for the language : 10 L3 CO3

L = {ai bj ck / i + k = j , i ≥ 0 , k ≥ 0} and show the moves made by the PDA
P

for the string aabbbc.

-M

2 of 3
P
-M
P
M
 BCS503

pm
c. Convert the following CFG’s to PDA : 6 L2 CO3

2
S→aA ; A → a ABC / bB / a ; B → b ; C → c.

:5
Module – 4

1
Q.7 a. Define CNF. Convert the following CFG to CNF 10 L2 CO4

:1
E→E+T/T
T→T*F/F

01

P
F → (E) / I

-M
I → Ia / Ib / a / b.

5
b. Show that L = {0n 1n 2n / n ≥ 1} is no context free.

02

P
4 L2 CO4

-M
c. Prove that the family of context free languages is closed under union and
-2 6 L1 CO4
concatenation.

P
01

-M
OR
7-

Q.8 a. Define Greibach Normal Form. Convert the following CFG to GNF. 6 L2 CO4
S → AB ; A → aA/ bB / b ; B → b.
P
-1

-M
b. Consider the following CFG : 10 L3 CO4
U

S → ABC / BaB
VT

A → aA / BaC / aaa
P

B → bBb / a / D m
-M

C → CA / AC
2p
D→

P
P

i) What are useless symbols?

:0

-M
-M

ii) Eliminate  - productions , Unit productions and useless symbols from

28

the grammar.
P
P

c. Prove that the following languages are not context free. 4 L2 CO3
:

-M
-M

01

2
i) L = {ai / i is prime} ii) L = { a n / n ≥ 1}.
P
P

Module – 5
25

-M
-M

Q.9 a. Define a turing machine and explain with neat diagram, the working of a 6 L1 CO4
basic turing machine.
20

P
P

b. Design a Turing machine to accept the language, L = {an bn cn / n ≥ 1}. 14 L4 CO4

-M
1-
M

Draw the transition diagram and show the moves for the string aabbcc.
-0

OR
P
17

Q.10 a. Design a Turing machine to accept palindrome over {a, b} and draw the 12 L4 CO5
-M

transition diagram.
P

b. Write a short notes on : 8 L1 CO5

-M

i) Recursively Enumerable Language.

ii) Multitape Turing Machine.
P
-M

*****

3 of 3
P
-M
P
M
 pm
USN BAI515A

1
Fifth Semester B.E./B.Tech. Degree Examination, Dec.2024/Jan.2025

:2
Computer Vision

8
Time: 3 hrs. Max. Marks: 100

:0
Note: 1. Answer any FIVE full questions, choosing ONE full question from each module.

01

P
2. M : Marks , L: Bloom’s level , C: Course outcomes.

-M
5
Module – 1 M L C

02

P
Q.1 a. What is Compute Vision? Why is vision so difficult? Discuss the real – 10 L1 CO1

-M
world examples of computer vision.
-2
b. Explain the behavior of pinhole camera under different effects using a clear 10 L2 CO1

P
01
illustration to show the real–world example.

-M
2-

OR
Q.2 a. Explain the phong shading model. 8 L2 CO1
P
-2

b. Explain the Di-chromatic reflectance model. 5 L2 CO1

-M
c. What is meant by image filtering? Clearly discuss types of filter. 7 L1 CO1
U
VT

m
-M

Module – 2
7p
Q.3 a. Differentiate between a linear spatial filter and a non-linear spatial filter. 10 L2 CO2

P
Explain why bilateral filtering is quite show compared to regular separable
P

:1

filtering. -M
-M

b. Explain the binary image processing. Obtain the distance transform D(i, j) 10 L2 CO2
27

of a binary image B(i, j).

P
P

-M
-M

01

OR
Q.4 a. Explain the derivation of Discrete Fourier Transform (DFT) form the 10 L2 CO2
P

continuous transform of the sampled function.

P

25

-M

b. What are the geometric transformation? Explain the forward warping 10 L1 CO3
-M

algorithm for transforming an image.

20

P
P

-M
1-
M

Module – 3
Q.5 a. Give the probability density functions for Gaussion noise model and 10 L1 CO3
-0

Rayleigh noise models.

22

-M

b. Discuss the noise reduction capabilities of the following spatial filters : 10 L1 CO3
i) Arithmetic mean filter
ii) Geometric mean filter.
P
-M

OR
Q.6 a. Explain the image gradient and its properties. 10 L2 CO3
P

b. Explain the following gradient operators : 10 L2 CO3

-M

i) Roberts cross –gradient operators

ii) Sobel operator
iii) Prewitt operator
P

iv) Laplacian operator.

-M

1 of 2
P
M
 BAI515A

1 pm
:2
Module – 4

8
Q.7 a. Define the pseudocolor processing of digital images. Explain the graphical 10 L2 CO4

:0
interpretation of the intensity slicing technique.
b. Discuss the procedure for conversion from RGB color model to HIS color 10 L2 CO4

01

P
model.

-M
5
OR

02
a. Illustrate how full-color images are handled for a variety of image 10 L2

P
Q.8 CO4

-M
processing tasks.
-2
b. Explain the color image smoothing and sharpening procedure. 10 L2 CO4

P
01

-M
Module – 5
2-

Q.9 a. Explain how morphological operations are performed between images and 10 L2 CO5
structuring elements. P
-2

-M
b. Write short notes on the following : 10 L2 CO5
U

i) Erosin
ii) Dialation.
VT

m
-M

OR
7p
Q.10 a. Explain the procedures in the “boundary following” algorithm that traces 10 L2 CO5

P
P

the boundary in binary image.

:1

-M
-M

b. What is Pattern Classification? Explain the minimum distance classifier. 10 L2 CO5

27

P
P

*****
-M
-M

01

P
P

25

-M
-M

20

P
P

-M
1-
M

-0

P
22

-M
P
-M
P
-M

2 of 2
P
-M
P
M
 pm
USN BAD515B

0
Fifth Semester B.E./B.Tech. Degree Examination, Dec.2024/Jan.2025

:2
Data Warehousing

8
Time: 3 hrs. Max. Marks: 100

:0
Note: 1. Answer any FIVE full questions, choosing ONE full question from each module.

01

P
2. M : Marks , L: Bloom’s level , C: Course outcomes.

-M
5
Module – 1 M L C

02

P
Q.1 a. Discuss the escalating need for strategic information in modern business. 10 L2 CO2

-M
How does this need impact decision making processes?
-2
b. Bring out the differences between operational systems and decision support 10 L3 CO2

P
01
systems in detail.

-M
OR
2-

Q.2 a. How do you justify “Data warehousing the only viable solution? 10 L2 CO1
b. Compare data warehouses and data marts. Discuss when and why an 10 L3 CO1
P
-2

organization might choose one over the other.

-M
U

Module – 2
VT

Q.3 a. Discuss on any four key issues to be considered while planning for data 10 L2 CO2
m
-M

warehouse.
5p
b. Illustrate the process of data transformation and its significance in data 10 L2 CO2

P
warehousing
P

:1

OR
-M
-M

Q.4 a. How are data warehouse projects different from OLTP system projects? 10 L2 CO2
27

Describe any four such differences.

P
P

b. With a neat diagram, explain the architectural components driven by the 10 L3 CO2
:

-M
-M

01

requirements.
P

Module – 3
P

25

-M

Q.5 a. Define the architectural framework and how do they interact to support data 10 L3 CO3
-M

warehousing explain with a neat diagram.

20

b. Analyze the significance of metadata in data warehousing. How does it 10 L4 CO3

P
P

improve data accessibly and management within the warehouse.

-M
1-
M

OR
a. List out the guidelines for selecting appropriate hardware and operating
-0

Q.6 10 L3 CO3
P

system for the data warehouse.

22

-M

b. With a neat diagram, discuss on the tools required for a data warehouse. 10 L4 CO3

Module – 4
P

Q.7 a. What are star schema keys, and what role do they play in a star schema. 10 L3 CO4
-M

Describe how they contribute to data organization and retrieval.

b. Describe the ETL tools used in data warehousing. How do these tools 10 L4 CO4
P

improve ETL process?

-M

OR
Q.8 a. Discuss the methods for handling updates to dimension tables in a data 10 L3 CO4
warehouse. What strategies exist for managing slowly changing
P

dimensions?
-M

b. Outline the essential steps and requirements in the ETL process. 10 L4 CO4
1 of 2
P
M
 BAD515B

pm
Module – 5

0
Q.9 a. Identify the key challenges of maintaining data quality in a data warehouse. 10 L3 CO5

:2
b. List and explain the major features and functions of OLAP in data 10 L3 CO5

8
warehouse.

:0
OR
Q.10 a. List and explain five criteria for selecting information delivery tools for 10 L3 CO5

01

P
your data warehouse.

-M
b. Describe briefly two major features of the web –enabled data warehouse. 10 L3 CO5

5
02

P
*****

-M
-2

P
01

-M
2-

P
-2

-M
U
VT

m
-M

5p

P
P

:1

-M
-M

27

P
P

-M
-M

01

P
P

25

-M
-M

20

P
P

-M
1-
M

-0

P
22

-M
P
-M
P

2 of 2
-M
P
-M
P
M
 BCS515B

pm
USN

Fifth Semester B.E./B.Tech. Degree Examination, Dec.2024/Jan.2025

3
Artificial Intelligence

:2
Time: 3 hrs. Max. Marks: 100

8
Note: 1. Answer any FIVE full questions, choosing ONE full question from each module.

:0
2. M : Marks , L: Bloom’s level , C: Course outcomes.

01

P
Module – 1 M L C

-M
Q.1 a. Define the following : 5 L2 CO1
i) Intelligence ii) Artificial Intelligence iii) Agent iv) Rationality

5
v) Logical reasoning.

02

P
-M
b. Examine the AI literature to discover whether the following tasks can 8 L2 CO1
-2
currently be solved by computers.
i) Playing a decent game of table tennis (ping-pong)

P
01
ii) Discovering and proving new mathematical theorems

-M
iii) Giving competent legal advice in a specialized area of law
2-

iv) Performing a complex a surgical operation.

P
-2

c. Implement a simple reflex agent for the vacuum environment. Run the 7 L3 CO1
-M
environment with this agent for all possible initial dirt configurations and
U

agent locations. Record the performance score for each configuration and
VT

the overall score.

m
-M

3p
OR
Q.2 a. Is AI a science, or is it engineering or neither or both? Explain. 5 L2 CO1

P
P

:2

-M
-M

b. Write pseudocode agent programs for the goal based and utility based 8 L1 CO1
27

agents.
P
P

For each the following activities give a PEAS description.

-M

c. 7 L1 CO1
-M

01

i) Playing a tennis match

ii) Performing a high jump
P

iii) Bidding on an item in an auction.

P

25

-M
-M

Module – 2
20

Q.3 a. Explain why problem formulation must follow goal transformation. 5 L1 CO1
P
P

-M
1-
M

b. Give complete problem formulation for each of the following choose a 8 L2 CO2
formulation that is precise enough to be implemented.
-0

i) Using only four colors, you have to color a planar graph in such a way
P

that no two adjacent regions have the same color.

22

-M

ii) A 3 – foot – tall monkey is in a room where some bananas are

suspended from the 8-foot ceiling. He would like to get the bananas.
The room contains two stackable, moveable, climbable 3-foot high
P
-M

crates.

c. Prove each of the following statements or given counter example : 7 L2 CO2

P

i) Breadth – first search is a special case of uniform – cost search.

-M

ii) Uniform – cost search is a special case of A* search.

1 of 3
P
-M
P
M
 BCS515B

pm
OR
Q.4 a. Define the following terms with example. 8 L2 CO2
i) State space ii) Search node iii) Transition model

3
iv) Branching factor.

:2
b. Show that the 8-puzzle states are divided in to two disjoint sets, such that 7 L2 CO2

8
any state is reachable from any other state in the same set, while no state is

:0
reachable from any state in the other set. Devise a procedure to decide
which set a given state is in and explain why this is useful for generating

01

P
random state.

-M
5
c. Describe a state space in which iterative deepening search performs much 5 L2 CO2
worse than depth first search for example, O(n2)Vs O(n)).

02

P
-M
Q.5
-2 Module – 3
a. Devise a state space in which A* using GRAPH-SEARCH returns a 7 L2 CO3

P
01
suboptimal solution with h(n) function that is admissible but inconsistent.

-M
2-

b. Which of the following are correct? 8 L1 CO3

i) (A  B)  (C  D  E)F(A  B)
P
-2

ii) (A  B)  (C  D  E)F(A  B)  (D  E)

-M
iii) (A  B) (A  B) is satistiable
U

iv) (A  B)  C has the same number of models as ( A  B)

VT

m
Consider a vocabulary with only four propositions, A, B, C and D. How
-M

c. 5 L1 CO3
many models are there for the following sentences?
3p
i) B  C ii) A  B  C  D iii) ( A  B)  A  B  C  D .

P
P

:2

-M
-M

OR
27

Q.6 a. Prove that if a heuristic is consistent, it must be admissible. Construct an 8 L1 CO3

admissible heuristic that is not consistent.
P
P

-M
-M

01

b. Prove each of the following assertions : 7 L1 CO3

i)    if and only if the sentence (   ) is valid
P

ii)    if and only if the sentence   ) is unsatisfiable.

P

25

-M
-M

c. Prove, or find a counter example to each of the following assertions. 5 L1 CO3

20

i) If   (  ) then    and   
P
P

ii) If   (  ) then    and    (or) both

-M
1-
M

-0

Module – 4
P

Q.7 a. Which of the following are valid necessary true sentences? 7 L1 CO4
22

-M

i) (x x  x)  (y  z y  z)
ii) x P(x) p(x)
P

iii) x smart(x)  (x = x)
-M

b. Prove that universal Instantiation is sound that existential instanticition 5 L1 CO4

produces an inferentially equivalent knowledge base.
P
-M

2 of 3
P
-M
P
M
 BCS515B

pm
c. Write down logical representations for the following sentences, suitable for 8 L1 CO4
use with generalized modulus ponens :
i) Horses, cows and pigs are mammals

3
ii) Bluebeard is Charlie’s parent

:2
iii) Offspring and parent are inverse relations

8
:0
OR
Q.8 a. Consider a knowledge base containing just two sentence ; P(a) and P(b) 5 L2 CO4

01

P
does this knowledge base entail x P(x)? Explain your answer interms of

-M
models.

5
b. Suppose a knowledge base contains just one sentence, 8 L2 CO4

02

P
xAs High As(x, Everest) which of the following are legitimate results of

-M
applying existential instantiation?
-2
i) AsHighAs(Kilimanjaro, Everest)
ii) AsHighAs(Kilimanjaro, Everest)  AsHighAs (Benvevis, Everest)

P
01

-M
c. Explain how to write any 3-SAT problem of arbitrary size using a single 7 L2 CO4
2-

first order definite clause and no more than 30 ground facts.

P
-2

-M
Module – 5
U

Q.9 a. i) Give a backward chaining proof of the sentence7  3 + 9. Show only the 8 L1 CO5
steps that leads to success
VT

m
ii) Give a forward chaining proof of the sentence 7  3 + 9. Show only the
-M

steps that leads to success.

3p
b. Describe the differences and similarities between problem solving and 5

P
L2 CO5
P

:2

planning. -M
-M

27

c. Prove that backward search with PDDL problems is complete. 7 L1 CO5

P
P

-M
-M

OR
01

Q.10 a. The following prolog code defines a predicate P 8 L1 CO5

P(x, [x|y]),
P
P

25

P(x, [y|z]) :- P(x, z)

-M
-M

i) Show proof trees and solutions for the queries P(A, [ 2, 1, 3]) and
P(z,[1, A, 3])
20

ii) What standard list operation does P represent?

P
P

-M
1-
M

b. Explain why dropping negative effects from every action schema in a 5 L2 CO5
planning problem results in a relaxed problems.
-0

c. Prove the following assertions about planning graphs : 7 L1 CO5

22

-M

i) A literal that does not appear in the final level of the graph connot be
achieved.
P

ii) The level cost of a literal in a serial graph is no greater than the actual
-M

cost of an optimal plan for achieving it.

*****
P
-M

3 of 3
P
-M
P
M
 BRMK557

pm
USN

Fifth Semester B.E./B.Tech. Degree Examination, Dec.2024/Jan.2025

3
Research Methodology and IPR

1 :0
Time: 3 hrs. Max. Marks: 100

:1
Note: 1. Answer any FIVE full questions, choosing ONE full question from each module.
2. M : Marks , L: Bloom’s level , C: Course outcomes.

01

P
-M
Module – 1 M L C
Q.1 a. Identify the meaning of Research and brief out the objective and motivation 10 L1 CO1

5
in engineering research.

02

P
-M
b. Explain brief about research cycle and verify with the research flow 10 L1 CO1
diagram.
-2

P
01
OR

-M
Q.2 a. Identify the types of engineering research and briefly explain them. 10 L1 CO1
7-

b. Explain about the different types of research misconduct.

P 10 L1 CO1
-2

-M
U

Module – 2
Q.3 a. Explain about the importance of literature review and technical reading. 10 L2 CO2
VT

m
-M

b. Mention the various benefits of bibliographic databases. 10 L1 CO2

0p
OR

P
P

:5

Q.4 a. Indentify the impact of technical reaction and brief about it. -M 10 L1 CO2
-M

26

b. Enumerate the impact of title and keywords on citation with example. 10 L2 CO2
P
P

-M
-M

Module – 3
01

Q.5 a. Define Intellectual properties and explain about its types. 10 L1 CO3
P
P

25

b. Explain about the key aspect of patent law. 10 L2 CO3

-M
-M

OR
20

Q.6 a. Explain about the assessment of novelty. 10 L1 CO3

P
P

-M
1-
M

b. Brief about the patent procedure in India. 10 L1 CO4

-0

Module – 4
27

-M

Q.7 a. Mention and brief about the justification for copyright law. 10 L2 CO4

b. Explain about the basic concepts of under lying copyright law. 10 L1 CO4
P
-M

OR
Q.8 a. Brief about the various representations of sound recordings. 10 L2 CO5
P

b. Explain about TRIPS agreement in detail. 10 L1 CO5

-M

1 of 2
P
-M
P
M
 BRMK557

pm
Module – 5

3
Q.9 a. Explain about the justification of protection designs. 10 L2 CO5

:0
b. Brief about the excluded subjected matter in the context of design 10 L1 CO5

1
protection.

:1
OR

01

P
Q.10 a. What are the rights of the owner of designs? Explain. 10 L1 CO5

-M
b. Brief about the Assignment of Design Rights. 10 L1 CO5

5
02

P
*****

-M
-2

P
01

-M
7-

P
-2

-M
U
VT

m
-M

0p

P
P

:5

-M
-M

26

P
P

-M
-M

01

P
P

25

-M
-M

20

P
P

-M
1-
M

-0

P
27

-M
P
-M

2 of 2
P
-M
P
-M
P
M