Course Code: B20CS3101

SAGI RAMA KRISHNAM RAJU ENGINEERING COLLEGE (A) R20

III B.Tech. I Semester MODEL QUESTION PAPER
DATA WAREHOUSING AND DATA MINING
Computer Science & Engineering
TIME: 3Hrs. Max.Marks:70M
Answer ONE Question from EACHUNIT
All questions carry equal marks
Assume suitable data if necessary
CO KL M
UNIT-I
Define data mining? Explain the process of Knowledge Discovery
1. a) 1 2 7
(KDD)?
b) Explain Major Issues in Data Mining? 1 2 7
OR
2. a) Discuss about basic data objects and attributes types in Data Mining? 1 2 7
Discuss about estimating data dissimilarity measures on numeric data?
Given two objects represented by the tuples(22,1,42,10) and (20,0,36,8).
b) a) Compute Euclidean distance between the objects. 1 3 7
b) Compute Manhattan distance between objects.
c) Compute Supremum distance between the objects.

UNIT-II
3. a) What is data preprocessing? Explain data cleaning in detail? 2 2 7
Explain about data transformation strategies?
Use these methods to normalize the following group of data:
200,300,400,600,1000
b) a) min-max normalization by setting min = 0 and max = 1 2 3 7
b) z-score normalization.
c) z-score normalization using the mean absolute deviation instead of
standard deviation.
OR
What is data ware housing? Illustrate the multitier data ware house
4. a) 2 2 7
architecture?
Compare OLTP and OLAP systems? Explain typical OLAP operations on
b) 2 2 7
multidimensional data?

UNIT-III

Page 1 of 29
 Discuss about frequent item set mining? A data base has five
transactions. Letmin_supD60%andmin_conf80%. Apply Apriori
algorithm to find all frequent item sets.
TID Items bought
5. a) T100 {M,O,N,K,E,Y} 3 3 7
T200 {D,O,N,K,E,Y}
T300 {M,A,K,E}
T400 {M,U,C,K,Y}
T500 {C,O,O,K,I,E}

b) Demonstrate FP Growth algorithm with an example. 3 2 7

OR
6. a) Explain mining frequent item sets using vertical data formats? 3 2 7
What are closed and max patterns? Explain about pattern mining in multi-
b) 3 2 7
dimensional and multilevel association?

UNIT-IV
7. a) Demonstrate the construction of a Decision tree with an example. 4 2 7
b) Explain about rule based classification in detail? 4 2 7
OR
Apply Naïve Bayes algorithm on the following dataset and classify the
following tuple:
(Outlook=Sunny, Temperature=Cool, Humidity=High, Wind=Strong)

8. a) 4 3 7

Discuss about Back propagation algorithm for neural network-based

b) 4 2 7
Classification of data?

UNIT–V
Consider that the data mining task is to cluster the following seven
9. a) pointsP1,P2,P3,P4,P5,P6,P7intotwoclusters.P1(1,1),P2(2,2),P3(3,4),P4(5, 5 3 7
7), P5(3,5),P6(4,5) andP7(4,6). The distance function is Euclidean

Page 2 of 29
 distance. Apply K-means algorithm with two iterations to form two
clusters by taking the initial cluster centres as points P1 andP4?
b) Compare partitional and hierarchical clustering algorithms? 5 2 7
OR
Explain Density based clustering and demonstrate DBSCAN algorithm
10. a) 5 2 7
with the help of an example?
Explain Grid based clustering and demonstrate STING algorithm with the
b) 5 2 7
help of an example?
CO-COURSE OUTCOME KL-KNOWLEDGE LEVEL M-MARKS

NOTE : Questions can be given as A,B splits or as a single Question for 14 marks

Page 3 of 29
 Course Code: B20CS3102
SAGI RAMA KRISHNAM RAJU ENGINEERING COLLEGE (A) R20
III B.Tech. I Semester MODEL QUESTION PAPER
FORMAL LANGUAGES AND AUTOMATA THEORY
Computer Science & Engineering
Time: 3 Hrs. Max. Marks:70
Answer ONE Question from EACH UNIT
All questions carry equal marks
Assume suitable data if necessary
CO KL M
UNIT-I
Construct DFA for the following languages i) L={w/w begins with 1 and
1. a). ends with 00, w in {0,1}*} ii) L={w/w contains Even number of zeros and 1 3 7
Even number of ones, w in {0,1}*}
Illustrate the differences in Mealy and Moore Machines and give an
b). 1 2 7
example for Mealy machine and Moore machine.
OR
Construct NFA for accepting the strings {ab, ba} and then convert it to
2. a). 1 3 7
DFA.
Explain about minimization algorithms and apply minimization algorithm
to reduce the number of states of following DFA

