Types of Distributed Systems

Duration: 4 min

This video lesson is available to enrolled students.

Return to /learn/AMCAT-PREPARATION/operating-systems/distributed-systems/distributed-system-basic/asset-types-of-distributed-systems after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Quantitative Ability: Percentage, Profit and Loss, Ratio and Proportion (Ratios), Average, Time and Work, Speed Time and Distance, Simple Interest and Compound Interest, Age Problems, Number System, Divisibility Rules, HCF LCM, Algebra, Permutation and Combination, Probability, Data Interpretation, Logarithm, Sequence and Series (Series), Powers and Exponents (Surds and Indices), Speed Mathematics and Basic Mathematics
  2. Logical Reasoning: Seating Arrangements, Puzzle Solving (Puzzles), Data Arrangement, Coding Decoding, Blood Relations, Directions (Direction Test), Ranking, Order and Sequence, Data Sufficiency, Venn Diagram, Inequality, Series (Number and Letter Series) (Numerical Relations and Reasoning), Logical Sequence Of Words, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Selection Decision Table (Decision Making), Analogy, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning)
  3. Verbal Ability: Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Subject Verb Agreement (Verb Noun Agreement), Tenses, Articles, Preposition, Conjunction, Modals, Active Passive Voice (Voice), Direct and Indirect Speech, Vocabulary, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Completion (Fill in the blanks), Sentence Correction (Error Correction), Cloze Test (Cloze Passage), Facts, Inference and Judgements
  4. Programming Fundamentals (Technical): C Fundamentals
  5. Data Structures (Technical): Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  6. Algorithms (Technical): Algorithm Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Time Complexity Analysis, Advanced Algorithms
  7. OOPs (Technical): Object Oriented Programming (OOPS)
  8. DBMS (Technical): Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, File Organization & Indexing, Relational Algebra, Relational Calculus, Transaction Management, Concurrency Control, Database Recovery, ORDBMS, Database Security & Authorization, Query Processing & Optimization, Enhanced Data Models, Data Warehousing & Mining, Big Data Systems, NoSQL
  9. SQL (Technical): SQL
  10. Operating Systems (Technical): Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Windows OS, Linux OS, Security, Distributed Systems, Virtual Machines
  11. Computer Networks (Technical): Introduction to CN, Data Communication, DLL: Access Control, DLL: Flow Control, DLL: Error Control, DLL: Framing, Data Link Layer - Ethernet, Net Layer: IPv4 & Proto, Net Layer: IP Addressing, Net Layer:Routing Protocol, Transport Layer Services, TL: Congestion & UDP, Application Layer, Hardware basics, Network Security, Mobile Technology, Cloud Computing and IoT, Cyber and Info Security
  12. Software Engineering (Technical): Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  13. Coding/Automata Round: Coding Questions by Yash Sir, C Programming by Yash Sir, Programming in C++, Java, Python for Placements by Yash Sir, Pseudo Codes
  14. Personality / Behavioral Assessment: Behavioral Assessment (Behavioral Competency Profiling) (Psychometric Test)
  15. Writing Assessment: English Writing Ability
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

The video presents a lecture on the types of distributed systems, focusing on the distinction between Network Operating Systems and Distributed Operating Systems. The instructor begins by introducing the two categories and then elaborates on their key differences. For Network Operating Systems, the core concept is that users are aware of the multiple machines in the network and must explicitly access resources, such as through remote login (telnet, ssh) or file transfer (FTP). The instructor illustrates this with a diagram showing a user accessing a server. In contrast, Distributed Operating Systems are designed to hide the complexity of multiple machines from the user, making remote resources appear as local. The lecture details two primary mechanisms for this: Data Migration, which involves transferring the entire file or only necessary portions, and Computation Migration, which moves the processing task itself, often using Remote Procedure Calls (RPCs) or messaging systems. The video uses on-screen text and handwritten diagrams to visually reinforce these concepts.

Chapters

  1. 0:00 – 2:00 00:00-02:00

    The video opens with a slide titled "Types of Distributed Systems" listing two categories: "Network Operating Systems" and "Distributed Operating Systems." The instructor begins to explain the first type, Network Operating Systems. On-screen, the instructor writes the command "telnet 162.110.98.02" and the command "ssh" to illustrate remote access. A diagram is drawn to represent a user accessing a server, visually demonstrating the concept of a user explicitly connecting to a remote machine. The instructor explains that in this model, users are aware of the multiplicity of machines and must use specific commands to access them.

  2. 2:00 – 3:59 02:00-03:59

    The video transitions to a new slide titled "Distributed-Operating Systems." The instructor highlights the key difference: "Users not aware of multiplicity of machines." The slide lists two mechanisms for achieving this: "Data Migration" and "Computation Migration." For Data Migration, the instructor explains that data is transferred, either the entire file or only necessary portions. For Computation Migration, the instructor explains that the computation is moved, not the data, and mentions the use of Remote Procedure Calls (RPCs) and messaging systems. The instructor uses the example of a user accessing a Google server, where the user's request is processed by a remote machine, and the result is sent back, making the process appear seamless.

The lecture systematically contrasts two models of distributed computing. It begins by establishing that Network Operating Systems require users to be aware of and explicitly manage multiple machines, using tools like telnet and ssh. This model is characterized by a user-centric approach to resource access. The lecture then pivots to Distributed Operating Systems, which aim to abstract away the underlying complexity. This is achieved through two main strategies: moving data (Data Migration) or moving the processing task itself (Computation Migration). The core synthesis is that the primary goal of a Distributed Operating System is to provide a unified, seamless user experience, making the distributed nature of the system invisible, unlike the more transparent and user-involved Network Operating System model.

Loading lesson…