DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

SUBJECT: ARTIFICIAL INTELLIGENCE (III CSE-A,B,C)

QUESTION BANK

UNIT-1

SYLLABUS: Introduction to artificial intelligence: Introduction ,history, intelligent

systems, foundations of AI, applications, tic-tac-tie game playing, development of AI
languages, current trends in AI.
Text Books:
1. Artificial Intelligence, Saroj Kaushik, CENGAGE Learning,
2. Artificial intelligence, A modern Approach , 2nd ed, Stuart Russel, Peter Norvig, PEA
3. Artificial Intelligence, Rich, Kevin Knight, Shiv Shankar B Nair, 3rd ed, TMH
4. Introduction to Artificial Intelligence, Patterson, PHI

Topic name: Introduction

1. What is AI? Explain any four approaches to AI. [Dec/Jan-2022-23]

Topic name: History of AI

1. Briefly explain the history of Artificial Intelligence. [Dec/Jan-2022-23]

Topic name: Intelligent systems

1. Discuss categorization of intelligent systems. [Dec/Jan-2022-23]

Topic name: Foundations of AI

1. Discuss about the Foundations of AI

Topic name: Applications of AI

1. List out the Applications of AI [Dec/Jan-2022-23]

Topic name: Tic-Tac-Toe game playing

1. Discuss the tic-tac-toe problem in detail and explain how it can be solved using AI techniques?
[Dec/Jan-2022-23]

Topic name: Development of AI languages

1. Explain about the development of AI languages.

Topic name: Current Trends of AI

1. List out the current trends of AI [Dec/Jan-2022-23]
UNIT-2
SYLLABUS: Problem solving: state-space search and control strategies: Introduction,
general problem solving, characteristics of problem Search Strategies: exhaustive
searches, heuristic search techniques, iterative-deepening A*, constraint satisfaction
Text Books: 1. Artificial Intelligence, Saroj Kaushik, CENGAGE Learning,
2. Artificial intelligence, A modern Approach , 2nd ed, Stuart Russel, Peter
Norvig, PEA 3. Artificial Intelligence, Rich, Kevin Knight, Shiv Shankar B
Nair, 3rd ed, TMH
4. Introduction to Artificial Intelligence, Patterson, PHI

Topic name: State-space search and control strategies

1. Draw a state space representation of Towers of Hanoi problem [Dec/Jan-2022-23]
2. Describe different control strategies used in problem solving. [Dec/Jan-2022-23]
3. Provide a state space for the game of chess. [Dec/Jan-2022-23]
Topic name: Characteristics of problem Search Strategies
1. Discuss the characteristics of AI problem. [Dec/Jan-2022-23]
2. Solve the water-jug problem by writing the production rules. [Dec/Jan-2022-23]
Topic name: Exhaustive searches
1. Explain various blind search strategies [Dec/Jan-2022-23]
2. Illustrate the heuristic Hill climbing algorithm with an example. [Dec/Jan-2022-23]
Topic name: Heuristic search techniques
1. Explain the Heuristic Search Techniques. [Dec/Jan-2022-23]
Topic name: Iterative-deepening A*
1. Explain about A* algorithm in detail. [Dec/Jan-2022-23]
Topic name: Constraint satisfaction
1. . Define constraint satisfaction problem (CSP). How CSP is formulated as a search problem?
Explain with an example. [Dec/Jan-2022-23]

UNIT-3
SYLLABUS: Logic concepts: Introduction, propositional calculus, proportional logic,
natural deduction system, axiomatic system, semantic tableau system in proportional
logic, predicate logic
Text Books: 1. Artificial Intelligence, Saroj Kaushik, CENGAGE Learning,
2. Artificial intelligence, A modern Approach , 2nd ed, Stuart Russel, Peter
Norvig, PEA 3. Artificial Intelligence, Rich, Kevin Knight, Shiv Shankar B
Nair, 3rd ed, TMH
4. Introduction to Artificial Intelligence, Patterson, PHI

PART-A
Topic name: Propositional calculus
1. Solve the given propositional calculus expressions are equivalent or not (P->Q->R) AND (P-
>Q ^ Q->R) [Dec/Jan-2022-23]
2. Show by using truth table the expressions are logical equivalent [(A → B) →C, A→ (B →
C)] and [(A ˄ ~ B) →C, ~ (A ˄ ~ B ˄ ~ C)]. [Dec/Jan-2022-23]
Topic name: Propositional logic
1. Give the rules of inference in propositional logic. [Dec/Jan-2022-23]
2. Explain the syntax and semantics of propositional logic [Dec/Jan-2022-23]
 3. Decide whether each of following sentence is valid, unsatisfiable or neither. Verify your
decisions using truth tables and equivalence rules
i) Big V Dumb V (Big => Dumb)
ii) (Big Λ Dumb) V ¬Dumb
iii) (A Λ B) V (B Λ C)
Topic name: Natural deduction system
1. Explain about Natural Deduction system.
2. Explain natural deduction using an example. [Dec/Jan-2022-23]

PART-B

Topic name: Axiomatic system

1. Define Axiomatic system. State the axioms and the rules used in the Axiomatic system.
[Dec/Jan-2022-23]
Topic name: Semantic tableau system in proportional logic
1. Illustrate semantic tableau system in propositional logic using the rules? [Dec/Jan-2022-23]
2. Prove the following theorem using deductive inference rules From A → B ˄ C, A infer C, from
A ˄ B, A → C infer C. [Dec/Jan-2022-23]
3. Apply resolution refutation in proportional logic for checking the equivalence of expressions.
[Dec/Jan-2022-23]
Topic name: Predicate logic
1. What is predicate logic? Explain the predicate logic representation with reference to suitable
example.
2. Consider the following sentences
i. John likes all kinds of Food
ii. Apple is Food
iii. Chicken is Food
iv. Anything anyone eats and is not killed by is Food.
v. Bill eats Peanuts and is still Alive
vi. Sue eats Peanuts and is still Alive
a. Translate the above sentences into Predicate Logic.
b. Convert the Above Formulas into Clause Form.
c. Using Resolution Prove that “John likes Peanuts”.

UNIT-4
SYLLABUS: Knowledge representation: Introduction, approaches to knowledge
representation, knowledge representation using semantic network, extended semantic
networks for KR Advanced knowledge representation techniques: Introduction,
conceptual dependency theory, script structure.
Text Books: 1. Artificial Intelligence, Saroj Kaushik, CENGAGE Learning,
2. Artificial intelligence, A modern Approach , 2nd ed, Stuart Russel, Peter
Norvig, PEA 3. Artificial Intelligence, Rich, Kevin Knight, Shiv Shankar B
Nair, 3rd ed, TMH
4. Introduction to Artificial Intelligence, Patterson, PHI

Topic name: Knowledge representation, approaches to knowledge representation

1. Discuss about Knowledge Representation using Semantic Network. [Dec/Jan-2022-23]
2. Give an overview of various knowledge representation approaches.
3. Explain about Knowledge representation using Frames

Topic name: Knowledge representation using semantic network, extended semantic

networks for KR
1. Represent the following knowledge using a semantic network [Dec/Jan-2022-23]
Anil is a writer
Anil lives in Bombay
Swathi is a teacher
Swathi lives in Bangalore.
Anil sent a copy of his book to Swathi
Swathi sent her thanks to Anil.

2. Explain about Extended semantic networks for KR. [Dec/Jan-2022-23]

