Types of Network OS
Duration: 1 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- 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
- 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)
- 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
- Programming Fundamentals (Technical): C Fundamentals
- Data Structures (Technical): Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
- Algorithms (Technical): Algorithm Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Time Complexity Analysis, Advanced Algorithms
- OOPs (Technical): Object Oriented Programming (OOPS)
- 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
- SQL (Technical): SQL
- 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
- 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
- Software Engineering (Technical): Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
- 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
- Personality / Behavioral Assessment: Behavioral Assessment (Behavioral Competency Profiling) (Psychometric Test)
- Writing Assessment: English Writing Ability
AI summary & chapters
AI Summary
An AI-generated summary of this video lecture.
The video presents a lecture on network operating systems, focusing on two primary models: peer-to-peer (P2P) and client-server. The instructor begins by defining P2P networks, where all devices (peers) are equal and share resources from a common location, making them suitable for small and medium LANs and less expensive to set up. A diagram illustrates this model with multiple peers (Peer 1, Peer 2, etc.) connected in a decentralized manner, sharing objects. The lecture then transitions to the client-server model, which is more expensive and requires technical maintenance. In this architecture, a central server provides resources to clients (such as phones, PCs, and laptops), and the network is centrally controlled, making changes and additions easier. A diagram shows a server (Server-PT) connected via a network cloud to various client devices. The video also briefly touches on concepts like data migration and computation migration, and concludes with a list of services provided by distributed operating systems, including directory, backup, web, and internetworking services.
Chapters
0:00 – 1:26 00:00-01:26
The video starts with a slide titled 'Types of network operating systems'. The instructor explains the first type, peer-to-peer (P2P), defining it as a network where users share resources saved in a common, accessible location, and all devices are treated equally. The text states P2P is best for small and medium LANs and is less expensive than the client-server model. A diagram shows multiple peers (Peer 1, Peer 2, Peer 3, Peer 4, Peer N) connected in a decentralized network, with arrows indicating shared objects. The instructor then transitions to the second type, client-server, explaining that it provides access to resources through a central server. The text notes this model is more expensive and requires technical maintenance. A diagram illustrates a central server (Server-PT) connected to a network cloud, which in turn connects to various client devices (Phone-PT, PC-PT, Laptop-PT). The instructor highlights that a key advantage of the client-server model is central control, which simplifies changes and additions. The final slide lists services provided by distributed operating systems, including directory, backup, web, and internetworking services.
The lecture systematically compares the two fundamental network operating system models. It begins with the peer-to-peer (P2P) model, emphasizing its decentralized nature, equality of devices, and cost-effectiveness for smaller networks, supported by a diagram of interconnected peers. It then contrasts this with the client-server model, highlighting its centralized architecture, higher cost, and the advantage of centralized control for easier management, illustrated by a diagram of a server serving multiple clients. The progression from P2P to client-server provides a clear comparison of their structures, advantages, and typical use cases.