b). 1 3 7

UNIT-II
Define Regular expression and construct NFA with ϵ moves equivalent to
3. a). 2 3 7
the Regular Expression ( ab + aab )*
Identify the Regular expression and construct the equivalent Finite
automata for the following language descriptions :
b). 2 3 7
i. set of all strings beginning with 01 and ending with 10
ii. set of all strings having three consecutive zeros or three consecutive ones
OR
Explain the statement of the Pumping lemma on Regular sets and list the
4. a). 2 2 7
applications of pumping lemma.

Page 4 of 29
 Apply pumping lemma to show the set of all even length palindrome strings
b). 2 3 7
is not regular.

UNIT-III
5. a). Construct Context free grammar for L= { WCWR / W in (0+1)* } 3 3 7
b). Define CNF and convert the following CFG to CNF S → aSa / bSb / a / b 3 2 7
OR
Construct Context free grammar for generating all palindrome strings over
6. a). 3 3 7
(0,1)
Define GNF and Convert the following CFG to GNF S → AA | a, A → SS
b). 3 2 7
|b

UNIT-IV
Define Pushdown Automata? Explain the acceptance of PDA by empty
7. a). 4 2 7
stack using an example.
Construct PDA for recognizing the Context free language L= {an c bn /
b). 4 3 7
n>=1}
OR
8. a). What is ID of PDA? Explain the acceptance of PDA by final state 4 2 7
b). Construct a PDA to accept language of odd length palindrome strings 4 3 7

UNIT-V
9. a). Define the Turing Machine and Explain different types of TM? 5 2 7
b). Construct a TM for recognizing the language L= {WWR / W in (a,b)*} 5 3 7
OR
10. a). Explain about PCP and give an example 5 2 7
b). Explain about P and NP classes 5 2 7
CO-COURSE OUTCOME KL-KNOWLEDGE LEVEL M-MARKS

NOTE : Questions can be given as A,B splits or as a single Question for 14 marks

Page 5 of 29
 Course Code: B20CS3103
SAGI RAMA KRISHNAM RAJU ENGINEERING COLLEGE (A) R 20
III B.Tech. I Semester MODEL QUESTION PAPER
COMPUTER NETWORKS
Computer Science & Engineering
Time: 3 Hrs. Max.Marks:70
Answer ONE Question from EACH UNIT
All questions carry equal marks
Assume suitable data if necessary
CO KL M
UNIT-I
1. a). Define computer network and describe various network topologies. 1 3 7
b). Sketch layered Architecture of TCP/IP and discuss functions of each layer. 1 3 7
OR
2. a). Elaborate various Digital-to-Digital data transmission techniques 1 3 7
b). Discuss about various Guided media 1 2 7

UNIT-II
Solve the following. A bit stream 1101011011 is transmitted using the
3. a). standard CRC method. The generator polynomial is x4+x+1. What is the 2 3 7
actual bit string transmitted?
b). Describe Sliding window flow control Algorithm 2 3 7
OR
4. a). Illustrate various ARQ mechanisms 2 3 7
b). Discuss about HDLC protocol. 2 2 7

UNIT-III
5. a). Discuss CSMA/CD protocol 3 2 7
b). Compare Fast Ethernet and Gigabit Ethernet 3 3 7
OR
6. a). Demonstrate Architecture of Bluetooth. 3 3 7
b). Discuss services at MAC sub layer of IEEE 802.11 3 2 7

UNIT-IV
7. a). Discuss IPV4 addressing and importance of Subnetting. 4 2 7
b). Describe Internet Protocol (IP) header. 4 2 7
OR
8. a). Explain Link state Routing Algorithm. 4 3 7
b). What is NAT? Explain how address translation is done using NAT? 4 2 7

Page 6 of 29
 UNIT-V