3. Represent the following knowledge using a semantic network [Dec/Jan-2022-23]
Tom is a Cat
Tom caught a bird
Tom is owned by John
Tom is ginger in colour
Cats like cream
Cat is on the mat
A Cat is a Mammal
A Bird is an animal
All mammals are animals
Mammals have fur
Topic name: Conceptual dependency theory
1. Explain about the rules for conceptual dependencies. [Dec/Jan-2022-23]
Topic name: Script Structure
1. What is meant by Script? Write a script for i. Going to Theatre ii. Write a script for Restaurant
Problem. [Dec/Jan-2022-23]

UNIT-5
SYLLABUS: Expert system and applications: Introduction phases in building expert
systems, expert system versus traditional systems, rule-based expert systems blackboard
systems truth maintenance systems, application of expert systems, list of shells and tools.
Text Books: 1. Artificial Intelligence, Saroj Kaushik, CENGAGE Learning,
2. Artificial intelligence, A modern Approach , 2nd ed, Stuart Russel, Peter
Norvig, PEA 3. Artificial Intelligence, Rich, Kevin Knight, Shiv Shankar B
Nair, 3rd ed, TMH
4. Introduction to Artificial Intelligence, Patterson, PHI
Topic name: Introduction phases in building expert systems
1. With the help of a neat diagram, explain the Expert System Architecture[Dec/Jan-2022-23]
2. What is Inference Engine? Describe Backward and Forward chaining mechanism used by an
inference engine? [Dec/Jan-2022-23]
3. Give two examples of non-monotonic system. Consider some monotonic and non monatomic
applications and show how you can solve them using truth monotonic system.
Topic name: Expert system versus Traditional systems
1. How is an expert system different from a traditional program? [Dec/Jan-2022-23]

Topic name: Rule-based expert systems blackboard systems truth maintenance systems
 1. Build a rule based expert system for criminal identification. [Dec/Jan-2022-23]
2. Explain the Issues in black board systems for problem solving. [Dec/Jan-2022-23]
Topic name: Application of expert systems
1. Explain the Applications of the Expert systems. [Dec/Jan-2022-23]
2. Explain about MYCIN Expert system in detail. [Dec/Jan-2022-23]
Topic name: List of shells and tools
1. List the characteristics of expert systems. Classify various Expert System shells and
tools[Dec/Jan-2022-23]

SUBJECT: COMPUTER NETWORKS (III CSE-A,B,C)

UNIT1
Syllabus:
UNIT I: Introduction: Network Types, LAN, MAN, WAN, Network Topologies
Reference models- The OSI Reference Model- the TCP/IP Reference Model - A
Comparison of the OSI and TCP/IP Reference Models, OSI Vs TCP/IP, Lack of OSI
models success, Internet History. Physical Layer –Introduction to Guided Media-
Twisted-pair cable, Coaxial cable and Fiber optic cable and unguided media: Wireless-
Radio waves, microwaves, infrared.
Text Books:
1. Computer Networks — Andrew S Tanenbaum, Fifth Edition. Pearson Education/PHI
2. Data Communications and Networks – Behrouz A. Forouzan, Fifth Edition TMH.
References Books:
1. Data Communications and Networks- Achut S Godbole, Atul Kahate
2. Computer Networks, Mayank Dave, CENGAGE
Topic name: Computer networks definition,Characteristics
1.what do you mean by computer networks? Classify computer networks and explain them
In brief. [7M] [Reg Feb2022] Knowledge CO1
2.What are the characteristics of computer networks. Analysis[7M] [Oct/Nov-2017]
Analysis CO1
Topic name: Network Types
3.Explain various categories of network, Explain different Network Types. [7M] [Reg
Feb2022] Knoledge CO1
4. Explain different Network topologies of the network, List any 3 network topologies. [7M]
[ June/July-
2022]Analysis CO1
Topic name: The OSI Reference Mode the TCP/IP Reference Model
5.What is the significance of layered Architecture Explain the OSI Layered Architecture with
neat sketch? (OR)explain the functionality of each layer in OSI reference model [7M] [Reg
Feb2022]Understand CO1
6.Explain the responsibilities of physical, Data link, network, Transport, presentation and
session layer in OSI model. [7M] [ Reg Feb2022] Understand CO1
7.What is TCP/IP reference model. [7M] [Reg Feb2022] [Dec/Jan-2022-23] Understand
CO1
8.Explain the difference between OSI model and TCP/IP model. (OR) Compare and Contrast
OSI model and TCP/IP reference model. [7M] [ Dec/Jan -2022-23] Analyze CO1
Topic name: Internet History
9.What is internet, explain the Architecture of Internet with neat sketch, discuss its history.
[ June/July-2022] Understand CO1
10. Briefly explain ARPANET design, Limitations. [7M] [ Dec/Jan -2022-23] Understand
CO1
11. Classify internet, intranet and extranet with applications. [7M][Dec/Jan-2022-23]
Understand CO1
Topic name: Guided Media,unguided media:
12.Describe the Transmission media. What are the types of Transmission media? [7M] ]
Understand
[ June/July-2022]
CO1
13.Explain the difference between guided and unguided media with diagrams, compare their
performance. [7M] [Dec/Jan-2022-23] Analyze CO1
14. Briefly explain Network devices. [7M] [ June/July-2022] Understand CO1
15. Explain about fibre optic cable? What are the types of fibre optic cable? [7M][Dec/Jan-
2022-23] Understand CO1
UNIT-II

Syllabus:
Data link layer: Design issues, Framing: fixed size framing, variable size framing, flow
control, error control, error detection and correction codes, CRC, Checksum: idea,
one’s complement internet checksum, services provided to Network Layer, Elementary
Data Link Layer protocols: simplex protocol, Simplex stop and wait, Simplex protocol
for Noisy Channel. Sliding window protocol: One bit, Go back N, Selective repeat-Stop
and wait protocol, Data link layer in HDLC: configuration and transfer modes, frames,
control field, point to point protocol (PPP): framing transition phase, multiplexing,
multi link PPP
Text Books:
1. Computer Networks — Andrew S Tanenbaum, Fifth Edition. Pearson Education/PHI
2. Data Communications and Networks – Behrouz A. Forouzan, Fifth Edition TMH.
References Books:
1. Data Communications and Networks- Achut S Godbole, Atul Kahate
2. Computer Networks, Mayank Dave, CENGAGE
Topic name: Data link layer: Design issues, Framing: fixed size framing, variable size
framing,
1.Explain the significance of datalink layer, explain the design issues of datalink layer. [7M]
[Dec/Jan-2022-23] Understand CO3
2.What is need of framing, various methods for implementing framing in data link layer
And Explain character, Bit stuffing for framing. [7M] [Dec/Jan-2022-23]Analyze
CO3
3.Explain about the datalink layer frame and frame fields. [7M] [Apr/May-2019]
Understand CO3
Topic name: flow control, error control, error detection and correction codes, CRC,
Checksum: idea, one’s complement internet checksum, services provided to Network
Layer
4.Explain the following error detection techniques with example i) LRC ii) CRC iii)
Checksum [7M] [Dec/Jan-2022-23]
Understand CO3
5.What is meant by error in data link layer? Discuss about error detection and correction
methods in data link layer, [7M] [Dec/Jan-2022-23]Analyze CO3
6.Explain the CRC error detection technique using generation polynomial x4+x3+1 data is
11100011. [7M] [Dec/Jan-2022-23] Understand CO3
7.A bit stream 10011101 is transmitted using the standard CRC method. The generator
polynomial is x3+1. Show the actual bit string transmitted. Suppose the third bit from the
left is inverted during transmission. Show that this error is detected at the receiver end.
[7M]Evaluate CO3
8.A sender sends series of frames to the same destination using 5-bit sequence number. If
the sequence number starts with 0, what is the sequence number after sending 100
frames? [7M] [Jun/Jul-2022] Evaluate CO3
9.Discuss datalink layer protocols for noiseless channels and noisy channels in detail.
[7M] [Dec/Jan-2022-23]Understand
CO3
10.A bit stream 10011101 is transmitted using CRC method .The generator polynomial is
X 3+1. Show that the actual bit transmitted. Suppose that third bit from left is inverted
during the transmission. Show that this error is detected at the receiver’s end.
[7M] [Apr/May-2019] Evaluate CO3

