b.tech. degree examination, may - 2013 (examination at the ... · n-3062 2 unit - ii q4) a) explain...
TRANSCRIPT
�������������Total No. of Questions : 9] [Total No. of Pages : 02
B.Tech. DEGREE EXAMINATION, MAY - 2013
(Examination at the end of Final Year)
COMPUTER SCIENCE
(Paper - I) : Object Oriented Analysis & Design
Time : 03 Hours Maximum Marks : 75
Answer Question No. 1 compulsory (15 × 1 = 15)
Answer One question from each unit (4 × 15 = 60)
Q1) a) Define object.
b) Define Activity diagram.
c) Discuss CRC cards.
d) Define Pattern.
e) Define State Chart.
f) What is physical design?
g) What is Consistency checking?
h) What is Concurrency?
i) Define Interface.
j) Define Data Conversion.
k) What is Implementation Strategy?
l) What is Component?
m) Define Method.
n) What do you mean by Software Metric?
o) Define legacy system.
UNIT - I
Q2) a) Discuss about Requirements in Agate Ltd. Case study.
b) Explain about Modeling Concepts.
OR
Q3) a) Discuss about Requirements Capture.
b) Explain how to draw Activity diagrams.
N-3062 P.T.O.
�������������
N-3062 2
UNIT - II
Q4) a) Explain Component based development and software development pattern.
b) Explain how the Design is different from analysis.OR
Q5) a) Discuss Object Interaction.
b) Explain about measurable objectives in Design.
UNIT - III
Q6) Explain the following:a) Concurrency.b) Criteria for good design.c) Architecture of the presentation layer.
ORQ7) Explain the following:
a) Integrity constraint.b) Documenting pattern.c) Approach to user interface design.
UNIT - IV
Q8) Discuss about implementation in detail.OR
Q9) a) Differentiate Method and Methodology.b) Extreme Programming.c) What are the issues in choosing a methodology.
���
�����������Total No. of Questions : 9] [Total No. of Pages : 02
B.Tech. DEGREE EXAMINATION, MAY - 2013
(Examination at the end of Final Year)
Computer Science and IT
COMPUTER NETWORKS
Time : 03 Hours Maximum Marks : 75
Answer Question No. 1 compulsory (15)Answer One question from each Unit (4 × 15 = 60)
Q1) a) What is optimality principle?
b) What is flooding?
c) What is hierarchical routing?
d) What is use of switch?
e) What is remote procedure call?
f) What is use of TCP?
g) What is MIME type?
h) What are the components of URL?
i) What is audio compression?
j) What is IP address?
k) Give two services of e-mail.
l) What is substitution cipher?
m) Define public key.
n) What is cryptanalysis?
o) What is message digest?
UNIT - I
Q2) a) Describe the network layer design issues.
b) Differentiate datagram subnet and virtual circuit subnet.
OR
Q3) a) What are the elements of internet protocol header?
b) Discuss the congestion control algorithm.
N-3063 P.T.O.
�����������
N-3063 2
UNIT - II
Q4) Explain about connection establishment & connection release in transport layer?
OR
Q5) a) What are the elements of TCP header?
b) Write short notes on UDP protocol.
UNIT - III
Q6) a) Write about DNS name space.b) Explain about World Wide Web with its architecture?
ORQ7) Describe the basic components of multimedia system. Also list the applications of multimedia
systems.
UNIT - IV
Q8) a) Explain about RSA algorithm.b) Describe the significance of digital signatures.
ORQ9) a) Write short notes on IP security.
b) Discuss the e-mail security.
���
�������������Total No. of Questions : 9] [Total No. of Pages : 02
B.Tech. DEGREE EXAMINATION, MAY - 2013
(Examination at the end of Final Year)
COMPUTER SCIENCE
(Paper - III) : Compiler Design
Time : 03 Hours Maximum Marks : 75
Answer Question No. 1 compulsory
Answer One question from each Unit
Q1) a) What is interpreter?
b) What is cross compiler?
c) Define handle pruning.
d) What is role of 100k ahead operator?
e) What do you meant by shift reduce technique?
f) Define s-attributes.
g) What are semantic errors?
h) What is register description?
i) What is YACC tool?
j) What is activation record?
k) What is reduction in strength?
l) What is DAG?
m) Define regular Grammar.
n) Give the significance of symbol table.
o) What is annotated parse tree.
UNIT - I
Q2) Describe various phase of compiler and show translation of statement a = b + c + 5 at end ofeach phase.
OR
Q3) a) Write about lexical analyzer generator.
b) Differentiate top-down and bottom - up parsing techniques.
N-3064 P.T.O.
�������������
N-3064 2
UNIT - II
Q4) a) Write algorithm for constructing predictive parsing table.
b) What is left recursion? Write a procedure to eliminate left recursion.
OR
Q5) Construct LR (1) parsing table for the following grammar with detail algorithm.
LR
idL
RL
RS
RLS
→
→
∗→
→
=→
UNIT - III
Q6) What are contents and data structures of symbol table?
ORQ7) Explain about syntax directed translation.
UNIT - IV
Q8) Explain the following:a) Implement of stack allocation scheme.b) Activation record.
ORQ9) a) Describe various error recovery strategies followed by a parser of the compiler.
b) Explain the role of addressing modes in code generation.
���
���������������Total No. of Questions : 5] [Total No. of Pages : 02
B.Tech. DEGREE EXAMINATION, MAY - 2013
(Examination at the end of Final Year)
COMPUTER SCIENCE
(Paper - IV) : VLSI Design
Time : 03 Hours Maximum Marks : 75
Answer question No. 1 compulsory (15)
Answer one question from each Unit (4 × 15 = 60)
Q1) Write briefly on the following:
a) Why substrate and well contacts are important in CMOS? (2)
b) What is the pull up to pull down ratio for an NMOS? (2)
c) Sketch the CMOS fabrication of p-channel device in an n-well with p-type substrate.(2)
d) What is a sense amplifier in a memory system? (2)
e) What is inverter pair delay? (2)
f) Mention a few CAD testing tools used in VLSI Industry. (3)
g) What is meant by ultra fast VLSI circuits? (2)
UNIT - I
Q2) a) Explain the advantages of MOS technology over bipolar technology and why MOSdevice gained performance over bipolar devices.
b) Derive the equations for transconductance gm and output conductance gds of a MOStransistor.
OR
c) How the shortcomings of CMOS technology overcome through BiCMOS technology?
d) Explain different types of scaling models. Write down scaling factors used for thesemodels.
UNIT - II
Q3) a) Explain the switch logic implementation of four-way multiplexer.
b) Implement the Bus arbitration logic for n-line bus using structured design.
OR
N-3065 P.T.O.
���������������
N-3065 2
c) What are the advantages of domino logic over dynamic logic?
d) Implement the EX-OR gate using Dynamic CMOS logic.
UNIT - III
Q4) a) Explain about a Pseudo - static RAM cell with the computation of area and powerdissipation.
b) Explain about the construction of a 3T - DRAM CELL with a neat circuit diagram.
OR
c) Give the sketch for an AND Matrix used in PLA and explain its functionality.
d) Explain the disadvantages of single transistor dynamic RAM cell.
UNIT - IV
Q5) a) Explain about BIST.
b) Explain about the following CAD tools.
i) Design Rule Verification.
ii) Layout Versus Schematic verification.
OR
c) Explain the circuit simulation.
d) How fault simulation is done? Give examples for fault models.
���
�������������Total No. of Questions : 9] [Total No. of Pages : 02
B.Tech. DEGREE EXAMINATION, MAY - 2013
(Examination at the end of Final Year)
Computer Science
(Paper - IV) : IMAGE PROCESSING
Time : 03 Hours Maximum Marks : 75
Answer Question No. 1 compulsory
Answer One question from each Unit
Q1) a) What is aliasing and moire pattern?
b) What is contrast stretching?
c) What is meant by order statistics filters?
d) What is wavelets?
e) What is meant by inverse filtering?
f) What is multiresolution?
g) What lossy compression?
h) What is meant by image segmentation?
UNIT - I
Q2) a) Describe the fundamental steps in digital image processing.
b) Give the applications of image processing.
OR
Q3) a) Describe the elements of visual perception.
b) Explain about image sampling and quantization.
UNIT - II
Q4) a) Discuss picewise - linear transformations.
b) Explain about procedure to histogram processing.
OR
Q5) a) Explain about buttrworth low pass and Gaussian low pass filters.
b) Explain about homomorphic filtering.
N-3066 P.T.O.
�������������
N-3066 2
UNIT - III
Q6) a) Describe different image noise models.b) Explain adaptive median filtering.
ORQ7) a) Explain about discretewave let transform.
b) Discuss Wiener filtering principle.
UNIT - IV
Q8) a) Describe the image compression standards.b) Write about error free compression.
ORQ9) a) Discuss detection of discontinuties in image segmentation.
b) Explain about region based segmentation.
���
��������������Total No. of Questions : 5] [Total No. of Pages : 02
B.Tech. DEGREE EXAMINATION, MAY - 2013
(Examination at the end of Final Year)
COMPUTER SCIENCE
(Paper - V) : Cryptography and Network Security
Time : 03 Hours Maximum Marks : 75
Answer Question No. 1 compulsory. (15)
Answer ONE question from each Unit. (4 × 15 = 60)
Q1) a) Define Stegnography. (2)
b) What is differential Cryptoanalysis. (2)
c) What is Fermat’s theorem? (2)
d) What is transposition? (2)
e) Explain about key management in IP security? (3)
f) What is MD5? (2)
g) What is Kerberos? (2)
UNIT - I
Q2) a) Explain about various substitution techniques in detail.
b) What is network security? Explain about various services provided by n/w security.
OR
What is conventional Excryption? Explain the working of DES in detail. Also discuss aboutstrengths & weakness of DES.
UNIT - II
Q3) a) Explain Chinese Remainder theorem with example.
b) What is Euler’s theorem? Explain.
OR
Explain the Secure Hash Algorithm with a neat block diagram.
N-3067 P.T.O.
��������������
N-3067 2
UNIT - III
Q4) a) What is X-509? Explain.
b) Draw and explain IP Security Architecture.
OR
c) What is ESP? Explain.
d) Discuss about various countermeasures of virus.
UNIT - IV
Q5) a) What is SET? Explain.
b) What is SSL? Explain.
OR
c) What is intrusion detection? Explain.
d) What is trusted system? Explain.
���
�������������Total No. of Questions : 9] [Total No. of Pages : 02
B.Tech. DEGREE EXAMINATION, MAY - 2013
(Examination at the end of Final Year)
COMPUTER SCIENCE
(Paper - V) : Soft Computing
Time : 03 Hours Maximum Marks : 75
Answer Question No. 1 compulsory. (15 × 1 = 15)
Answer ONE question from each unit. (4 × 15 = 60)
Q1) a) What do you mean by ANN?
b) What is the logistic signoid function?
c) What is supervised training?
d) What is auto associative memory?
e) What is hamming net?
f) In which situation fuzzy logic is most suitable?
g) What is the difference between classical & fuzzy set?
h) What is subtractive clustering?
i) What is knowledge acquisition?
j) Define Neuro-fuzzy modeling?
k) Define hybrid model.
l) List out the applications of soft computing.
m) What is the role played by mutation in GA?
n) Discuss the significance of fitness function.
o) What is cross over and inversion?
UNIT - I
Q2) a) Explain BP network with an example.
b) Discuss single layer perception with example.
OR
Q3) a) Explain binary hopefield network with an example.
b) Explain Kohonus self organising network with example.
N-3068 P.T.O.
�������������
N-3068 2
UNIT - II
Q4) a) Explain the sugeno model with an example.
b) Discuss the multi objective decision making with an example.OR
Q5) a) Discuss Mamdani model with examples.
b) Explain fuzzy control methods with an example.
UNIT - III
Q6) a) Explain k-means clustering algorithm with example.b) Explain classification & regression trees with suitable example.
ORQ7) Explain adaptive neuro fuzzy based inference system with an example.
UNIT - IV
Q8) a) Explain the Simulated Annealing with an example.b) Explain the mutation operations and discuss the significance of mutation.
ORQ9) Write short notes on the following:
a) Pridicate Calculus.b) Semantic Networks.c) Rank space method.
���
Total No. of Questions : 9] [Total No. of Pages : 01
B.Tech. DEGREE EXAMINATION, MAY - 2013
(Examination at the end of Final Year)
COMPUTER SCIENCE
(Paper - VII) : Industrial Management
Time : 03 Hours Maximum Marks : 75
Answer Question No. 1 is compulsory. (15) Answer any FOUR questions. (4 × 15 = 60)
Q1) Write short notes on:a) Job design.b) Depreciation.c) Compound interest.d) Power.e) Joint stock company.f) Scientific management.g) Present worth.h) Goals.
Q2) What are the functions of Management?
Q3) Explain the principles of scientific management.
Q4) Discuss the forms of Business Organisation.
Q5) Explain the types of Depreciation.
Q6) Explain the importance of materials management.
Q7) Explain about EOQ models.
Q8) Explain about personnel functions in a large scale organisation.
Q9) Write any one of the theories of Motivation.
���N-3069
�����������
������������Total No. of Questions : 9] [Total No. of Pages : 02
B.Tech. DEGREE EXAMINATION, MAY - 2013
(Examination at the end of Final Year)
Computer Science
(Paper - VIII) : ADVANCED COMPUTER ARCHITECTURE
Time : 03 Hours Maximum Marks : 75
Answer Question No. 1 compulsory. (15 × 1 = 15)
Answer one question from each unit. (4 × 15 = 60)
Q1) Write briefly on the following:
a) Multicomputer.
b) Give examples for Dynamic interconnection networks.
c) Define bandwidth of a system.
d) What is meant by cache coherence?
e) What is a cross bar switch?
f) MIPS.
g) Amdhal’s law.
h) Process migration.
i) Replication.
j) Explicit parallelism.
k) Pre-fetching.
l) Register Renaming.
m) Multiport memory.
n) Shared variables.
o) Branch prediction.
UNIT - I
Q2) a) Discuss about dataflow architecture.
b) Discuss about classification of parallel computers.
OR
Q3) a) Explain the conditions of parallelism.
b) Compare different types of program flow mechanisms.
N-3070 P.T.O.
������������
N-3070 2
UNIT - II
Q4) a) Briefly explain arithmetic pipeline design with a neat diagram.
b) Explain performance metrics and measures in detail with an example.OR
Q5) a) Explain about multifunctional arithmetic pipelines.
b) Explain matrix multiplication using parallel processing.
UNIT - III
Q6) a) Explain about synchronization mechanisms in multiprocessor systems.b) What is meant multithreading? Write the principles of multithreading.
ORQ7) a) Describe the synchronization mechanisms for multiprocessing.
b) Explain about Hybrid architectures.
UNIT - IV
Q8) a) How is parallelism in progress detected?b) Explain about various Parallel languages.
ORQ9) a) Explain about shared variable program structures.
b) What is the role of compiler in achieving parallelism?
���
�������������Total No. of Questions : 9] [Total No. of Pages : 02
B.Tech. DEGREE EXAMINATION, MAY - 2013
(Examination at the end of Final Year)
Computer Science
(Paper - IX) : DATA WAREHOUSING & DATA MINING
Time : 03 Hours Maximum Marks : 75
Answer Question No. 1 compulsory
Answer one question from each Unit (4 × 15 = 60)
Q1) a) Differentiate virtual data warehouse Vs data mart. (3)
b) What is a multidimensional database? (2)
c) Define Bagging and Pruning. (2)
d) List out the major strength of decision tree method. (2)
e) Write the two measures of Association Rule. (2)
f) What is Synchronous Generalization? (2)
g) What is constraint based rule mining? (2)
UNIT - I
Q2) a) Explain about architecture of typical data mining system.
b) How is a data warehouse different from relational database? How they are similar?
OR
Q3) a) Write about heterogeneous and legacy databases.
b) Describe the classification of data mining systems.
UNIT - II
Q4) a) What is meant by missing values in data cleaning? How to fill these missing values?
b) What is data transformation? Describe the various data transformation techniques.
OR
Q5) a) Explain constraint based association mining.
b) Explain FP-growth algorithm with suitable example.
N-3071 P.T.O.
�������������
N-3071 2
UNIT - III
Q6) a) Explain rule based classification with suitable example.
b) What is decision tree? Explain it with suitable example.
OR
Q7) a) Write a short notes on support vector machines.
b) Write about k-nearest neighbor classifiers.
UNIT - IV
Q8) a) Describe the model based clustering methods.
b) Discuss the requirements of clustering in data mining.
OR
Q9) a) Write a short notes on Outliers.
b) Explain k-medoids partitioning algorithm.
���
�������������Total No. of Questions : 5] [Total No. of Pages : 02
B.Tech. DEGREE EXAMINATION, MAY - 2013
(Examination at the end of Final Year)
COMPUTER SCIENCE
(Paper - X) : Embedded Systems
Time : 03 Hours Maximum Marks : 75
Answer Question No. 1 compulsory (15)
Answer one question from each unit (4 × 15 = 60)
Q1) Write short notes on the following:
a) What is the function of UART?
b) What is DMA?
c) What is the main problem of signal overloading?
d) Define Interrupt routine.
e) What is ASIC?
f) Define cross-compiler and cross assembler.
g) What is FPGA?
UNIT - I
Q2) a) Write short notes on PAL and PAL programming.
b) Explain the functional block diagram of a Microprocessor.
OR
a) Explain shared - data problem with an example. Explain how to avoid this problem.
b) Write short notes on RAM? How many types of RAM used in computer systems?Explain them.
UNIT - II
Q3) Explain various architectures followed to design embedded software.
OR
a) What is Reentrancy? What are the three rules to be followed by a function to bereentrant?
b) What is a semaphore? Explain the use of semaphores with examples.
N-3072 P.T.O.
�������������
N-3072 2
UNIT - III
Q4) a) Discuss about semaphores and shared data in RTOs.
b) List out the bugs to be likely occurred while using mail boxes, pipes and queues.
OR
a) What are the methods followed by interrupt routines in a RTOs environment.
b) Briefly explain the role of queues and pipes in message communication in RTOS.
UNIT - IV
Q5) a) Explain about the Linker/Locator for an embedded software.
b) Explain the usage of Logic analyzers in static mode.
OR
a) Discuss about different debugging tools.
b) Write down the goals of the typical testing process on your host machine.
���
��������������Total No. of Questions : 9] [Total No. of Pages : 02
B.Tech. DEGREE EXAMINATION, MAY - 2013
(Examination at the end of Final Year)
COMPUTER SCIENCE
(Paper - X) : TSP & PSP
Time : 03 Hours Maximum Marks : 75
Answer Question No. 1 compulsory. (15)
Answer ONE question from each unit. (4 × 15 = 60)
Q1) a) Define PSP. (2)
b) Define TSP. (2)
c) “To manage your time, plan your time and then follow the plan”. Justify. (3)
d) Why should you record time data? (2)
e) Write a short note on code review. (2)
f) Define product, project, task, process. (2)
g) Mention few Software defects. (2)
UNIT - I
Q2) Explain what parameters are required for time recording log instructions with a sampleformat.
OR
Q3) Explain the relationship between period and product plans. How do you record the summaryof the weekly activity?
UNIT - II
Q4) Explain the product planning process in detail with an example.
OR
Q5) a) How do you manage personal schedules?
b) Explain about Personal Software Process.
UNIT - III
Q6) a) Define software error, defect, fault and failure. When do you state that the defect is aserious defect?
b) Define Defect Efficiency, Inspection Rate and Defect Rate.
N-3073 P.T.O.
��������������
N-3073 2
ORQ7) a) Explain about Code Review Checklist with an example.
b) “Do at least some code review, even if you don’t have time to review at all”. Justifywith an example.
UNIT - IV
Q8) a) Define Defect Density. How do you calculate defect density?
b) What is the Defect Density for a program having 96 new lines of code and 12 defects?
c) When do you say the quality of the software is 100%?
OR
Q9) a) How do you identify design defects?
b) How do you calculate yield values and estimate the ultimate yield?
c) What are the benefits of 100% process yield?
���