9. a). Define UDP Datagram and Explain the UDP frame format? 5 3 7
b). Explain slow start algorithm and briefly discuss Reno TCP? 5 3 7
OR
10. a). Describe SMTP, POP protocols. 5 2 7
Discuss about Following Application layers protocols
b). a. DNS 5 2 7
b. HTTP

CO-COURSE OUTCOME KL-KNOWLEDGE LEVEL M-MARKS

NOTE : Questions can be given as A,B splits or as a single Question for 14 marks

Page 7 of 29
 Course Code: B20CS3104
SAGI RAMA KRISHNAM RAJU ENGINEERING COLLEGE (A) R20
III B.Tech. I Semester MODEL QUESTION PAPER
ARTIFICIAL INTELLIGENCE
Computer Science & Engineering
Time: 3 Hrs. Max. Marks:70
Answer ONE Question from EACH UNIT
All questions carry equal marks
Assume suitable data if necessary

CO KL M
UNIT-I
1. a). Explain about different problem characteristics of AI problem. 1 2 7
b). Explain production system in AI. 1 2 7
OR
Explain about water jug problem and suggest a suitable solution to
2. a). 1 2 7
water jug problem.
b). Explain how to perform Turing test. 1 3 7

UNIT-II
3. a). Explain A* algorithm with an example. 2 2 7
b). Apply nearest neighbor heuristic algorithm to solve TSP. 2 3 7
OR
4. a). Explain about Means ends analysis. 2 2 7
b). Apply simple hill climbing to solve 8-puzzle problem. 2 3 7

UNIT-III
Apply unification algorithm to the following :
a. Like( john, x) Hate (john, x)
5. a). 3 3 7
b. Like ( Marcus, Caesar, john) and Like( x, y)
c. Like ( john, kate) and Like ( x, kate)
b). Explain Truth maintenance system in detail. 3 2 7
OR
Apply the Resolution algorithm to Prove that:
● John likes peanuts. From the following facts:
a. John likes all kind of food.
6. a). b. Apple and vegetable are food. 3 3 7
c. Anything anyone eats and not killed is food.
d. Anil eats peanuts and still alive.
e. Harry eats everything that Anil eats.
b). Explain about Clause conversion algorithm. 3 2 7

Page 8 of 29
 UNIT-IV
7. a). Differentiate Procedural knowledge and Declarative Knowledge. 4 2 7
Represent the following facts using Partitioned Semantic Nets:
b). a. The dog bite the mail carrier 4 3 7
b. Every batter hit every bowler
OR
8. a). Differentiate Forward and Backward Reasoning. 4 3 7
Represent the following facts in Conceptual Dependency :
b). a. John gave the AI book to marry. 4 3 7
b. John punched marry.

UNIT-V
9. a). Explain about goal stack planning. 5 3 7
b). Explain different types of expert systems. 5 2 7
OR
10. a). Explain various steps in the natural language processing. 5 2 7
b). Explain the architecture of Expert system. 5 3 7

CO-COURSE OUTCOME KL-KNOWLEDGE LEVEL M-MARKS

NOTE : Questions can be given as A,B splits or as a single Question for 14 marks

Page 9 of 29
 Course Code: B20CS3105
SAGI RAMA KRISHNAM RAJU ENGINEERING COLLEGE (A) R 20
III B.Tech. I Semester MODEL QUESTION PAPER
SOFTWARE PROJECT MANAGEMENT
Computer Science & Engineering
Time: 3 Hrs. Max. Marks:70
Answer ONE Question from EACH UNIT
All questions carry equal marks
Assume suitable data if necessary
CO KL M
UNIT-I
1. a). Explain in detail various activities of software management 1 2 7
b). Explain few problems associated with software projects 1 2 7
OR
2. a). Explain in detail the five basic parameters of the Software Cost Model? 1 2 7
b). Explain detail about the effort estimation models. 1 2 7

UNIT-II
3. a). Define Artifact? Write short notes on Engineering Artifacts. 2 2 7
b). Illustrate the principles of modern software management 2 3 7
OR
4. a). Explain the typical minor milestones in the lifecycle of iteration 2 2 7
b). Explain the first two phases of the life-cycle process. 2 2 7

UNIT-III
5. a). Illustrate in detail different models of COCOMO with an example 3 3 7
b). Illustrate periodic status assessments 3 3 7
OR
6. a). Write a short notes on software process workflow & iteration workflow 3 2 7
b). Sketch and explain in detail various steps in Project Monitoring Cycle 3 3 7