Topic name: Elementary Data Link Layer protocols,Sliding window protocol,multi link
PPP
11.Explain in detail about Point-to-Point Protocol. [7M] [Dec/Jan-2022-23] Understand
CO3
12.Explain the elementary datalink layer protocols. [7M] [Apr/May-2019] Understand CO3
i) Simplex protocol ii) simplex stop and wait iii) simplex protocol for noisy
channel
13.Explain the Sliding window flow control mechanisms. Explain the drawbacks of Stop
and wait? How they overcome by Sliding window protocol.
[7M] [Dec/Jan-2022-23] Understand
CO3
14.Describe about the Selective –Repeat protocol. [7M] [Jun/Jul-2022] Understand CO3

Unit3 (part 1)
Syllabus:
Media Access Control: Random Access: ALOHA, Carrier sense multiple access
(CSMA), CSMA with Collision Detection, CSMA with Collision Avoidance, Controlled
Access: Reservation, Polling, Token Passing,
Text Books:
1. Computer Networks — Andrew S Tanenbaum, Fifth Edition. Pearson Education/PHI
2. Data Communications and Networks – Behrouz A. Forouzan, Fifth Edition TMH.
References Books:
1. Data Communications and Networks- Achut S Godbole, Atul Kahate
2. Computer Networks, Mayank Dave, CENGAGE

Topic name: Media Access Control: Random Access: ALOHA, Carrier sense multiple
access (CSMA), CSMA with Collision Detection, CSMA with Collision Avoidance
1.What is a collision. What is the need of MAC protocols? Explain Channelization
protocols with neat sketch. [7M] [Dec/Jan-2022-23] Understand CO4
2.Explain the concept of wired LAN’s. Explain in detail IEEE-802.3. [7M] [Dec/Jan-2022-
23]
Understand CO4
3.What is the purpose of CSMA with collision detection? Explain it. [7M] [Dec/Jan-2022-
23]
Understand CO4
4.Discuss briefly about the MAC layers in 802.11 standards. [7M] [Jun/Jul-2022]
Understand CO4
Topic name: Controlled Access: Reservation, Polling, Token Passing,
5.Explain controlled access protocols with neat sketch. [7M] [Dec/Jan-2022-23] Understand
CO4

6.Explain Token Ring technology. [8M] [ June/July-2022] Understand CO4

Unit3 (Part-2)
Syllabus:
Channelization: frequency division multiple Access(FDMA), time division multiple
access(TDMA), code division multiple access(CDMA). Wired LANs: Ethernet, Ethernet
Protocol, Standard Ethernet, Fast Ethernet(100 Mbps), Gigabit Ethernet, 10 Gigabit Ethernet.
Topic name: Channelization
7. Explain Channelization protocols with neat sketch. [7M] [Dec/Jan -2022-23] Understand
CO4
8. Write in detail on TDM and FDM, CDM. [7M] [Dec/Jan -2022-23] Remember CO4
Topic name: Wired LANs
9. Explain the concept of wired LAN’s.[7M] [Dec/Jan-2022-23] Understand CO4
10. Explain in detail IEEE-802.3. [7M] [Dec/Jan -2022-23] Understand CO4
11. Explain Standard Ethernet concept. [7M] [Dec/Jan-2022-23] Understand CO4

Unit4
Syllabus:
The Network Layer Design Issues – Store and Forward Packet Switching-Services Provided
to the Transport layer- Implementation of Connectionless Service-Implementation of
Connection Oriented Service- Comparison of Virtual Circuit and Datagram Networks,
Routing Algorithms-The Optimality principle-Shortest path, Flooding, Distance vector, Link
state, Hierarchical, Congestion Control algorithms-General principles of congestion control,
Congestion prevention polices, Approaches to Congestion Control-Traffic Aware Routing-
Admission Control-Traffic Throttling-Load Shedding. Traffic Control Algorithm-Leaky
bucket & Token bucket. Internet Working: How networks differ- How networks can be
connected- Tunnelling, internetwork routing-, Fragmentation, network layer in the internet –
IP protocols-IP Version 4 protocol-IPV4 Header Format, IP addresses, Class full Addressing,
CIDR, NAT-, Subnets-IP Version 6-The main IPV6 header, Transition from IPV4 to IPV6,
Comparison of IPV4 & IPV6- Internet control protocols- ICMP-ARPDHCP
Text Books:
1. Computer Networks — Andrew S Tanenbaum, Fifth Edition. Pearson Education/PHI
2. Data Communications and Networks – Behrouz A. Forouzan, Fifth Edition TMH.
References Books:
1. Data Communications and Networks- Achut S Godbole, Atul Kahate
2. Computer Networks, Mayank Dave, CENGAGE
Topic name: The Network Layer
1. Explain the services and design issues of Network layer. [7M][Dec/Jan -2022-
23]Understand CO2
2. what are the responsibilities of Network layer. [7M] [Nov-2019] Understand CO2
3. Explain in brief Store and Forward Packet Switching. [7M] [Dec/Jan -2022-23]
Understand CO2
Topic name: Circuit Switching,Packet Switching
4. With a neat sketch, Explain the following in detail
Circuit Switching Technique and Packet Switching Technique.[7M] [Nov-2019] Apply CO2
5. Discuss in detail Virtual circuit vs Datagram sockets. [7M] [Dec/Jan-2022-23]
Understand CO2
6. Differences between static routing and dynamic routing with examples (Adaptive and non-
Adaptive routing).. [7M] [Dec/Jan -2022-23] Analyze CO2
Topic name: Routing Algorithms
7. With an example explain the Dijkstra’s (Shortest path) routing algorithms used in computer
networks [7M] [Dec/Jan -2022-23] Understand CO2
8. Explain distance vector routing algorithm (DVMRP), Describe the problem and solutions
associated with distance vector routing. [7M] [Dec/Jan-2022-23] Understand CO2
9. Explain Link state routing algorithm. [7M] [Nov-2019] Understand CO2
10. Explain flooding with examples. [7M] [Dec/Jan-2022-23] Understand CO2
11. Briefly explain Hierarchical, Broadcast, multicast routing techniques. [7M] [Dec/Jan-
2022-23]
Understand CO2
Topic name: Congestion Control
12. Differentiate the open loop congestion control and closed loop congestion control in
detail. [7M] [Dec/Jan-2022-23]Analyze CO2
13. What are the reasons for congestion in network layer. [7M] [Dec/Jan-2022-
23]Understand CO2
14. what are the problems with congestion control? [7M] [Dec/Jan-2022-23] Understand
CO2
15. Explain the general principles and prevention policies of congestion control. [7M] [Nov-
2019] Understand CO2
16. Explain the leaky bucket and token bucket algorithm. [7M] [Dec/Jan-2022-23]
Understand CO2
Topic name: Internet Working
17. How Networks differ,how networks can be connected. [7M] [Nov-2019] Analyze CO2
18. What is internet working? Explain about tunneling. [7M] [Dec/Jan-2022-23]Understand
CO2
19. Discuss different internet control protocols. [7M] [Dec/Jan-2022-23]Understand CO2
20. Classify Internet,Intranet,and Extranet with applications. [7M] [Nov-2019] Understand
CO2
Topic name: IPV4,IPV6
21. Explain the IPV4 header format with neat sketch. [7M] [Dec/Jan-2022-23] Understand
CO2
22. Explain the IPV6 header format with neat sketch. [7M] [Dec/Jan-2022-23] Understand
CO2
23. Explain the transition from IPV4 to IPV6. [7M] [Nov-2019] Understand CO2
24. Explain about class full addressing and CIDR. [7M] [Dec/Jan-2022-23] Understand
CO2
25. Explain the format of IPv4, IPv6 header, describe the significance of each field and the
major problems of IPv4 protocol,and discuss the various classes of IPV4 addressing.
[7M] [Nov-2019] Understand CO2
26. Explain Internet control protocols-ICMP,ARP,DHCP. [7M] [Nov-2019] Understand
CO2
Unit5
Syllabus:
The Transport Layer: Transport layer protocols: Introduction-services- port number-User data
gram protocol-User datagram-UDP services-UDP applications-Transmission control protocol:
TCP servicesTCP features- Segment- A TCP connection- windows in TCP- flow control-
Error control, Congestion control in TCP. Application Layer –- World Wide Web: HTTP,
Electronic mail-Architecture- web based mail- email security- TELENET-local versus remote
Logging-Domain Name System: Name Space, DNS in Internet ,- Resolution-Caching-
Resource Records- DNS messages- Registrars-security of DNS Name Servers, SNMP.
Text Books:
1. Computer Networks — Andrew S Tanenbaum, Fifth Edition. Pearson Education/PHI
2. Data Communications and Networks – Behrouz A. Forouzan, Fifth Edition TMH.
References Books:
1. Data Communications and Networks- Achut S Godbole, Atul Kahate
2. Computer Networks, Mayank Dave, CENGAGE
 Topic name: Transport layer
