You are on page 1of 18

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 Page | 1

resource Vs communication deadlocks. Token based and non token based algorithms. Locks. Events and notifications. Nested transactions. Cryptographic algorithms. Case studies: Needham Schroeder. 100 100 200 300 3 GP-801 General Proficiency . shared memory. Atomic Commit in Distributed Database system. termination detection. System models. Unit–III Distributed Objects and Remote Invocation: Communication between distributed objects. Application of Agreement problem. Distributed File Systems: File service architecture. absence of global clock. System Models: Architectural models. global state. Digital signatures Cryptography pragmatics. SEMESTER – VIII S. Sun Network File System. Security: Overview of security techniques. deadlock prevention. Unit–II Distributed Deadlock Detection: system model. distributed dead lock detection. requirement of mutual exclusion theorem. B. classification of Agreement Problem. Office Of Academic Affairs-DBGI-Dehradun:: Handbook of B. Kerberos. SSL & Millicent.COMPUTER SCIENCE & ENGINEERING YEAR FOURTH. avoidance. Solution to Byzantine Agreement problem. performance metric for distributed mutual exclusion algorithms. Lamport’s & vectors logical clocks. Logical clocks.Tech- CSE_VIII Sem Page | 2 .. Interactive consistency Problem. 50 50 . . TECH.No Course Subject PERIOD EVALUATION Subject Code S SCHEME Total SESSIONAL EXA EXAM M ESE L T P CT TA TOTAL 1 TCS-801 DISTRIBUTED 3 1 0 30 20 50 100 150 SYSTEMS 2 TCS 802 Mobile Computing 3 1 0 30 20 50 100 150 3 CS – 033 Multimedia 3 1 0 30 20 50 100 150 Communication & System Design 4 CS – 042 Data Mining 3 1 0 30 20 50 100 150 & Date Warehousing Practical/Training/Project 1 PCS-851 Distributed 0 0 2 . Agreement Protocols: Introduction. Java RMI case study. . Consensus problem. 25 25 25 50 Systems Lab 2 PCS-852 Project 0 0 2 . Byzantine agreement problem. edge chasing algorithms. Distributed Mutual Exclusion: Classification of distributed mutual exclusion. Causal ordering of messages. detection & resolution. Remote procedure call. path pushing algorithms. Fundamental Models Theoretical Foundation for Distributed System: Limitation of Distributed system. 50 Total 12 4 4 1000 (TCS-801) DISTRIBUTED SYSTEMS Unit–I Characterization of Distributed Systems: Introduction. Examples of distributed Systems. Resource sharing and the Web Challenges. Unit–IV Transactions and Concurrency Control: Transactions. centralized dead lock detection. Recent advances. The Andrew File System.

channel allocation in cellular systems. application environment. Election algorithm. Dollimore. Wireless applications. MAC issues. Singhal & Shivaratri. Deadlock free Packet switching. Dynamic source routing (DSR). Artech House. WAP: Architecture. Gerald Tel. GPRS. adaptive clustering for mobile wireless networks. Addison Wesley. transaction processing in mobile computing environment. highly available services. Routing protocols. Unit – V Ad Hoc networks. Unit . protocol stack. Pearson Ed. V. A. (CS – 033) MULTIMEDIA COMMUNICATION & SYSTEM DESIGN Unit-I: Introduction Introduction to Multimedia. "Distributed System: Concepts and Design”. Introduction to Wave & traversal algorithms. TCP over wireless. presentation tools. Communication devices. Addison Wesley. Comparison of methods for concurrency control. CDMA. Mobile IP. IEEE 802. GSM System Engineering. Taylor. Distributed deadlocks. Mobile Communications. Charles Perkins. Dictionary based Compression. Transaction recovery. Kindberg. Unit-III: Data Compression Huffman Coding. image capturing. M. Temporary ordered routing algorithm (TORA). Wireless LAN Overview: MAC issues. Routing algorithms. Cambridge University Press (TCS-802) MOBILE COMPUTING Unit – I Introduction. Transactions with replicated data. Adaptive Coding. 3. Mobile IP. Books: 1. Destination sequenced distance vector routing (DSDV). Finite Context Modelling. Schiller. Balanced sliding window protocol. Multimedia Objects. Coulouris.II Wireless Networking. Blue Tooth. Wireless multiple access protocols. audio file formats. global state routing (GSR). Unit-IV: Speech Compression & Synthesis Office Of Academic Affairs-DBGI-Dehradun:: Handbook of B. tools for object generations. Atomic Commit protocols. Concurrency control in distributed transactions. data broadcasting.tolerant services. security and fault tolerance. APP problem. Shannon Fano Algorithm. CORBA Case Study: CORBA RMI. Destination based routing.IV Mobile Agents computing. 2. Unit – III Data management issues. applications. "Distributed Algorithms".Optimistic Concurrency control. Communication and Entertainment products Stages of Multimedia Projects Multimedia hardware. 3. Addison Wesley. CORBA services. Multimedia software's. GSM: air-interface. Sliding Window Compression. Unit-II: Multimedia Building Blocks Text. Unit . File system. Fault .Tech- CSE_VIII Sem Page | 3 . Multimedia Information. Convergence of Computer. issues in mobile computing. McGraw Hill 2. Charles Perkins.11. Huffman Algorithms. Disconnected operations. QoS in Ad Hoc Networks. Books: 1. Unit –V Distributed Algorithms: Introduction to communication protocols. Compression ratio loss less & lossy compression. channel structure. hierarchical. Timestamp ordering. Ad Hoc on demand distance vector routing (AODV). card and page based authoring tools. Ad hoc Networks. "Advanced Concept in Operating Systems". MIDI under windows environment Audio & Video Capture. Arithmetic Coding Higher Order Modelling. Mehrotra . authoring tools. Understanding WAP. M. 5. D. Multimedia in business and work. LZW compression. 4. J. localization. handoffs. sound. location management: HLR-VLR. Compression. overview of wireless telephony: cellular concept. data replication for mobile computers. video. Memory & storage devices. Distributed Transactions: Flat and nested distributed transactions. LZ77. applications. Digital Audio. Replication: System model and group communication. Heijden. Sound MIDI.

