MEDIUM
Earn 100

What are the various operations that can be performed on different Data Structures?

50% studentsanswered this correctly

Important Questions on Data Structure

HARD
The extra key inserted at the end of the array is called a _____.
MEDIUM
An adjacency matrix representation of a graph cannot contain information of ______.
MEDIUM
Which of the following statement is/are correct about Linked List data structure when it is compared with array:
HARD
Which of the following data structure store the homogeneous data elements?
EASY
Each array declaration need not give, implicitly or explicitly the information about
MEDIUM
In the previous question after the operation argv++, the value of argv [1][2] will be:
HARD

The hash function:

hash: key mod size

and linear probing is used to insert the keys 37, 38, 72, 48, 98, 11, 56 into the hash table with indices 0 ..... 6..

The order of the keys in the array are given by:

HARD
Which of the following data structure is linear data structure?
HARD
What is the time complexity of inserting at the end in dynamic arrays?
HARD
Locality of reference implies that the page reference being made by a process _____.
EASY
The memory address of tenth element of an array can be calculated by the formula
HARD
The memory address of the fifth element of an array can be calculated by which of the following formula?
HARD
The difference between Linear array and a record is _____.
MEDIUM
Consider the following command that invokes the executable file a.out with the following command-line arguments:
"a.out" God loves you Argv [1][2] corresponds to the character_____.
HARD
What is the condition specify when a variable P is called as pointer?
HARD
What is the term used for the largest element of an array index?