1. Explain the Services of Transport layer, what are the responsibilities of Transport layer? [7M]
[Nov-2019] Understand CO5
2. what are the different transport layer protocols, Explain flow control in transport layer in
detail.
[7M] Understand CO5
3. Briefly explain flow control, error control and congestion control in transport layer. [7M]
[Dec/Jan-2022-23] Understand CO5
4. Explain the services,responsibilities, functions of transport layer. [7M] [Oct/Nov-
2020]Understand CO5

Topic name: TCP (Transmission Control Protocol)

5. Explain the TCP header format and Pseudo header structure with neat sketch. [7M] [Nov-
2019] Understand CO5
6. Explain TCP services and 3-protocol Scenarios for connection establishment in TCP. [7M]
[Nov-2019] Understand CO5
7. What is congestion? Discuss TCP congestion control. [7M] [Dec/Jan-2022-23]
Understand CO5
8. What is Connection management? , Discuss in detail about the connection establishment
and release in TCP. [7M] [Dec/Jan-2022-23]
Understand CO5
9. How a Connection is established in a Transport Protocol. Explain three protocol scenarios
for establishing a connection. Explain in detail three way handshaking for connection
establishment in TCP. [7M] [Nov-2019] Apply
CO5
10. Draw and explain each field in the TCP Segment header. [7M] [Nov-2019] Understand
CO5

Topic name: UDP (User Datagram Protocol)

11. How does UDP differ from TCP? List the applications of UDP. [7M] [Nov-2019]
Understand CO5
12. Write the structure of TCP pseudo header and explain how it is used in checksum
calculation.
[7M] [Nov-2019]Understand
CO5
13. Explain the UDP header with protocols used in UDP. [7M] [Nov-2019]Understand CO5
14. Discuss real time transport protocol with applications and services. [7M] [Dec/Jan-2022-
23] Understand CO5
Topic name: Application layer
15.Write a short note on the following [7M] [Dec/Jan-2022-23]Remember
CO5
1. SNMP 2. Multimedia 3.DNS 4. FTP
5. SMTP 6. HTTP
16. What is World Wide Web, Explain about electronic mail architecture in detail? [7M]
[Dec/Jan-2022-23] Understand CO5
17. Explain the purpose, working of DNS and significance of DNS. [7M] [Nov-2019]
Understand CO5
18. Explain briefly DNS messages and resource records. [7M] [Dec/Jan-2022-23]
Understand CO5
19. How DNS service maps domain names to IP addresses, what resource records are
associated with DNS? Explain. [7M] [Nov-2019] Understand CO5
20. What is DNS? What resource records are associated with it? Explain. [7M] [Jun/Jul-
2022] Understand CO5
21. What are the five basic functions supported in e-mail systems? Explain. [7M] [Jun/Jul-
2022] Remember CO5
22. What is electronic E-mail? Describe in brief about the two architectures of E- Mail. [7M]
[Nov-2019] Remember CO5

SUBJECT: Design and Analysis of Algorithms (III CSE-A,B,C)

UNIT-I
Syllabus:
Introduction: Algorithm Definition, Algorithm Specification, performance Analysis,
Performance measurement, asymptotic notation, Randomized Algorithms.
Text Books:
1. Ellis Horwirtz, Sartaj Sahani, Sanguthevar Rajasekharan, “Fundamentals of Computer
algorithms” 2nd Edition, Universities Press.
2. Introduction to Algorithms Thomas H. Cormen, PHI Learning
3.Harsha Bhasin, “Algorithms Design and Analysis”, Oxford University Press
Reference Books:
1. Ellis Horwirtz, Sartaj Sahani, Sanguthevar Rajasekharan, “Fundamentals of Computer
algorithms” 2nd Edition, Galgotia Publications,2008.
Topic name: Algorithm Definition, Algorithm Specification
1. Write an algorithm for linear search and analyze the algorithm for its time complexity.
(JAN-2022)
2. Write an algorithm for Bubble sort and analyze the algorithm for its time complexity.
(JAN-2022)
3. Write different pseudo code conventions used to represent an algorithm. (Feb-2022)
4. What do you mean by performance analysis? Give the algorithm for matrix
multiplication (Feb-2022)
5. Write an algorithm for Binary search (JAN-2022,Feb-2022)
Topic name: Performance Analysis
1. Define Time and Space Complexity, and calculate the time space complexity for
addition of two matrices. (JAN-2022)
2. a) In what way amortized analysis is used for performance analysis of algorithms?
Explain. (JAN-2022 2-times)
3. Explain the method of determining the complexity of a procedure by the step count
approach. Illustrate with an example. (JAN-2022)
4. Explain the method of determining the complexity of a procedure by the step count
approach. Illustrate with an example. (JAN-2022)
5. a) Write an algorithm for Bubble sort and analyze the algorithm for its time complexity.
(JAN-2022)
 6. Write an algorithm for Binary search and analyze the algorithm for its time
complexity(JAN-2022,Feb-2022)
7. What do you mean by performance analysis? Give the algorithm for matrix
multiplication and find the time complexity using step–count method. (Feb-2022)
8. b) Explain time complexity of insertion sort in different cases.

Topic name: Performance measurement

1. Differentiate performance measurement and performance estimation of
algorithms.(JAN-2022)
2. Write short notes on probabilistic analysis. Discuss its role in Algorithemic analysis.
(JAN-2022)
3. How to measure the performance of an algorithm? Give some parameters. (JAN-
2022)
Topic name: Asymptotic notation
1. Explain in brief about Asymptotic notations with examples. (JAN-2022 2-times, Feb-
2022)
2. Describe best case, average case and worst case efficiency of an algorithm. (JAN-
2022)
3. What are the different mathematical notations used for algorithm analysis? Explain
them (JAN-2022)
4. Compare Big-oh, Omega (I) and Little-oh notation. Illustrate with an example. (JAN-
2022)
5. Define Time Complexity. Describe different notations used to represent these
complexities (JAN-2022)
Topic name: Randomized Algorithms
1. Mention the important advantages and disadvantages of using randomized algorithms.
(JAN-2022)
2. Write Randomized algorithm of Quick sort (JAN-2022)