Mining Class comparisions.Dunham. Data Marting. Backup and Recovery. JPEG Compression. Model Based Method –Statistical Approach. 7. Hierarchical Clustering. Dimensionality reduction. Books: 1. Sleinreitz “Multimedia System” Addison Wesley. Regression. 2. Data Compression. Multilayer feed-forward Neural Network. 4. Issues regarding Classification and prediction. Unit-V: Images Multiple monitors. ROLAP. Measuring Dispersion of Data. Vector drawing. 6.”Data Mining:Introductory and Advanced Topics” Pearson Education 2. Data Mining interface. Making IT Work” Osborne McGraw Hill. Cluster Analysis: Data types in cluster analysis. Noisy Data. Form of Data Preprocessing. Sam Anahory. Micheline Kamber. lossy graphic compression. Unit-II Concept Description:. Security. Analysis of attribute relevance.CURE and Chameleon. Graph Displays of Basic Statistical class Description. Delivery Process. Zig Zag Coding.H. Fact Constellations. Outlier Analysis Unit-IV Data Warehousing: Overview.Definition.Tech- CSE_VIII Sem Page | 4 . Classification methods Knearest neighbor classifiers. Density Based Methods-DBSCAN. Indexing and retrieval of Video Database. Sampling Variables. Statistical measures in large Databases. bitmaps. Motivation(for Data Mining). Analytical Characterization. Stars. Clustering. Back propagation Algorithm. Decision tree. OLAP function and Tools. ”Data Mining Concepts & Techniques” Elsevier 3. Concept hierarchy. Dennis Murray. Data Generalization. Multimedia Broadcast Services. Mark Nelson “Data Compression Book” BPB. HOLAP. Mining Association Rules in Large Databases. Colors. Neural Network approach.Inconsistent Data. Data Integration and Transformation. James E Skuman “Multimedia in Action” Vikas. 5. 1/e “ Pearson Education Office Of Academic Affairs-DBGI-Dehradun:: Handbook of B. M. Measuring Central Tendency. 8. loss compression & silence compression. Categories of clustering methods. Buford “Multimedia Systems” Addison Wesley. Multi Dimensional Data Model. Snow Flakes. CLIQUE. Partitioning methods. Clustering. Multimedia Database. Rosch “Multimedia Bible” Sams Publishing. MPEG standards. OPTICS. Historical information. Data Cleaning: Missing Values. 3 Tier Architecture. mining Single-Dimensional Boolean Association rules from Transactional Databases– Apriori Algorithm. Tay Vaughan “Multimedia. Tuning Data Warehouse.Video:Video representation.Data Mining-Definition & Functionalities. Genetic Algorithm. Numerosity Reduction. Query Facility. Testing Data Warehouse. Unit-III Classification and Predictions: What is Classification & Prediction. MOLAP. Mining Multilevel Association rules from Transaction Databases and Mining Multi-Dimensional Association rules from Relational Databases. Association rule mining. Video Conferencing. Jiawei Han. image file formatic animations Images standards. Bayesian Classification. Computer and Human inspection). Discretization and Concept hierarchy generation. Definition. Data Reduction:-Data Cube Aggregation. Classification by Back propagation. David Hillman “Multimedia technology and Applications” Galgotia Publications. Video Compression. Agrawal & Tiwari “Multimedia Systems” Excel. “Data Warehousing in the Real World : A Practical Guide for Building Decision Support Systems. Loss less compression of sound.STING. Unit-V Aggregation. Process Architecture. recent development in Multimedia. Difference between Database System and Data Warehouse.(Binning. OLAP Servers. Grid Based Methods.Content based retrieval for text and images. Data Processing. MHEG Standard Video Streaming on net. Books: 1. (CS – 042) DATA MINING AND WAREHOUSING Unit-I Overview.Digital Audio concepts. 3. Data Cubes.

Case studies: Needham Schroeder. Interactive consistency Problem L19 Solution to Byzantine Agreement problem.McGraw –Hill LECTURE PLAN DISTRIBUTED SYSTEMS lecture topic no L1 UNIT 1 Characterization of Distributed Systems: Introduction. resource Vs communication deadlocks L14 deadlock prevention. termination detection. L2 Examples of distributed Systems L3 Resource sharing and the Web Challenges L4 System Models: Architectural models. L10 Requirement of mutual exclusion theorem L11 Token based and non token based algorithms L12 Performance metric for distributed mutual exclusion algorithms UNIT 2 L13 Distributed Deadlock Detection: system model. L25 L26 Security: Overview of security techniques. UNIT3 L21 L22 Distributed Objects and Remote Invocation: Communication between distributed objects. path pushing algorithms. Application of Agreement problem L20 Atomic Commit in Distributed Database system. detection & resolution L15 L16 centralized dead lock detection. Lamport’s & vectors logical clocks. L7 Logical clocks. Digital signatures L27 L28 Cryptography pragmatics. Consensus problem. shared memory. classification of Agreement Problem L18 Byzantine agreement problem.”Data Warehousing System”. L23 L24 Remote procedure call. distributed dead lock detection. edge chasing algorithms. SSL & Millicent. Office Of Academic Affairs-DBGI-Dehradun:: Handbook of B. Mallach.4. Kerberos. avoidance. Fundamental Models L5 L6 Theoretical Foundation for Distributed System: Limitation of Distributed system. Events and notifications. L17 Agreement Protocols: Introduction. L8 Causal ordering of messages. Java RMI case study. absence of global clock. L9 Distributed Mutual Exclusion: Classification of distributed mutual exclusion. Cryptographic algorithms. System models.Tech- CSE_VIII Sem Page | 5 . global state.

L42 Fault . L30 L31 Sun Network File System. Transactions with replicated data. UNIT 5 L43 L44 Distributed Algorithms: Introduction to communication protocols. Topic Covered Book name Page no. UNIT 4 L32 L33 Transactions and Concurrency Control: Transactions.tolerant services. L38 L39 Concurrency control in distributed transactions. Timestamp ordering. Atomic Commit protocols. Recent advances. L48 L49 APP problem. Locks L34 L35 Optimistic Concurrency control. UNIT 1 L1 Introduction to mobile computing Mobile computing by 2 Sarika Jain L2 Issues of mobile computing Mobile computing by 9 Sarika Jain L3 Overview of wireless telephony Mobile computing by 16 Sarika Jain L4 Cellular concept Mobile computing by 52-53 Sarika Jain L5 GSM air interface Mobile computing by 66-67 Sarika Jain L6 Channel Structure Notes L7 Location management Notes L8 HLR-VLR Notes L9 handoffs Notes L10 Channel allocation in cellular Mobile computing by 73-84 systems Sarika Jain L11 CDMA Mobile computing by 63-64 Sarika Jain L12 GPRS Mobile computing by 69-71 Sarika Jain UNIT 2 Wireless Networking Notes L13 L14 Wireless LAN overview Notes Office Of Academic Affairs-DBGI-Dehradun:: Handbook of B. L45 Balanced sliding window protocol. Election algorithm L51 L52 CORBA Case Study: CORBA RMI. L29 Distributed File Systems: File service architecture. L41 Replication: System model and group communication. L46 L47 Routing algorithms. MOBILE COMPUTING Lecture No.highly available services. Comparison of methods for concurrency control L36 L37 Distributed Transactions: Flat and nested distributed transactions. Destination based routing. The Andrew File System. CORBA services.Tech- CSE_VIII Sem Page | 6 . Distributed deadlocks L40 Transaction recovery. Nested transactions. Deadlock free Packet switching L50 Introduction to Wave & traversal algorithms.

11 Mobile computing by 32-39 Sarika Jain L17 Blue tooth Mobile computing by 39-47 Sarika Jain L18 Wireless multiple access protocol Mobile computing by 61-63 Sarika Jain L19 TCP over Wireless Mobile computing by 215-229 Sarika Jain L20 Wireless application Notes L21 Data broadcasting Mobile computing by 180-186 Sarika Jain L22 Mobile IP Mobile computing by 191-214 Sarika Jain L23 WAP: architecture.Tech- CSE_VIII Sem Page | 7 . protocol stack Notes L24 Application environment. L15 MAC issues Notes L16 IEEE 802. Notes application UNIT 3 L25 Data management issues Mobile computing by 85-90 Sarika Jain L26 Data replication Mobile computing by 92-100 Sarika Jain L27 Adaptive clustering for mobile Mobile computing by 108-120 wireless networks Sarika Jain L28 File system Mobile computing by 101-102 Sarika Jain L29 Disconnected operations Mobile computing by 103-107 Sarika Jain UNIT 4 Mobile agents computing Mobile computing by 230-239 L30 Sarika Jain L31 Security and Fault tolerance Mobile computing by 240-258 Sarika Jain L32 Transaction processing in mobile Mobile computing by 259-267 computing Sarika Jain UNIT 5 Adhoc networks Mobile computing by 268-270 L33 Sarika Jain L34 Localization Mobile computing by 271-272 Sarika Jain L35 MAC issues Notes L36 Routing protocols Mobile computing by 273-276 Sarika Jain L37 GSR Mobile computing by 277-279 Sarika Jain L38 DSDV Mobile computing by 285-293 Sarika Jain L39 DSR Mobile computing by 297-298 Sarika Jain L40 AODV Mobile computing by 294-296 Sarika Jain L41 TORA Internet L42 QoS in Adhoc Networks. Internet application MULTIMEDIASYSTEMS Office Of Academic Affairs-DBGI-Dehradun:: Handbook of B.

Office Of Academic Affairs-DBGI-Dehradun:: Handbook of B.Tech- CSE_VIII Sem Page | 8 .Lecture Topic Covered Book Name Page No. No.

multiomedia software’s 9 Presentation tools.1 Introduction to multimedia Multimedia 1.Tech- CSE_VIII Sem Page | 9 .sound capturing 10 Image capturing .sound. memory& storage Tay Vaughan 263 devices.74 lomanCompleterefrence 17 Shanon fano algorithm Data compression 67 Davidsaloman Complete Reference 18 Adaptive coding Data compression 120 Davidsaloman Complete Reference 19 Arithmetic coding. Multimedia 2.2 communication system. higher order modelling Data compression 125 Davidsaloman Complete Reference 20 Finite context modelling Data compression 436 Davidsaloman Complete Reference 21 Dictionary based compression Data compression 168 Davidsaloman Complete Reference 22 Sliding window compression Data compression 169 Davidsaloman Complete Reference 23 LZ77 compression Data compression 170 Davidsaloman Complete Reference 24 LZ78 compression Data compression 172.video.173 Davidsaloman Complete Reference 25 LZW compression Data compression 195 Davidsaloman Complete Reference 26 Digital audio concepts Graphs Data compression 695 Davidsaloman Complete Reference 27 Sampling variables Data compression 697 Office Of Academic Affairs-DBGI-Dehradun:: Handbook of B. card & Tay Vaughan 278 page based authoring tools 11 Text. compression ratio.96 12 Digital audio. audio file formats Tay Vaughan 99 13 MIDI under windows environment Tay Vaughan 113 14 Audio & video capture Tay Vaughan 120 15 Compression.3 communication system. lossless Data compression 240 & lossy compression Davidsaloman Complete Reference 16 Huffman coding & algorithm DatacompressionDavidsa 69.tay Vaughan 4 Multimedia in business &work Tay Vaughan 5 5 Convergence of computer Tay Vaughan 39 6 Communication &entertainment product Tay Vaughan 40 7 Multimedia production planning Tay Vaughan 18 8 Multimedia hardware. Tay Vaughan 2 Multimedia Information. object generation Tay Vaughan 277 tools.Tay Vaughan 3 Multimedia Objects Multimedia 4 communication system.authoring tools.MIDI Tay Vaughan 48.

Graph Displays of Basic Statistical class Description 7. 6. Form of Data Pre-processing.image standard 33 JPEG Compression Data compression 329 Davidsaloman Complete Reference 34 Zig Zag coding Multimedia fundamentals 146 35 Multimedia database net 36 Content based retrieval for text & images Tay Vaughan 80 37 Video representation . 3. Dimensionality reduction. Data Cleaning: Missing Values. 2. Overview.. 5. Data Mining-Definition & Functionalities. Data Reduction:-Data Cube Aggregation. Statistical measures in large Databases. Mining Association Rules in Large Databases.161 format. 6.animation. Inconsistent Data. Analytical Characterization.Tech- CSE_VIII Sem P a g e | 10 . Measuring Dispersion of Data. mining Single-Dimensional Boolean Association rules from Transactional Databases Office Of Academic Affairs-DBGI-Dehradun:: Handbook of B. MPEG standards Data compression 637 Davidsaloman Complete Reference 40 Video conferencing net 41 Multimedia broadcast services Multimedia 473 communication system 42 Indexing & retrieval of video database net 43 Recent development in multimedia net DATA MINING AND WAREHOUSING L. Discretization and Concept hierarchy generation Unit 2: 1. Analysis of attribute relevance. 5. 4. Data Generalization.No Topic . 7. Noisy Data. 8. Mining Class comparisons. Numerosity Reduction. Motivation(for Data Mining).Definition. Data Processing. Measuring Central Tendency. Data Compression 10. 9. coolers Tay Vaughan 192 38 MPEG standards. 2. 3. Unit 1: 1. Data Integration and Transformation. 4. Clustering 11. Association rule mining 9. Davidsaloman Complete Reference 28 Lossless compression of sound Data compression 700 Davidsaloman Complete Reference 29 Lossless compression & silence Data compression net compression Davidsaloman Complete Reference 30 Multiple monitor bitmaps Tay Vaughan 133 31 Vector drawing Tay Vaughan 144 32 Lossy graphic compression. Video streaming on net net 39 Video compression. Concept Description:. image file Tay Vaughan 156. 8.

Issues regarding Classification and prediction 2. What is the difference between them? 4. Process Architecture. Data Warehousing: Overview 3. 13. The terms loosely-coupled system and tightly-coupled system are often used to describe distributed computer systems. What are distributed systems? What are limitations of distributed system? Office Of Academic Affairs-DBGI-Dehradun:: Handbook of B. Data types in cluster analysis 9. Name two advantages and disadvantages of distributed systems over centralized ones. Multi Dimensional Data Model 6. 2. Genetic Algorithm 8. Delivery Process 4. Multilayer feed-forward Neural Network 5. Unit5: 2. Mining Multilevel Association rules from Transaction Databases Mining Multi-Dimensional Association rules from Relational 12. QUESTION BANK DISTRIBUTED SYSTEMS UNIT-I 1. OLAP function and Tools. 4. Categories of clustering methods 10. 7. Data Mining interface. Bayesian Classification 3. 9. ROLAP. Concept hierarchy.10.OPTICS. Apriori Algorithm 11. MOLAP. Back propagation Algorithm 6. Outlier Analysis 1. Density Based Methods-DBSCAN. OLAP Servers 6. Hierarchical Clustering. Backup and Recovery.Tech- CSE_VIII Sem P a g e | 11 . Model Based Method –Statistical Approach Neural Network approach. 5. Databases Unit3: What is Classification & Prediction 1. Testing Data Warehouse.STING. Data Marting. Fact Constellations 8. 9. 3 Tier Architecture. Data Cubes. Definition. Difference between Database System and Data Warehouse 5. Classification methods Knearest neighbour classifiers 7. Classification by Back propagation 4. Query Facility. Stars. 1. 8. Partitioning methods 11. Unit 4: 2. What is the difference between a multiprocessor and a multicomputer? 3.CURE and Chameleon 12. HOLAP. CLIQUE. Aggregation 3. Grid Based Methods. Decision tree. Historical information. Tuning Data Warehouse. Security. Snow Flakes 7.

17. Explain characteristics of a distributed system and its examples. 13. Differentiate global state and local state. 9. Office Of Academic Affairs-DBGI-Dehradun:: Handbook of B. 8. 11) Discuss the system model of the deadlock detection. 5. Explain the reasons. What do you mean by Causal Ordering of message? If process P sends two messages M1 and M2 to another process Q. 6. Explain different types of fundamental models. 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. 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”. Explain the difference between data migration. Write short note on : • Global knowledge • Naming • Scalability • Compatibility • Process synchronization • Resource management • Security 14. Explain virtual time and the vector clocks. 13) Show that Byzantine agreement can not always be reached among four processor if two processor are faulty. What are Vector clocks ? What are the advantages of Vector clock over Lamport clock? 11. Give arguments either in favor of or against the statement. Give the difference between distributed operating system and network operating system. 19. then C(A) < C(B) but vice versa is not true. totally ordered multicast in a synchronous system. Discuss any protocol.Tech- CSE_VIII Sem P a g e | 12 . What are the fundamental issues in resource management in distributed system? 7. How we measure the performance of mutual exclusion algorithm? 20. 18. 12. what problem may arise if the two messages are not received by recipient Q in the order they were sent by process P? 10. using a reliable multicast and a solution to the consensus problem. computation migration and distributed scheduling. What are Lamport’s Logical Clocks? List the important conditions to be satisfied by Lamport logical clocks. UNIT-II 1) What is the problem of distributed deadlock detection? 2) What are the differences in Centralized. Discuss the limitations for the above approach. 12) Differentiate between resource vs communication deadlocks. 15. 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. 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. If A and B represent two distinct events in a process and if A→B. Explain with an example. . 16. 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. Explain the token and non token based algorithm? 21. what would be the impact of absence of global clock and shared memory. which uses the time stamp to order critical section request and resolve conflict in simultaneous request for critical section execution.