UNIT-IV
7. a). Discuss Cost monitoring with suitable example. 4 2 7
b). List and explain seven categories of resources 4 2 7
OR
8. a). Briefly explain about the earned values 4 2 7
b). Explain the risk assessment 4 2 7

UNIT-V
9. a). What is capability maturity model? Explain. 5 2 7
b). With neat diagram explain product and process metrics. 5 2 7

Page 10 of 29
 OR
What is Software Quality Metrics? Explain in detail various Categories of
10. a). 5 2 14
Software Quality Metrics with suitable example each.
CO-COURSE OUTCOME KL-KNOWLEDGE LEVEL M-MARKS

NOTE : Questions can be given as A,B splits or as a single Question for 14 marks

Page 11 of 29
 Course Code: B20CS3106
SAGI RAMA KRISHNAM RAJU ENGINEERING COLLEGE (A) R 20
III B.Tech. I Semester MODEL QUESTION PAPER
DISTRIBUTED SYSTEMS
Computer Science & Engineering
Time: 3 Hrs. Max. Marks:70
Answer ONE Question from EACH UNIT
All questions carry equal marks
Assume suitable data if necessary
CO KL M
UNIT-I
1. a). Describe the characteristics of Parallel Systems 1 3 7
b). Explain Different Primitives for Distributed Communication 1 2 7
OR
Distinguish between Message Passing Systems versus Shared Memory
2. a). 1 2 7
Systems.
b). Explain different design issues in Distributed Systems. 1 2 7

UNIT-II
3. a). Discuss about different Message ordering Paradigms 2 3 7
b). Explain the Chandy–Lamport algorithm for FIFO channels. 2 2 7
OR
4. a). Explain about Group Communication. 2 2 7
b). Explain the Issues in recording a global state. 2 3 7

UNIT-III
5. a). Explain about the LAMPORT’S ALGORITHM. 3 2 7
b). Explain different Issues in Deadlock Detection. 3 2 7
OR
Explain the three basic approaches for implementing distributed mutual
6. a). 3 2 7
exclusion
b). Explain the SUZUKI-KASAMI’S BROADCAST ALGORITHM 3 2 7

UNIT-IV
Explain about Communication-induced Check pointing rollback-recovery
7. a). 4 2 7
technique.
b). Explain CONSENSUS PROBLEM IN ASYNCHRONOUS SYSTEMS. 4 2 7
OR
8. a). Why is rollback recovery of distributed systems complicated? 4 3 7
b). Explain the NONBLOCKING UNIVERSAL ALGORITHM. 4 2 7

Page 12 of 29
 UNIT-V
9. a). Explain the Content Addressable Network (CAN). 5 2 7
b). Explain Napster P2P System. 5 2 7
OR
10. a). Distinguish between Structured vs. unstructured overlays 5 3 7
b). Explain Extended Barabasi-Albert Model. 5 2 7
CO-COURSE OUTCOME KL-KNOWLEDGE LEVEL M-MARKS

NOTE : Questions can be given as A,B splits or as a single Question for 14 marks

Page 13 of 29
 Course Code: B20CS3107
SAGI RAMA KRISHNAM RAJU ENGINEERING COLLEGE (A) R 20
III B.Tech. I Semester MODEL QUESTION PAPER
ADVANCED UNIX PROGRAMMING
Computer Science & Engineering
Time: 3 Hrs. Max. Marks:70
Answer ONE Question from EACH UNIT
All questions carry equal marks
Assume suitable data if necessary
CO KL M
UNIT-I
1. a). Write the Brief History of Unix 1 2 7
b). Explain any 7 Basic Command of Unix 1 2 7
OR
2. a). Explain about Unix Components 1 2 7
b). Explain about Command Substitution in Unix 1 3 7

UNIT-II
3. a). Explain about The Directory Hierarchy in Unix 2 2 7
b). Explain about File-Directories and File Names of Unix 2 3 7
OR
4. a). Explain about File Permissions in Unix 2 2 7
b). Explain about Chmod, Chown, Chgrp commands in Unix 2 3 7

UNIT-III
5. a). Explain about Shell Variable in Unix 3 3 7
b). Explain about The Grep Family 3 2 7
OR
6. a). Explain about Looping in Shell Programs 3 3 7
b). Explain about AWK Pattern Scanning 3 2 7