UNIT -II
Syllabus:
Divide and Conquer: General Method, Defective chessboard, Binary Search, finding the
maximum and minimum, Merge sort, Quick sort.
The Greedy Method: The general Method, knapsack problem, minimum-cost spanning
Trees, Optimal Merge Patterns, Single Source Shortest Paths.
Text Books:
1. Ellis Horwirtz, Sartaj Sahani, Sanguthevar Rajasekharan, “Fundamentals of Computer
algorithms” 2nd Edition, Universities Press.
2. Introduction to Algorithms Thomas H. Cormen, PHI Learning
3.Harsha Bhasin, “Algorithms Design and Analysis”, Oxford University Press
Reference Books:
1. Ellis Horwirtz, Sartaj Sahani, Sanguthevar Rajasekharan, “Fundamentals of Computer
algorithms” 2nd Edition, Galgotia Publications,2008.
Topic name: General Method (Divide and Conquer)
1. Write and explain the control abstraction for Divide and Conquer approach. (JAN-
2022 – 2 times, Feb-2022)
2. Explain How Master’s theorem is useful for solving recurrence relations. (JAN-2022)
Topic name: Defective chessboard
1. Explain Defective chess board Problem. (JAN-2022)
Topic name: Binary Search
1. Give the divide and conquer solution for Binary Search algorithm (JAN-2022)
Topic name: finding the maximum and minimum
 1. Explain the problem of finding minimum and maximum, and try to apply „divide and
conquer‟ strategy to solve it. Give a general algorithm for doing the same.(June –
2022)
Topic name: Merge sort
1. Using Merge sort, sort the following elements: 310, 285, 179, 652, 351, 423, 861,
254, 450, 520 (JAN-2022)
Topic name: Quick sort
1. Write the algorithm for finding pivot element in quick sort algorithm and analyze its
time complexity. (JAN-2022)
2. Trace the quick sort algorithm to sort the list C, O, L, L, E, G, E in alphabetical order.
(JAN-2022)
3. Design an algorithm to sort the given list of elements using Quick Sort incorporating
divide and conquer technique. Sort the following list using the same and compute its
best case time
efficiency: 4, 2, 0, 8, 7, 1, 3, 6. (JAN-2022)
Topic name: The general Method (Greedy Method)
1. What is the need of greedy method, explain with an example? (JAN-2022)
Topic name: knapsack problem
1. Apply the greedy method to solve Knapsack problem for given instance Where n=3,
m=20, (p1,p2,p3)=(25,24,15), and weight (w1,w2,w3)=(18,15,10). (JAN-2022)
2. Explain the Knapsack problem. Find an optimal solution to the Knapsack instance
n=7, m=15, (p1, p2, p3, …p7)=(10,5,15,7,6,18,3) and (w1, w2, w3, …w7)=(2, 3, 5, 7,
1, 4, 1). (JAN-2022)

Topic name: minimum-cost spanning Trees

1. What is minimum spanning tree? Explain the Kruskal’s algorithm to find the
minimum spanning by taking an illustrative graph (JAN-2022)
2. What is Minimum cost spanning tree? Explain an algorithm for generating minimum
cost Spann--ing tree and list some applications of it. (JAN-2022)
Topic name: Optimal Merge Patterns
1. How many ways we can merge the files on optimal merge pattern? (JAN-2022)
Topic name: Single Source Shortest Paths
1. Explain single source shortest path Problem with example. (JAN-2022)

UNIT –III (Part-1)

Syllabus:
Dynamic Programming: The general method, multistage graphs, All pairs-shortest paths,
optimal Binary search trees, 0/1 knapsack, The traveling salesperson problem.
Text Books:
1. Ellis Horwirtz, Sartaj Sahani, Sanguthevar Rajasekharan, “Fundamentals of Computer
algorithms” 2nd Edition, Universities Press.
2. Introduction to Algorithms Thomas H. Cormen, PHI Learning
3.Harsha Bhasin, “Algorithms Design and Analysis”, Oxford University Press
Reference Books:
1. Ellis Horwirtz, Sartaj Sahani, Sanguthevar Rajasekharan, “Fundamentals of Computer
algorithms” 2nd Edition, Galgotia Publications,2008.
Topic name: The general method
1. List the drawback of Divide and Conquer method, how can you address these in
Dynamic Programming? (JAN-2022)
2. Compare Dynamic programming with Greedy method. (JAN-2022)
3. Explain the methodology of Dynamic programming. Mention the applications of
Dynamic programming. (JAN-2022)
Topic name: multistage graphs
1. Explain in detail about Multi stage graphs. (JAN-2022 – 2 times)
Topic name: All pairs-shortest paths
1. Illustrate the working principle of Dynamic Programming with All Pairs Shortest Path
problem. (JAN-2022)
2. Write and explain an algorithm to compute the all pairs shortest path using dynamic
programmi--ng and prove that it is optimal (JAN-2022)
3. Compute all pairs-shortest path for following graph. (JAN-2022- 2 times)

Unit III (Part-2)

Syllabus:
Dynamic Programming: optimal Binary search trees, 0/1 knapsack, The traveling
salesperson problem.
Text Books:
1. Ellis Horwirtz, Sartaj Sahani, Sanguthevar Rajasekharan, “Fundamentals of Computer
algorithms” 2nd Edition, Universities Press.
2. Introduction to Algorithms Thomas H. Cormen, PHI Learning
3.Harsha Bhasin, “Algorithms Design and Analysis”, Oxford University Press
Reference Books:
1. Ellis Horwirtz, Sartaj Sahani, Sanguthevar Rajasekharan, “Fundamentals of Computer
algorithms” 2nd Edition, Galgotia Publications,2008.

Topic name: optimal Binary search trees

1. Use the function OBST to compute w(i,j), r(i,j), and c(i,j), 0 ≤ i < j ≤4, for the
identifier set (a1, a2, a3, a4) = (do, if, int, while) with p(1 : 4) = (3, 3, 1, 1) and
q(0:4)=(2,3,1,1,1). Using the r(i,j)’s construct the optimal binary search tree. (JAN-
2022-2 times)
2. Derive the recursive formulas of optimal cost Binary search tree based on dynamic
programming. (JAN-2022)
Topic name: 0/1 knapsack
1. Solve the following 0/1 Knapsack problem using dynamic programming P= (11, 21,
31, 33), W= (2, 11, 22, 15), C=40, n=4. (JAN-2022 2 times)
2. Explain 0/1 knapsack problem with respect to dynamic programming. (JAN-2022)
Topic name: The traveling salesperson problem.
1. Discuss the time and space complexity of Dynamic Programming Traveling Sales
Person algorithm. (JAN-2022 2 times)
2. Write dynamic programming solution for the Traveling Sales Person problem for the
network with the cost adjacency matrix below. Assume node 1 as the home city.
(JAN-2022,Feb-2022)
0 10 15 30
4 0 9 11
5 13 0 10
7 7 8 0
 Unit IV
