Scribd
Upload
37 views5 pages

Aptitude Questions

Uploaded by

Impan gowda
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
37 views5 pages

Aptitude Questions

Uploaded by

Impan gowda
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 5

APTITUDE QUESTIONS:

Time and Distance


Time and Work
Boats and Streams
Pipes and Cisterns
Profit and Loss
Simple Interest and Compound Interest
Permutation and Combination
Probability
Age Problems
Numbers
Average
Percentage
Ratio and Proportion

Verbal Ability:
Reading Comprehension
Synonyms and Antonyms
Sentence Correction
Para Jumbles

Logical Reasoning:
Puzzles
Seating Arrangements
Blood Relations
Syllogisms
Data Sufficiency

Data Interpretation:
Bar Graphs
Line Charts
Pie Charts
Tables

COADING QUESTIONS:

1. Reverse a String: Write a function to reverse a string.


2. Find the Missing Number: Given an array containing n distinct numbers taken from 0, 1,
2, ..., n, find the one that is missing from the array.
3. Palindrome: Check if a given string is a palindrome or not.
4. Fibonacci Series: Write a function to generate the Fibonacci sequence up to a certain
number of terms.
5. Binary Search: Implement the binary search algorithm to find an element in a sorted
array.
6. Sorting Algorithms: Implement sorting algorithms such as bubble sort, selection sort,
merge sort, or quicksort.
7. Linked Lists: Implement basic operations on linked lists such as insertion, deletion, and
reversing.
8. Tree Traversal: Implement depth-first search (DFS) and breadth-first search (BFS) for
binary trees.
9. Stacks and Queues: Implement basic operations on stacks and queues.
10. Dynamic Programming: Solve problems using dynamic programming techniques such
as the knapsack problem, longest common subsequence, or Fibonacci series.
11. Graph Algorithms: Implement graph traversal algorithms like depth-first search (DFS)
and breadth-first search (BFS), and algorithms like Dijkstra’s shortest path algorithm or
Kruskal’s minimum spanning tree algorithm.
12. Two Sum Problem: Given an array of integers, return indices of the two numbers such
that they add up to a specific target

JAVA script:

1. Basics of JavaScript
- Variables, data types, and operators
- Control flow and loops
- Functions and scope
2. Document Object Model (DOM)
- Manipulating HTML elements with JavaScript
- Event handling and listeners
3. JavaScript in the Browser
- Making AJAX requests and working with APIs
- Promises and asynchronous programming
4. Object-Oriented Programming (OOP) in JavaScript
- Constructors and prototypes
- Inheritance and polymorphism
5. Advanced JavaScript Concepts
- Closures and scope
- Modules and namespaces
- Error handling
6. JavaScript Tools and Libraries
- NPM (Node Package Manager)
- Build tools like Webpack or Grunt
- Popular libraries/frameworks like React or Vue.js
7. Functional Programming in JavaScript
- Higher-order functions
- Immutable data and pure functions
- Functional programming libraries like Lodash or Ramda
8. Testing and Debugging in JavaScript
- Writing unit tests with frameworks like Jest or Mocha
- Debugging techniques and tools
9. Security and Performance Optimization
- Handling cross-site scripting (XSS) attacks
- Code optimization and performance profiling
10. JavaScript on the Backend
- Node.js and Express.js framework
- Working with databases (e.g., MongoDB, Postgres)
- RESTful API development

DSA ROADMAP:

1. Programming Fundamentals

- Variables, data types, and operators


- Control flow (loops, conditionals)
- Functions and modular programming
- Input/output and file handling

2. Basic Data Structures:

- Arrays and dynamic arrays


- Linked lists (singly linked, doubly linked)
- Stacks and queues (array-based, linked list-based)
- Hash tables (hash functions, collision handling)

3. Basic Algorithms:

- Linear search
- Binary search
- Bubble sort
- Insertion sort
- Selection sort

4. Advanced Data Structures:

- Trees (binary trees, binary search trees)


- Balanced trees (AVL trees, red-black trees)
- Heaps (binary heap, priority queue)
- Graphs (representation, traversal)

5. Advanced Algorithms:

- Divide and conquer (merge sort, quick-sort)


- Dynamic programming (Fibonacci sequence, knapsack problem)
- Graph algorithms (breadth-first search, depth-first search)
- Shortest path algorithms (Dijkstra’s algorithm, Bellman-Ford algorithm)

6. Problem Solving and Practice:


- Solving coding problems (LeetCode, HackerRank, Codeforces)
- Algorithmic complexity analysis (time complexity, space complexity)
- Problem-solving techniques (logical reasoning, algorithm design)

7. Algorithmic Techniques:

- Recursion and backtracking


- Greedy algorithms
- Sliding window technique
- Two-pointer technique
- Divide and conquer strategies

8. Optimisation and Advanced Topics:

- Algorithm analysis (asymptotic notation)


- Memoization and dynamic programming optimisation
- Space-time tradeoffs (tradeoff between time and space complexity)
- Additional data structures (heaps, hash tables, advanced graph structures)

9. Practice Projects:

- Implementing data structures and algorithms in practical projects


- Solving real-world problems using algorithms
- Optimising algorithms for efficiency and performance

10. Continued Learning:

- Staying updated on new algorithms and data structures


- Reading books on algorithms and advanced topics
- Exploring research papers and online resources for further learning

ALGORITHMS:-

1. Binary Search
2. QuickSort
3. Merge Sort
4. Bubble Sort
5. Insertion Sort
6. Selection Sort
7. Depth-First Search (DFS)
8. Breadth-First Search (BFS)
9. Dijkstra’s Algorithm
10. Bellman-Ford Algorithm
11. Floyd-Warshall Algorithm
12. Binary Tree Traversal (In-order, Pre-order, Post-order)
13. A* Algorithm
14. Knapsack Problem (Dynamic Programming)
15. Dynamic Programming (e.g., Fibonacci Sequence)
16. Hashing (e.g., Hash Tables)
17. Kruskal’s Algorithm
18. Prim’s Algorithm
19. Bresenham’s Line Algorithm
20. KMP Algorithm
21. Rabin-Karp Algorithm
22. Maximum Subarray Sum (Kadane’s Algorithm)
23. Topological Sorting
24. Ford-Fulkerson Algorithm (Max Flow)
25. Monte Carlo Algorithm

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy