Important Practice Questions & Short Tricks
Duration: 6 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- About the course: About the Course
- Mathematical Aptitude: संख्या पद्धति / Number System, महत्तम समापवर्तक और लघुत्तम समापवर्त्य / HCF and LCM, Divisibility Rules, प्रतिशत / Percentage, अनुपात और समानुपात / Ratio and Proportion, औसत / Average, लाभ, हानि और बट्टा / Profit, Loss and Discount, समय और कार्य / Time and Work, घन क्षेत्रमिति / Solid Mensuration, साधारण और चक्रवृद्धि ब्याज / Simple and Compound Interest, समय, चाल और दूरी / Time, Speed and Distance, Age Problems, मिश्रण और एलिगेशन / Mixture and Alligation, Algebra, सरलीकरण, घातांक और करणी / Simplification, Indices and Surds, Pipe and Cistern, Trigonometry, Statistics, आँकड़ा निर्वचन / Data Interpretation, Arithmetic, समुच्चय, संबंध, फलन और विविक्त गणित / Sets, Relations, Functions and Discrete Mathematics, संख्या पद्धति और संख्या सिद्धांत / Number Systems and Number Theory, निर्देशांक ज्यामिति, सदिश और त्रिविमीय ज्यामिति / Coordinate Geometry, Vectors and 3D Geometry, बहुपद, समीकरण और सम्मिश्र संख्याएँ / Polynomials, Equations and Complex Numbers
- Logical Reasoning: श्रेणी / Series, कूट लेखन एवं कूट वाचन / Coding-Decoding, सादृश्यता एवं वर्गीकरण / Analogy and Classification, रक्त संबंध / Blood Relations, दिशा एवं दूरी / Direction and Distance, क्रम एवं रैंकिंग / Order and Ranking, अशाब्दिक तर्क / Non-Verbal Reasoning, बैठक व्यवस्था एवं पहेलियाँ / Seating Arrangement and Puzzles, Syllogisms, वेन आरेख, न्याय वाक्य एवं असमानता / Venn Diagrams, Syllogism and Inequalities, गणितीय संक्रियाएँ एवं लुप्त संख्या / Mathematical Operations and Missing Numbers, वर्णमाला एवं संख्या परीक्षण / Alphabet and Number Test, कथन आधारित तार्किक विवेचन / Statement-Based Reasoning, Analytical Reasoning (Counting Figures Reasoning), घन, पासा एवं आकृतियों की गिनती / Cubes, Dice and Figure Counting, कैलेंडर एवं घड़ी / Calendar and Clock, Clock
- General Knowledge: वैज्ञानिक उपलब्धियाँ और अनुसंधान / Scientific Achievements and Research, Chemistry, Biology, History, Geography, Polity, Indian Economy, समसामयिकी / Current Affairs, Static General Knowledge, राज्य विशेष सामान्य ज्ञान / State-Specific General Knowledge
- Art of Teaching: शिक्षण-अधिगम प्रक्रिया एवं कक्षा प्रबंधन / Teaching-Learning Process and Classroom Management, Learners & Learning Process, Factors Affecting Teaching, शिक्षण विधियाँ एवं उपागम / Teaching Methods and Approaches, सूक्ष्म शिक्षण एवं कक्षा संप्रेषण / Microteaching and Classroom Communication, शिक्षण सहायक सामग्री एवं शैक्षिक तकनीकी / Teaching Aids and Educational Technology, आकलन एवं मूल्यांकन / Assessment and Evaluation, शिक्षक: गुण, व्यावसायिक नैतिकता एवं विकास / Teacher: Qualities, Professional Ethics and Development, शैक्षिक नीतियाँ, अधिनियम एवं प्रशासन / Educational Policies, Acts and Administration, पाठ्यचर्या, कला एवं सह-शैक्षिक क्षेत्र / Curriculum, Arts and Co-curricular Areas, निर्देशन एवं परामर्श / Guidance and Counselling, दिव्यांग बच्चों की शिक्षा / Education of Children with Disabilities, Micro-Teaching & Teaching Skills, पाठ योजना / Lesson Planning
- Environmental Science: Environment
- Unit 1 | Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
- Unit 2 | COA: Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Instr Formats & Modes, Control Unit Design, Register Transfer and Microoperations, Programming the Basic Computer
- Unit 3 | C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
- Unit 3 | Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
- Unit 4 | Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Advanced Algorithms
- Unit 5 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management
- Unit 6 | 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, Transaction Management, Concurrency Control
- Unit 7 | Computer Networks: 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
- Unit 8 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
- Unit 9 | Object Oriented Programming: OOPS with C++
- Unit 10 | Web Development: HTML Basics, CSS, JavaScript-Basics, XML, Node.js, Git & Github
- Unit 11 | Theory Of Computation: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Grammar, Regular Language Properties, Moore & Mealy Machines, Pushdown Automata & CFG, Turing Machines
- Unit 12 | IoT: Emerging Tech Trends, Cloud Computing, कंप्यूटर नेटवर्क / Computer Networks
- Unit 13 | Artificial Intelligence: Approaches to AI, Search Algorithms, Game Playing, Knowledge Representation, Natural Language Processing, Artificial Neural Networks, Genetic Algorithms
- Unit 14 | E-Commerce: Electronic Data Interchange and E-Commerce, Role of Internet and Web Services, Security in Mobile and Wireless Computing, Physical Security and Cryptography Basics, Cyber Safety and Security
- Unit 15 | Multimedia: Multimedia
- Unit 16 | Python: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis, DSA using Python
- Full Length Mock Tests — General Paper:
- Full Length Mock Tests — Computer Science (Paper II):
AI summary & chapters
AI Summary
An AI-generated summary of this video lecture.
This video is a lecture on solving calendar-based aptitude questions, presented by an instructor from Knowledge Gate. The session begins with a question asking for the date 89 days from January 20, 2017, a Sunday. The instructor breaks down the calculation by first determining the number of weeks and remaining days, using the formula 89 = 12*7 + 5, which results in 12 weeks and 5 days. He then calculates the day of the week by adding 5 days to Sunday, concluding it is a Friday, and identifies the date as April 19, 2017. The second problem involves a 30-day month starting on a Saturday, with specific holidays on every second and fourth Saturday and all Sundays. The instructor calculates the total number of holidays (7) and subtracts this from the total days to find 23 working days. The final problem states that the second day of a month is a Sunday and asks for the last day of the next month, which has 31 days. The instructor deduces that the first day of the month is a Saturday, and by counting forward, determines the last day of the 31-day month is a Friday. The video uses a digital blackboard for calculations and includes on-screen text with questions and options.
Chapters
0:00 – 2:00 00:00-02:00
The video opens with a title card for a calendar problem. The first question displayed is "What is 89 days from today?" with the hint that today is January 20, 2017, a Sunday. The instructor, Yash Jain, begins to solve the problem by stating the total number of days is 89. He starts the calculation by writing "89" on the digital blackboard and begins to divide it by 7 to find the number of weeks and remaining days. The on-screen text clearly shows the question and the hint, providing the necessary information for the calculation.
2:00 – 5:00 02:00-05:00
The instructor continues solving the first problem. He completes the division, writing "89 = 12*7 + 5" on the blackboard, indicating 12 weeks and 5 extra days. He then explains that adding 5 days to a Sunday results in a Friday. He calculates the date by adding 5 days to January 20, which is January 25, and then adds the remaining 12 weeks (84 days) to reach April 19, 2017. The on-screen text shows the options, and the instructor's final answer is option (a) 19th April, Friday. The video then transitions to the next problem, which is about a 30-day month starting on a Saturday with specific holidays.
5:00 – 6:02 05:00-06:02
The video presents the third problem: "The second day of a month is Sunday. What will be the last day of the next month which has 31 days?" The instructor explains that if the second day is Sunday, the first day must be Saturday. He then calculates the last day of the 31-day month by counting forward from the first day. He writes "31" on the board and calculates 31 = 4*7 + 3, meaning 4 weeks and 3 extra days. Starting from Saturday, he adds 3 days to get Friday. The on-screen text shows the options, and the instructor concludes the answer is Friday, which is option (a). The video ends with a "THANKS FOR WATCHING" screen.
The video provides a structured, step-by-step approach to solving three distinct calendar-based aptitude problems. It begins with a straightforward date calculation, where the instructor uses division to find the number of weeks and extra days, then applies this to determine the day of the week and the final date. The second problem introduces the concept of counting working days by first identifying all holidays (Sundays and specific Saturdays) and subtracting them from the total days in the month. The final problem requires logical deduction to find the starting day of a month based on a given day, followed by a similar calculation to find the last day of a subsequent month. The consistent use of a digital blackboard for calculations and clear on-screen text for questions and options makes the teaching method effective and easy to follow.