# Data structure- Linear Data Structures / List Sample Test,Sample questions

1. End list.

2.Zero list.

3.Null list.

4.Sentinel list.

1. n.

2.n+1.

3.n+2

4.n-1.

## Question: ` A vertex of degree one is called __________`

2.isolated vertex

3.null vertex

4.colored vertex

## Question: ` An edge E is called _________ if it has identical endpoints.`

1.multiple edges.

2.loops

3.finite

4.digraph

## Question: ` Divide and conquer is an important algorithm design paradigm based on _______.`

1. multi-branched recursion.

2.single-branched recursion

3. two-way recursion

4.None.

## Question: ` Each entry in a linked list is a called a_______________.`

2.Node

3. Data Structure

4.Avail

## Question: ` In a graph G if e=(u,v), then u and v are called ___________.`

1.endpoints.

3.neighbours

4.All of the above

## Question: ` In a linked list the _________field contains the address of next element in the list.`

2.Next element field

3. Start field

4. Info field .

## Question: ` The binary tree that has n leaf nodes. The number of nodes of degree 2 in this tree is`

1. log2N

2.n-1

3.n

4.None of the above

## Question: ` The correctness of a divide and conquer algorithm is usually proved by _________.`

1.mathematical theorem.

2. de-Morgan `s law

3.mat hematical induction

4. none.

1. merge.

2.obstacle

3.overlapping

4.collision

## Question: ` Which of the following is two way lists?`

4.List traversed in two directions.

## Question: `. If every node u in G is adjacent to every other node v in G, A graph is said to be _______.`

1. isolate.

2.complete

3.finite

4.Strongly connected.

## Question: `A connected graph T without any cycles is called _____________.`

1. a tree graph.

2. free tree.

3.a tree.

4.All of the above

## Question: `An algorithm that calls itself directly or indirectly is known as ____________.`

1.Sub algorithm.

2.Recursion

3.Polish notation.

4.Traversal algorithm.

## Question: `How do you instantiate an array in Java?`

1.int arr[] = new int(3);

2. int arr[];

3.int arr[] = new int[3];

4.. int arr() = new int(3);

1.1

2.2

3.3

4.6

1. recursion.

2.traversal

3.heaps

4.queues

## Question: `Selection sort and quick sort both fall into the same category of sorting algorithms._________ is thatcategory.`

1.O(n log n) sorts.

2.Divide-and-conquer sorts

3.Interchange sorts.

1.log n.

2.n-1/2.

3. n/2.

4.n+1/2.

1. hierarchical.

2.procedural

3.indexed

4.leveled

1.Algorithm.

2.Tree

3.Problem

4.Graph

## Question: `The efficient searching algorithm for algorithm for a sorted array is _________.`

1. Binary search.

2. Linear search

3. Indexed search

4. Repeated search.

## Question: `The sequence (1,1) (2,1) (3,1) (1,2) (2,2) (3,2) . . . .represents _________.`

1. row major order.

2.column major order.

3.random order.

4.successive order.

## Question: `The special list which consists of unused memory space is called __________.`

1. Free space.

2.Empty space.

3.. Available space.

4. Free storage list.

1. Heap sort.

2.Quick sort.

3.Merge sort.

## Question: `To insert a new node in linked list free node will be available in ___________.`

1.Available list.

2.Avail list.

3. Free node list.

4. Memory space list.

## Question: `Uniform distribution of the hash address throughout the given set L is _________`

1. reduce the number of collision.

2.increase the number of collision.

3.totally avoid collision

1. int[] arr;

2. int arr[[]];

3.int[][]arr;

4. int[[]] arr;

## Question: `Which of the following is true while inserting a new node in the list?`

1.Check there is node in the list.

2.Check in the free node in the pool.

3.There is no node

4.Underflow

## Question: `___ is finding a path/tour through the graph such that every vertex is visited exactly once.`

1. Travelling Salesman tour.

2. Eulerian tour.

3.Hamiltonian tour.

4.None of These

1.pre-order

2.post-order

3.prefix

4. in-order

1.Array.

3.Queue

4.Stack

1.Arranging.

2.Bonding

3.Combing

4.Chaining

## More MCQS

##### Olete Team
Online Exam TestTop Tutorials are Core Java,Hibernate ,Spring,Sturts.The content on Online Exam Testwebsite is done by expert team not only with the help of books but along with the strong professional knowledge in all context like coding,designing, marketing,etc!