and why the latter is more practical to implement. Bulk data transfer 6. What are the goals of distributed file system? 15. 2. How are the parameters and results passed to a remote procedure? Explain with a suitable example. Explain coherence protocol. 11. 4.Tech- CSE_VIII Sem P a g e | 13 . What are Public and Private keys? List the key differences and issues in public key cryptography and private key cryptography. What are cryptographic systems? Give a general model of a cryptographic system listing its objectives. What do you mean by distributed scheduling? 10. What do you mean by Digital Signature? Explain the different methods for generating and verifying signatures. 15) Discuss the following distributed deadlock detection algorithms a) Path pushing algorithm b) Edge chasing algorithm 16) Discuss the applications of agreement algo. What are the advantages and drawbacks of multiversion timestamp ordering in comparision with the ordering timestamp ordering. 5. What do you mean by the distributed object model? Write short note on RMI. Discuss distributed shared memory concept and algorithm for implementing distributed shared memory. in general? 4. Differentiate weak consistency with release consistency. Explain why a measure of reliability based on a simple percentage of the time that a node is up may be inadequate in general. 14. 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. What is the difference between a file service using the upload/download model and one using the remote access model? 20. Hints 6. explaining the important characteristics of each. 2. 3. What is the difference between tree structured directory system from a general graph structured system? UNIT-IV 1. 6. 17. What are the different mechanisms for building distributed file systems? 16. 8. Write short notes on : 6. What are the benefits of caching. Name resolution 6. Caching is one of the techniques used to improve access to naming data. Explain distributed file system and mechanism of building distributed file system. Briefly define the terms secret key cryptography and public key cryptography. 12. Memory coherence 6.4. UNIT-III 1. Caching 7. 13. 19.3. Explain the salient features of Mounting and Caching process. What do you mean by distributed objects? Explain the concept of remote method invocation with a suitable example. 9. 18. Describe how a non-recoverable situation could arise if write locks are released after the last operation of a transaction but before its commitment. Explain the difference between linearizability and sequential consistency. What are Distributed Databases? Office Of Academic Affairs-DBGI-Dehradun:: Handbook of B.1.2.5. 3.14) Show how a solution to the consensus problem can be used to solve the interactive consistency problem.

