Question Bank for

CSE
III year-II sem (R22)
A.Y (2024-25)
 MACHINE LEARNING (R22)
UNIT-I
1. Explain about the Types of Machine Learning?

2. a.Explain Candidate Elimination Algorithm with an Example?

b. Explain FIND-S Algorithm with an Example?

3. Explain Perceptrons with Example?

4. Explain Concept of Learning as Search?

5. Explain about Linear Regression?

UNIT-II
1. Explain Multi-layer Perceptron with Example?

2. Explain the Back propagation learning algorithm?

3. Describe Radial Basis Function and Splines?

4. Explain about RBF Network?

5. Describe about SVM?

UNIT-III
1. Discuss about decision tree representation, in detail?

2. Contrast the hypothesis space search in ID3.

3. Write about Boosting Bagging?

4. a.Explain about EM Algorithm?

b. Describe briefly about k-nearest neighbor algorithm

5. Explain about K-Means Algorithm?

UNIT-IV
1. Explain about LDA and PCA?

2. Discuss Briefly about Genetic algorithms in detail?

3. Explain Independent Component Analysis?

4. a.Explain Locally Linear Embedding Algorithm?

5. a. Describe ISOMAP?

b. Explain MDS Algorithm?

 UNIT-V
1. Define Reinforcement Learning?

2. Explain Q-Learning Algorithm?

3. Explain about HMM?

4. Explain Bayesian belief network?

5. a.Explain about Sampling?

B.Explain Proposal Distribution?

 Formal Languages and Automata Theory
UNIT-I

1. Write the procedure to convert NFA to its equivalent DFA and convert t following NFA to
DFA.

2. Write the procedure to convert NFA with epsilon transitions to its equivalent NFA and
apply it on following NFA-€.

3. Write the procedure to convert NFA with epsilon transitions to its equivalent DFA and
apply it on following NFA-€.

4. Convert Moore machine to Mealy machine

5. Explain the steps for the minimization of given DFA with an example.
 UNIT-II

1. State and prove Arden’s theorem. Obtain regular expression for the following FA.

2. Convert the following Regular expressions to NFA with Ɛ.

(11+0)*(00+1)*

3. Construct DFA that accepts all strings corresponding to the regular expression 1*01(0+11)*.
Also explain how to convert regular expression to DFA.

4. Prove that the following language is not regular using pumping lemma
i i. L={an bn+1 | n>0}.
ii. L={ ww | w ꞓ (0,1)* }
5.
i) Construct the NFA for the regular expression (0+1)*(00+11)(01)(0+1)*
ii) Find regular expression for the following DFA.

UNIT-III

1. Use G be the grammar S->B|bA

A->a|aS |bAA
B->b|bS |aBB
For the string aaabbabbba Find
a. Leftmost Derivation.
b. Rightmost Derivation.
c. Derivation Tree.
 2. Check whether the following grammars
are ambiguous or not?
i. SaAB, AbC|cd, Ccd, Bc|d.
ii. EE+E|E-E|E*E|E/E|(E)|a.

3. Explain minimization or simplification of context free grammars.

Simplify the following grammar: SAaB|aaB, AD, BbbA|ɛ, DE, EF |aS.

4. Construct a PDA to accept the language L ={ anbn | n >= 1} by a final

state. Draw the graphical representation of the PDA. Also show the moves made by the PDA for
the string aaabbb.

5. Write the procedure to convert CFG to PDA and also convert the following CFG to PDA.
S->B | aAA
A->aBB | a
B->bBB|A
C->a

UNIT-IV

1. Convert the following CFG to CNF

S→~S/[SS]/p/q

2. Convert the following CFG to GNF

A1→A2A3
A2→A3A1/b
A3→A1A2/a

3. Convert the following CFG to CNF

S→bA/aB
A→bAA/aS/a
B→aBB/bS/b

4. Design a Turing Machine for the Multiplication of two integers.

5. a)Design a Turing Machine for L={ anbncn / n≥1 }.

b)Explain about the Programming Techniques for Turing Machines.

 UNIT-V

1. Explain Modified PCP and Completion of the proof of PCP undecidability

2. Explain how the Turing Machine accept the Empty Language
3. Explain Undecidable Problems about Turing Machines.
4. Compare and contrast FA,PDA and TM
5. a)Show that Halting problem is Undecidable
b)Explain in detail about Chomsky Hiearchy.
 Artificial Intelligence
UNIT-I

1. Explain the structure of an intelligent agent with an example.

2. Compare and contrast Breadth-first search and Depth-first search with suitable examples.
3. Describe the working of A* search algorithm with an appropriate example.
4. Explain Hill Climbing algorithm and discuss its limitations using a simple example.
5. What is Simulated Annealing? How does it differ from Hill Climbing in terms of exploration?

UNIT-II

1. Explain the Minimax algorithm and illustrate its working with a simple game tree.
2. Describe Alpha-Beta pruning and explain how it optimizes the Minimax algorithm.
3. Define Constraint Satisfaction Problems (CSP) and explain constraint propagation with an
example.

4. What is Forward and Backward Chaining? Illustrate their working with an example.
5. Explain the concept of Propositional Logic and discuss its role in Knowledge-Based Agents.

UNIT-III

1. Explain the syntax and semantics of First-Order Logic (FOL) with suitable examples.
2. Differentiate between Forward Chaining and Backward Chaining in First-Order Logic. Provide
an example for each.

