Aptitude Preparation for GATE
I'm a CS student and I'm appearing for GATE exam 2025 conducted by IIT ROORKEE. What topics
should I focus on for scoring full marks in Aptitude section?
The General Aptitude (GA) section of the GATE exam is common to all disciplines and holds a weightage
of 15 marks. It is relatively easy to score well in this section with focused preparation. Here are the key
topics you should focus on to maximize your score:
1. Verbal Ability (7-8 Marks)
English Grammar:
Parts of speech, subject-verb agreement, tenses, articles, prepositions, and modifiers.
Practice error-spotting and sentence correction questions.
Vocabulary:
Synonyms, antonyms, word meanings, and contextual usage.
Learn commonly confused words and idioms/phrases.
Reading Comprehension:
Focus on understanding the main idea, tone, and details in short passages.
Practice questions on inference, summary, and fact-based comprehension.
Sentence Completion:
Practice filling blanks with appropriate words based on context.
Critical Reasoning:
Practice questions on cause-effect relationships, assumptions, conclusions, and
strengthening/weakening arguments.
2. Quantitative Aptitude (7-8 Marks)
Arithmetic:
Ratios and Proportions, Percentages, Profit and Loss, Time and Work, Time, Speed, and
Distance.
Algebra:
Linear and Quadratic Equations, Progressions (AP, GP, HP).
Geometry and Mensuration:
Properties of triangles, circles, polygons, and 2D/3D figures.
Areas, volumes, and surface areas.
Number System:
Divisibility rules, LCM and HCF, Remainder theorem, Prime numbers.
Probability and Permutations/Combinations:
Printed using ChatGPT to PDF, powered by PDFCrowd HTML to PDF API. 1/8
Basic probability, arrangements, and combinations.
Data Interpretation:
Charts, graphs, tables, and caselets-based questions.
Focus on calculation speed and accuracy.
3. Logical Reasoning (2-3 Marks)
Puzzles:
Seating arrangement (linear, circular), blood relations, and scheduling.
Series and Patterns:
Number series, alphabet series, and coding-decoding.
Syllogisms:
Practice Venn diagrams and logical deductions.
Direction Sense and Visual Reasoning:
Direction-based problems and image-based reasoning.
Analogies:
Identify relationships between pairs of words or numbers.
Preparation Tips
1. Practice Regularly:
Solve previous GATE Aptitude questions and take mock tests.
2. Focus on Speed and Accuracy:
The Aptitude section can be completed quickly, but avoid silly mistakes.
3. Refer to Good Resources:
Use books like A Modern Approach to Verbal & Non-Verbal Reasoning by R.S. Aggarwal and
Quantitative Aptitude by Arun Sharma.
4. Time Management:
Allocate 20-25 minutes for the GA section during the exam.
5. Mock Tests and Analysis:
Regularly take full-length mock tests and analyze mistakes to improve.
A good preparation strategy for the GA section can give you a significant edge in scoring high marks in
GATE 2025.
Okay, now explain me the different Addressing modes used in Computer Architecture
Addressing modes in computer architecture define how the operand of an instruction is chosen or
accessed. They play a crucial role in instruction set architecture by enabling the processor to perform
Printed using ChatGPT to PDF, powered by PDFCrowd HTML to PDF API. 2/8
tasks effectively. Below is a detailed explanation of different addressing modes:
1. Immediate Addressing Mode
Definition: The operand is directly specified in the instruction itself.
Example: `MOV A, 10` (Here, 10 is the operand and is directly provided in the instruction.)
Advantage:
Simple and fast as no memory lookup is needed.
Disadvantage:
The size of the operand is limited to the size of the instruction.
2. Register Addressing Mode
Definition: The operand is located in a register within the CPU.
Example: `MOV A, B` (Here, the content of register `B` is moved to register `A`.)
Advantage:
Very fast as it avoids memory access.
Compact instruction size.
Disadvantage:
Limited number of registers restricts the flexibility.
3. Direct Addressing Mode
Definition: The address of the operand is directly specified in the instruction.
Example: `MOV A, 2000` (Here, the content of memory location 2000 is moved to `A`.)
Advantage:
Simple and easy to understand.
Disadvantage:
Requires more memory access, making it slower.
The address size is limited by the instruction length.
4. Indirect Addressing Mode
Definition: The address of the operand is stored in a register or memory location, and the
instruction specifies the location of this address.
Example: `MOV A, (B)` (Here, `B` holds the address of the operand.)
Advantage:
Provides flexibility for accessing large memory.
Disadvantage:
Extra memory access increases execution time.
5. Indexed Addressing Mode
Definition: The effective address of the operand is generated by adding a constant value (index) to
the contents of a register.
Example: `MOV A, 2000(BX)` (Here, `BX` is added to 2000 to calculate the effective address.)
Advantage:
Efficient for accessing arrays.
Printed using ChatGPT to PDF, powered by PDFCrowd HTML to PDF API. 3/8
Disadvantage:
Involves extra calculations, slightly increasing execution time.
6. Base Addressing Mode
Definition: The effective address is generated by adding the content of a base register to an offset
value in the instruction.
Example: `MOV A, BASE+OFFSET` (Here, `BASE` is the content of a register.)
Advantage:
Useful for relocatable code and segmentation.
Disadvantage:
Requires management of the base register.
7. Relative Addressing Mode
Definition: The effective address is determined by adding an offset value to the program counter
(PC).
Example: `JUMP LABEL` (Here, `LABEL` is an offset from the current PC value.)
Advantage:
Efficient for branching instructions.
Disadvantage:
Limited to short-range jumps if offset size is small.
8. Implicit Addressing Mode
Definition: The operand is implicitly specified by the instruction.
Example: `CLR` (Clear accumulator) or `CMA` (Complement accumulator).
Advantage:
Simple and requires fewer bits in the instruction.
Disadvantage:
Very limited in scope.
9. Stack Addressing Mode
Definition: Operands are implicitly assumed to be on the stack, and the operations are performed
at the top of the stack.
Example: `PUSH` or `POP` instructions.
Advantage:
Simplifies expression evaluation and nested subroutine calls.
Disadvantage:
Slower compared to register-based operations due to stack memory access.
Comparison of Addressing Modes
Addressing Mode Memory Access Flexibility Usage
Immediate None Low Constants
Register None Low Fast computations
Printed using ChatGPT to PDF, powered by PDFCrowd HTML to PDF API. 4/8
Addressing Mode Memory Access Flexibility Usage
Direct 1 Memory Medium Simple data access
Indirect 2 Memory High Dynamic memory access
Indexed 1 Memory Medium Arrays and tables
Base 1 Memory High Relocatable code
Relative 1 Memory Medium Branching
Implicit None Low Accumulator-based ops
Stack 1 Memory Medium Subroutine management
Conclusion
Understanding the addressing modes is essential for designing efficient assembly-level programs. Each
mode has its unique advantages and is suited for specific use cases, from basic computations to
complex memory management tasks.
Make a table of various searching sorting algorithms with their respective time complexities in best,
average and worst cases, their space complexities, their properties (like inplace, stable, adaptive,
approach, sorting techniques etc)
Table: Comparison of Searching and Sorting Algorithms
Best Average Worst Space
Algorithm Properties
Case Case Case Complexity
- Sequential search
- Works on both sorted and
Linear Search O(1) O(n) O(n) O(1) unsorted data
- In-place
- Non-adaptive
- Only for sorted data
- Divide and conquer approach
Binary Search O(1) O(log n) O(log n) O(1)
- Not in-place (if recursion used)
- Non-adaptive
- Stable
- In-place
Bubble Sort O(n) O(n²) O(n²) O(1)
- Adaptive
- Compare adjacent elements
- Not stable (unless modified)
- In-place
Selection Sort O(n²) O(n²) O(n²) O(1) - Non-adaptive
- Select the smallest/largest in
each iteration
Insertion Sort O(n) O(n²) O(n²) O(1) - Stable
- In-place
Printed using ChatGPT to PDF, powered by PDFCrowd HTML to PDF API. 5/8
Best Average Worst Space
Algorithm Properties
Case Case Case Complexity
- Adaptive
- Suitable for small datasets
- Stable
O(n log O(n log - Not in-place
Merge Sort O(n log n) O(n)
n) n) - Divide and conquer approach
- Suitable for linked lists
- Not stable
O(n log O(log n) (in- - In-place
Quick Sort O(n log n) O(n²)
n) place) - Divide and conquer approach
- Suitable for large datasets
- Not stable
O(n log O(n log - In-place
Heap Sort O(n log n) O(1)
n) n) - Non-adaptive
- Based on heap data structure
- Stable
- Not in-place
Counting Sort O(n+k) O(n+k) O(n+k) O(k) - Non-adaptive
- Suitable for integers or fixed
range elements
- Stable
- Not in-place
Radix Sort O(nk) O(nk) O(nk) O(n+k)
- Non-adaptive
- Suitable for integers, strings
- Stable (if individual bucket
sorting is stable)
Bucket Sort O(n+k) O(n+k) O(n²) O(n+k) - Not in-place
- Suitable for uniformly
distributed data
- Not stable
- In-place
O(n log
Shell Sort O(n log² n) O(n²) O(1) - Non-adaptive
n)
- Based on insertion sort with
varying gaps
- Stable
- In-place
Binary Insertion O(n log O(n log
O(n log n) O(1) - Adaptive
Sort n) n)
- Uses binary search for insertion
position
- Stable
- Adaptive
O(n log - Combination of merge and
Tim Sort O(n) O(n log n) O(n)
n) insertion sort
- Used in Python's and Java's
standard libraries
Key to Properties:
1. Stable: Does not change the relative order of equal elements.
2. In-place: Does not require extra space (apart from recursion stack, if applicable).
3. Adaptive
Printed using ChatGPT to PDF, powered by PDFCrowd HTML to PDF API. 6/8
Not a tabular form for properties, please make it in tabular format for each specified aspect....
Here is the requested table with properties structured into specific aspects for each searching and
sorting algorithm:
Best Average Worst Space
Algorithm In-Place Stable Adaptive Approach Te
Case Case Case Complexity
Linear
O(1) O(n) O(n) O(1) Yes N/A No Sequential Sea
Search
Binary O(log Yes (if Divide and
O(1) O(log n) O(1) N/A No Sea
Search n) iterative) Conquer
Compare
Bubble
O(n) O(n²) O(n²) O(1) Yes Yes Yes adjacent Exc
Sort
elements
Select
Selection
O(n²) O(n²) O(n²) O(1) Yes No No min/max Sel
Sort
element
Insertion Incremental
O(n) O(n²) O(n²) O(1) Yes Yes Yes Ins
Sort insertion
Merge O(n O(n log O(n Divide and
O(n) No Yes No Me
Sort log n) n) log n) Conquer
Quick O(n O(n log Divide and
O(n²) O(log n) Yes No No Pa
Sort log n) n) Conquer
O(n O(n log O(n Binary heap
Heap Sort O(1) Yes No No Sel
log n) n) log n) properties
Counting Counting No
O(n+k) O(n+k) O(n+k) O(k) No Yes No
Sort frequencies com
Process No
Radix
O(nk) O(nk) O(nk) O(n+k) No Yes No digit-by- com
Sort
digit Sta
Distribute
Bucket
O(n+k) O(n+k) O(n²) O(n+k) No Yes No into Dis
Sort
buckets
Reducing Ins
O(n O(n log²
Shell Sort O(n²) O(1) Yes No No gaps ba
log n) n)
iteratively red
Binary Binary
O(n O(n log O(n
Insertion O(1) Yes Yes Yes search + Ins
log n) n) log n)
Sort insertion
Hybrid
O(n log O(n Op
Tim Sort O(n) O(n) No Yes Yes (merge +
n) log n) me
insertion)
Explanation of Columns:
Printed using ChatGPT to PDF, powered by PDFCrowd HTML to PDF API. 7/8
1. In-Place: Whether the algorithm sorts or searches without using extra space (except recursion or a
small fixed amount).
2. Stable: Retains the relative order of elements with equal keys.
3. Adaptive: Adapts to already sorted or partially sorted data, improving performance.
4. Approach: General working principle or method used by the algorithm.
5. Technique: Specific methodology applied, such as partitioning, merging, or frequency counting.
This table provides a comprehensive comparison of key searching and sorting algorithms based on their
various properties.
Printed using ChatGPT to PDF, powered by PDFCrowd HTML to PDF API. 8/8
