-
About the Course
LMT — IBPS SO IT Officer This Course is Only Available
On Our AppDive in and start learning. Get offline access to all the course contents!
IBPS SO IT Officer Crash Course
Crack your IBPS SO IT OFFICER exams in the first attempt with LMT Crash Course
👨💻 400+ Video Lectures📚 Latest Mock Test📌 Study Material📝 Formulas and tricks👣 Beginner Friendly⭐️ Trusted by 1000+ StudentsThe one-stop destination for everything you need for IBPS SO IT OFFICER exam preparations.Enroll Now on the AppNo items in this section -
[ Quantitative ] - Quadratic Equations
-
[ Quantitative ] - Discount
-
[ Quantitative ] - Ratio and Proportion
-
[ Quantitative ] - Average
-
[ Quantitative ] - Alligations and Mixtures
-
[ Quantitative ] - Percentage Problem
-
[ Quantitative ] - Profit and Loss
-
[ Quantitative ] - Time, Speed and Distance
-
[ Quantitative ] - Simple and Compound Interest
-
[ Quantitative ] - Probability
-
[ Quantitative ] - Permutation and Combination
-
[ Quantitative ] - Time and Work
- Time and Work Part #1
- Time and Work Part #2
- Time and Work Part #3
- Time and Work Part #4
- Time and Work Part #1 [ Old Videos by Sumer ]
- Time and Work Part #2 [ Old Videos by Sumer ]
- Time and Work Part #3 [ Old Videos by Sumer ]
- Time and Work [Formula] —
- Time and Work [Practice Problems]
- Time and Work [Handmade Notes]
-
[ Quantitative ] - Number System
- Number System – 1
- Number System – 2
- Number System – 3
- Number System – 4
- Number System Part #1 [Old Video]
- Number System Part #2 [Old Video]
- Number System Part #3 [Old Video]
- Number System Part #4 [Old Video]
- Number System Part #5 [Old Video]
- Number System Part #6 [Old Video]
- Number System Part #7 [Old Video]
- Number System Part #8 [Old Video]
- Number System Part #9 [Old Video]
- Number System Part #10 [Old Video]
- Number System, LCM & HCF Practice Problem
-
[ Quantitative ] - Number Series
-
[ Quantitative ] - Data Interpretation
-
[ Quantitative ] - Simplification
-
[ Verbal ] - Reading Comprehension
-
[ Verbal ] - Sentence Rearrangement
-
[ Verbal ] - Subject Verb Agreement
-
[ Verbal ] - Ability Extra
- Introduction to Verbal Ability + Tenses Part #1
- Tenses Part #1
- Tenses [ Notes + Solved Examples + Practice Problem ]
- Error Detection and Correction + Sentence Completion #1
- Sentence Completion Part #2
- Spotting Erorrs [ Notes + Solved Examples + Practice Problem ]
- Sentence Completion [ Notes + Solved Examples + Practice Problem ]
- Assumption in Verbal Reasoning
- Deduction in Verbal Reasoning
-
[ Verbal ] - Sentence Corrections
-
[ Verbal ] - Fill in the Blanks
-
[ Verbal ] - Error Identification
-
[ Verbal ] - Paragraph
-
[ Verbal ] - Sentence Completion
-
[ Verbal ] - Cloze Test
-
[ Reasoning ] - Blood Relation
-
[ Reasoning ] - Coding Decoding
-
[ Reasoning ] - Data Sufficiency
-
[ Reasoning ] - Direction
-
[ Reasoning ] - Seating Arrangement
-
[ Reasoning ] - Syllogism
-
[ Reasoning ] - Puzzle
-
[ Reasoning ] - Verbal Reasoning : Analogy
-
[ Reasoning ] - Inequality
-
Computer Fundamental
-
Concepts of Programming
-
Database Management Systems
- Introduction to DBMS Basic Concept [01 Introduction Database Concepts]
- Advantages and Disadvantage of DBMS [01 Introduction Database Concepts]
- Architecture of DBMS [01 Introduction Database Concepts]
- Database Administrator Manager Storage Manager [01 Introduction Database Concepts]
- Data Independence [01 Introduction Database Concepts]
- Entity Relationship Modelling with solved example [02 Entity–Relationship Data Model]
- Extended Entity Relationship Model with solved example [02 Entity–Relationship Data Model]
- Data Modelling [03 Relational Model and relational Algebra]
- Inference Rules [03 Relational Model and relational Algebra]
- Keys [03 Relational Model and relational Algebra]
- E-R To Relational Schema #1 [03 Relational Model and relational Algebra]
- E-R To Relational Schema #2 [03 Relational Model and relational Algebra]
- Introduction to SQL [04 Structured Query Language (SQL) ]
- Data definition language [04 Structured Query Language (SQL) ]
- DML ( data manipulation language ) [04 Structured Query Language (SQL) ]
- DRL ( Data Retrieval Language) [04 Structured Query Language (SQL) ]
- Aggregate Function in SQL [04 Structured Query Language (SQL) ]
- Types Of Joins & Inner Join [04 Structured Query Language (SQL) ]
- Left, Right & Full Join [04 Structured Query Language (SQL) ]
- SQL Queries | Solved Example – 1 [04 Structured Query Language (SQL) ]
- SQL Queries | Solved Example – 2 [04 Structured Query Language (SQL) ]
- SQL Queries | Solved Example – 3 [04 Structured Query Language (SQL) ]
- SQL Queries | Solved Example – 4 [04 Structured Query Language (SQL) ]
- SQL Queries | Solved Example – 5 [04 Structured Query Language (SQL) ]
- PL SQL | part 1 | [04 Structured Query Language (SQL) ]
- PL SQL | part 2 | [04 Structured Query Language (SQL) ]
- Query Processing And Query Optimisation [Part 1] [04 Structured Query Language (SQL) ]
- Query Processing And Query Optimisation [Part 2] [04 Structured Query Language (SQL) ]
- Query Processing And Query Optimisation [Part 3] [04 Structured Query Language (SQL) ]
- Query Processing And Query Optimisation [Part4] [04 Structured Query Language (SQL) ]
- Integrity Constraints [04 Structured Query Language (SQL) ]
- Trigger [04 Structured Query Language (SQL) ]
- Normalization and first normal form 1NF [05 – Relational-Database Design]
- Second Normal Form 2NF example [05 – Relational-Database Design]
- Third Normal Form 3NF with example [05 – Relational-Database Design]
- BCNF | Boyce Cod Normal Form | with example [05 – Relational-Database Design]
- Canonical Cover [05 – Relational-Database Design]
- Decomposition And Dependency Preservation [05 – Relational-Database Design]
- Concurrency Control [06 Transactions Management and Concurrence]
- Concurrency Control – Lock Based Protocol in DBMS Transaction [06 Transactions Management and Concurrence]
- Timestamp Based Protocol [06 Transactions Management and Concurrence]
- Deadlock Full concept in DBMS transaction management [06 Transactions Management and Concurrence]
- Shadow Paging in Database Recovery [06 Transactions Management and Concurrence]
- Log Based Database Recovery [06 Transactions Management and Concurrence]
- Shadow Copy Technique in Database recovery [06 Transactions Management and Concurrence]
- Transaction State and Acid Properties [06 Transactions Management and Concurrence]
- Transaction Schedule [06 Transactions Management and Concurrence]
- View Serializability [06 Transactions Management and Concurrence]
- Conflict Serializability [06 Transactions Management and Concurrence]
-
Data Structures
- Introduction [ Introduction ]
- Types Of Data Structures [ Introduction ]
- Operations Of Data Structures [ Introduction ]
- Concept Of Abstract Data Type [ Introduction ]
- Arrays – Part 1 [ Introduction ]
- Arrays – Part 2 [ Introduction ]
- Introduction To Stack [ Stacks ]
- Operations Of Stack ADT [ Stacks ]
- Stack Implementation Using Array Part – 1 [ Stacks ]
- Stack Implementation Using Array Part – 2 [ Stacks ]
- Introduction Of Queue [ Queues ]
- Operations Of Queue ADT [ Queues ]
- Queue Implementation Using Array Part – 1 [ Queues ]
- Queue Implementation Using Array Part – 2 [ Queues ]
- Circular Queue Implementation Part – 1 [ Queues ]
- Circular Queue Implementation Part – 2 [ Queues ]
- Introduction To Linked List [ Linked Lists ]
- Array Vs Linked List [ Linked Lists ]
- Linked List Implementation Part – 1 [ Linked Lists ]
- Linked List Implementation Part – 2 [ Linked Lists ]
- Linked List Implementation Part – 3 [ Linked Lists ]
- Linked List Implementation Part – 4 [ Linked Lists ]
- Linked List Implementation Part – 5 [ Linked Lists ]
- Linked List Implementation Part – 6 [ Linked Lists ]
- Stack Implementation Using Linked List – Part 1 [ Linked Lists ]
- Stack Implementation Using Linked List – Part 2 [ Linked Lists ]
- Queue Using Linked List Part – 1 [ Linked Lists ]
- Queue Using Linked List Part – 2 [ Linked Lists ]
- Circular Queue Using Linked List [ Linked Lists ]
- Doubly Linked List – Part 1 [ Linked Lists ]
- Doubly Linked List – Part 2 [ Linked Lists ]
- Doubly Linked List – Part 3 [ Linked Lists ]
- Doubly Linked List – Part 4 [ Linked Lists ]
- Doubly Linked List – Part 5 [ Linked Lists ]
- Introduction to Tree Data Structure & Binary Tree [ Trees ]
- Binary Tree Implementation Part 1 – Insertion & Traversing [ Trees ]
- Binary Tree Implementation Part 2 – Traversing & Deletion [ Trees ]
- Binary tree Traversal [ Trees ]
- Tree traversal methods: Pre, post and in-order traversal [ Trees ]
- (Binary Search Tree) – Traverse the Tree in In-Order, Pre-Order and Post-Order [ Trees ]
- Height Balaced Binary Search Tree [ Trees ]
- AVL Tree [ Trees ]
- AVL Tree Solved Example – #1 [ Trees ]
- AVL Tree Solved Example – #2 [ Trees ]
- B-Tree Introduction [ Trees ]
- B-Tree Solved Example – #1 [ Trees ]
- B-Tree Solved Example – #2 [ Trees ]
- Huffman Coding [ Trees ]
- Graphs Introduction [ Graphs ]
- BFS & DFS – #1 [ Graphs ]
- BFS & DFS – #2 [ Graphs ]
- Topological Sorting [ Graphs ]
- Topological Sorting – Solved Example [ Graphs ]
- Binary Search [ Recursion and Storage Management ]
- Linear Search [ Recursion and Storage Management ]
- Recursion – Winding & Unwinding [ Recursion and Storage Management ]
- Introduction to Buddy System [ Recursion and Storage Management ]
- Problems on Buddy System [ Recursion and Storage Management ]
- Hashing Collision [ Searching & Sorting ]
- Hashing concept [ Searching & Sorting ]
- Linear Probing – #1 [ Searching & Sorting ]
- Linear Probing – #2 [ Searching & Sorting ]
- Linear Probing With Collisions – Solved [ Searching & Sorting ]
- Linear + Quadratic Probing – Solved Example [ Searching & Sorting ]
- Searching & Sorting Introduction [ Searching & Sorting ]
- Selection Sorting – #1 [ Searching & Sorting ]
- Selection Sorting – #2 [ Searching & Sorting ]
- Insertion Sort – #1 [ Searching & Sorting ]
- Insertion Sort – #2 [ Searching & Sorting ]
- Merge Sort – #1 [ Searching & Sorting ]
- Merge Sort – #2 [ Searching & Sorting ]
- Merge Sort – #3 [ Searching & Sorting ]
- Quick Sort – #1 [ Searching & Sorting ]
- Quick Sort – #2 [ Searching & Sorting ]
- Radix Sort – #1 [ Searching & Sorting ]
- Radix Sort – #2 [ Searching & Sorting ]
- Heap Data Structure [ Applications of Data Structures ]
- Min & Max Heap [ Applications of Data Structures ]
- Infix Notation & Conversion [ Applications of Data Structures ]
- Prefix, Postfix Notation & Conversion [ Applications of Data Structures ]
- Prim’s & Kruskal’s #1 [ Applications of Data Structures ]
- Prim’s & Kruskal’s #2 [ Applications of Data Structures ]
- Stack, Queue & Linked List [ Importance Solutions ]
- Trees [ Importance Solutions ]
- Graphs [ Importance Solutions ]
- Recursion & Storage Management [ Importance Solutions ]
- Searching & Sorting [ Importance Solutions ]
- Application Of Data Structures [ Importance Solutions ]
-
Data Communication and Networking
- Introduction to Computer Networks [01 Introduction to Networks]
- Network Topologies [01 Introduction to Networks]
- Network Connecting Devices [01 Introduction to Networks]
- Connection-Oriented vs Connection-Less Communication [01 Introduction to Networks]
- OSI Reference Model [01 Introduction to Networks]
- TCP-IP Reference Model [01 Introduction to Networks]
- OSI vs TCP-IP Model Comparision [01 Introduction to Networks]
- Network Classification LAN, MAN, WAN [01 Introduction to Networks]
- Virtual Lan’s [01 Introduction to Networks]
- CoAxial Cable [02 Physical Layer]
- Twisted-Pair Cables [02 Physical Layer]
- Transmission Media: Guided and Unguided [Difference] [02 Physical Layer]
- Fiber Optics Part [01] [02 Physical Layer]
- Fiber Optics Part [02] [02 Physical Layer]
- Framing and it’s Methods [03 Data Link Layer]
- Error Detection and its Methods [03 Data Link Layer]
- Hamming Code [03 Data Link Layer]
- Cyclic Redundancy Check Part [01] [03 Data Link Layer]
- Cyclic Redundancy Check Part [02] [03 Data Link Layer]
- Parity Checking and Checksum Error Detection [03 Data Link Layer]
- Flow Control: Stop and Wait and Sliding Window Protocol [03 Data Link Layer]
- Go Back- N ARQ System [03 Data Link Layer]
- SDLC protocol [03 Data Link Layer]
- HDLC protocol [03 Data Link Layer]
- Carrier Sense Multiple Access-Collision Detection Procedure (CSMA-CD) [03 Data Link Layer]
- IP address vs MAC address [04 Network Layer]
- IPv4 Header Format [04 Network Layer]
- IPv4 vs IPv6 [04 Network Layer]
- Routing Algorithms Part 01 [04 Network Layer]
- Routing Algorithms Part 02 [04 Network Layer]
- ARP & RARP [04 Network Layer]
- Leaky Bucket Algorithm [04 Network Layer]
- Token Bucket Algorithm [04 Network Layer]
- Berkeley Sockets [05 Transport Layer]
- User Datagram Protocol [05 Transport Layer]
- Domain Name Server – DNS [06 Application Layer]
- Simple Mail Transfer Protocol – SMTP [06 Application Layer]
- Hypertext Transfer Protocol – HTTP [06 Application Layer]
- File Transfer Protocol – FTP [06 Application Layer]
- Network Security Management [07 Network Security]
- SNMP v3 Architecture [07 Network Security]
- Network Access Control With Use Cases [07 Network Security]
- IDS and its Types [08 System Security]
- Firewall & types [08 System Security]
- Firewall Design Principles [08 System Security]
- Data Communication and Networking
- Data Communication and Networking Notes
-
Operating System
- Introduction to Operating System [01 Fundamentals of Operating System ]
- Monolithic and Micro Kernel Architecture [01 Fundamentals of Operating System ]
- System Calls and Its Types [01 Fundamentals of Operating System ]
- PCB (Process Control Block) [02 Process Management]
- Process State Transition Diagram [02 Process Management]
- Threading and Multi-Threading [02 Process Management]
- Scheduler and Types of Process Scheduling Algorithm [02 Process Management]
- Critical Section Problem [03 Process Coordination]
- Dead Lock Recovery [03 Process Coordination]
- Dining philosopher Problem [03 Process Coordination]
- Deadlock in Operating System [03 Process Coordination]
- Semaphore Producer Consumer Problem [03 Process Coordination]
- Memory Management & Partitioning [04 Memory Management]
- Memeory Allocation Techniques [04 Memory Management]
- Paging & TLB [04 Memory Management]
- File Managment File System [05 Operating System]
- Disk Allocation Methods [05 Operating System]
- Modern Operating System [06 Special Purpose Operating System]
- Network Operating System [06 Special Purpose Operating System]
- Mobile Operating System [06 Special Purpose Operating System]
- Real Time Operating System [06 Special Purpose Operating System]
- Input Output Management
-
Software Engineering
- Introduction To Software Engineering [01 Introduction to SEPM]
- Process Framework Models [01 Introduction to SEPM]
- Capability Maturity Model (CMM) [01 Introduction to SEPM]
- Waterfall Model [01 Introduction to SEPM]
- Iterative Model [01 Introduction to SEPM]
- Agile Development Process [01 Introduction to SEPM]
- Extreme Programming [01 Introduction to SEPM]
- Schedule Slippage & Cost Slippage [01 Introduction to SEPM]
- SCRUM [01 Introduction to SEPM]
- Verification & Validation [01 Introduction to SEPM]
- Data Flow Diagram [02 Software Requirements Analysis ]
- srs [02 Software Requirements Analysis ]
- SRS Example [02 Software Requirements Analysis ]
- SRS Characteristics [02 Software Requirements Analysis ]
- COCOMO (Constructive Cost Model) [03 Software Estimation Metrics]
- Software Measurement & Function Point Analysis [03 Software Estimation Metrics]
- Use-case Diagram [04 Software Design]
- Class Diagram [04 Software Design]
- Sequence Diagram [04 Software Design]
- Component Diagram [04 Software Design]
- Deployment Diagram [04 Software Design]
- Cohesion & Coupling [04 Software Design]
- Object-Oriented [05 Software Testing]
- Integration Testing [05 Software Testing]
- White Box Testing [05 Software Testing]
- Black Box Testing [05 Software Testing]
- Reverse Engineering [05 Software Testing]
- Alpha and Beta testing in software Engineering [05 Software Testing]
- Software Configuration Management [06 Software Quality Assurance]
- Risk Identification [06 Software Quality Assurance]
- RMMM [06 Software Quality Assurance]
- Change Control [06 Software Quality Assurance]
- Version Control [06 Software Quality Assurance]
- Formal Technical Review (FTR) [06 Software Quality Assurance]
- Maintenance in Software Engineering [06 Software Quality Assurance]
- Service-Oriented Architecture [06 Software Quality Assurance]
-
Computer Organization and Microprocessor
- Introduction [01 Introduction ]
- Von Neumann Architecture [01 Introduction ]
- Memory And It’s Characteristics [02 Memory]
- DRAM [02 Memory]
- SRAM [02 Memory]
- Memory Hierarchy And Locality Of Reference [02 Memory]
- Cache Memory [02 Memory]
- Cache Coherence [02 Memory]
- Cache Coherence Strategies [02 Memory]
- MESI Protocol [02 Memory]
- Interleaved Memory [02 Memory]
- Parallel Processing & Applications [02 Memory]
- Data transfer Modes [02 Memory]
- IO Module, Functions, Requirement & Types [03 Input Output]
- Programmed IO [03 Input Output]
- Interrupt Driven IO [03 Input Output]
- DMA Driven IO [03 Input Output]
- Instruction Cycles & Interrupts Mechanism [04 Processor Organization and Architecture]
- Microprogrammed Control Unit [04 Processor Organization and Architecture]
- Hardwired Control Unit [04 Processor Organization and Architecture]
- 8086 Addressing modes [06 Instruction and Types of Instruction]
- Data Transfer Instruction [06 Instruction and Types of Instruction]
- XLAT Translation [06 Instruction and Types of Instruction]
- DAA and AAA Instruction [06 Instruction and Types of Instruction]
- Push and POP instruction [06 Instruction and Types of Instruction]
- String Instruction [06 Instruction and Types of Instruction]
- Logical Operation [06 Instruction and Types of Instruction]
- Arithmetic instructions [06 Instruction and Types of Instruction]
- 8086 Rotate instructions [06 Instruction and Types of Instruction]
- 8086 Branch instructions [06 Instruction and Types of Instruction]
-
OOP's Concept
-
Compiler Design
- System Programming and Compiler Design Introduction
- What is Assembler and Assembly Language
- Forward reference problem
- Assembly language statement
- Macros and Macro-processors
- Loaders
- Linkers
- Compile and go loader, General Loader and Absolute Loader
- Subroutine Linkage, Relocating Loader and Direct Link Loader
- Dynamic Loading Loader, Dynamic Linking Loader and Linkage Editor_1
- Phases of compiler
-
Previous Year Question Papers
- 2023 – 2024 PYQ – English Prelims
- 2023 – 2024 PYQ – Quantitative Prelims
- 2023 – 2024 PYQ – Reasoning Prelims
- 2023 – 2024 PYQ – Mains
- 2021-22 – English PYQ Prelims
- 2021-22 – Reasoning PYQ Prelims
- 2021-22 – Quantitative PYQ Prelims
- 2021-22 – PYQ Mains
- 2019-2020 PYQ – Prelims – English
- 2019-2020 PYQ – Prelims – Reasoning
- 2019-2020 PYQ – Prelims – Quantitative
- 2019-2020 PYQ – Mains
Q.1:
In what ratio should two varieties of sugar of Rs.18 per kg and Rs.24 kg be mixed together to get a mixture whose cost is Rs.20 per kg?
| A) 1:3 | B) 3:1 |
| C) 1:2 | D) 2:1 |
Answer & Explanation
Q.2:
In what ratio must a grocer mix two varieties of pulses costing Rs. 15 and Rs. 20 per kg respectively so as to get a mixture worth Rs. 16.50 kg?
| A) 3 : 7 | B) 5 : 7 |
| C) 7 : 3 | D) 7 : 5 |
Answer & Explanation
Q.3:
The ratio in which the price at Rs.7.20 a kg be mixed with rice at Rs. 5.70 a kg to produce a mixture worth Rs.6.30 a kg is:
| A) 1:3 | B) 2:3 |
| C) 3:4 | D) 4:5 |
Answer & Explanation
Q.4:
In what ratio must a grocer mix teas worth Rs.60 a kg and Rs.65 a kg.So that by selling the mixture at Rs. 68.20 a kg, He may gain 10%?
| A) 3:2 | B) 3:4 |
| C) 3:5 | D) 4:5 |
Answer & Explanation
Q.5:
How many kg of Sugar at 50 P per kg must a man mix with 25 kg of sugar at 34P per kg so that by selling the mixture at 44P per kg he gains 10% on the outlay?
| A) 10 kg | B) 15 kg |
| C) 20 kg | D) 18 kg |
Answer & Explanation
Q.6:
How much sugar at Rs. 9.5 a kg should be added to 17 kg of tea at Rs. 20 a kg so that the mixture be worth Rs. 13 a kg.?
| A) 11 kg | B) 17 kg |
| C) 21 kg | D) 34 kg |
Answer & Explanation
Q.7:
How many kg of custard powder costing Rs. 42 per kg must be mixed with 16 kg of custard powder costing Rs. 60 per kg so that 20 % may be gained by selling the mixture at Rs. 60 per kg?
| A) 11 kg | B) 14 kg |
| C) 12 kg | D) 20 kg |
Answer & Explanation
Q.8:
How much chicory at Rs. 5 a kg should be added to 20 kg of coffee at Rs. 12 a kg so that the mixture be worth Rs. 7.50 a kg.?
| A) 21 kg | B) 15 kg |
| C) 36 kg | D) 42 kg |
Answer & Explanation
Q.9:
Cost of two types of pulses is Rs.15 and Rs, 20 per kg, respectively. If both the pulses are mixed together in the ratio 2:3, then what should be the price of mixed variety of pulses per kg?
| A) Rs. 22 per kg | B) Rs. 30 per kg |
| C) Rs. 10 per kg | D) Rs. 18 per kg |
Answer & Explanation
Q.10:
A dealer has 1000 kg sugar and he sells a part of it at 8% profit and the rest of it at 18% profit. The overall profit he earns is 14%. What is the quantity which is sold at 18% profit?
| A) 250 kg | B) 600 kg |
| C) 620 kg | D) 400 kg |
Answer & Explanation
Q.11:
A mixture of 150 liters of wine and water contains 20% water. How much more water should be added so that water becomes 25% of the new mixture?
| A) 7 liters | B) 15 liters |
| C) 10 liters | D) 9 liters |
Answer & Explanation
Q.12:
How many liters of oil at Rs.40 per liter should be mixed with 240 liters of a second variety of oil at Rs.60 per liter so as to get a mixture whose cost is Rs.52 per liter?
| A) 120 liters | B) 180 liters |
| C) 110 liters | D) 160 liters |
Answer & Explanation
Q.13:
In a can, there is a mixture of milk and water in the ratio 4 : 5. If it is filled with an additional 8 litres of milk the can would be full and ratio of milk and water would become 6 : 5. Find the capacity of the can?
| A) 40 | B) 44 |
| C) 48 | D) 52 |
Answer & Explanation
Q.14:
A container contains 40 litres of milk. From this container 4 litres of milk was taken out and replaced by water. This process was repeated further two times. How much milk is now contained by the container?
| A) 26.34 Litre | B) 27.36 Litre |
| C) 28 Litre | D) 29.16 Litre |
Answer & Explanation
Q.15:
A mixture of 70 litres of milk and water contains 10% water. How many litres of water should be added to the mixture so that the mixture contains 12 1/2% water?
| A) 2 | B) 8 |
| C) 4 | D) 5 |
Answer & Explanation
Q.16:
Five litres of wine is removed from a cask full of wine and is replaced with water. Five litres of this mixture is then removed and replaced with water. If the ratio of wine to water in the cask is now 16 : 9, how much wine did the cask hold ?
| A) 25 litres | B) 50 litres |
| C) 100 litres | D) 150 litres |
Answer & Explanation
Q.17:
In a mixture of milk and water, there is only 26% water. After replacing the mixture with 7 liters of pure milk , the percentage of milk in the mixture become 76%. The quantity of mixture is:
| A) 65 liters | B) 91 liters |
| C) 38 liters | D) None of these |
Answer & Explanation
Q.18:
Two vessels P and Q contain 62.5% and 87.5% of alcohol respectively. If 2 litres from vessel P is mixed with 4 litres from vessel Q, the ratio of alcohol and water in the resulting mixture is?
| A) 16 : 5 | B) 14 : 5 |
| C) 16 : 7 | D) 19 : 5 |
Answer & Explanation
Q.19:
In what ratio must water be mixed with milk to gain 16 2/3 % by selling the mixture at cost price?
| A) 1:6 | B) 2:3 |
| C)4:3 | D) 6:1 |
Answer & Explanation
Q.20:
How much water must be added to a bucket which contains 40 liters of milk at the cost price of Rs.3.50 per liter so that the cost of milk reduces to Rs.2 per liter?
| A) 25 liters | B) 28 litres |
| C) 30 liters | D) 35 liters |
Answer & Explanation