(DMTCS 21) - Anucde · (DMTCS 21) M.Tech. DEGREE EXAMINATION, DECEMBER 2012. (Examination at the...
Transcript of (DMTCS 21) - Anucde · (DMTCS 21) M.Tech. DEGREE EXAMINATION, DECEMBER 2012. (Examination at the...
(DMTCS 21)
M.Tech. DEGREE EXAMINATION, DECEMBER 2012.
(Examination at the end of Final Year)
Computer Science
Paper I — ADVANCED DATABASE MANAGEMENT SYSTEMS
Time : Three hours Maximum : 75 marks
Answer Question No. 1 compulsorily. (15 × 1 = 15)
Answer ONE question from each Unit. (4 × 15 = 60)
1. (a) Define Distributed DBMS.
(b) Define Autonomy.
(c) What do you mean by Heterogeneity?
(d) Expand OLAP.
(e) Write a short note of peer-peer systems.
(f) Define Transaction.
(g) Define Normalization.
(h) Define fragmentation.
(i) What do you mean by data cleaning?
(j) What do you mean by data mart?
(k) Mention the types of optimization process in query processing.
(l) Define data localization.
(m) Define consistency and isolation.
(n) Mention two locking based concurrency control algorithms
(o) Define State and Failure.
UNIT I
2. (a) Define object, Encapsulation, Inheritance, Polymorphism.
(b) Explain about Object query Language with an example.
Or
3. (a) What are the differences between traditional databases and object oriented
databases.
(b) How do you achieve inheritance in object oriented databases.
UNIT II
4. Explain the Design issues of Distributed databases.
Or
5. Explain the Allocation problem and solutions in the distributed database design.
UNIT III
6. Explain different layers of Query Processing in detail.
Or
7. Discuss in detail about Centralized Query Optimization Techniques.
UNIT IV
8. Explain about Deadlock management in detail.
Or
9. (a) Define System, Reliability, Availability, Mean Time between failures, Mean Time
to Repair.
(b) Explain about various failures in Distributes DBMS.
–––––––––––
(DMTCS 22) M.Tech. DEGREE EXAMINATION, DECEMBER 2012.
(Examination at the end of Final Year)
Computer Science
Paper II — DESIGN AND ANALYSIS OF ALGORITHMS
Time : Three hours Maximum : 75 marks
Answer Question No. 1 compulsory.
Answer ONE question from each Unit.
1. (a) Define space and time complexities.
(b) What is convex hull? Give its complexity.
(c) Give the general method of Greedy algorithm.
(d) What is principle of optimality? Give two applications of dynamic programming.
(e) How can you say sub-set sum problem is back track problem?
(f) Give the Graph traversing techniques.
(g) What is difference between back tracking and branch and bound method?
(h) Define NP-Hard problem.
UNIT I
2. (a) Give the characteristics of an algorithm.
(b) What are different asymptotic notations used? Explain.
Or
3. Sort the following element using merge sort.
10, 5, 7, 6, 1, 4, 8, 3, 2, 9 and also compute its time complexity.
UNIT II
4. Write and explain prim's algorithm. Solve the following problem by Prims algorithm find
the shortest path.
Or
5. Explain optimal binary search algorithm using dynamic programming. Also discuss the
time complexity.
UNIT III
6. (a) Write and explain DFS algorithm.
(b) From the following graph, draw the DFS graph traversal.
Or
7. Give the a bactracking algorith for n-queen's problem. Draw the state space tree for a 4-
queen's poblem.
UNIT IV
8. Apply branch and bound to 0/1 knapsack problem. Explain with suitable example.
Or
9. Discuss NP-hard and NP-complete problems with suitable example.
–––––––––––
(DMTCS 23)
M.Tech. DEGREE EXAMINATION, DECEMBER 2012.
(Examination at the end of Final Year)
Computer Science
Paper III — COMPUTER NETWORKS
Time : Three hours Maximum : 75 marks
Answer Question No. 1 compulsorily. (15 × 1 = 15)
Answer ONE question from each Unit. (4 × 15 = 60)
1. Briefly explain the following :
(a) What is framing?
(b) What is meant by check sum?
(c) Define packet switching.
(d) What is subnet?
(e) What is flooding?
(f) Define traffic shaping.
(g) Define marshaling.
(h) What is IP address format?
(i) Give any network topologies?
(j) What is use of DNS?
(k) What is URL?
(l) What is message digest?
(m) What is firewall?
(n) What is difference between FTP and http protocols?
(o) What is public key?
UNIT I
2. (a) Describe the salient features of wireless LAN’s.
(b) Explain TCP/IP reference model.
Or
3. (a) Explain about Bluetooth Architecture? Give the applications of Bluetooth.
(b) Explain about fast Ethernet.
UNIT II
4. (a) Describe the network layer design issues.
(b) Differentiate datagram subnet and virtual circuit subnet.
Or
5. (a) Explain about hierarchical rooting.
(b) Discuss about tunneling.
UNIT III
6. Explain about connection establishment and connection release in transport layer.
Or
7. (a) What are the elements of TCP header?
(b) Discuss various functions performed by the e-mail systems.
UNIT IV
8. (a) Explain about DES symmetric key algorithm.
(b) Explain about e-mail security.
Or
9. (a) Discuss about public key cryptography.
(b) Write short notes on digital signatures.
–––––––––––
(DMTCS 24)
M.Tech. DEGREE EXAMINATION, DECEMBER 2012.
(Examination at the end of Final Year)
Computer Science
Paper IV — INTERNET PROGRAMMING
Time : Three hours Maximum : 75 marks
Answer Question No. 1 is compulsorily. (15 × 1 = 15)
Answer ONE question from each Unit. (4 × 15 = 60)
1. (a) What can javascript programs do?
(b) How to embed javascript in a web page?
(c) What is the difference between an alert box and a confirmation box?
(d) Name the numeric constants representing max, min values.
(e) What is CSS?
(f) What is variable typing in javascript?
(g) What is filter?
(h) Define active control.
(i) Tell about technologies that we use in DHTML?
(j) What is the difference b/w DHTML and HTML?
(k) Give the advantages of ASP over Java script.
(l) What is XML?
(m) What is data binding?
(n) Give any two functions of string object.
(o) What are the differences between the web server and application server?
UNIT I
2. (a) Describe the various functions in Date with suitable examples.
(b) Develop a javascript to determine whether a given number is an ‘ARMSTRONG
NUMBER’ or not.
Or
3. (a) Describe with syntax various control structures in java script.
(b) Write a java script to validate a form consisting of a username. Also navigate to
another web page after validation.
UNIT II
4. (a) Describe the different types of CSS.
(b) Explain the various ways you can reference a color in CSS.
Or
5. What is an Event? Describe different types of events.
UNIT III
6. Discuss about structured graphics active control and sprite active control.
Or
7. (a) Differentiate java script and VB script.
(b) Write the VB script features.
UNIT IV
8. (a) Give the syntax of an XML document and explain how a basic XML Document is
created with an example.
(b) Explain the following terms related to Document Type Definition :
(i) Elements
(ii) Attributes and entities
(iii) Internal and external entities.
Or
9. (a) Explain about different types of web-servers.
(b) Discuss briefly the features of ASP.
–––––––––––
(DMTCS 25)
M.Tech. DEGREE EXAMINATION, DECEMBER 2012.
(Examination at the end of Final Year)
Computer Science
Elective I — Paper V — REAL TIME SYSTEMS
Time : Three hours Maximum : 75 marks
Answer Question No. 1 compulsorily. (15)
Answer ONE question from each Unit. (4 × 15 = 60)
1. Write short notes on the following :
(a) Hard-real time system. (2)
(b) Sampled Data Systems. (2)
(c) Release time and relative deadline. (3)
(d) Precedence constraints. (2)
(e) Greedy scheduling. (2)
(f) Acceptance test for sporadic jobs. (2)
(g) Consumption rule. (2)
UNIT I
2. (a) Explain about any two Signal Processing related real-time applications.
(b) Explain about reference model of Real-time systems.
Or
(c) Explain about weighted round-robin approach.
(d) Explain about off-line versus on-line scheduling.
UNIT II
3. (a) Explain about optimality of the RM and DM algorithms.
(b) Explain about fixed versus dynamic priority algorithms.
Or
(c) Explain about fair-queuing servers.
(d) Explain about static timer-driven scheduler.
UNIT III
4. (a) Explain about basic priority ceiling protocol.
Or
(b) Explain about task assignments.
(c) Explain about multiprocessor priority ceiling protocol.
UNIT IV
5. (a) Explain about tasks with temporal distance constraints.
Or
(b) Explain about Internet and resource reservation protocols.
(c) Explain about capabilities of commercial real-time OS.
–––––––––––
(DMTCS 26)
M.Tech. DEGREE EXAMINATION, DECEMBER 2012.
(Examination at the end of Final Year)
Computer Science
Paper VI — ARTIFICIAL INTELLIGENCE
Time : Three hours Maximum : 75 marks
Answer Question No. 1 is compulsorily. (15 marks)
Answer ONE question from each Unit. (4 × 15 = 60)
1. Briefly explain the following :
(a) What do you understand by heuristic search?
(b) How are the facts represented in logic?
(c) What is meant by matching?
(d) Define Abduction.
(e) What is frame? Give an example.
(f) Define monotonic and non-monotonic reasoning.
(g) What is an expert system?
(h) Give the syntax of PROLOG.
UNIT I
2. (a) Compare depth first search and breadth first search.
(b) Describe about the problem characteristics.
Or
3. (a) Explain about AO* algorithm.
(b) Explain about constraint satisfaction problem with an example.
UNIT II
4. (a) Explain about Unification algorithm.
(b) Explain about natural deduction.
Or
5. What are well formed formulae? What are the steps involved in bringing acknowledge to
clause form? Give an example.
UNIT III
6. (a) Construct partitioned semantic net
representation for “Every batter hit a ball”.
(b) Write short notes on Conceptual dependency.
Or
7. (a) Differentiate forward versus and backward reasoning.
(b) Explain procedural and declarative knowledge.
UNIT - IV
8. (a) How to represent fact in PROLOG?
(b) Write a prolog program to implement resolution theorem.
Or
9. (a) Explain about dynamic databases.
(b) What is recursion? How to implement recursive programs in PROLOG? Give an
example.
—————
(DMTCS 27)
M.Tech. DEGREE EXAMINATION, DECEMBER 2012.
(Examination at the end of Final Year)
Computer Science
Paper VII — OBJECT ORIENTED ANALYSIS AND DESIGN
Time : Three hours Maximum : 75 marks
Answer Question No. 1 compulsory. (15 marks)
Answer ONE question from each Unit. (4 × 15 = 60)
1. (a) What are the main underlying concepts of object orientation?
(b) Differentiate persistent and non-persistent objects.
(c) What is importance of package?
(d) What is meant by software development method?
(e) How to represent the interaction between the modeling elements?
(f) Mention the elements used in the Use-case model.
(g) Describe UI design rules.
(h) What do you meant by software metric?
UNIT I
2. What are the various diagrams that are used in analysis and design steps of booch
methodology? Explain with your own example.
Or
3. Explain the following :
(a) Object modeling technique.
(b) Compare aggregation and composition with suitable example.
UNIT II
4. (a) Describe the basic activities of Object oriented analysis and explain how Use-Case
modeling is useful in analysis.
(b) Draw the Use-Case model for ATM Bank operation.
Or
5. Draw the class diagram, use-case diagram, interaction diagram for Library management
system.
UNIT III
6. (a) Write short notes on centric process.
(b) Explain about four P’s.
Or
7. Explain about iterative and incremental process.
UNIT IV
8. (a) Explain the macro and micro process of a view layer design.
(b) How do you develop a custom form for a user satisfaction test?
Or
9. (a) Describe the different testing strategies.
(b) Explain the principles and metrics of good Object oriented design.
–––––––––––
(DMTCS 28 (A))
M.Tech. DEGREE EXAMINATION, DECEMBER 2012.
(Examination at the end of Final Year)
Computer Science — Elective – I
Paper VIII — EMBEDDED SYSTEMS
Time : Three hours Maximum : 75 marks
Answer Question No. 1 compulsorily. (15 marks)
Answer ONE question from each Unit. (4 × 15 = 60)
1. Write short notes on the following :
(a) What is FPGA? (2)
(b) What is a reentrant function? (2)
(c) What is linker? (2)
(d) What is a Host Machine? (2)
(e) What is logic analyzer? (2)
(f) Define RT Kernel. (2)
(g) What is UART and RS232? (3)
UNIT I
2. (a) Explain the use of open collector outputs.
(b) Differentiate SSP, GPP and ASIC processor.
Or
(c) Write short notes on RAM? How many types of RAM used in computer systems?
(d) Explain embedded architecture with example.
UNIT II
3. (a) Explain various architectures followed to design embedded software.
(b) What is Reentrancy? What are the three rules to be followed by a function to be
reentrant?
Or
(c) What is a semaphore? Explain the use of semaphores with examples.
(d) What are task states? Explain the function of a scheduler.
UNIT III
4. (a) Discuss about semaphores and shared data in RTOs.
(b) Briefly explain the role of queues and pipes in message communication in RTOs.
Or
(c) How we can save the memory space and power in embedded systems?
(d) Explain about encapsulating semaphores.
UNIT IV
5. (a) What is cross compiler? How does it help in developing embedded software?
(b) What are the goals of a typical testing process of a Host machine?
Or
(c) Give the tool chain for building embedded software.
(d) Explain how you are Testing Embedded Software on the host machine.
–––––––––––
(DMTCS 28 (B))
M.Tech. DEGREE EXAMINATION, DECEMBER 2012.
(Examination at the end of Final Year)
Computer Science
Elective I — Paper VIII — IMAGE PROCESSING
Time : Three hours Maximum : 75 marks
Answer Question No. 1 is compulsorily. (15 × 1 = 15)
Answer ONE question from each Unit. (4 × 15 = 60)
1. Briefly explain the following :
(a) Pixel operations.
(b) Edge enhancement.
(c) Intensity slicing.
(d) What are the advantages of filters in frequency domain?
(e) What are the characteristics of segmentation?
(f) What is Skeletanization?
(g) Define Walsh transform.
(h) Define Histogram.
(i) Define thresolding.
(j) Run length code.
(k) Mention the significant features of wavelet transform.
(l) Spatial Resolution.
(m) Define fidelity criteria.
(n) Image smoothing.
(o) Define adjacency pixel.
UNIT I
2. (a) Explain the representation of Digital image.
(b) Explain the following :
(i) 4-adjacency (ii) 8-adjacency (iii) M-adjacency.
Or
3. (a) Explain about image sensing and acquisition.
(b) Discuss about camera model and camera calibration.
UNIT II
4. (a) Explain the one dimensional and two dimensional Fourier transform and its
inverse.
(b) What is FFT? Explain about the FFT algorithm based on successive doubling
method.
Or
5. (a) Explain image Enhancement techniques using arithmetic operators.
(b) Explain pseudo color image processing.
UNIT III
6. (a) Explain about minimum mean square error filtering technique.
(b) Discuss about degradation model.
Or
7. (a) Discuss wavelet transforms in one dimension.
(b) Discuss the effects of diagonalization on the degradation model.
UNIT IV
8. What is meant by image segmentation? Why it is required? Explain about Region Based
segmentation methods.
Or
9. (a) Briefly explain about point detection, line detection and edge detection.
(b) Discuss the global thresolding technique.
–––––––––––
(DMTCS 29 A)
M.Tech. DEGREE EXAMINATION, DECEMBER 2012.
(Examination at the end of Final Year)
Computer Science
Elective – II
Paper IX — MOBILE CELLULAR COMMUNICATION
Time : Three hours Maximum : 75 marks
Answer Question No. 1 compulsorily. (15 marks)
Answer ONE question from each Unit. (4 × 15 = 60)
1. Write short notes on the following :
(a) Uniqueness of Mobile Radio Environment.
(b) Cochannel Interference Reduction Factor.
(c) Exploring Cochannel interference Areas in a System.
(d) Effect On Near-End Mobile Units.
(e) Definition of Channel Assignment.
(f) Intersystem Handoff.
(g) Digital Mobile Telephony.
UNIT I
2. (a) Discuss the performance criteria of the basic cellular system?
(b) Explain the handoff mechanisms in cellular systems?
Or
(c) Explain about Real-Time Cochannel Interference Measurement at Mobile Radio
Transceivers.
(d) Explain in detail the difference between the subjective and objective tests under
non cochannel interference?
UNIT II
3. (a) Explain about Nonfixed Channel Assignment Algorithms.
(b) Discuss about Perception of Call Blocking from the Subscribers.
Or
(c) Discuss about Cell-Site Handoff Only
(d) Explain about Dropped Call Rate
UNIT III
4. (a) Discuss about Practical Multiple-Access Schemes.
(b) Explain about Digital Speech.
Or
(c) Explain about Global System for Mobile.
(d) Explain about DECT.
UNIT IV
5. (a) Explain about In-building Communication
(b) Discuss about CDMA Cellular Radio Network
Or
(c) Discuss about Wireless Information Superhighway.
(d) Explain about ISDN.
—————
(DMTCS 29 B)
M.Tech. DEGREE EXAMINATION, DECEMBER 2012
(Examination at the end of Final Year)
Computer Science
Elective – II
Paper IX — NETWORK SECURITY
Time : Three hours Maximum : 75 marks
Answer Question No.1 compulsorily. (15)
Answer ONE question from each Unit.(4 × 15 = 60)
1. (a) What is the difference between Public Key and Private Key encryption? (3)
(b) What is passive attack? (2)
(c) What is hash junction? (2)
(d) What are the services provided by PGP? (2)
(e) What is block cipher? (2)
(f) What is kerberos? (2)
(g) What is Trojan Horse? (2)
UNIT I
2. What is cryptography? Explain the DES algorithm with a block diagram.
Or
3. (a) What is network security? Discuss about various services provided by network
security.
(b) Differentiate between Stream and Block ciphers.
UNIT II
4. Explain the working of RSA with an example.
Or
5. (a) Explain the concepts of discrete logarithms.
(b) What is number theory? How is it used in public key encryption? Explain.
UNIT III
6. What is message authentication? Explain how digital signatures are generated.
Or
7. (a) What is Elliptic curve? Explain.
(b) Discuss about various key management schemes.
UNIT IV
8. (a) What is secure electronic transaction? Explain how it works.
(b) What is fire wall? Classify various types of firewalls.
Or
9. (a) Discuss about various identification schemes in detail.
(b) What is Eight-mime? Explain.
——————