bala _cse4 th yr
TRANSCRIPT
DEV BHOOMI GROUP OF INSTITUTES, DEHRADUN
(STUDENTS HANDBOOK)FOR B.TECH[CSE] –VIII SEM
Student Hand Book
Office Of Academic Affairs-DBGI-Dehradun:: Handbook of B.Tech- CSE_VIII Sem P a g e | 1
B. TECH.COMPUTER SCIENCE & ENGINEERINGYEAR FOURTH, SEMESTER – VIII
S.No CourseCode
Subject PERIODS
EVALUATIONSCHEME
SubjectTotal
SESSIONALEXAM
EXAM
ESEL T P CT TA TOTAL
1 TCS-801 DISTRIBUTED SYSTEMS
3 1 0 30 20 50 100 150
2 TCS 802 Mobile Computing 3 1 0 30 20 50 100 1503 CS – 033 Multimedia
Communication& System Design
3 1 0 30 20 50 100 150
4 CS – 042 Data Mining& DateWarehousing
3 1 0 30 20 50 100 150
Practical/Training/Project1 PCS-851 Distributed
SystemsLab
0 0 2 - 25 25 25 50
2 PCS-852 Project 0 0 2 - 100 100 200 3003 GP-801 General Proficiency - - - - 50 50 - 50Total 12 4 4 1000
(TCS-801) DISTRIBUTED SYSTEMSUnit–ICharacterization of Distributed Systems: Introduction, Examples of distributed Systems,Resource sharing and the Web Challenges.System Models: Architectural models, Fundamental ModelsTheoretical Foundation for Distributed System: Limitation of Distributed system, absenceof global clock, shared memory, Logical clocks, Lamport’s & vectors logical clocks, Causalordering of messages, global state, termination detection.Distributed Mutual Exclusion: Classification of distributed mutual exclusion, requirementof mutual exclusion theorem, Token based and non token based algorithms, performancemetric for distributed mutual exclusion algorithms.Unit–IIDistributed Deadlock Detection: system model, resource Vs communication deadlocks,deadlock prevention, avoidance, detection & resolution, centralized dead lock detection,distributed dead lock detection, path pushing algorithms, edge chasing algorithms.Agreement Protocols: Introduction, System models, classification of Agreement Problem,Byzantine agreement problem, Consensus problem, Interactive consistency Problem,Solution to Byzantine Agreement problem, Application of Agreement problem, AtomicCommit in Distributed Database system.Unit–IIIDistributed Objects and Remote Invocation: Communication between distributed objects,Remote procedure call, Events and notifications, Java RMI case study.Security: Overview of security techniques, Cryptographic algorithms, Digital signaturesCryptography pragmatics, Case studies: Needham Schroeder, Kerberos, SSL & Millicent.Distributed File Systems: File service architecture, Sun Network File System, The AndrewFile System, Recent advances.Unit–IV
Office Of Academic Affairs-DBGI-Dehradun:: Handbook of B.Tech- CSE_VIII Sem P a g e | 2
Transactions and Concurrency Control: Transactions, Nested transactions, Locks,Optimistic Concurrency control, Timestamp ordering, Comparison of methods forconcurrency control.Distributed Transactions: Flat and nested distributed transactions, Atomic Commitprotocols, Concurrency control in distributed transactions, Distributed deadlocks, Transactionrecovery. Replication: System model and group communication, Fault - tolerant services,highly available services, Transactions with replicated data.Unit –VDistributed Algorithms: Introduction to communication protocols, Balanced sliding windowprotocol, Routing algorithms, Destination based routing, APP problem, Deadlock free Packetswitching, Introduction to Wave & traversal algorithms, Election algorithm.CORBA Case Study: CORBA RMI, CORBA services.Books:1. Singhal & Shivaratri, "Advanced Concept in Operating Systems", McGraw Hill2. Coulouris, Dollimore, Kindberg, "Distributed System: Concepts and Design”, Pearson Ed.3. Gerald Tel, "Distributed Algorithms", Cambridge University Press
(TCS-802) MOBILE COMPUTINGUnit – IIntroduction, issues in mobile computing, overview of wireless telephony: cellular concept,GSM: air-interface, channel structure, location management: HLR-VLR, hierarchical,handoffs, channel allocation in cellular systems, CDMA, GPRS.Unit - IIWireless Networking, Wireless LAN Overview: MAC issues, IEEE 802.11, Blue Tooth,Wireless multiple access protocols, TCP over wireless, Wireless applications, databroadcasting, Mobile IP, WAP: Architecture, protocol stack, application environment,applications.Unit – IIIData management issues, data replication for mobile computers, adaptive clustering formobile wireless networks, File system, Disconnected operations.Unit - IVMobile Agents computing, security and fault tolerance, transaction processing in mobilecomputing environment.Unit – VAd Hoc networks, localization, MAC issues, Routing protocols, global state routing (GSR),Destination sequenced distance vector routing (DSDV), Dynamic source routing (DSR), AdHoc on demand distance vector routing (AODV), Temporary ordered routing algorithm(TORA), QoS in Ad Hoc Networks, applications.Books:1. J. Schiller, Mobile Communications, Addison Wesley.2. A. Mehrotra , GSM System Engineering.3. M. V. D. Heijden, M. Taylor, Understanding WAP, Artech House.4. Charles Perkins, Mobile IP, Addison Wesley.5. Charles Perkins, Ad hoc Networks, Addison Wesley.
(CS – 033) MULTIMEDIA COMMUNICATION & SYSTEM DESIGNUnit-I: IntroductionIntroduction to Multimedia, Multimedia Information, Multimedia Objects, Multimedia inbusiness and work. Convergence of Computer, Communication and Entertainment productsStages of Multimedia ProjectsMultimedia hardware, Memory & storage devices, Communication devices, Multimediasoftware's, presentation tools, tools for object generations, video, sound, image capturing,authoring tools, card and page based authoring tools.Unit-II: Multimedia Building BlocksText, Sound MIDI, Digital Audio, audio file formats, MIDI under windows environment Audio& Video Capture.Unit-III: Data CompressionHuffman Coding, Shannon Fano Algorithm, Huffman Algorithms, Adaptive Coding, ArithmeticCoding Higher Order Modelling. Finite Context Modelling, Dictionary based Compression,Sliding Window Compression, LZ77, LZW compression, Compression, Compression ratio lossless & lossy compression.
Office Of Academic Affairs-DBGI-Dehradun:: Handbook of B.Tech- CSE_VIII Sem P a g e | 3
Unit-IV: Speech Compression & SynthesisDigital Audio concepts, Sampling Variables, Loss less compression of sound, loss compression &silence compression.
Unit-V: ImagesMultiple monitors, bitmaps, Vector drawing, lossy graphic compression, image file formaticanimations Images standards, JPEG Compression, Zig Zag Coding, Multimedia Database.Contentbased retrieval for text and images,Video:Video representation, Colors, Video Compression,MPEG standards, MHEG Standard Video Streaming on net, Video Conferencing, MultimediaBroadcast Services, Indexing and retrieval of Video Database, recent development in Multimedia.Books:1. Tay Vaughan “Multimedia, Making IT Work” Osborne McGraw Hill.2. Buford “Multimedia Systems” Addison Wesley.3. Agrawal & Tiwari “Multimedia Systems” Excel.4. Mark Nelson “Data Compression Book” BPB.5. David Hillman “Multimedia technology and Applications” Galgotia Publications.6. Rosch “Multimedia Bible” Sams Publishing.7. Sleinreitz “Multimedia System” Addison Wesley.8. James E Skuman “Multimedia in Action” Vikas.
(CS – 042) DATA MINING AND WAREHOUSINGUnit-IOverview, Motivation(for Data Mining),Data Mining-Definition & Functionalities, DataProcessing, Form of Data Preprocessing, Data Cleaning: Missing Values, NoisyData,(Binning, Clustering, Regression, Computer and Human inspection),Inconsistent Data,Data Integration and Transformation. Data Reduction:-Data Cube Aggregation,Dimensionality reduction, Data Compression, Numerosity Reduction, Clustering,Discretization and Concept hierarchy generation.Unit-IIConcept Description:- Definition, Data Generalization, Analytical Characterization,Analysis of attribute relevance, Mining Class comparisions, Statistical measures in largeDatabases. Measuring Central Tendency, Measuring Dispersion of Data, Graph Displays ofBasic Statistical class Description, Mining Association Rules in Large Databases, Associationrule mining, mining Single-Dimensional Boolean Association rules from TransactionalDatabases– Apriori Algorithm, Mining Multilevel Association rules from TransactionDatabases and Mining Multi-Dimensional Association rules from Relational Databases.Unit-IIIClassification and Predictions:What is Classification & Prediction, Issues regarding Classification and prediction, Decisiontree, Bayesian Classification, Classification by Back propagation, Multilayer feed-forwardNeural Network, Back propagation Algorithm, Classification methods Knearest neighborclassifiers, Genetic Algorithm.Cluster Analysis:Data types in cluster analysis, Categories of clustering methods, Partitioning methods.Hierarchical Clustering- CURE and Chameleon, Density Based Methods-DBSCAN,OPTICS, Grid Based Methods- STING, CLIQUE, Model Based Method –StatisticalApproach, Neural Network approach, Outlier AnalysisUnit-IVData Warehousing: Overview, Definition, Delivery Process, Difference between DatabaseSystem and Data Warehouse, Multi Dimensional Data Model, Data Cubes, Stars, SnowFlakes, Fact Constellations, Concept hierarchy, Process Architecture, 3 Tier Architecture,Data Marting.Unit-VAggregation, Historical information, Query Facility, OLAP function and Tools. OLAPServers, ROLAP, MOLAP, HOLAP, Data Mining interface, Security, Backup and Recovery,Tuning Data Warehouse, Testing Data Warehouse.Books:1. M.H.Dunham,”Data Mining:Introductory and Advanced Topics” Pearson Education2. Jiawei Han, Micheline Kamber, ”Data Mining Concepts & Techniques” Elsevier3. Sam Anahory, Dennis Murray, “Data Warehousing in the Real World : A Practical Guide
Office Of Academic Affairs-DBGI-Dehradun:: Handbook of B.Tech- CSE_VIII Sem P a g e | 4
for Building Decision Support Systems, 1/e “ Pearson Education4. Mallach,”Data Warehousing System”,McGraw –Hill
LECTURE PLAN
DISTRIBUTED SYSTEMS
lecture no
topic
L1 UNIT 1 Characterization of Distributed Systems: Introduction,
L2 Examples of distributed SystemsL3 Resource sharing and the Web ChallengesL4 System Models: Architectural models, Fundamental
ModelsL5 L6 Theoretical Foundation for Distributed System:
Limitation of Distributed system, absenceof global clock, shared memory,
L7 Logical clocks, Lamport’s & vectors logical clocks, L8 Causal ordering of messages, global state, termination
detection.L9 Distributed Mutual Exclusion: Classification of
distributed mutual exclusion, L10 Requirement of mutual exclusion theoremL11 Token based and non token based algorithmsL12 Performance metric for distributed mutual exclusion
algorithmsUNIT 2
L13 Distributed Deadlock Detection: system model, resource Vs communication deadlocks
L14 deadlock prevention, avoidance, detection & resolution
L15 L16 centralized dead lock detection, distributed dead lock detection, path pushing algorithms, edge chasing algorithms.
L17 Agreement Protocols: Introduction, System models, classification of Agreement Problem
L18 Byzantine agreement problem, Consensus problem, Interactive consistency Problem
L19 Solution to Byzantine Agreement problem, Application of Agreement problem
L20 Atomic Commit in Distributed Database system.
UNIT3
L21 L22 Distributed Objects and Remote Invocation: Communication between distributed objects,
L23 L24 Remote procedure call, Events and notifications, Java RMI case study.
L25 L26 Security: Overview of security techniques, Cryptographic algorithms, Digital signatures
L27 L28 Cryptography pragmatics, Case studies: Needham Schroeder, Kerberos, SSL & Millicent.
Office Of Academic Affairs-DBGI-Dehradun:: Handbook of B.Tech- CSE_VIII Sem P a g e | 5
L29 Distributed File Systems: File service architecture,
L30 L31 Sun Network File System, The AndrewFile System, Recent advances.
UNIT 4
L32 L33 Transactions and Concurrency Control: Transactions, Nested transactions, Locks
L34 L35 Optimistic Concurrency control, Timestamp ordering, Comparison of methods for concurrency control
L36 L37 Distributed Transactions: Flat and nested distributed transactions, Atomic Commit protocols,
L38 L39 Concurrency control in distributed transactions, Distributed deadlocks
L40 Transaction recovery.
L41 Replication: System model and group communication,
L42 Fault - tolerant services,highly available services, Transactions with replicated data.UNIT 5
L43 L44 Distributed Algorithms: Introduction to communication protocols,
L45 Balanced sliding window protocol,
L46 L47 Routing algorithms, Destination based routing,
L48 L49 APP problem, Deadlock free Packet switching
L50 Introduction to Wave & traversal algorithms, Election algorithm
L51 L52 CORBA Case Study: CORBA RMI, CORBA services.
MOBILE COMPUTING
Lecture No. Topic Covered Book name Page no.
UNIT 1 L1 Introduction to mobile computing Mobile computing by Sarika Jain
2
L 2 Issues of mobile computing Mobile computing by Sarika Jain
9
L3 Overview of wireless telephony Mobile computing by Sarika Jain
16
L4 Cellular concept Mobile computing by Sarika Jain
52-53
L5 GSM air interface Mobile computing by Sarika Jain
66-67
L6 Channel Structure Notes
L7 Location management Notes
L8 HLR-VLR Notes
L9 handoffs Notes
L10 Channel allocation in cellular systems
Mobile computing by Sarika Jain
73-84
L11 CDMA Mobile computing by Sarika Jain
63-64
L12 GPRS Mobile computing by Sarika Jain
69-71
UNIT 2 L13
Wireless Networking Notes
L14 Wireless LAN overview Notes
Office Of Academic Affairs-DBGI-Dehradun:: Handbook of B.Tech- CSE_VIII Sem P a g e | 6
L15 MAC issues Notes
L16 IEEE 802.11 Mobile computing by Sarika Jain
32-39
L17 Blue tooth Mobile computing by Sarika Jain
39-47
L18 Wireless multiple access protocol Mobile computing by Sarika Jain
61-63
L19 TCP over Wireless Mobile computing by Sarika Jain
215-229
L20 Wireless application Notes
L21 Data broadcasting Mobile computing by Sarika Jain
180-186
L22 Mobile IP Mobile computing by Sarika Jain
191-214
L23 WAP: architecture, protocol stack Notes
L24 Application environment, application
Notes
UNIT 3 L25 Data management issues Mobile computing by Sarika Jain
85-90
L26 Data replication Mobile computing by Sarika Jain
92-100
L27 Adaptive clustering for mobile wireless networks
Mobile computing by Sarika Jain
108-120
L28 File system Mobile computing by Sarika Jain
101-102
L29 Disconnected operations Mobile computing by Sarika Jain
103-107
UNIT 4 L30
Mobile agents computing Mobile computing by Sarika Jain
230-239
L31 Security and Fault tolerance Mobile computing by Sarika Jain
240-258
L32 Transaction processing in mobile computing
Mobile computing by Sarika Jain
259-267
UNIT 5 L33
Adhoc networks Mobile computing by Sarika Jain
268-270
L34 Localization Mobile computing by Sarika Jain
271-272
L35 MAC issues Notes
L36 Routing protocols Mobile computing by Sarika Jain
273-276
L37 GSR Mobile computing by Sarika Jain
277-279
L38 DSDV Mobile computing by Sarika Jain
285-293
L39 DSR Mobile computing by Sarika Jain
297-298
L40 AODV Mobile computing by Sarika Jain
294-296
L41 TORA Internet
L42 QoS in Adhoc Networks, application
Internet
MULTIMEDIASYSTEMS
Office Of Academic Affairs-DBGI-Dehradun:: Handbook of B.Tech- CSE_VIII Sem P a g e | 7
Lecture No.
Topic Covered Book Name Page No.
Office Of Academic Affairs-DBGI-Dehradun:: Handbook of B.Tech- CSE_VIII Sem P a g e | 8
1 Introduction to multimedia Multimedia communication system, Tay Vaughan
1,2
2 Multimedia Information, Multimedia communication system,Tay Vaughan
2,3
3 Multimedia Objects Multimedia communication system,tay Vaughan
4
4 Multimedia in business &work Tay Vaughan 55 Convergence of computer Tay Vaughan 396 Communication &entertainment product Tay Vaughan 407 Multimedia production planning Tay Vaughan 188 Multimedia hardware, memory& storage
devices,multiomedia software’s Tay Vaughan 263
9 Presentation tools, object generation tools,video,sound capturing
Tay Vaughan 277
10 Image capturing ,authoring tools, card & page based authoring tools
Tay Vaughan 278
11 Text,sound,MIDI Tay Vaughan 48,9612 Digital audio, audio file formats Tay Vaughan 9913 MIDI under windows environment Tay Vaughan 11314 Audio & video capture Tay Vaughan 120
15 Compression, compression ratio, lossless & lossy compression
Data compression Davidsaloman Complete Reference
240
16 Huffman coding & algorithm DatacompressionDavidsalomanCompleterefrence
69,74
17 Shanon fano algorithm Data compression Davidsaloman Complete Reference
67
18 Adaptive coding Data compression Davidsaloman Complete Reference
120
19 Arithmetic coding, higher order modelling Data compression Davidsaloman Complete Reference
125
20 Finite context modelling Data compression Davidsaloman Complete Reference
436
21 Dictionary based compression Data compression Davidsaloman Complete Reference
168
22 Sliding window compression Data compression Davidsaloman Complete Reference
169
23 LZ77 compression Data compression Davidsaloman Complete Reference
170
24 LZ78 compression Data compression Davidsaloman Complete Reference
172,173
25 LZW compression Data compression Davidsaloman Complete Reference
195
26 Digital audio concepts Graphs Data compression Davidsaloman Complete Reference
695
27 Sampling variables Data compression 697
Office Of Academic Affairs-DBGI-Dehradun:: Handbook of B.Tech- CSE_VIII Sem P a g e | 9
Davidsaloman Complete Reference
28 Lossless compression of sound Data compression Davidsaloman Complete Reference
700
29 Lossless compression & silence compression
Data compression Davidsaloman Complete Reference
net
30 Multiple monitor bitmaps Tay Vaughan 13331 Vector drawing Tay Vaughan 14432 Lossy graphic compression, image file
format,animation,image standardTay Vaughan 156,161
33 JPEG Compression Data compression Davidsaloman Complete Reference
329
34 Zig Zag coding Multimedia fundamentals 14635 Multimedia database net36 Content based retrieval for text & images Tay Vaughan 8037 Video representation , coolers Tay Vaughan 19238 MPEG standards, Video streaming on net net39 Video compression, MPEG standards Data compression
Davidsaloman Complete Reference
637
40 Video conferencing net41 Multimedia broadcast services Multimedia
communication system473
42 Indexing & retrieval of video database net43 Recent development in multimedia net
DATA MINING AND WAREHOUSING
L.No.
Topic
1.2.3.4.5.6.7.8.9.10.11.
1.2.3.4.5.6.7.8.9.
Unit 1: Overview, Motivation(for Data Mining),,Data Mining-Definition & Functionalities, Data Processing, Form of Data Pre-processing, Data Cleaning: Missing Values, Noisy Data, Inconsistent Data,Data Integration and Transformation,Data Reduction:-Data Cube Aggregation.Dimensionality reduction, Data CompressionNumerosity Reduction, ClusteringDiscretization and Concept hierarchy generation
Unit 2:Concept Description:- Definition,Data Generalization, Analytical Characterization,Analysis of attribute relevance, Mining Class comparisons,Statistical measures in large Databases,Measuring Central Tendency, Measuring Dispersion of Data,Graph Displays of Basic Statistical class DescriptionMining Association Rules in Large Databases,Association rule miningmining Single-Dimensional Boolean Association rules from Transactional Databases
Office Of Academic Affairs-DBGI-Dehradun:: Handbook of B.Tech- CSE_VIII Sem P a g e | 10
10.11.
12.
1.2.3.4.5.6.7.8.9.10.11.12.13.
1.2.3.4.5.6.7.8.9.
1.2.3.4.5.6.7.8.9.
Apriori AlgorithmMining Multilevel Association rules from Transaction DatabasesMining Multi-Dimensional Association rules from Relational Databases
Unit3:What is Classification & PredictionIssues regarding Classification and predictionDecision tree, Bayesian ClassificationClassification by Back propagationMultilayer feed-forward Neural NetworkBack propagation AlgorithmClassification methods Knearest neighbour classifiersGenetic AlgorithmData types in cluster analysisCategories of clustering methods Partitioning methodsHierarchical Clustering- CURE and Chameleon Density Based Methods-DBSCAN,OPTICS, Grid Based Methods- STING, CLIQUE,Model Based Method –Statistical ApproachNeural Network approach, Outlier Analysis
Unit 4:
Data Warehousing: OverviewDefinition, Delivery ProcessDifference between Database System and Data WarehouseMulti Dimensional Data ModelData Cubes, Stars, Snow FlakesFact ConstellationsConcept hierarchy, Process Architecture,3 Tier Architecture,Data Marting.
Unit5:Aggregation Historical information, Query Facility, OLAP function and Tools, OLAP Servers ROLAP, MOLAP, HOLAP, Data Mining interface,Security, Backup and Recovery, Tuning Data Warehouse, Testing Data Warehouse,
QUESTION BANK
DISTRIBUTED SYSTEMS
UNIT-I
1. Name two advantages and disadvantages of distributed systems over centralized ones. 2. What is the difference between a multiprocessor and a multicomputer? 3. The terms loosely-coupled system and tightly-coupled system are often used to describe
distributed computer systems. What is the difference between them? 4. What are distributed systems? What are limitations of distributed system?
Office Of Academic Affairs-DBGI-Dehradun:: Handbook of B.Tech- CSE_VIII Sem P a g e | 11
5. Explain with an example, what would be the impact of absence of global clock and shared memory.
6. What are the fundamental issues in resource management in distributed system? 7. Explain the difference between data migration, computation migration and distributed
scheduling. 8. What are Lamport’s Logical Clocks? List the important conditions to be satisfied by
Lamport logical clocks. If A and B represent two distinct events in a process and if A→B, then C(A) < C(B) but vice versa is not true. Explain the reasons.
9. What do you mean by Causal Ordering of message? If process P sends two messages M1 and M2 to another process Q, what problem may arise if the two messages are not received by recipient Q in the order they were sent by process P?
10. What are Vector clocks ? What are the advantages of Vector clock over Lamport clock? 11. What do you mean by distributed mutual exclusion? A simple solution to this problem
may be obtained by having a designated site called control site which receives all requests and grants permission to execute critical section.
12. Discuss the limitations for the above approach. Discuss any protocol, which uses the time stamp to order critical section request and resolve conflict in simultaneous request for critical section execution.
13. Write short note on : Global knowledge Naming Scalability Compatibility Process synchronization Resource management Security
14. Explain virtual time and the vector clocks. 15. Differentiate global state and local state. 16. Explain characteristics of a distributed system and its examples. 17. Explain different types of fundamental models. 18. Give the difference between distributed operating system and network operating system. 19. How we measure the performance of mutual exclusion algorithm? 20. Explain the token and non token based algorithm? 21. Give an example execution of the ring-based algorithm to show that processes are not
necessarily granted entry to critical section in happened before order. .
UNIT-II
1) What is the problem of distributed deadlock detection? 2) What are the differences in Centralized, Distributed and Hierarchical control organizations for
distributed deadlock detection? 3) What are the advantages of distributed control organization over centralized control
organization for distributed deadlock detection? 4) What are phantom deadlocks? Explain the algorithm which could detect phantom deadlocks? 5) Construct a solution to reliable, totally ordered multicast in a synchronous system, using a
reliable multicast and a solution to the consensus problem. 6) What are Agreement Protocols? What are agreement and validity objectives of Byzantine
Agreement problems? 7) “An approach to concurrency control based on time-stamping is inherently superior to an
approach based on locking”. Give arguments either in favor of or against the statement. 8) Explain why time-stamping cannot lead to deadlock and why locking can 9) What are the shortcomings of Ho Ramamoorthys Two Phase algorithm for deadlock
detection? How does One Phase algorithm remove the possibility of false deadlock detection?
10) Discuss the deadlock avoidance approach. 11) Discuss the system model of the deadlock detection. 12) Differentiate between resource vs communication deadlocks. 13) Show that Byzantine agreement can not always be reached among four processor if two
processor are faulty. 14) Show how a solution to the consensus problem can be used to solve the interactive
consistency problem.
Office Of Academic Affairs-DBGI-Dehradun:: Handbook of B.Tech- CSE_VIII Sem P a g e | 12
15) Discuss the following distributed deadlock detection algorithms a) Path pushing algorithm b) Edge chasing algorithm
16) Discuss the applications of agreement algo.
UNIT-III
1. Caching is one of the techniques used to improve access to naming data. What are the benefits of caching, and what assumptions must hold for it to be useful? Comment on the likelihood of these assumptions being true in any system you care to choose.
2. Explain why a measure of reliability based on a simple percentage of the time that a node is up may be inadequate in general.
3. Briefly define the terms secret key cryptography and public key cryptography, explaining the important characteristics of each.
4. Explain distributed file system and mechanism of building distributed file system. 5. Discuss distributed shared memory concept and algorithm for implementing distributed
shared memory. 6. Write short notes on :
6.1. Memory coherence 6.2. Name resolution 6.3. Bulk data transfer 6.4. Hints 6.5. Caching
7. Differentiate weak consistency with release consistency.
8. Explain coherence protocol. 9. What do you mean by distributed scheduling? 10. What do you mean by distributed objects? Explain the concept of remote method invocation with a suitable example. 11. How are the parameters and results passed to a remote procedure? Explain with a suitable example. 12. What are cryptographic systems? Give a general model of a cryptographic system listing its objectives. 13. What are Public and Private keys? List the key differences and issues in public key cryptography and private key cryptography. 14. What are the goals of distributed file system? 15. What are the different mechanisms for building distributed file systems? 16. Explain the salient features of Mounting and Caching process. 17. What do you mean by the distributed object model? Write short note on RMI. 18. What do you mean by Digital Signature? Explain the different methods for generating and verifying signatures. 19. What is the difference between a file service using the upload/download model and one using the remote access model? 20. What is the difference between tree structured directory system from a general graph structured system? UNIT-IV 1. Describe how a non-recoverable situation could arise if write locks are released after the last operation of a transaction but before its commitment. 2. What are the advantages and drawbacks of multiversion timestamp ordering in comparision with the ordering timestamp ordering. 3. Explain the difference between linearizability and sequential consistency, and why the latter is more practical to implement, in general? 4. What are Distributed Databases? 5. What are the advantages of data distribution and data replication? 6. Explain the difference between Horizontal and Vertical Fragmentations. If data
Office Of Academic Affairs-DBGI-Dehradun:: Handbook of B.Tech- CSE_VIII Sem P a g e | 13
object replicas are stored at multiple number of sites, explain how the lock will be acquired by a transaction on the data object. 7. What are locks? What are the essential differences in the Lock-based protocols and Time Stamp-based protocols? 8. What are commit protocols? Explain how Two-phase commit protocol responds to failure of participating site and failure of coordinator. 9. Explain remote procedure calls and the basic use of remote procedure calls. 10. Explain remote method invocation. 11. Explain about various types of security techniques. 12. Differentiate between sun network file system and Andrew file system. UNIT-V 1. What are the differences in centralized and distributed algorithms? How is the performance of a distributed algorithm evaluated? 2. Explain the term, message complexity in reference to distributed algorithm. 3. What is routing? Discuss the correctness, complexity, efficiency and robustness criteria of a good routing algorithm. 4. What is destination-based routing? 5. What are Wave and Traversal algorithms? 6. Explain the termination, decision and dependence requirements of a wave algorithm. 7.What types of failure can there be in a simple bidirectional client-server interaction and what action is appropriate for each form of failure? 8. Explain balanced sliding window protocol. 9. What is election algo? Suppose that two processes detect the demise of the coordinator simultaneously and both decide to hold an election using the bully algo. What happens? 10. Write short notes on :
ARP problem Deadlock free packet switching
11. Differentiate the bully election algo and ring election algo 12. Write short note on CORBA services.
MOBILE COMPUTING
UNIT 11. What is mobile computing? What are novel applications?2. Describe in detail the various challenges of of mobile computing?3. What do you mean by wireless telephony?4. Explain GSM with its architecture and components?5. Explain GPRS and how it has upgraded GSM?6. Explain both physical and logical channel structure?
UNIT 27. What is Blue tooth ?Why it is called blue tooth ?What are the future directions of blue
tooth standard?8. How secure is Bluetooth network?9. Define Frequency Hoping Spread Spectrum?10. Will other RF devices interfere with blue tooth devices?11. Will Bluetooth andother WLAN devices interfere with each other?12. What is the data throughput speed of Bluetooth connection?And what is its range?13. Differentiate between Blue tooth and 802.11.14. Describe various components of 802.11 wireless LAN architecture?15. Explain IEEE 802.11 protocol stack?16. Write short notes on MAC Layer and PHY Layer with respect to blue tooth technology?17. Explain cellular concept?18. Define frequency reuse nad its advantages?19. What are the major problems in AMPS system? How they overcome in GSM system.20. How cellular system wiorks?21. How MAC is classified ? Describe with the architecture?22. What are Polling techniques in TDMA and what are its advantages and disadvantages?23. Discuss ALOHA scheme with proper diagram?24. What is CDMA including advantages , disadvantages another features?25. How is asynchronous CDMA is better than other technologies?
Office Of Academic Affairs-DBGI-Dehradun:: Handbook of B.Tech- CSE_VIII Sem P a g e | 14
26. What is CSMA and ISMA?27. What Is channel allocation and what is the effect of CIR on it?28. How channel allocation algorithms can be classified?29. Discuss FCA?30. Discuss DCA?31. Discuss HCA?32. What is mutual exclusion and how it is different from channel allocation?33. Decsribe wireless TCP mechanisms?34. Whatkind of problems may arise if TCP is implemented over wireless network ? explain.35. Discuss various design approaches for implementing TCP over wireless?36. Explain in detail aboput Snooping TCP?37. What is indirect TCP?38. What is RED and where it is implemented and in what condition?39. Is link level re transmissions successful ? Give reason for your answer?40. What is mobile TCP? Explain its multiple acknowledgements?41. Discriminate congestion losses and wireless losses?
Unit 342: Describe the different data management issues related to mobile computing?43: what is the impact of mobile computing in area of data management?44: How many types of data replication in mobile computing? discuss with suitable example?
45: what is the general goal of file system? Explain the CODA file system?
46:How clustering is done in wireless transmission? Give any suitable example?
47:Show the status of the client in CODA file system and also explain the mobile client and server system in brief?
48: Discuss the concept of data replication. What place it serves in mobile computing environment?
49:What is the basic concept behind adaptive clustering for mobile wireless networks. discuss with suitable example?
50:How does conventional file system react to disconnected system? Explain in brief by giving suitable example?
51: Discuss the following in terms of CODA file system:(a) venus states.(b) hoarding.(c) Emulation.(d) Reintegration
52:Describe the various processes involved in file transfer in buffer client and server system?
53: How rover toolkit is useful in mobile computing? explain in brief ? UNIT 454: What do you understand by mobile agent? Describe the model for mobile agent based computing?
55: What are the alternating to mobile agents for client server interaction? List relating advantages to mobile agents over these alternatives?
56: Discuss the possible ways for promoting security to mobile agent?
57: Describe fault tolerance in mobile computing?
58:Draw mobile agent model? Also define advantages and disadvantages of mobile agent?
59: Why we are using mobile agent? Discuss in detail?
Office Of Academic Affairs-DBGI-Dehradun:: Handbook of B.Tech- CSE_VIII Sem P a g e | 15
60: Explain the different security aspects during data transfer in mobile communication and also give any suitable example of authentication and privacy proceeding for mobile phone system with suitable diagram?
UNIT 561: Name the main differences between Adhoc networks and other network. What advantages do Adhoc network offer? Explain in detail by giving suitable example.
62: Why is routing in Ad-hoc networks complicated. What are the special challenges? Give some examples of real life scenarios of Ad-hoc networks.
63: Explain the energy indexing for wireless broadcast data in detail with suitable example. And also describe the pointer forwarding strategies in brief?
64: Explain any two of the following of receipt forwarding process:(a) Tunneling.(b) Encapsulation.(c) Registration.
65: What are the basic routing principles in case of IP routing? Also describe routing process at IP layer with suitable diagram ad proper examples.
66: Describe the route discovery and route maintenance mechanisms of Ad hoc On Demand Distance Vector(AODV) routing algorithm in adhoc wireless networks.
67: Describe the following algorithm:(a) Destination Sequential Distance Vector Routing.(b) Dynamic state Routing.(c) Distance Vector Routing.
68: Differentiate between global state routing and dynamic state routing?
69: What do you mean by routing protocols? Explain the Fisheye state routing?
70: Explain the destination sequenced distance vector routing with suitable example and also differentiate it with Adhoc –on-demand?
71: Describe the location management algorithm with distributed location servers and explain how it handles communication between the two mobile hosts under mobile switching centers in two different regions?
72: Describe (I,M) algorithm for energy efficient indexing on air.
73: Describe QoS routing scheme in Ad hoc Networks? Why it is used?
Multimedia Communication & System DesignUNIT 1
Q1.Define Multimedia? What are its various application areas? Q2. Describe how can multimedia be useful in business domain?
Q3.What is the multimedia objects in a multimedia presentation? Q4.What is the hardware and software requirements for multimedi computer?
Q5.What are the different stages of Multimedia Project? Q6.What are the various communication devices used in multimedia? Q7.Write down the differences b/w asynchronous, synchronous, isochronous transmission mode. Q8.Explain the types of multimedia in detail? Q9.Explain the characteristics for continuous media streams in MM system? Q10.Write down the differences b/w asynchronous, synchronous, isochronous transmission mode?
Office Of Academic Affairs-DBGI-Dehradun:: Handbook of B.Tech- CSE_VIII Sem P a g e | 16
Q11.What is various peripherals used in multimedia? Describe any three. Q12.What is various elements of multimedia? Explain in detail. Q13.Explainthe working environment of multimedia in detail? Q14.What did you mean by multimedia framework? Explain in detail. Q15.Write short notes on: JPEG, MPEG, MHEG, multimedia on networks Q16.What did you mean by multimedia project planning? Explain in detail. Q17.describe any two communication devices used in multimedia
UNIT2
Q1. What are the various types of multimedia authoring tools? Explain each in brief?Q2. Define the ISDN modems?Q3.What is the tools used for image capturing and editing?Q4.Q10 discusses the input and output devices used for preparing and distributing multimedia projects?Q5.What do you understand by video making? Also explain the effect of sound video and graphics on the viewer?Q6. What is the significance of studying texts and fonts on information exchange?Q7. What do you understand by bitmaps and vector drawings?Q8. Explain the following terms with respect to sound
(a)Amplitude(b)Time period(c)PitchQ9. What do you understand by MIDI? How MIDI is different from Digital audio?Q10. What are the various audio file formats available for computers?
Q11. Define MIDI under windows Environment?Q12. Write the advantages and disadvantages of MIDI over Digital Audio?Q13. Differentiate between San serifs and Serifs?Q14.Differentiate between Hypertext and Hypermedia?Q15.What is the advantage of MIDI over digital audio?Q16.What is multiple monitors?Q17.What is color depth?Q16.Note the differences b/w speech synthesis and speech recognition?Q17.explain CD & its architecture? Differentiate between CD & DVD.
Q18.what is MPEH? Describe different standards of MPEG? Q19.what is image file formats? Explain in detail.
UNIT 3
Q1 How the sound files are created with windows?Q2.What is the significance of data compression in communication technology?Q3. What do you understand by Entropy of Information?Q4. What are the advantages of Adaptive Huffman coding over Huffman method?Q5. Explain the Shannon Fano and Huffman algorithm and also determine the Huffman and Shannon Fano code for the following variables whose frequency given below:
A B C D E F G20 30 50 35 70 10 05
Q6.What is LZ77 compression? Explain with a suitable example.Q7. Explain Dictionary based compression?Q8. What is the difference between LZ77 and LZW Compression?Q9. Explain Finite Context Modeling?Q10. What is the difference between static and dynamic coding?Q11. Differentiate the Loss-less and Lossy data compression and explain the basic principle of each?Q12.What is Silence Compression? How it is achieved?Q13.Explain the steps of Lossy sequential DCT based coding modes? Q14.what is LZ78 compression? Explain with example.Q15. What is LZW compression? Explain with example.
Office Of Academic Affairs-DBGI-Dehradun:: Handbook of B.Tech- CSE_VIII Sem P a g e | 17
Q16.explain:a)adaptive coding b)arithmetic codingQ17.what is statistical & dictionary based modeling?explain.Q18.differentiate between statistical& dictionary based modeling with example.
UNIT 4Q1. What are the techniques of speech synthesis?Q2. Explain lossless compression of sound?Q3. What is the role of multiple monitors in image processing?Q4. What are the various Image file formats?Q5.Explain the JPEG Compression with suitable example?Q6. What is the difference between Compression methods and Model?Q7. What is a Zig Zag coding?Q8. Explain the multimedia database?Q9. Elucidate the various MPEG standards?Q10. What do you understand by speech compression and speech synthesis?Q11. What is computer animation?
Q12. Distinguish between Lossless and Lossy compression of sound?Q13. Write the differences between DVD and CD?Q14. What do you understand by minimum redundancy compression?
Methods?Q15. Define the term anti aliasing?Q16. What are the various recent developments in multimedia?Q17.What is bitmap images?Q18.What is vector images?
UNIT 5
Q1.What is color depth?Q2.What is 24 RGB color information?Q3.Define resolution?Q4.What is arithmetic coding. Explain with example?Q5.Define sampling & sampling variables?Q6.Define quantization?Q7.What is interlined twittering?Q8.What do you mean by interlacing of video?Q9.What is progressive scan?Q10Differentiate between progressive scan and interlacing?Q11.What is software testing?Q12.Explain types of testing?Q13.what do you mean by recent development in multimedia? Explain in detail.
Office Of Academic Affairs-DBGI-Dehradun:: Handbook of B.Tech- CSE_VIII Sem P a g e | 18