What is Data Structure?

A data structure is a specialized format for organizing, processing, retrieving and storing data. There are several basic and advanced types of data structures, all designed to arrange data to suit a specific purpose. Data structures make it easy for users to access and work with the data they need in appropriate ways. Most importantly, data structures frame the organization of information so that machines and humans can better understand it.

In computer science and computer programming, a data structure may be selected or designed to store data for the purpose of using it with various algorithms. In some cases, the algorithm’s basic operations are tightly coupled to the data structure’s design. Each data structure contains information about the data values, relationships between the data and — in some cases — functions that can be applied to the data.

Data Structure tutorial includes all topics of Data Structure such as Array, Pointer, Structure, Linked List, Stack, Queue, Graph, Searching, Sorting, Programs, etc.

Why are data structures important?

Typical base data types, such as integers or floating-point values, that are available in most computer programming languages are generally insufficient to capture the logical intent for data processing and use. Yet applications that ingest, manipulate and produce information must understand how data should be organized to simplify processing. Data structures bring together the data elements in a logical way and facilitate the effective use, persistence and sharing of data. They provide a formal model that describes the way the data elements are organized.

Data Structures points
Arrays	Queues
Linked Lists	Trees
Tries	Hash Tables
Graphs	Stacks

Trees

A tree is a hierarchical data structure consisting of vertices (nodes) and edges that connect them. Trees are similar to graphs, but the key point that differentiates a tree from the graph is that a cycle cannot exist in a tree.

Data Structure mcq and answer :-

1)…………… is not the component of data structure.?
A. Operations
B. Storage Structures
C.Algorithms
D.None of above
Ans: D

2)……… is very useful in situation when data have to stored and then retrieved in reverse order.?
A. Stack
B. Queue
C. List
D.Link list
Ans: A

3)Which is/are the application(s) of stack?
A. Function calls
B. Large number Arithmetic
C. Evaluation of arithmetic expressions
D. All of the above
Ans: D

4)The number of comparisons done by sequential search is ……………?
A. (N/2)+1
B. (N+1)/2
C. (N-1)/2
D. (N+2)/2
Ans: B

5) Which of the following is not the internal sort?
A.Insertion Sort
B. Bubble Sort
C. Merge Sort
D. Heap Sort
Ans:C

Data Structure Objective type Questions with Answers

6)The dummy header in linked list contain….. ?
A. first record of the actual data
B. last record of the actual data
C. pointer to the last record of the actual data
D. middle record of the actual data
Ans:A

7) ………. refers to a linear collection of data items.?
A. List
B. Tree
C. Graph
D. Edge
Ans:A

8)The list which has its own pointer is called……..
A. pointer list
B. self pointer
C. free pool
D. own pointer
Ans: C

9) Finding the location of a given item in a collection of items is called……
A. Discovering
B. Finding
C. Searching
D. Mining
Ans:C

10) The easiest sorting is…….. ?
A. quick sort
B. shell sort
C. heap sort
D. selection sort
Ans: D