UNIT-IV
7. a). Write a shell program to find the biggest of three numbers 4 2 7
b). Compare Continue and Break Statements in Unix 4 3 7
OR
8. a). Write a shell program to find the given number is prime are not 4 3 7
b). Compare Eval and Exec Commands in Unix 4 3 7

UNIT-V
9. a). Compare Parent and Child Processes 5 3 7
b). Compare Internal and External Commands 5 3 7

Page 14 of 29
 OR
10. a). Compare Foreground and Background processes 5 3 7
b). Compare Stty and Kill Command 5 3 7
CO-COURSE OUTCOME KL-KNOWLEDGE LEVEL M-MARKS

NOTE : Questions can be given as A,B splits or as a single Question for 14 marks

Page 15 of 29
 Course Code: B20CS3201
SAGI RAMA KRISHNAM RAJU ENGINEERING COLLEGE (A) R 20
III B.Tech. II Semester MODEL QUESTION PAPER
COMPILER DESIGN
Computer Science & Engineering
Time: 3 Hrs. Max. Marks:70
Answer ONE Question from EACH UNIT
All questions carry equal marks
Assume suitable data if necessary
CO KL M
UNIT-I
Draw a diagram for phases of a compiler and explain the main functions of 1 2 7
1. a).
each phase along with an example of position = initial + rate * 45.
b). Explain about Recognition of tokens. 1 2 7
OR
2. a). Discuss about the Science of Building a Compiler. 1 2 7
b). Explain the Role of Lexical analyzer. 1 2 7

UNIT-II
3. a). Explain the role of parser. 2 2 7
b). Explain how the Shift-Reduce parser operates by taking an example. 2 2 7
OR
Describe about model of a table driven predictive parser and algorithm with 2 2 7
4. a).
neat sketch.
List the differences between Top-down and Bottom-up parsers and eliminate 2 2 7
b).
the left recursion in CFG with an example.

UNIT-III
5. a). What is LR parser and construct SLR parsing table using a CFG. 3 2 8
What is syntax directed translation specification for a more advanced desk 3 2 6
b).
calculator. How it is different from translation schemes.
OR
6. a). Explain CLR parser by taking an example. 3 2 8
Explain about evaluation of SDD at nodes of a parse tree by taking an 3 2 6
b).
example.

UNIT-IV
Translate the expression a = (b * -c)+(b * -c) into Quadruples, triples and 4 3 7
7. a).
indirect triples.
b). Explain about data-flow analysis on basic blocks and reaching definitions. 4 2 7

Page 16 of 29
 OR
8. a). Explain about the principle sources of optimization. 4 2 7
b). Explain about DAG and construct DAG for a + a*(b-c) + (b-c)*d 4 3 7

UNIT-V
Generate target code from a sequence of three address statements using a 5 3 7
9. a).
simple code generator algorithm.
b). Discuss about peephole optimization techniques. 5 2 7
OR
Define Symbol table? Explain about the data structures used for symbol 5 2 8
10. a).
table.
b). Explain about Heap Management. 5 2 6
CO-COURSE OUTCOME KL-KNOWLEDGE LEVEL M-MARKS

NOTE : Questions can be given as A,B splits or as a single Question for 14 marks

Page 17 of 29
 Course Code: B20CS3202
SAGI RAMA KRISHNAM RAJU ENGINEERING COLLEGE (A) R 20
III B.Tech. II Semester MODEL QUESTION PAPER
MACHINE LEARNING
Computer Science & Engineering
Time: 3 Hrs. Max. Marks:70
Answer ONE Question from EACH UNIT
All questions carry equal marks
Assume suitable data if necessary
CO KL M
UNIT-I
1. a). Illustrate in detail about ingredients of Machine Learning. 1 3 7
b). Demonstrate about curse of Dimensionality and Overfitting. 1 2 7
OR
2. a). List out & explain the models in the output of Machine Learning. 1 2 7
b). Differentiate between Prior Probability and Conditional Probability. 1 2 7

