Scribd
Upload
24 views

Data Structures Important Questions

Uploaded by

udyadav430
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
24 views

Data Structures Important Questions

Uploaded by

udyadav430
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/ 2

Data Structures Important Questions

DATA STRUCTURE
> What is abstract data type? explain with the help of example.
> Differentiate array and linked list.
> What is the application of linked list and also write the algorithm how to add
two polynomials using LinkedIn list.
> Write a program in c to insert a node at any specified position in doubly linked
list.
> What is the difference between data and information?give one example.
> How to represent 2-D array in memory? Explain with the help of example.
> Write an algorithm to convert infix expression into postfix from using
stack.Also evaluate the given postfix from using stack.
239*+23^-62/+
> Write a program in C to implementation of queue .
> What are the difference between
1. Height and depth
2. Order and degree
> Show that the maximum number of nodes in a binary tree of height h is
2^h+1--1.
> Construct the steps to configure a B-tree of order 5 for the following data:
78,21,11,97,85,74,63,45,42,57,20,16,19,32,30,31.
> Explain Dijkstra Algorithm with the help of example.
> Write a heap sort algorithm. Use heap sort algorithm to sort the following
element
DATA STRUCTURES.
> Differentiate internal sorting and external sorting.Also enlists the name of two
sorting techniques of each.
> Binary search is more efficient than linear search . Justify your answer.
> Write a short note on hashing and indexing.
> Describe Asymptotic notation in detail.
> What is recursion ? Explain in detail with example.
> Write short notes:-
1. Garbage collection
2. Backtracking
> Give the solution for the following recurrence
T(n)=2T[n/2]+ n login
> What do you understand about graph ? How the graph represented in memory
> Write the algorithm of insertion sort and find its time complexity.

You might also like