Important Practice Questions & Short Tricks

Duration: 6 min

This video lesson is available to enrolled students.

Return to /learn/BIHAR-STET-COMPUTER-SCIENCE-COMPLETE-COURSE/logical-reasoning/calendar/formulas-and-high-yield-questions/asset-important-practice-questions-short-tricks-9408 after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About the course: About the Course
  2. 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
  3. 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
  4. General Knowledge: वैज्ञानिक उपलब्धियाँ और अनुसंधान / Scientific Achievements and Research, Chemistry, Biology, History, Geography, Polity, Indian Economy, समसामयिकी / Current Affairs, Static General Knowledge, राज्य विशेष सामान्य ज्ञान / State-Specific General Knowledge
  5. 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
  6. Environmental Science: Environment
  7. Unit 1 | Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
  8. 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
  9. Unit 3 | C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  10. Unit 3 | Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  11. Unit 4 | Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Advanced Algorithms
  12. 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
  13. 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
  14. 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
  15. 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
  16. Unit 9 | Object Oriented Programming: OOPS with C++
  17. Unit 10 | Web Development: HTML Basics, CSS, JavaScript-Basics, XML, Node.js, Git & Github, PHP
  18. 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
  19. Unit 12 | IoT: Emerging Tech Trends, Cloud Computing, कंप्यूटर नेटवर्क / Computer Networks, Internet of Things
  20. Unit 13 | Artificial Intelligence: Approaches to AI, Search Algorithms, Game Playing, Knowledge Representation, Natural Language Processing, Artificial Neural Networks, Genetic Algorithms
  21. 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
  22. Unit 15 | Multimedia: Multimedia
  23. 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
  24. Full Length Mock Tests — General Paper:
  25. Full Length Mock Tests — Computer Science (Paper II):
  26. Full Length Mock Test – General + Computer Science:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

The video is a lecture on solving logical reasoning problems related to calendars, presented by an instructor from Knowledge Gate. The first problem, asked in a TCS interview, is a riddle about age: 'The day before yesterday, I was 25 years old, and next year I will turn 28.' The instructor explains that this is possible if the person's birthday is on December 31st and the current date is January 1st of a new year. On December 30th of the previous year, the person was 25. On December 31st, they turned 26. On January 1st of the current year, they are still 26, but they will turn 27 in the current year and 28 in the following year. The second problem asks for the maximum gap between two successive leap years, which is 8 years, as demonstrated by the sequence 1896, 1904, 1908, 1912, 1920, etc. The final problem asks how many weekends are in a year, with the instructor calculating that a year has 52 weeks and 1 or 2 extra days, leading to 52 or 53 weekends, with 53 being the maximum possible. The video uses a digital blackboard for calculations and includes on-screen text for the questions and options.

Chapters

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

    The video opens with a title card for a 'CALENDAR' topic, followed by a lecture screen. The instructor, Yash Jain, introduces a logical puzzle: 'The day before yesterday, I was 25 years old, and next year I will turn 28. How is it possible?' The question is displayed on a green bar at the top. The instructor begins to analyze the problem, setting up the context of a TCS interview question from 2019. The background is a black digital board with white chalk-style drawings of school supplies. The instructor is visible in a small window in the bottom right corner.

  2. 2:00 – 5:00 02:00-05:00

    The instructor begins to solve the age riddle on the digital blackboard. He writes 'DOB: 31st December' and then uses a timeline to explain the logic. He writes '31st December 2007 -> 25' and '30th December 2008 -> 26', showing that the person was 25 on December 30, 2007. He then writes '1st Jan 2008 -> 26' and '31st Dec 2009 -> 28', explaining that on January 1, 2008, the person is 26, and they will turn 27 in 2008 and 28 in 2009. The key insight is that the 'day before yesterday' was December 30, 2007, and 'next year' refers to 2009, when they will turn 28. The instructor uses arrows and dates to clearly illustrate the timeline.

  3. 5:00 – 6:27 05:00-06:27

    The video transitions to a new problem: 'The maximum gap between two successive leap year is?'. The options are a) 4, b) 8, c) 2, d) 1. The instructor explains that a leap year occurs every 4 years, but century years are not leap years unless divisible by 400. He provides the example of 1896 and 1904, showing a gap of 8 years. He then moves to the next problem: 'How many weekends are there in a year?'. He explains that a year has 365 days, which is 52 weeks and 1 day, or 52 weeks and 2 days in a leap year. Since a weekend consists of 2 days (Saturday and Sunday), there are at least 52 weekends. In a non-leap year, the extra day could be a Saturday or Sunday, making it 53 weekends. In a leap year, the two extra days could be a Saturday and Sunday, also making it 53 weekends. The maximum is 53. The video ends with a 'THANKS FOR WATCHING' screen.

The video presents a structured lesson on calendar-based logical reasoning, progressing from a complex riddle to two more direct calculation problems. The core teaching method involves breaking down each problem into a clear, step-by-step logical process, often using a timeline or a digital blackboard to visualize the sequence of events. The first problem highlights the importance of carefully interpreting the temporal context of a statement, particularly the ambiguity of 'next year'. The second problem demonstrates the application of the rules for leap years, showing that the maximum gap is 8 years due to the century rule. The final problem applies basic division and understanding of the week cycle to determine the maximum number of weekends in a year. The synthesis of these problems is the application of logical deduction and fundamental calendar rules to solve seemingly paradoxical or quantitative questions.

Loading lesson…