Weightage & Pre-Introduction

Duration: 3 min

This video lesson is available to enrolled students.

Return to /learn/ISRO/general-aptitude-reasoning/calendar/basics-of-calendar-year-month-week-day-system/asset-weightage-pre-introduction after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. General Aptitude & Reasoning: Number System, Percentage, Ratio and Proportion (Ratios), Average, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Speed Time and Distance, Mixture and Alligation, Data Interpretation, Algebra, Probability, Permutation and Combination, Venn Diagram, HCF LCM, Divisibility Rules, Age Problems, Pipe and Cistern, Partnership, Linear Algebra, Sequence and Series (Series), Statistics, Powers and Exponents (Surds and Indices), Arithmetic, Mensuration and Geometry, Calculus, Trigonometry, Vectors, Speed Mathematics and Basic Mathematics, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Analogy, Series (Number and Letter Series) (Numerical Relations and Reasoning), Puzzle Solving (Puzzles), Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Calendar, Seating Arrangements, Coding Decoding, Blood Relations, Directions (Direction Test), Clock, Analytical Reasoning (Counting Figures Reasoning), Ranking, Order and Sequence, Logical Sequence Of Words, Inequality, Data Sufficiency, Cubes & Dices
  3. Computer Networks & Cybersecurity: 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
  4. Programming, Data Structures & Algorithms: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling, OOPS with C++, Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Advanced Algorithms
  5. AI, Machine Learning, Big Data & Cloud: Emerging Tech Trends, Artificial Intelligence, Big Data Systems, Approaches to AI, Search Algorithms, Knowledge Representation, Cloud Computing
  6. Digital Logic & Computer Organization: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Register Transfer and Microoperations, Control Unit Design, Programming the Basic Computer
  7. TOC & Compiler: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Grammar, Regular Language Properties, Moore & Mealy Machines, Pushdown Automata & CFG, Turing Machines, Complexity Theory, Intro to Compilers, Lexical Analysis, Grammar & CFG, Syntax Analysis: Top-Down, Syntax Analysis: Bottom-Up, Semantic Analysis & SDT, Intermediate Code Gen, Code Optimization, Run Time Environment
  8. Discrete Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic
  9. Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Unix OS, Linux OS, Distributed Systems
  10. Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management, Object Oriented Technology, HTML Basics, JavaScript-Basics, Java, XML
  11. Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, File Organization & Indexing, Relational Algebra, SQL, Relational Calculus, Transaction Management, Concurrency Control, Database Recovery, Data Warehousing & Mining, Enhanced Data Models, NoSQL
  12. Other Recurring CS Topics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing, Multimedia
  13. Live Classes: ISRO Live classes
  14. Full Mock Test:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

The video is a lecture on solving calendar-based problems for competitive exams, presented by an educator named Yash Jain Sir. The first segment introduces the topic with a slide titled 'DNA - Calendars', which includes a table showing the percentage of calendar chapter questions in various exams like TCS NQT, Infosys, Wipro, and Accenture. The instructor explains that calendar questions are a scoring topic due to their limited variety and that success depends on logic and aptitude skills, not complex formulas. The second segment shifts to time management strategies, displaying a slide with a table of exam names and their time limits, such as GATE (10 questions in 20 minutes) and CAT (34 questions in 60 minutes). The instructor emphasizes the principle 'The faster, the better' and advises students to minimize the time per question to 1.5 minutes, use approximate answers, and learn to identify which questions to skip. The video concludes with a 'Thanks for Watching' screen.

Chapters

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

    The video opens with a title slide for a lecture on 'DNA - Calendars'. The instructor, Yash Jain Sir, introduces the topic, explaining that calendar questions are a scoring subject because they have limited variety and are based on logic and aptitude skills. A table on the slide lists the percentage of calendar chapter questions for several exams: TCS NQT (3%), Infosys (6%), Wipro NLTH (1%), Accenture (3%), and Cognizant (2%). The instructor notes that the data is based on previous year trends and that the questions are not formula-heavy, making them easier to solve with the right approach.

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

    The lecture transitions to a new slide titled 'The faster, the better.' This slide features a table comparing different exams (GATE, CAT, TCS NQT, Infosys, Wipro, Accenture, IBM) with their respective number of questions and time limits. The instructor emphasizes the importance of speed, stating that the average time to solve a question should be 1.5 minutes. He provides key strategies: minimize formula usage, try to find approximate answers, and learn to identify which questions to leave. The slide also includes a humorous example of a logical puzzle about a chocolate, and the instructor uses red markings to highlight key points on the table.

The video provides a comprehensive guide for students preparing for competitive exams, focusing on the strategic approach to calendar problems. It begins by establishing the importance of this topic, noting its high scoring potential due to its predictable nature. The core of the lesson is a shift from rote learning to a time-efficient, logic-based strategy. By analyzing the time constraints of various exams, the instructor teaches a practical method for maximizing score, emphasizing speed, approximation, and question selection. The synthesis of these two parts—understanding the topic and mastering the test-taking strategy—forms a complete approach to excelling in this section of the exam.

Loading lesson…