Important Practice Questions & Short Tricks

Duration: 7 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-9407 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.

The video is a lecture on solving calendar-based aptitude questions, presented by an instructor from Knowledge Gate. The first problem, from HP 2017, asks when Virat Kohli will celebrate his next wedding anniversary on the same day of the week, given that he celebrated it on Monday, December 11, 2007. The instructor explains that this requires calculating the day of the week for December 11, 2018, by determining the number of odd days between the two dates. He uses a table to calculate the number of odd days for each century (100, 200, 300, etc.), noting that 100 years have 5 odd days, 200 have 3, 300 have 1, and 400 have 0. He then calculates the total odd days from 2007 to 2018, which is 11 years, and finds that 2018 is 11 days ahead of 2007. Since 11 days is 1 week and 4 days, the day of the week advances by 4 days. Starting from Monday, adding 4 days results in Friday. The second problem, from Capgemini 2016, asks which day of the week cannot be the last day of a century. The instructor uses the same table of odd days for centuries to show that the last day of a century can be Friday (for 100, 200, 300 years), Wednesday (for 400 years), and Monday (for 800 years), but never Tuesday or Thursday. 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, from HP 2017, is displayed: 'Virat Kohli Celebrated his wedding anniversary on Monday on 11th December 2007, when will he celebrate his next wedding anniversary on the same day?'. The instructor, Yash Jain, begins to solve the problem by explaining that the next anniversary will be on December 11, 2018. He states that to find the day of the week, one must calculate the number of odd days between 2007 and 2018. He introduces a table on the screen that lists the number of odd days for different century lengths: 100 years have 5 odd days, 200 have 3, 300 have 1, and 400 have 0. He explains that a century is 100 years, and the number of odd days is the remainder when the total number of days is divided by 7.

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

    The instructor continues to solve the first problem. He calculates the number of odd days from 2007 to 2018. He writes '2007' and '2018' on the screen and adds a '+11' to indicate the 11 years between the two dates. He explains that 11 years consist of 8 ordinary years and 3 leap years. He calculates the total number of days as (8 * 365) + (3 * 366) = 4018 days. He then divides 4018 by 7 to find the number of odd days, which is 4018 / 7 = 574 weeks and 0 days. He then adds the 4 odd days from the century calculation (100 years have 5 odd days, but since 2007 is not a century year, he uses the 5 odd days from the 100-year cycle). He concludes that the day of the week advances by 4 days from Monday, which is Friday. He then transitions to the second problem.

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

    The second problem is introduced: 'The last day of a century cannot be'. The options are Monday, Wednesday, Tuesday, and Friday. The instructor refers to the table of odd days for centuries. He explains that the last day of a century can be Friday (for 100, 200, 300 years), Wednesday (for 400 years), and Monday (for 800 years). He states that the last day of a century can never be Tuesday or Thursday. He uses the table to show that the number of odd days for 100, 200, 300, and 400 years are 5, 3, 1, and 0 respectively. He then explains that the last day of a century can be Friday (5 odd days), Wednesday (3 odd days), and Monday (1 odd day), but never Tuesday or Thursday. The video ends with a 'Thanks for Watching' screen.

The video presents a structured approach to solving two common calendar aptitude problems. The first problem involves calculating the day of the week for a future date by determining the number of odd days between two years, using a table of odd days for centuries. The second problem uses the same table to determine which day of the week cannot be the last day of a century, based on the pattern of odd days. The instructor uses a clear, step-by-step method, writing out calculations and referencing the table, to demonstrate the logic behind the solutions.

Loading lesson…