Syllabus:
Backtracking: The General Method, The 8-Queens problem, sum of subsets, Graph
coloring, Hamiltonian cycles, knapsack problem.
Text Books:
1. Ellis Horwirtz, Sartaj Sahani, Sanguthevar Rajasekharan, “Fundamentals of Computer
algorithms” 2nd Edition, Universities Press.
2. Introduction to Algorithms Thomas H. Cormen, PHI Learning
3.Harsha Bhasin, “Algorithms Design and Analysis”, Oxford University Press
Reference Books:
1. Ellis Horwirtz, Sartaj Sahani, Sanguthevar Rajasekharan, “Fundamentals of Computer
algorithms” 2nd Edition, Galgotia Publications,2008.
Topic name: The General Method
1. Explain the major drawbacks of backtracking method with example. (JAN-2022)
2. Explain the major drawbacks of backtracking method with example. How can they be
handled?
(JAN-2022)
3. Write the general procedure for back tracking algorithm. (JAN-2022)
4. Write the algorithm for general iterative backtracking method and explain various
factors that define the efficiency of backtracking.
Topic name: The 8-Queens problem
1. Define Backtracking. Draw the state space tree for solution of 4-queens problem.
(JAN-2022-2 times)
2. Give the solution to the 8-queens problem using backtracking (JAN-2022 2- times)
3. Briefly explain n-queen problem using backtracking. (JAN-2022)
Topic name: sum of subsets
1. Draw the portion of state space tree generated by recursive backtracking algorithm for
sum of subsets problem with an example. (JAN-2022)
2. What is sum-of-subsets problem? Write a recursive backtracking algorithm for sum of
subsets problem. (JAN-2022 2-times)
Topic name: Graph coloring
1. Explain the Graph – coloring problem. And draw the state space tree for m= 3 colors
and n=4 vertices complete graph. (JAN-2022 – 3 times,Feb-2022)
2. Describe Backtracking technique to m-coloring graph. (JAN-2022)
3. Find all m-colors of a graph with undirected connections v1->2, v1->v3, v1->v4, v2-
>v3, v2->v4, v2->v5, v3->v4, v4->v5 using backtracking technique. (JAN-2022)

Topic name: Hamiltonian cycles

1. Relate Hamiltonian cycle with travelling sales person problem and also give the
backtracking solution that finds all Hamiltonian cycles for any directed or undirected
graph. (JAN-2022)
2. Describe the algorithm for Hamiltonian cycles and Determine the order of magnitude
of the worst-case computing time for the backtracking procedure that finds all
Hamiltonian cycles. (JAN-2022)
3. Explain how the Euler circuit problem is solved by using the backtracking concept.
(JAN-2022)

Topic name: knapsack problem

1. Solve the following instance of 0/1 KNAPSACK problem using backtracking n = 3,
(W1, W2, W3) = (2, 3, 4), (P1, P2, P3) = (1, 2, 5), and m = 6. (Model Question)
 Unit V
Syllabus:
NP-Hard and NP-Complete problems: Basic concepts, non-deterministic algorithms, NP -
Hard and NP-Complete Class, Cook’s Theorem.
Text Books:
1. Ellis Horwirtz, Sartaj Sahani, Sanguthevar Rajasekharan, “Fundamentals of Computer
algorithms” 2nd Edition, Universities Press.
2. Introduction to Algorithms Thomas H. Cormen, PHI Learning
3.Harsha Bhasin, “Algorithms Design and Analysis”, Oxford University Press
Reference Books:
1. Ellis Horwirtz, Sartaj Sahani, Sanguthevar Rajasekharan, “Fundamentals of Computer
algorithms” 2nd Edition, Galgotia Publications,2008.
Topic name: Basic concepts
1. Explain the P, NP, NP-Hard and NP- complete classes with suitable examples. (JAN-
2022)
Topic name: non-deterministic algorithms
1. Write about non deterministic algorithms and choice, failure and success functions
with search example. (JAN-2022)
2. Discuss about deterministic and non-deterministic algorithms. (JAN-2022)
3. Give examples of some deterministic algorithms. Justify. (JAN-2022)
4. Give examples of some non-deterministic algorithms. Justify. (JAN-2022)
Topic name: NP - Hard and NP-Complete Class
1. Show that the Hamiltonian cycles problem on directed graphs is NP-complete. (JAN-
2022)
2. Explain the classes of NP-Hard and NP-Complete. (JAN-2022)
3. Using an example prove that, satisfiability of boolean formula in 3-Conjunctive
Normal form is NP-Complete. (JAN-2022)
4. Explain the classes of NP and NP-Complete giving example problem for each. (JAN-
2022)
5. Explain the strategy to prove that a problem is NP hard. (JAN-2022)
6. Briefly explain NP-hard and NP-completeness with example. (JAN-2022)
7. Is Travelling salesman problem NP-hard or NP-Complete? Justify your answer. (JAN-
2022)
8. How many steps are required to prove that a decision problem is NP-Complete?
Justify. (JAN-2022)
Topic name: Cook’s Theorem
1. Briefly explain Cooks-theorem. (JAN-2022)
2. Give the applications of Cook’s theorem. (JAN-2022)

SUBJECT: RENEWAL ENERGY SYSTEMS (III CSE-A,B,C)

UNIT-I
Prospects, Solar radiation at the Earth Surface
1. Explain the following terms w.r.t Solar radiation geometry: (i) Angle of latitude (ii) Declination
angle (iii) Zenith Angle (iv) Hour angle (June-2022)
2. Explain the following terms w.r.t Solar Energy: (i) Solar constant (ii) Extraterrestrial radiations (iii)
Terrestrial radiations (iv) Solar Irradiation (June-2022)
3. What is the significance of Solar radiation data and in how many forms is this data available? (June
2022)
4. Define solar constant. What is its standard value?(Jan 2023)
5. Write a short note on sizing of PV system and its storage (Jan 2023)
Equivalent circuit of a Photovoltaic (PV) Cell - I-V & P-V Characteristics
1. Draw and explain the P-V characteristics of a Solar Cell. (June 2022)
2. Explain in detail about the Solar cell mismatch in a module and effect of shadowing on a Solar
module. (June 2022)
3. Distinguish between Solar Cell, module and an Array. (June 2022, Jan2023),
4. Define the term Fill factor and explain its significance. (June 2022),
5. Explain the following Solar cell design considerations: (i) Short circuit current and (ii) Open circuit
voltage(June 2022)
6. How can you maximize the Solar PV system output and also explain the concept of load matching.
(June 2022)
7. Draw and explain the P-V and I-V characteristics of the PV System for different Input quantities of
irradiance and temperature.(Jan 2023) (June 2022)
8. What are the advantages and disadvantages of photo voltaic solar energy conversion?(July 2023)
Solar Energy Collectors: Flat plate Collectors
1. What are the main advantages of flat-plate solar collector? (Jan2023)
Concentrating collectors
1. A cylindrical parabolic concentrator is 1m long and 2.5 m wide. The diameter of absorber
tube is 12 cm. Find the concentration ratio (Aug-2021)
Solar Energy storage systems and Applications: Solar Pond
1. List and explain about any two solar energy storage systems with necessary illustrations.(Jan 2023)
2. With suitable schematic, describe the construction and working of solar pond based electric-power
plant with cooling tower(jan 2023)
Solar water heating and Solar Green house.
1. Explain about solar pond, solar water heater and solar green house. (July 2023)
Unit-2
Introduction - basic Principles of Wind Energy Conversion
1. Explain the factors affecting the distribution of wind energy on the surface of earth. (June 2022)
2. Explain different parameters which are required in the extraction of maximum power under varying
wind speed conditions?(Jan2023)
3. Show that ideal maximum power coefficient is 0.59 for a horizontal axis windmill?( Jan 2023)
4. Explain the operation of wind energy system with a neat sketch.(Jan2023)

The nature of Wind

1. Explain the following terms: (i) free and relative wind velocities, (ii) drag and lift forces, solidity
and (iii) pitch angle and chord. (June 2022)
The power in the wind
1. Explain the power extracted (momentum theory) by the wind turbine (Aug-2021)
2. Explain the following terms w.r.t wind Power: (i) Wind shear (ii) Gradient height, (iii) Planetary
boundary (iv) Ekman layer (June2022)
3. Derive an expression for energy available in the wind. (June2022)
4. Show that ideal maximum power coefficient is 0.59 for a horizontal axis windmill? (Jan2023)

