Data structures & Algorithms concepts and implementation

Q: Write a program base on user inputs wich perfor...
Data Structures Using C
What is a data structure?
DATA STRUCTURES
B-Trees
Very Large Files - External Sorting
Trees Comparison
Skip Lists
Red-Black Trees
Binary Search Trees
Dictionaries & Hash Tables
Sorting Algorithms Comparison
Quicksort
Shell Sort
Insertion Sort
Timing Estimates
Linked Lists
Binary Search
Sequential Search
Searching and sorting
Binary Trees
Queues
Conversion Of Expressions Prefix/Postfix/Infix Not...
Linked List
Self Referential Data Structure
The Queue Abstract Data Type
Binary Trees
HEAP AND HEAPSORT ALGORITHM
QUICKSORT ALGORITHM
Data Structures Questions
Data Structures FAQ's
Program to sort list of elements using quick sort....
Program to sort list of elements using heap sort.
Program to show operations in binary tree.
Program to show breadth first search in graph.
Program to show depth first search in graph.
Program to compute shortest path using dijkstras ...
Program to compute mimimum spanning tree using pr...
Basic Data Structure Interview Questions And Answe...
Data Structure aptitude questions.
Source code for converting an Interger into String...
Source code for reversing a string.( charecter by ...
Source code for converting a string to an integer ...
Reversing words from a string( containin more than...
Source code for reversing a singly linked list.
Source code for Finding a Cycle in a singly linked...
Telephone Words
Combinations of a String using recursion.
Permutations of a String using recursion.
Binary Search using recursion.
What is Recursion ? Explain in detail.
Searching M th Element from the end of Linked List...
Fibonacci-Delete
Fabonnacci Heap Cascade-Cut
Fabonacci heap Cut
Decrease-key
Fibonacci-Link
Fibonacci Heap Consolidate
Fibonacci-Heap-Extract-Min
Fibonacci-Heap-Union
Fibonacci-Heap-Insert
Bimomial-Heap-Delete
Decrease-key
Binomial-Heap-Extract-Min
Binomial-Heap-Insert
Binomial-Heap-Union
Heap Binomial-Link
Binomial-Heap-Minimum
Create-Binomial-Heap
Heap-Increase-key
Heap Extract-Maximum
Heap Insert
Build-Heap
Heapify
KMP-Matcher
Compute-Prefix (P)
Rabin-karp-Match
Brute-Force-String Matching
Binary Tree Search
Postorder Tree traversal
Inorder Traversal
Pre Order Traversal
Bucket Sort
Radix sort
Quick Sort
Circular Queues- Deletion of item from circular qu...
Circular Queues- Insertion of item into circular q...
Queues - Deletion of item from queue
Queues - Inserting item into queue
Queues- Is Full - check if queue is full
Queues - Is Exmpty Queue function
Queues - Create Queue function
Floyd-Warshal algorithm for all pairs of shortest ...
Function Bellman-Ford algorithm for shortes path
Dijkstra algorithm for shortest path
Prims Algorithm for minimum spanning tree.
Kruskal Algorithm for Minimum Spanning tree
DFS- Depth First Search
BFS- Breadth First Search
Sequential Search
Towers of Hanoi problem
Fibonacci Series
Factorial
Bubble sort
Merge Sort
Selection Sort
Insertion Sort
Binary Search in Circular Sorted Array. How can we...
What are the advantages of linked lists?
Write an Optimized Binary Search algorithm.
Write an Optimized Binary Search algorithm.
What is a spanning Tree?
25. What are the types of Collision Resolution Tec...
Sort the given values using Quick Sort? 65 70 75...
8. Convert the expression ((A + B) * C – (D – E) ...
Traverese tree in PostOrder
Check if a binary tree is a binary search tree
Technique for Swapping Two Integers Without Using ...
write an O(log2(N)) algorithm to find X^N
Classis Factorial problem & Solution..
Append Element at the end of the Linked List...
Insert element at head position into Linked List.....
Removing Duplecate nodes from a linked list..
How to build an expression trees ?
Explain Sparse Matrix...
What is a priority queue?
What is garbage collection?
Explain Hashing..
Explain AVL Trees.
Explain Radix Sort.
Explain Comparison Trees...
Explain Polish Notation.
Classify the Hashing Functions based on the variou...
What is the data structures used to perform recurs...
Minimum number of queues needed to implement the p...
If you are using C language to implement the heter...
What is a spanning Tree?
Given a binary search tree and a "target" value, s...
Given a binary search tree and a "target" value, s...
Generate a Mirror Image of a tree. Change a tree s...
finding Nth Node in linked list..
Source code for Binary search method
Deletion of linked list
Inserting element into linked list
Reversing a linked list

Data structures questions

What is heap sort?

How to reverse the odd bits of an integer?

Check if the 20th bit of a 32 bit integer is on or off?

How to reverse the bits in an interger?

What purpose do the bitwise and, or, xor and the shift operators serve?

Write a C program to count bits set in an integer?

What is a threaded binary tree?

Write pseudocode to add a new node to a Binary Search Tree (BST)

Implement Breadth First Search (BFS) and Depth First Search (DFS)

A full N-ary tree has M non-leaf nodes, how many leaf nodes does it have?

How many different trees can be constructed using n nodes?

What is an AVL tree?

How do you convert a tree into an array?

Given an expression tree, evaluate the expression and obtain a paranthesized form of the

Find the closest ancestor of two nodes in a tree.

Construct a tree given its inorder and preorder traversal strings. Similarly construct a tree given

C, Data structures and algorithm questions

What is the purpose of a function prototype?

Does C support function overloading?

How can I return multiple values from a function?

Does extern in a function declaration mean anything?

How to declare a pointer to a function?

What are the common causes of pointer bugs?

What is an opaque pointer?

Why is sizeof() an operator and not a function?

What is the difference between malloc() and calloc()?

What are near, far and huge pointers?

What operations are valid on pointers? When does one get the Illegal use of pointer in function

Is *(*(p+i)+j) is equivalent to p[i][j]? Is num[i] == i[num] == *(num + i) == *(i + num)?

What do pointers contain?

What is a dangling pointer? What are reference counters with respect to pointers?

What are brk() and sbrk() used for? How are they different from malloc()?

What is a memory leak?

What is the difference between an array of pointers and a pointer to an array?

What do Segmentation fault, access violation, core dump and Bus error mean?

What is a void pointer? Why can't we perform arithmetic on a void * pointer?

What's the difference between const char *p, char * const p and const char * const p?

What does malloc() , calloc(), realloc(), free() do? What are the common problems with malloc()?

Is the cast to malloc() required at all?

Does an array always get converted to a pointer? What is the difference between arr and &arr?

What is a null pointer assignment error?

What is a NULL pointer? How is it different from an unitialized pointer? How is a NULL pointer

What does *p++ do? Does it increment p or the value pointed by p?

How can I sort things that are too large to bring into memory?

Implement the bubble sort algorithm. How can it be improved? Write the code for selection sort,

Give pseudocode for the mergesort algorithm

What is the difference between Merge Sort and Quick sort?

Data Structures & algorithms Interview Questions And Answers and Frequently Asked Questions( FAQ's) Data Structures Linked list, algorithms,searching

http://datastructurefaqs.blogspot.com/