How cellular system wiorks? 21. Define frequency reuse nad its advantages? 19. 7. 4. What are commit protocols? Explain how Two-phase commit protocol responds to failure of participating site and failure of coordinator. Discuss ALOHA scheme with proper diagram? Office Of Academic Affairs-DBGI-Dehradun:: Handbook of B. What are the advantages of data distribution and data replication? 6. What is routing? Discuss the correctness. 14. How secure is Bluetooth network? 9. What are Polling techniques in TDMA and what are its advantages and disadvantages? 23.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 how the lock will be acquired by a transaction on the data object. 12. What do you mean by wireless telephony? 4. Explain the difference between Horizontal and Vertical Fragmentations. UNIT-V 1. Differentiate between Blue tooth and 802. 20. What are locks? What are the essential differences in the Lock-based protocols and Time Stamp-based protocols? 8. Explain balanced sliding window protocol. Differentiate the bully election algo and ring election algo 12. complexity. efficiency and robustness criteria of a good routing algorithm. Differentiate between sun network file system and Andrew file system. What are the major problems in AMPS system? How they overcome in GSM system. 7. 3. What is mobile computing? What are novel applications? 2. What is the data throughput speed of Bluetooth connection?And what is its range? 13. Explain GSM with its architecture and components? 5.Tech- CSE_VIII Sem P a g e | 14 . 10. message complexity in reference to distributed algorithm.11 protocol stack? 16. Explain remote method invocation. Explain the term. 11. decision and dependence requirements of a wave algorithm. Write short note on CORBA services.11. Explain the termination.11 wireless LAN architecture? 15. Describe various components of 802. What is destination-based routing? 5. What are Wave and Traversal algorithms? 6. What are the differences in centralized and distributed algorithms? How is the performance of a distributed algorithm evaluated? 2. Explain remote procedure calls and the basic use of remote procedure calls. Describe in detail the various challenges of of mobile computing? 3. Write short notes on : • ARP problem • Deadlock free packet switching 11. How MAC is classified ? Describe with the architecture? 22. 5. Explain IEEE 802. MOBILE COMPUTING UNIT 1 1. 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. 9. What happens? 10. Will Bluetooth andother WLAN devices interfere with each other? 12. Explain both physical and logical channel structure? UNIT 2 7. 9. If data object replicas are stored at multiple number of sites. What is Blue tooth ?Why it is called blue tooth ?What are the future directions of blue tooth standard? 8. Explain about various types of security techniques. Explain cellular concept? 18. Write short notes on MAC Layer and PHY Layer with respect to blue tooth technology? 17. Will other RF devices interfere with blue tooth devices? 11. Explain GPRS and how it has upgraded GSM? 6. Define Frequency Hoping Spread Spectrum? 10.