UNIT-II
Demonstrate least-squares method using least square regression for 2 3 7
3. a).
classification.
b). Demonstrate Nearest Neighbor Classification with suitable example. 2 3 7
OR
Develop Decision trees for following set of training examples. 2 3 7
Day Outlook Temperature Humidity Wind Play
Tennis
D1 Sunny Hot High Weak No
D2 Sunny Hot High Strong No
D3 Overcast Hot High Weak Yes
D4 Rain Mild High Weak Yes
D5 Rain Cool Normal Weak Yes
4. a). D6 Rain Cool Normal Strong No
D7 Overcast Cool Normal Strong Yes
D8 Sunny Mild High Weak No
D9 Sunny Cool Normal Weak Yes
D10 Rain Mild Normal Weak Yes
D11 Sunny Mild Normal Strong Yes
D12 Overcast Mild High Strong Yes
D13 Overcast Hot Normal Weak Yes
D14 Rain Mild High Strong No
b). Explain briefly distance based clustering and hierarchical clustering. 2 2 7

Page 18 of 29
 UNIT-III
5. a). Explain Feature construction and selection. 3 2 7
b). Compare Bagging and random forests. 3 2 7
OR
Explain how thresholding and discretisation is done in feature 3 2 7
6. a).
transformations
b). Demonstrate Adaboost and Gradient Boosting. 3 2 7

UNIT-IV
7. a). Summarize Principle Component Analysis. 4 2 7
b). Illustrate LDA 4 2 7
OR
8. a). Compare Model Evaluation Techniques. 4 2 7
b). Demonstrate the Regularization Process 4 2 7

UNIT-V
9. a). Explain back propagation in Neural Network with suitable Example. 5 2 7
b). Explain Markov Decision Process. 5 2 7
OR
10. a). Compare multilayer perceptrons with respect to linear perceptron. 5 2 7
b). Outline the uses of Reinforcement Learning. 5 2 7
CO-COURSE OUTCOME KL-KNOWLEDGE LEVEL M-MARKS

NOTE : Questions can be given as A,B splits or as a single Question for 14 marks

Page 19 of 29
 Course Code: B20CS3203
SAGI RAMA KRISHNAM RAJU ENGINEERING COLLEGE (A) R 20
III B.Tech. II Semester MODEL QUESTION PAPER
CRYPTOGRAPHY AND NETWORK SECURITY
Computer Science & Engineering
Time: 3 Hrs. Max. Marks:70
Answer ONE Question from EACH UNIT
All questions carry equal marks
Assume suitable data if necessary
CO KL M
UNIT-I
1. a). Differentiate Active attacks and Passive attacks. 1 2 7
b). Explain Traditional Block cipher Structure 1 2 7
OR
2. a). What is mono alphabetic cipher? How it differs from Caesar cipher. 1 2 7
b). Explain Block cipher design principles. 1 2 7

UNIT-II
Perform Encryption and Decryption using RSA algorithm for
3. a). 2 3 7
p=17,q=11,e=7,M=88.
Explain the structure of AES algorithm with neat diagram and describe
b). 2 2 7
the steps in AES encryption.
OR
Find the secret key shared between User A and User B using
4. a). DiffieHellman Key exchange algorithm for the following: 2 3 7
q=97, a=5, the private keys XA = 36, XB = 58.
b). Explain Block Cipher modes of operations 2 2 7

UNIT-III
Illustrate digital signature algorithm with neat diagram and explain how to
5. a). 3 3 7
sign and verify using DSS algorithm.
b). Differentiate between HMAC and CMAC 3 2 7
OR
6. a). List and explain various steps of SHA in detail with neat diagram. 3 2 7
b). Describe Kerberos with steps to grant the ticket. 3 2 7

UNIT-IV
7. a). Describe IP sec architecture with neat diagram. 4 2 7
b). Discuss the services provided by PGP with neat diagram. 4 2 7
OR
8. a). Discuss in detail about SSL/TLS. 4 2 7

Page 20 of 29
 b). Explain Web security requirements 4 2 7

UNIT-V
9. a). Explain key elements in Blockchain technology. 5 2 7
b). Explain about different types of firewalls. 5 2 7
OR
10. a). Explain how firewalls are configured. 5 2 7
b). Describe how Blockchain technology is used in smart contracts 5 2 7
CO-COURSE OUTCOME KL-KNOWLEDGE LEVEL M-MARKS

NOTE : Questions can be given as A,B splits or as a single Question for 14 marks

Page 21 of 29
 Course Code: B20CS3204
