Series: Subject: Topic:

# Algorithm Questions

Showing Algorithm Questions Related Tutorials 1 to 20

### C Algorithms - Dijkstra's Algorithm

Published at Exforsys.com | Last updated on: Sep 17th, 2011

This algorithm is a graph search algorithm that solves the shortest path problem for a graph. In the graph, the path between vertices has a cost or a length, so Dijkstra's algorithm simply determines the path with the lowest cost between a vertex and another. The algorithm ends when the shortest...

### C Algorithms - Breadth-First Search (BFS)

Published at Exforsys.com | Last updated on: Sep 16th, 2011

Depth-first search (DFS) and breadth-first search (BFS) are two algorithms for traversing a graph. A breadth-first search (BFS) begins at the root node and explores all the neighboring nodes. Then for each of those nearest nodes, it explores their unexplored neighbor nodes, and so on, until it...

### C Algorithms - Quick Sort

Published at Exforsys.com | Last updated on: Sep 13th, 2011

Quick sort is a comparison sort developed by Tony Hoare. Also, like merge sort, it is a divide and conquer algorithm, and just like merge sort, it uses recursion to sort the lists. It uses a pivot chosen by the programmer, and passes through the sorting list and on a certain condition, it sorts...

### C Algorithms - Depth-First Search (DFS)

Published at Exforsys.com | Last updated on: Sep 16th, 2011

Depth-first search (DFS) and breadth-first search (BFS) are two algorithms for traversing a graph. Graph traversal refers to the problem of visiting all the nodes in a graph in a particular manner. Each node may have to be visited more than once, and a root-like node that connects to all other...

### C Algorithms - Counting Sort

Published at Exforsys.com | Last updated on: Sep 12th, 2011

Counting sort is a sorting algorithm that is not based on comparison like most other methods. This method of sorting is used when all elements to be sorted fall in a known, finite and reasonably small range. How it works: The algorithm refers to finding for each element a[i] the number of elements...

### C Algorithms - The Problem of Sorting the Elements

Published at Exforsys.com | Last updated on: Sep 8th, 2011

In this tutorial, I will talk a little about the classification, stability and complexity of each algorithm, more regarding this you can read a little bit lower of this article. Then, the advantages or disadvantages of each algorithm are shown, which should give you the big picture of each algorithm....

### C Algorithms - Topological Sort

Published at Exforsys.com | Last updated on: Sep 15th, 2011

Let us say that the order relation that was defined the in introduction lesson was a partial one, for example: a1 < a0, a1 < a2 < a3. The problem is to determine a list of order, in which if ai < aj then ai will come before aj in the final sorted list . For example, our list could...

### C Algorithms - Graph Theory

Published at Exforsys.com | Last updated on: Sep 15th, 2011

The graph theory refers to the study of graphs. A graph is a mathematical object that captures the notion of connection. For example, you want to connect two or more dots that could be considered a graph. Leonhard Euler is the inventor of graph theory, as he tried to solve the known problem of...

### C Algorithms - Gnome Sort

Published at Exforsys.com | Last updated on: Sep 14th, 2011

Gnome sort is an extremely simple sorting algorithm, very similar to insertion sort. Also, it is another comparison and exchange sort. You could say that it looks like bubble sort, and you would be right. How it works: In gnome sort, two adjacent elements are compared, and if they are in the wrong...

### C Algorithms - Merge Sort

Published at Exforsys.com | Last updated on: Sep 12th, 2011

Merge sort is another comparison based sorting algorithm. Also, it is a divide and conquer algorithm, which means the problem is split into multiple simplest problems and the final solution is represented by putting together all the solutions. How it works: The algorithm divides the unsorted...

### 50 Algorithms Interview Questions

Published at Learn.GeekInterview.com | Last updated on: May 30th, 2005

Algorithms Interview Questions 1 What is the fastest way to count the number of ones in a given number represented in a binary form. You can assume that you have infinte run time memory and the response time should be O(1) always. Can you optimize the memory used? 2 What will be the complexity...

### What is Active Metadata Warehouse

Published at Learn.GeekInterview.com | Last updated on: Dec 10th, 2007

An Active Metadata Warehouse is a repository of Metadata to help speed up data reporting and analyses from an active data warehouse. In its most simple definition, a Metadata is data describing data. Many companies have spent years and billions of dollars trying to cleanse, profile, extract, transform,...

### What is Data Compression

Published at Learn.GeekInterview.com | Last updated on: Jan 23rd, 2008

Data Compression is a method using which the storage space required for storing data is reduced with the help of mathematical techniques.  Data compression is also referred to as source coding. This is the process of encoding data information using as few bits as possible compared to the unencoded...

### On-Line Analytical Processing

Published at Learn.GeekInterview.com | Last updated on: Dec 15th, 2007

On-Line Analytical Processing On-Line Analytical Processing is a processing that supports the analysis of business trends and projections. It is also known as decision support processing and OLAP.  An OLAP software enables companies to have real-time analysis of data stored in a database. An OLAP...

Published at Learn.GeekInterview.com | Last updated on: Dec 15th, 2007

Operational Metadata are metadata about operational data. Metadata is basically a kind of data that describes another data, content item or another collection of data which includes multiple content items. Its main purpose is to facilitate better understanding, use and management of data. The use...

### Centralized Data Warehouse

Published at Learn.GeekInterview.com | Last updated on: Dec 18th, 2007

A Centralized Data Warehouse is a data warehousing implementation wherein a single data warehouse serves the needs of several separate business unites simultaneously using a single data model that spans the needs of multiple business divisions. Today, having information means having power. In any...

### What is Access Path

Published at Learn.GeekInterview.com | Last updated on: Jan 9th, 2008

In relational database management system (RDBMS) terminology, Access Path refers to the path chosen by the system to retrieve data after a structured query language (SQL) request is executed. A query may request at least one variable to be filled up with one value or more. A query may look like this: SELECT...

### What is Data Cluster

Published at Learn.GeekInterview.com | Last updated on: Jan 19th, 2008

Clustering in the computer science world is the classification of data or object into different groups. It can also be referred to as partitioning of a data set into different subsets. Each data in the subset ideally shares some common traits. Data cluster are created to meet specific requirements that...

### What is Data Exploration

Published at Learn.GeekInterview.com | Last updated on: Feb 10th, 2009

Data exploration is a common process in data warehouses which are characterized by large bulks of data coming from disparate systems. Since these systems can have data in different formats and sources also, when data converge in a central data warehouses, it may be a very difficult task to get the relevant...

### What is Data Collection

Published at Learn.GeekInterview.com | Last updated on: Mar 11th, 2008

A database can be vast shared collection composed of data which are logically related to each other. Businesses rely heavily on data as they are Databases are used for managing the business day to day tasks so Data Collection happens every single day. Collection of data may seem a simple and trivial...