What is RED and where it is implemented and in what condition? 39.Whatkind of problems may arise if TCP is implemented over wireless network ? explain. 35.What is mutual exclusion and how it is different from channel allocation? 33. 24.What is indirect TCP? 38.Is link level re transmissions successful ? Give reason for your answer? 40.Tech- CSE_VIII Sem P a g e | 15 .What Is channel allocation and what is the effect of CIR on it? 28.Discuss FCA? 30. (c) Emulation.What is CDMA including advantages . (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 4 54: 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? Office Of Academic Affairs-DBGI-Dehradun:: Handbook of B. disadvantages another features? 25.Decsribe wireless TCP mechanisms? 34.Discuss various design approaches for implementing TCP over wireless? 36. What place it serves in mobile computing environment? 49:What is the basic concept behind adaptive clustering for mobile wireless networks.Discriminate congestion losses and wireless losses? Unit 3 42: 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.How channel allocation algorithms can be classified? 29.Discuss DCA? 31. (b) hoarding.What is mobile TCP? Explain its multiple acknowledgements? 41.How is asynchronous CDMA is better than other technologies? 26. 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.What is CSMA and ISMA? 27.Explain in detail aboput Snooping TCP? 37.Discuss HCA? 32.

What are the various communication devices used in multimedia? Q7. synchronous. 73: Describe QoS routing scheme in Ad hoc Networks? Why it is used? Multimedia Communication & System Design UNIT 1 Q1.Explain the characteristics for continuous media streams in MM system? Office Of Academic Affairs-DBGI-Dehradun:: Handbook of B. Describe how can multimedia be useful in business domain? Q3. 67: Describe the following algorithm: (a) Destination Sequential Distance Vector Routing.Define Multimedia? What are its various application areas? Q2. 62: Why is routing in Ad-hoc networks complicated.M) algorithm for energy efficient indexing on air.Explain the types of multimedia in detail? Q9.59: Why we are using mobile agent? Discuss in detail? 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 5 61: Name the main differences between Adhoc networks and other network. And also describe the pointer forwarding strategies in brief? 64: Explain any two of the following of receipt forwarding process: (a) Tunneling. Q8. 66: Describe the route discovery and route maintenance mechanisms of Ad hoc On Demand Distance Vector(AODV) routing algorithm in adhoc wireless networks. (c) Distance Vector Routing. What advantages do Adhoc network offer? Explain in detail by giving suitable example.Write down the differences b/w asynchronous.Tech- CSE_VIII Sem P a g e | 16 . (c) Registration.What is the hardware and software requirements for multimedi computer? Q5. (b) Encapsulation. isochronous transmission mode. 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.What is the multimedia objects in a multimedia presentation? Q4. What are the special challenges? Give some examples of real life scenarios of Ad-hoc networks. 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. (b) Dynamic state Routing. 63: Explain the energy indexing for wireless broadcast data in detail with suitable example.What are the different stages of Multimedia Project? Q6.