SAGI RAMA KRISHNAM RAJU ENGINEERING COLLEGE (A) R20
III B.Tech. II Semester MODEL QUESTION PAPER
MOBILE COMPUTING
Computer Science & Engineering
TIME: 3Hrs. Max.Marks:70M
Answer ONE Question from EACH UNIT
All questions carry equal marks
Assume suitable data if necessary
CO KL M
UNIT-I
1. a). Give brief introduction to voice-oriented data communication standards 1 2 7
b). Explain the characteristics of Mobile Computing. 1 2 7
OR
Differentiate guided with unguided transmission- signal propagation
2. a). 1 2 7
frequencies in Mobile Communication.
b). Explain the structure of Mobile Computing Application 1 2 7

UNIT-II
3. a). Illustrate 3G communication standards. 2 2 7
b). Explain the functional Architecture of GSM system with a neat diagram. 2 2 7
OR
4. a). Discuss about the mobile services and data services in GSM. 2 3 7
b). Compare 4G with 5G communication. 2 3 7

UNIT-III
5. a). List and explain the applications of ad-hoc networks. 3 2 7
b). What is MANET? What are the characteristics of MANET? 3 2 7
OR
6. a). Explain various improvements in TCP performance with diagram 3 3 7
b). Explain the agent discovery process in Mobile IP 3 2 7

UNIT-IV
7. a). Explain usage models for synchronization in mobile application. 4 2 7
Briefly discuss about various types of data synchronization in mobile
b). 4 2 7
computing systems.
OR
8. a). Classify the rules that need to be applied for conflict resolution. 4 2 7
b). Explain domain-dependent specific rules for data synchronization 4 2 7

UNIT–V

Page 22 of 29
9. a). Explain in detail about wireless datagram protocol 5 2 7
b). Demonstrate wireless transport layer security (WTLS). 5 2 7
OR
10. a). Write a short note on wireless LAN (WLAN). 5 2 7
b). Explain the architecture of WAP and its optimal support. 5 2 7
CO-COURSE OUTCOME KL-KNOWLEDGE LEVEL M-MARKS

NOTE : Questions can be given as A,B splits or as a single Question for 14 marks

Page 23 of 29
 Course Code: B20CS3205
SAGI RAMA KRISHNAM RAJU ENGINEERING COLLEGE (A) R20
III B.Tech. II Semester MODEL QUESTION PAPER
BIG DATA ANALYTICS
Computer Science & Engineering
Time: 3 Hrs. Max. Marks:70
Answer ONE Question from EACH UNIT
All questions carry equal marks
Assume suitable data if necessary
CO KL M
UNIT-I
1. a). Define Bigdata? Describe the main features of a big data in detail. 1 2 7
b). Explain in detail about Nature of Data and its applications. 1 2 7
OR
2. a). List the main characteristics of Big Data. 1 2 7
b). Explain in detail about Storage Considerations in Big Data. 1 2 7

UNIT-II
Describe how would you stream data model architecture with suitable
3. a). 2 3 7
block diagram?
b). How is data analysis used in stock market predictions? 2 2 7
OR
4. a). Discuss the concept of decaying window in detail. 2 2 7
b). What can you say about the real time analytics platform applications? 2 2 7

UNIT-III
5. a). Explain Hadoop Architecture with a neat diagram. 3 3 7
b). Illustrate a simple example of the working of MapReduce 3 3 7
OR
6. a). Explain about Hadoop Yarn Architecture. 3 2 7
b). Explain the differences between old and new Java MapReduce API 3 2 7

UNIT-IV
7. a). Explain the principles to be considered while writing Pig scripts. 4 2 7
b). What are the filters are available in Apache HBase? 4 2 7
OR
8. a). Describe two modes for running scripts in Pig. 4 3 7
b). Explain in brief about Data manipulation in HIVE. 4 2 7

UNIT-V
9. a). Explain Regression analysis in Data Analytics 5 2 7
b). What is a scatter plot? For what type of data is scatter plot usually used for? 5 2 7

Page 24 of 29
 OR
10. a). Explain about Multiple Linear Regression. 5 2 7
b). Which are most frequently used techniques for big data visualization? 5 2 7
CO-COURSE OUTCOME KL-KNOWLEDGE LEVEL M-MARKS

NOTE : Questions can be given as A,B splits or as a single Question for 14 marks

