Introduction to Distributed System

Duration: 5 min

This video lesson is available to enrolled students.

Return to /learn/AMCAT-PREPARATION/operating-systems/distributed-systems/distributed-system-basic/asset-introduction-to-distributed-system 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 is a lecture on Chapter 14, 'Distributed Systems,' from a computer science course. The instructor begins by introducing the chapter's topics, which include types of network-based operating systems, network and communication structures, protocols, robustness, design issues, and distributed file systems. The lecture then transitions to a formal definition of a distributed system, stating it is a collection of loosely coupled processors interconnected by a communications network. The instructor explains that these processors are also referred to as nodes, computers, machines, or hosts, and that a 'site' is the location of a processor. A key concept introduced is the client-server model, where a server provides a resource and a client at a different site requests it. To illustrate this, the instructor draws a diagram showing a server at site A, a client at site B, and a network connecting them, with communication flowing from the client to the server to access resources.

Chapters

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

    The video opens on a PDF document titled 'Chapter-14 Distributed Systems'. The instructor begins by outlining the topics for the chapter, which are listed on the page: Types of Network based Operating Systems, Network Structure, Communication Structure and Protocols, Robustness, Design Issues, and Distributed File Systems. The instructor then starts to write on the screen, adding handwritten notes such as 'Distributed System' and 'Types -> Multiprocessing' to the document, setting the stage for the lecture's content.

  2. 2:00 – 4:44 02:00-04:44

    The instructor continues the lecture by defining a distributed system as a collection of loosely coupled processors interconnected by a communications network. The on-screen text is highlighted to emphasize this definition. The instructor explains that processors are also called nodes, computers, machines, or hosts, and that a 'site' is the location of a processor. The lecture then introduces the client-server model, with the instructor writing 'client' and 'server' and drawing a diagram to illustrate the concept. The diagram shows a server at site A, a client at site B, and a network connecting them, with an arrow indicating communication from the client to the server to access resources. The instructor also writes 'work load -> dist' to suggest that workloads are distributed across the system.

The lecture provides a foundational overview of distributed systems. It begins by outlining the chapter's scope, covering key areas like network structures, protocols, and file systems. The core of the lesson is the formal definition of a distributed system as a network of loosely coupled processors. The instructor then builds on this by introducing the client-server model, using a diagram to visually explain how a client at one site can access a resource hosted by a server at another site, which is the fundamental mechanism for resource sharing in such systems.

Loading lesson…