Important Practice Questions & Short Tricks

Duration: 6 min

This video lesson is available to enrolled students.

Return to /learn/WIPRO-PREPARATION/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. Quantitative Aptitude: Number System, Percentage, Profit and Loss, Ratio and Proportion (Ratios), Average, Time and Work, Speed Time and Distance, Simple Interest and Compound Interest, Mixture and Alligation, Data Interpretation, Permutation and Combination, Probability, Logarithm, Powers and Exponents (Surds and Indices), Age Problems, Divisibility Rules, Partnership, HCF LCM, Algebra, Pipe and Cistern
  2. Logical Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Analogy, Coding Decoding, Blood Relations, Directions (Direction Test), Syllogisms, Logical Sequence Of Words, Data Sufficiency, Seating Arrangements, Puzzle Solving (Puzzles), Calendar, Clock, Cubes & Dices, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Data Arrangement
  3. English Language: Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Vocabulary, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Active Passive Voice (Voice), Direct and Indirect Speech, Cloze Test (Cloze Passage), Tenses, Subject Verb Agreement (Verb Noun Agreement), Preposition, Articles, Conjunction, Adverb
  4. Written English Test: English Writing Ability
  5. Coding: Coding Questions by Yash Sir, C Programming by Yash Sir, Programming in C++, Java, Python for Placements by Yash Sir
  6. Communication Round: Communication Assessment
  7. DBMS (Technical Interview): Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, File Organization & Indexing, Relational Algebra, Relational Calculus, Transaction Management, Concurrency Control, Database Recovery, ORDBMS, Database Security & Authorization, Query Processing & Optimization, Enhanced Data Models, Big Data Systems, NoSQL, Data Warehousing & Mining
  8. SQL (Technical Interview): SQL
  9. Operating Systems (Technical Interview): Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Windows OS, Linux OS, Security, Distributed Systems, Virtual Machines
  10. Computer Networks (Technical Interview): 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, Mobile Technology, Cloud Computing and IoT, Cyber and Info Security
  11. OOPs (Technical Interview): Object Oriented Programming (OOPS)
  12. HR Interview: MR & HR Interview Preparation
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…