Page 25 of 29
 Course Code: B20CS3206
SAGI RAMA KRISHNAM RAJU ENGINEERING COLLEGE (A) R 20
III B.Tech. II Semester MODEL QUESTION PAPER
OBJECT ORIENTED ANALYSIS AND DESIGN
Computer Science & Engineering

Time: 3 Hrs. Max. Marks:70

Answer ONE Question from EACH UNIT
All questions carry equal marks
Assume suitable data if necessary
CO KL M
UNIT-I
1. a). Explain the Architecture of UML 1 3 7
b). Describe the basic activities in Object oriented analysis and explain 1 3 7
OR
2. a). Explain the different phases of Unified Process 1 3 7
b). Illustrate the software development life cycle 1 3 7

UNIT-II
Describe the strategies used to identify conceptual classes. Describe the
3 2 2 14
steps to create a domain model used for representing conceptual classes
OR
Describe the UML notations for class diagram with an example. Explain the
4. 2 3 14
concept of Link, association and inheritance

UNIT-III
Sketch the activity diagram for the following scenario. Booking a ticket on
5. a). 3 3 7
the movies
b). Differentiate aggregation and composition with examples 3 2 7
OR
Sketch and explain the use case diagram and Interaction diagram for an
6. 3 3 14
online purchase system

UNIT-IV
List and construct of the state diagram. Use the same to Sketch the state
7. diagram for a software that controls an elevator in a building with seven 4 3 14
floors and write the merits and demerits of state diagram.
OR
What is the purpose of deployment diagrams? Explain the basic elements of
8. 4 3 14
a deployment diagram through an example

Page 26 of 29
 UNIT-V
9. Write the case study for Library Application with all diagrams 5 4 14
OR
10. Write the case study for college management with all diagrams 5 4 14
CO-COURSE OUTCOME KL-KNOWLEDGE LEVEL M-MARKS

NOTE : Questions can be given as A,B splits or as a single Question for 14 marks

Page 27 of 29
 Course Code: B20CS3207
SAGI RAMAKRISHNAMRAJU ENGINEERING COLLEGE(A) R20
III B.Tech. II Semester MODEL QUESTION PAPER
NETWORK PROGRAMMING
Computer Science & Engineering
TIME: 3Hrs. Max.Marks:70M
Answer ONE Question from EACH UNIT
All questions carry equal marks
Assume suitable data if necessary
CO KL M
UNIT-I
1. a). Explain the steps involved in creating raw socket 1 2 7
Explain the fundamental differences between the operation of TCP and
b). 1 2 7
UDP protocols.
OR
2. a). Explain SCTP Network architecture 1 2 7
b). Write a note on differences between IPv4 and IPv6 1 2 7

UNIT-II
3. a). Describe elementary TCP socket functions with an example. 2 2 7
b). Illustrate the concept of server host crashes with a suitable example. 2 3 7
OR
4. a). Illustrate Concurrent Servers and write close, read & Write functions 2 3 7
b). Explain socket functions for TCP client server model 2 2 7

UNIT-III
Write briefly POSIX Signal Handling and Termination of Server
5. a). 3 3 7
Process.
Explain the functionality provided by select function. List the
b). 3 2 7
differences between Poll and Select functions
OR
What is I/O Multiplexing? Explain different types of Synchronous and
6. 3 2 14
asynchronous I/O models.

UNIT- IV
Describe the UDP Echo server functions and lost datagram with an
7. a). 4 2 7
example.
Describe the getaddr info function as applicable to IPV6. Write briefly
b). 4 2 7
about IPV4 socket options.
OR

Page 28 of 29
 Write briefly about lack of flow control with UDP. List the differences
8. 4 3 14
between TCP and UDP.

UNIT–V
Explain in detail how the IPC functionality is provided by message
9. a). 5 2 7
queues.
What are the advantages of shared memory over pipes, FIFO and
b). message queues? Explain the process of Copying file data from server 5 2 7
to client using shared memory
OR
10. a). Write a short notes on a) FTP b) SMTP c) TELNET 5 2 7
b). Explain the differences among the exec family of functions of Unix. 5 2 7
CO-COURSE OUTCOME KL-KNOWLEDGE LEVEL M-MARKS

NOTE : Questions can be given as A,B splits or as a single Question for 14 marks

Page 29 of 29