what is MPEH? Describe different standards of MPEG? Q19. 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 G 20 30 50 35 70 10 05 Q6.explain CD & its architecture? Differentiate between CD & DVD.describe any two communication devices used in multimedia UNIT2 Q1.What is Silence Compression? How it is achieved? Q13.What is the tools used for image capturing and editing? Q4. What are the various audio file formats available for computers? Q11. UNIT 3 Q1 How the sound files are created with windows? Q2. Q13. MPEG.Tech- CSE_VIII Sem P a g e | 17 .Explainthe working environment of multimedia in detail? Q14.What is multiple monitors? Q17. Define MIDI under windows Environment? Q12.What did you mean by multimedia project planning? Explain in detail.Write short notes on: JPEG. Write the advantages and disadvantages of MIDI over Digital Audio? Q13. Explain the following terms with respect to sound (a)Amplitude (b)Time period (c)Pitch Q9.what is image file formats? Explain in detail. Differentiate between San serifs and Serifs? Q14. multimedia on networks Q16.What do you understand by video making? Also explain the effect of sound video and graphics on the viewer? Q6. Q18.Q10 discusses the input and output devices used for preparing and distributing multimedia projects? Q5. What do you understand by Entropy of Information? Q4. Explain Dictionary based compression? Q8. Differentiate the Loss-less and Lossy data compression and explain the basic principle of each? Q12. What is the difference between LZ77 and LZW Compression? Q9. What are the various types of multimedia authoring tools? Explain each in brief? Q2.Explain the steps of Lossy sequential DCT based coding modes? Office Of Academic Affairs-DBGI-Dehradun:: Handbook of B.What is LZ77 compression? Explain with a suitable example. Explain Finite Context Modeling? Q10. What do you understand by MIDI? How MIDI is different from Digital audio? Q10. Q15. synchronous. What is the difference between static and dynamic coding? Q11. Q7. Q10.Write down the differences b/w asynchronous.Differentiate between Hypertext and Hypermedia? Q15.What is the significance of data compression in communication technology? Q3.What is color depth? Q16. What do you understand by bitmaps and vector drawings? Q8.Note the differences b/w speech synthesis and speech recognition? Q17. Define the ISDN modems? Q3. What are the advantages of Adaptive Huffman coding over Huffman method? Q5.What is various peripherals used in multimedia? Describe any three.What is various elements of multimedia? Explain in detail.What did you mean by multimedia framework? Explain in detail.What is the advantage of MIDI over digital audio? Q16. MHEG. isochronous transmission mode? Q11. Q17. What is the significance of studying texts and fonts on information exchange? Q7. Q12.

