TDMA - Channelization

Duration: 2 min

This video lesson is available to enrolled students.

Return to /learn/AMCAT-PREPARATION/computer-networks/dll-access-control/channelization/asset-tdma-channelization 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, 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.

This lecture introduces Time-Division Multiple Access (TDMA) as a channelization technique where multiple stations share the same frequency bandwidth by dividing transmission time into distinct slots. The instructor contrasts TDMA with Frequency-Division Multiple Access (FDMA) using visual diagrams that plot frequency against time. FDMA is depicted with horizontal bands representing continuous frequency allocation, while TDMA is shown as vertical stripes indicating time-based sharing. A real-world analogy involving a radio station schedule is used to clarify how specific slots are assigned to different users, such as "Morning No 1 Soumya" or "Mid Day Masala RJ MIKE." The core definition states that in TDMA, each station is allocated a specific time slot during which it can send data without interference from others sharing the channel.

Chapters

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

    The instructor introduces TDMA using a slide comparing FDMA and TDMA graphs. The screen displays two frequency-time plots: FDMA with horizontal bands and TDMA with vertical stripes. Text on the slide defines TDMA as a method where stations share bandwidth in time, with each allocated a specific slot for data transmission. The instructor points to the vertical bars of the TDMA graph and writes "RR" above it while gesturing to the audience. A radio station schedule analogy is drawn, circling specific slots like "Morning No 1 Soumya" and "Mid Day Masala RJ MIKE" to illustrate time slot allocation.

  2. 2:00 – 2:19 02:00-02:19

    The segment concludes with a focus on the TDMA diagram showing vertical colored bars representing data transmission slots. The slide text reiterates that stations share channel bandwidth by being allocated specific time slots for data transmission. The presenter stands beside the diagram wearing a black shirt with a "KG KNOWLEDGE GATE" logo, reinforcing the educational context of the channelization method explanation.

The lecture effectively uses visual contrasts and real-world analogies to explain TDMA. The key distinction lies in how resources are partitioned: FDMA divides the frequency spectrum, whereas TDMA divides time. The radio station analogy serves as a concrete example of how non-overlapping slots prevent interference, mirroring the technical operation of TDMA systems. The notation "RR" and specific schedule names provide tangible evidence of slot assignment concepts.

Loading lesson…