Wind Energy Conversion

1. Explain the basic operation of wind energy conversion systems.(july -2023)

Site selection considerations

1. Explain the factors considered for selecting a site of a wind generator. (Aug-2021)

Basic components of Wind Energy Conversion Systems (WECS)

1. With a neat sketch of a HAWT, explain the functions of its main components . (June2022)
2. A wind turbine with 12 m diameter span has cut in speed of 5.2 m/s, at which it develops 3.5 KW.
Find the; (i) Efficiency of turbine and (ii) Axial force on turbine.(Jan2023)
 3. Explain the types of WECS in detail.(July 2023)

Classification of WECS and Applications of WECS

1. Compare between horizontal and vertical axis wind mills. (Aug-2021),
2. With a neat sketch of a VAWT, explain the functions of its main components. (June2022, July
2023),
Unit-3 PART-A
Biomass: Introduction - Biomass conversion technologies
1. What are the main advantages in use of biogas? What are its main constituents and explain them?
(June 2022)
2. Explain the process of production of biogas from biomass. What are the main advantages of
anaerobic digestion of biomass? (June 2022),
3. What are biomass conversion technologies? Draw a schematic diagram to explain various
conversion technologies and products.(Jan 2023)

Photosynthesis
1. Explain the process of photosynthesis. (June 2022)
Factors affecting Bio digestion
1. List and explain the factors affecting the performance of biogas digester (June 2022)
2. Explain the process of gasification of solid bio-fuels? What are its main applications? (June 2022)
Classification of biogas plants
1. Compare the relative performances of a floating drum and fixed dome type biogas plants. (June
2022)
2. Explain the operation of bio-gasifier. Write its applications.(Jan2023)
Types of biogas plants
1. What are the different biomass energy resources? What is the energy yield from each of them?(Jan
2023)
2. Write a short note on bio-gas plant.(Jan2023)
3. List and explain the main constituents of Biomass materials.(Jan2023)

Selection of site for a biogas plant

1. What are factors to be consider selection of Biomass plant

PART-B
Geothermal Energy:Introduction, Geothermal Sources
1. What are the merits and demerits of geothermal energy? (June 2022)
2. Explain the following types of geothermal resources: (i) Geo- pressured and (ii)
magma (June 2022)
3. Discuss the various methods and procedures to explore and develop geothermal
resources.(June 2022, July 2023)
4. Discuss the energy analysis of a hot Aquifer type Geothermal resource (Jan 2023)

Operational and Environmental problems

1Evaluate the environmental aspects of geothermal energy in detail .(June 2022,July 2023)

UNIT-4
Oceans: Introduction
1 List relative advantages and limitations of floating and shore based OTEC plants?
(June 2022)
Ocean Thermal Electric Conversion methods
1 What are the main advantages and disadvantages of OTEC system? And explain the various
technologies available for OTEC. (June-2022)
 2 Explain the working of Open Cycle OTEC plant with a neat diagram.(Jan2023)
Prospects of OTEC in India:
Waves:
Introduction
Energy and Power from the waves
1What do you mean by Wave Energy and list the advantages of wave power and also list the
Main difficulties encountered in the development of wave power? (June 2022)
Wave Energy conversion devices
1Discuss the different types of wave energy conversion devices(Jan 2023)
2 Describe the concepts of converting wave energy into mechanical or electrical energy. (Jan
2023)
Tides:
Basic principle of Tide Energy
1 Explain about double basin arrangement in tidal power generation.(Jan 2023).
Components of Tidal Energy
1 Explain how the tides are originated and give its uses in power generation (June 2022)
2 List and explain the various tidal energy conversion schemes. (June 2022)
UNIT 5
Fuel Cells: Introduction
1 List the advantages and disadvantages of Fuel cell.(June2022)
Fuel Cell Equivalent Circuit
1Explain the main components of Fuel cell system.(Aug-2021)
Operation of Fuel cell
1Explain the equivalent circuit of fuel cell.(July 2023)
2 Explain working principle of fuel cell and describe energy storage system using fuel cells?
(Jan 2023, July 2023)
Types of Fuel Cells
1Give the classification of Fuel Cells based on: (i) the type of electrolyte (ii) the types of fuel
and
oxidant and (iii) operating temperature (June 2022)
2Explain the operation of Phosphoric Acid Fuel cell with a neat diagram. (June 2022)
Applications.
1 Write short notes on regenerative fuel cell and list out its advantages. (Jan 2023)
Hydrogen Energy:
Introduction
1 Explain the working principle of fuel cell and describe energy storage system using fuel
cells? (July 2023)
Methods of Hydrogen production
1 Explain methods of hydrogen production with illustrations. (Jan 2023)
Storage and Applications
1 Explain the storage and applications of Hydrogen .(July 2023)
2 Mention the application of fuel cells and explain anyone application (Jan 2023)
3 Explain the various applications and storage techniques used for Hydrogen Energy. (July
2023).
4 Classify fuel cells and differentiate between Fuel Cell and Battery (July 2023).
Magneto Hydro Dynamics (MHD) Power Generation:
1 List various types of MHD power generation and explain any one type with working and a
neat
sketch.(Jan 2023, July 2023)
2 Explain the applications of MHD generation.(Jan 2023)
 SUBJECT: DATA WAREHOUSING & DATA MINING (III CSE-A,B,C)
QUESTION BANK
Regulation: R20 A.Y.:2023-24
Name of the faculty: Ms. P. Padmini Rani SEM : I

UNIT-I

UNIT I: Data Warehousing and Online Analytical Processing:

Data Warehouse: Basic concepts, Data Warehouse Modelling: Data Cube and OLAP, Data
Warehouse Design and Usage, Data Warehouse Implementation, Introduction: Why and
What is data mining, What kinds of data need to be mined and patterns can be mined, Which
technologies are used, Which kinds of applications are targeted

Topic: Datawarehouse basic concepts, Data warehousing models.

1. a) Differentiate Operational database systems and data warehousing[8M][FEB-22]
b) What is need for datawarehouse?[7M][FEB-22]
c) Explain datawarehouse architecture and models?[7M][JAN-2023]
d) Explain ETL tools and metadata repository?[7M]

Topic : Data Cube and OLAP

2. a) Suppose that a data warehouse consists of the three dimensions time, doctor, and
patient, and
the two measures count and charge, where charge is the fee that a doctor charges a patient
for a
visit. Enumerate three classes of schemas that are popularly used for modeling data
warehouses
and explain.[7M][JAN-2023]
b) Explain the star schema and fact constellation schemas.[7M][FEB-22] [JAN-23]
3. a) Explain OLAP operations and different types of OLAP Server architectures.[7M]
b)Explain the role of concept hierarchies?[7M][JAN-2023]
Topic : Data Warehouse Design and Usage, Data Warehouse Implementation
4) What are the differences between the three main types of data warehouse usage;
information
processing, analytical processing, and data mining? Discuss the motivation behind
OLAP
mining(OLAM) [7M][JAN-2023]
5) Illustrate indexing methods used for OLAP data. [7M][JAN-2023]
Topic: Why and What is data mining, What kinds of data need to be mined and
patterns can be mined, Which technologies are used, Which kinds of applications are
targeted
6 a) Explain kinds of data can be mined?Give examples. [7M][FEB-22]
b) What kinds of patterns can be mined? [7M][FEB-22][JAN-23]
c)Which technologies are used? [7M]
d)What kind of applications are targetted ? [7M]
e)What are the major issues in data mining. [7M][FEB-22]

UNIT II: Data Pre-processing: An Overview, Data Cleaning,Data Integration, Data