What is progressive scan? Q10Differentiate between progressive scan and interlacing? Q11.what is statistical & dictionary based modeling?explain. What do you understand by speech compression and speech synthesis? Q11.explain:a)adaptive coding b)arithmetic coding Q17. Explain with example? Q5. What is the difference between Compression methods and Model? Q7. What is the role of multiple monitors in image processing? Q4.Define sampling & sampling variables? Q6. Explain the multimedia database? Q9.Tech- CSE_VIII Sem P a g e | 18 . What is LZW compression? Explain with example. UNIT 4 Q1.what is LZ78 compression? Explain with example.What is interlined twittering? Q8.What do you mean by interlacing of video? Q9.Explain the JPEG Compression with suitable example? Q6.Define resolution? Q4.What is bitmap images? Q18.What is arithmetic coding. Q16. Q14.differentiate between statistical& dictionary based modeling with example. Explain lossless compression of sound? Q3.What is color depth? Q2. What is a Zig Zag coding? Q8. What do you understand by minimum redundancy compression? Methods? Q15. Define the term anti aliasing? Q16. Distinguish between Lossless and Lossy compression of sound? Q13. What are the various recent developments in multimedia? Q17. Elucidate the various MPEG standards? Q10. What are the various Image file formats? Q5. Write the differences between DVD and CD? Q14. What are the techniques of speech synthesis? Q2.Explain types of testing? Q13.What is vector images? UNIT 5 Q1. Q18.What is software testing? Q12.Q15.what do you mean by recent development in multimedia? Explain in detail.What is 24 RGB color information? Q3.Define quantization? Q7. Office Of Academic Affairs-DBGI-Dehradun:: Handbook of B. What is computer animation? Q12.