Scribd
Upload
319 views

List of Algorithms Interview Questions

An algorithm is a self-contained step-by-step set of operations to be performed. It is an effective method that can be expressed within a finite amount of space and time. searching sorting Recursive algorithms Backtracking algorithms Divide and conquer algorithms Bit Algorithms Dynamic programming algorithms Greedy algorithms Branch and bound algorithms Brute force algorithms Randomized algorithms

Uploaded by

Sivaselvi R
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
319 views

List of Algorithms Interview Questions

An algorithm is a self-contained step-by-step set of operations to be performed. It is an effective method that can be expressed within a finite amount of space and time. searching sorting Recursive algorithms Backtracking algorithms Divide and conquer algorithms Bit Algorithms Dynamic programming algorithms Greedy algorithms Branch and bound algorithms Brute force algorithms Randomized algorithms

Uploaded by

Sivaselvi R
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 9

Sivaselvi Ramasamy

List of Algorithm Type

searching
sorting
Recursive algorithms
Backtracking algorithms
Divide and conquer algorithms
Bit Algorithms
Dynamic programming algorithms
Greedy algorithms
Branch and bound algorithms
Brute force algorithms
Randomized algorithms
Visit http://careerdrill.com (Career Management)

Algorithm
An algorithm is a self-contained step-by-step set of

operations to be performed. It is an effective


method that can be expressed within a finite
amount of space and time.
Visit http://careerdrill.com/AlgorithmList.php
Visit http://careerdrill.com (Career Management)

Algorithm Source code - 1


Searching

Searching is an algorithm that allows user to retrieve the data according to search criteria.
Visit : http://careerdrill.com/algorithm/17/programming-interview-algorithm-questionsearching
Sorting

Sorting is an algorithm that sorts the elements in the list with ascending or descending order.
Visit: http://careerdrill.com/algorithm/18/programming-interview-algorithm-question-sorting

Recursive algorithms

A recursive algorithm is an algorithm which calls itself with the subset of values.
Visit: http://careerdrill.com/algorithm/19/programming-interview-algorithm-questionrecursive-algorithms
Visit http://careerdrill.com (Career Management)

Algorithm Source code - 2


Backtracking algorithms

Backtracking is an algorithm that considers searching every possible combination in order to solve an
optimization problem.
Visit: http://careerdrill.com/algorithm/20/programming-interview-algorithm-question-backtrackingalgorithms
Divide and conquer algorithms
Divide and conquer algorithm works by recursively breaking down a problem into sub-problems, until
these become simple enough to be solved directly.
Visit: http://careerdrill.com/algorithm/21/programming-interview-algorithm-question-divide-andconquer-algorithms
Bit Algorithms
Bit manipulation is the act of algorithmically manipulating bits or other pieces of data shorter than a word.
Visit: http://careerdrill.com/algorithm/22/programming-interview-algorithm-question-bit-algorithms

Visit http://careerdrill.com (Career Management)

Algorithm Source code - 3


Dynamic programming algorithms

Dynamic programming is a method for solving a complex problem by breaking it


down into a collection of simpler subproblems. If the subproblems have solution save
the result for future reference to avoid solving the same problem again..
Visit: http://careerdrill.com/algorithm/23/programming-interview-algorithm-questiondynamic-programming-algorithms
Greedy algorithms

A greedy algorithm is an algorithm that follows the problem-solving heuristic of


making the locally optimal choice at each stage with the hope of finding a global
optimum.
Visit: http://careerdrill.com/algorithm/24/programming-interview-algorithm-questiongreedy-algorithms
Visit http://careerdrill.com (Career Management)

Algorithm Source code -4


Branch and bound algorithms
Branch and bound is an algorithm design paradigm for discrete and combinatorial optimization problems,
as well as general real-valued problems

Visit: http://careerdrill.com/algorithm/25/programming-interview-algorithm-question-branch-and-boundalgorithms
Brute force algorithms
Brute force algorithm goes through all possible solutions extensively.

Visit: http://careerdrill.com/algorithm/26/programming-interview-algorithm-question-brute-forcealgorithms
Randomized algorithms
A randomized algorithm is an algorithm that employs a degree of randomness as part of its logic.

Visit: http://careerdrill.com/algorithm/27/programming-interview-algorithm-question-randomizedalgorithms

Visit http://careerdrill.com (Career Management)

Data Structure
A data structure is a particular way of organizing data in a computer so
that it can be used efficiently
http://careerdrill.com/DataStructreList.php

Visit http://careerdrill.com (Career Management)

More information
Visit http://www.careerdrill.com
Careerdrill is a web portal that focuses on Career Planning and
Development. It provides the tools to achieve the career goal. Careerdrill
provide technical interview questions in the following areas
Data Structure
Algorithm
Java and C++
SQL
Visit http://careerdrill.com (Career Management)

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