3. What is Unification in First-Order Logic? Explain the process with an example.

4. Compare Propositional Logic and First-Order Logic in terms of expressiveness, inference, and
applications.

5. Describe the Resolution method in First-Order Logic. How does it help in theorem proving?
Illustrate with an example.

UNIT-IV

1. How does Ontological Engineering help in Knowledge Representation? Discuss the role of
categories and objects?

2. Explain the importance of reasoning with events and mental objects in AI. How does reasoning
with default information differ from strict logical reasoning?

3. Compare forward search (progression) and backward search (regression) planning approaches,
discussing their advantages and limitations in AI problem-solving?

4. What are planning graphs, and how do they improve efficiency in classical planning?
5. Discuss how heuristics improve planning performance and analyze their effectiveness in solving
large-scale real-world problems.
 UNIT-V

1. Why is uncertainty a fundamental challenge in AI decision-making?

2. Derive Bayes' Rule from the basic probability axioms. Explain how Bayes' Rule is used in AI
3. Explain how Bayesian Networks (BNs) represent probabilistic dependencies in an uncertain
domain.

4. Discuss approximate inference techniques used to make probabilistic reasoning more efficient.
5. Explain the key ideas behind Dempster-Shafer theory and relational/first-order probability.
 Software Testing Methodologies
UNIT-I
1. a) Describe briefly about a model for testing?
b) Difference between Debugging and testing?
2. Explain about path testing with an example and effectiveness of path Testing?
3. Define path sensitization and write heuristic the procedure used in path sensitization?
4. Briefly explain about taxonomy of bugs and how the bugs are going to occur?
5. Discuss in detail about path instrumentation with examples?
UNIT-II
1. Demonstrate an anomaly can be detected. Explain different types of data flow anomalies and
data flow anomaly state graphs?
2. Explain with an example of data flow graphs and data flow anomalies?
3. Describe about the data flow testing techniques?
4. Differentiate between static vs dynamic anomaly detection? Discuss in detail about slicing and
dicing?
5. Explain in detail about transaction flow testing techniques?
UNIT-III
1. Describe short notes on
i. Ambiguities and contradictions ii. Simplifying the topology
2. Describe about testing one dimensional and two dimensional domains?
3. Explain briefly about bug assumption in domain testing?
4. Describe briefly about nice and ugly domains?
5. Describe about domain bugs and how to test them?
UNIT-IV
1. Explain the push/pop arithmetic with an example? And explain the get/return arithmetic with an
example?
2. Demonstrate decision table and how is a decision table useful in Testing? Explain with the help
of an example?
3. a) Explain about the mean processing time of a routine with an example?
b) Describe briefly about probability application with example?
4. a) Explain about the Reduction procedure with an example?
b) Explain with an example of maximum path count arithmetic and lower path count arithmetic?
5. Explain briefly about regular expression and flow anomaly detection?
 UNIT-V
1. Demonstrate an algorithm for node reduction (general)? And Illustrate the applications of node
reduction algorithm?
2. Define graph matrices and evaluate graph matrix with pictorial graph explains the basic
algorithms?
3. Describe briefly about the application of GET/RETURN problem?
4. a) Discuss in brief about the state graphs with an example? And control recovery routine state
graph?
b) Describe briefly about matrix of a graph with suitable example?
5. a) Demonstrate power of a matrix with an example?
b) Explain briefly about Partitioning algorithm in graph matrix with example?
 Fundamentals of Internet of Things

Unit I

1. Define the Internet of Things (IoT) and explain its significance in today's world.
2. Describe the characteristics of IoT and how they contribute to its functionality.
3. Explain the physical design of IoT, including the key components of an IoT device.
4. What are the functional blocks of IoT? Explain each block briefly.
5. Discuss the role of communication protocols in IoT and list a few commonly used
protocols.

Unit II

1. Define Machine-to-Machine (M2M) communication and explain how it differs from IoT.
2. Describe the architecture of M2M systems, including the components of M2M area
networks.
3. Explain the importance of interoperability in IoT and the challenges associated with it.
4. What is Arduino programming? Describe the basics of integrating sensors and actuators
with Arduino.
5. Compare and contrast different communication protocols used in M2M systems.

Unit III

1. Explain the key features of Python that make it suitable for IoT development.
2. Describe the basic data types in Python and their importance in programming.
3. What is Raspberry Pi? Explain its architecture and functionality.
4. How can Raspberry Pi be interfaced with basic peripherals for IoT applications?
5. Write a Python script to read data from a temperature sensor connected to a Raspberry Pi.
 Unit IV

1. Define Software Defined Networking (SDN) and explain its key components.
2. Discuss how SDN supports IoT by improving network management and performance.
3. Explain the concept of "centralized network control" in SDN architecture.
4. Describe the role of OpenFlow in SDN and why it’s important for communication.
5. How can data handling and analytics improve IoT systems? Provide examples.

Unit V

1. Define cloud computing and explain its role in supporting IoT systems.
2. Discuss the concept of sensor-cloud and how it benefits IoT applications.
3. Explain how IoT is transforming smart cities and smart homes with practical examples.
4. Describe the concept of Industrial IoT (IIoT) and its applications in manufacturing and
healthcare.
5. Analyze a case study on IoT in agriculture or healthcare, explaining key benefits and
challenges.