Reduction, Data Transformation and Data Discretization.
Topic: An Overview, Data Cleaning,Data Integration,

1 a) Explain in detail about data pre-processing.

b) What is data integration and discuss issues to consider during data integration.
2. Suppose a group of 12 sales price records has been sorted as
follows:5,10,11,13,15,35,50,55,72,92,204,215.
Partition the min to three bins by each of the following methods:
(i)equal-frequency(equal-depth) partitioning(ii)equal-width partitioning(iii)clustering

Topic: Data Reduction, Data Transformation and Data Discretization.

3 What are the value ranges of the following normalization methods? (i) min-
max normalization (ii) z-score normalization (iii) z-score normalization using
the mean absolute deviation instead of standard deviation(iv) normalization by
decimal scaling
4 What is the need of dimensionality reduction? Explain any two techniques for
dimensionality reduction.
5 Discuss in detail about data transformation with suitable examples.
6 Suppose that a hospital tested the age and body fat data for 18 randomly selected
adults with the following results:
age 23 23 27 27 39 41 47 49 50
%fat 9.5 26.5 7.8 17.8 31.4 25.9 27.4 27.2 31.2
age 52 54 54 56 57 58 58 60 61
%fat 34.6 42.5 28.8 33.4 30.2 34.1 32.9 41.2 35.7
a. Normalize the two attributes based on z-score normalization. [7M]
7 Calculate the correlation coefficient (Pearson’s product moment coefficient). Are
these two attributes positively or negatively correlated?Compute their covariance.

UNIT III:
Classification: Basic Concepts, General Approach to solving a classification problem,
Decision Tree Induction: Attribute Selection Measures, Tree Pruning, Scalability and
Decision Tree Induction, Visual Mining for Decision Tree Induction.
Part-A:
Basic Concepts, General Approach to solving a classification problem, Decision Tree
Induction: Attribute Selection Measures

1. a) Describe the classification task in induction and deduction phases. Explain with
example classification tasks.[7M][JAN-23]
1.b)What is attribute selection measure? Briefly describe the attribute selection
measures for decision tree induction. .[7M][JAN-23][FEB-22]
2.a)Why information gain is considered as attribute selection measure? Illustrate with
an example. [7M][JAN-23]
2. b) Explain the decision tree induction algorithm with appropriate examples. Discuss
the disadvantages of this approach? What is over fitting, and how can it be prevented
for decision trees?[7M][JAN-23][FEB-22]

Part-B
Topic: Tree Pruning, Scalability and Decision Tree Induction, Visual Mining for
Decision Tree Induction.

3. a)Why is tree pruning useful in decision tree induction? What is a drawback of using
a separate set of tuples to evaluate pruning? [7M][FEB-22]
b) Given data set, D, the number of attributes, n, and the number of training tuples,
|D|, show that the computational cost of growing a tree is atmost n×|D|
×log(|D|).[7M][JAN-23]
4. What are the new features of C4.5 algorithm comparing with original Quinlan’s
ID3 algorithm for decision-tree generation?[JAN-23][7M]
5. a) Given a decision tree, you have the option of (i) converting the decision tree to rules
and then pruning the resulting rules, or (ii) pruning the decision tree and then converting
the pruned tree to rule.What advantage does (i) have over(ii)?[7M][JAN-23]

5.b)Givena trainingdata setY:

A B C Class
15 1 A C1
20 3 B C2
5 2 A C1
30 4 A C1
35 2 B C2
25 4 A C1
15 2 B C2
Find the best split point for decision tree for attribute A.
UNIT IV:
Association Analysis: Problem Definition, Frequent Item set Generation, Rule
Generation: Confident Based Pruning, Rule Generation in Apriori Algorithm, Compact
Representation of frequent item sets, FP-Growth Algorithm.

TOPIC: Problem Definition, Frequent Item set Generation, Rule Generation: Confident
Based Pruning, Rule Generation in Apriori Algorithm.
1. a) Write the algorithm to discover frequent item sets without candidate generation
and explain it with an example.[7M][JAN-23]
1. b) Make a comparison of Apriori and FP-Growth algorithms for frequent item set
mining in transactional databases.Apply these algorithms to the following
data:[7M][JAN-23]
TID LISTOFITEMS
1 Bread,Milk,Sugar,TeaPowder,Cheese,Tomato
2 Onion,Tomato,Chillies,Sugar,Milk
3 Milk,Cake,Biscuits,Cheese,Onion
4 Chillies,Potato,Milk,Cake,Sugar,Bread
5 Bread,Jam,Mik,Butter,Chilles
6 Butter,Cheese,Paneer,Curd,Milk,Biscuits
7 Onion,Paneer,Chilies,Garlic,Milk
8 Bread,Jam,Cake,Biscuits,Tomato
2. a)A database has four transactions.Let min_sup=60% and min_conf=80%
TID Date items_bought
100 10/15/2022 {K,A, B, D}
200 10/15/2022 {D,A, C,E,B}
300 10/19/2022 {C,A, B,E}
400 10/22/2022 {B,A,D}
Find all frequent items using Apriori& FP-growth, respectively. Compare the
efficiency of the two-meaning process.[7M][Jnan-23]
b)How association rules mined from large databases?Explain.
3 a) Discuss Apriori Algorithm with a suitable example and explain how its
efficiency can be improved?[7m][jan-23]
3 b) Assume 5 transactions and explain the two-step approach to generate frequent
 item sets
and to mine association rules using Apriori algorithm.
4 a)Explain market basket analysis.[7m][feb-22]
TOPIC: Compact Representation of frequent item sets, FP-Growth Algorithm.
4 b) Can we design a method that mines the complete set of frequent item sets
with out candidate generation?If yes,explain it with the following table:
TID Listofitems
001 milk, dal, sugar,
bread
002 Dal, sugar,
wheat,jam
003
Milk,bread,curd,pa
neer
004 Wheat, paneer,
dal,sugar
005 Milk,paneer, bread
006 Wheat,dal,paneer,bread [7m][jan-23]
5 a)Consider the transaction data-set:
TransID Items
T1 {a,b}
T2 {b,c,d}
T3 {a,c,d,e}
T4 {a,d,e}
T5 {a,b,c}
T6 {a,b,c,d}
T7 {a}
T8 {a,b,c}
T9 {a,b,d}
T10 {b,c,e}
Construct the FP tree by showing the trees separately after reading each
transaction.[7m][jan-23]
5.b)Given a simple transactional database X:
TID
Ite
ms
T01 A, B,
C, D T02
A,
C,D,F
T03 C, D,
E, G, A T04
A, D,
F, B
T05 B,
C,G
T06 D, F,G
T07 A,
B, G
T08
C,
D,F,G
Using the threshold values support = 25% and confidence = 60%, find all large item
sets in database X.[7m][jan-23]

UNIT V
Cluster Analysis: Overview, Basics and Importance of Cluster Analysis,
Clustering techniques, Different Types of Clusters; K-means: The Basic K-
means Algorithm, K-means Additional Issues, Bi-secting K Means

Cluster Analysis: Basics and Importance of Cluster Analysis:

1. Discuss different types of clusters[7M]
2. Explain about Cluster Applications and Requirements.[7M]
3. Explain the categories of major clustering methods?[7M]
K-means: The Basic K-means Algorithm:
1. Explain about the strengths and weaknesses of k-means algorithm[7M][JAN-23]
2. Explain about the K-means Algorithms with an examples?[7M JAN-23]
3. What are the Advantages and Disadvantages of K-means algorithm[7M]
K-means Additional Issues:
1. Explain about the K-means Additional issues.
Bi-secting K Means:
1. Explain about the Bi-Secting K-means algorithm