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 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):
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This educational video presents a series of logical reasoning problems related to calendar calculations, typical of competitive exams. The lecture begins with a question about determining the day of the week for June 11th, 2013, given that August 15th, 2012, was a Thursday. The instructor uses a step-by-step method, calculating the number of days between the two dates and then finding the remainder when divided by 7 to determine the day of the week. The process involves identifying the number of days in each month and accounting for leap years. The video then transitions to a second problem, asking for the day of the week for January 7th, 2013, given that July 9th, 2012, was a Sunday. The final segment presents a multiple-choice question about which year among the options (2004, 2005, 2008) has 365 days, which is a test of understanding leap years. 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 card for a calendar problem. The first question is displayed: 'If Aug 15th, 2012 falls on Thursday then June 11th, 2013 falls on which day?'. The instructor, Yash Jain Sir, begins the solution by writing '15th Aug 2012 -> Thursday' on the blackboard. He then calculates the number of days from August 15, 2012, to August 15, 2013, which is 366 days because 2012 is a leap year. He notes that 366 mod 7 equals 2, meaning the day of the week advances by 2 days. He then calculates the number of days from June 11, 2013, to August 15, 2013, which is 65 days. He writes '65 days' and calculates 65 mod 7, which is 2. He then subtracts this from the total advance, resulting in a net advance of 0 days, concluding that June 11, 2013, is a Thursday.

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

    The instructor continues the solution for the first problem. He writes '15th Aug 2013 -> Friday' on the board, indicating the day of the week for August 15, 2013. He then calculates the number of days from June 11, 2013, to August 15, 2013, which is 65 days. He writes '65 days' and calculates 65 mod 7, which is 2. He then subtracts this from the total advance, resulting in a net advance of 0 days, concluding that June 11, 2013, is a Thursday. He then moves to the second problem: 'If July 9th, 2012 falls on Sunday then Jan 7th, 2013 falls on which day?'. He writes '9th July 2012 -> Sunday' on the board. He calculates the number of days from July 9, 2012, to July 9, 2013, which is 366 days. He notes that 366 mod 7 equals 2, meaning the day of the week advances by 2 days. He then calculates the number of days from January 7, 2013, to July 9, 2013, which is 183 days. He writes '183 days' and calculates 183 mod 7, which is 5. He then subtracts this from the total advance, resulting in a net advance of 0 days, concluding that January 7, 2013, is a Sunday.

  3. 5:00 – 5:58 05:00-05:58

    The video transitions to a new question: 'Which of the following year has 365 days?'. The options are a) 2004, b) 2005, c) 2008, d) All of the above. The instructor explains that a year with 365 days is a common year, not a leap year. He explains the rule for leap years: a year is a leap year if it is divisible by 4, but not by 100, unless it is also divisible by 400. He checks the options: 2004 is divisible by 4 and not by 100, so it is a leap year (366 days). 2005 is not divisible by 4, so it is a common year (365 days). 2008 is divisible by 4 and not by 100, so it is a leap year (366 days). Therefore, only 2005 has 365 days. The video ends with a 'Thanks for Watching' screen.

The video provides a comprehensive tutorial on solving calendar-based logical reasoning problems. It demonstrates a systematic approach: first, calculate the total number of days between two dates, then find the remainder when divided by 7 to determine the day of the week shift. The key concept is that a common year advances the day of the week by 1, while a leap year advances it by 2. The video also reinforces the rule for identifying leap years, which is essential for accurate calculations. The progression from one problem to the next builds a clear understanding of the underlying principles, making it a valuable resource for students preparing for competitive exams.

Loading lesson…