0

Data Structure

Description: IT Companies placement papers preparation test and data structure practice test
Number of Questions: 25
Created by:
Tags: IT INFORMATION TECHNOLOGY COMPUTER DATA STRUCTURE C Placement Papers Data Structure Test HCL placement Papers Infosys Placement Papers Gates Truth Table and Basic Logic Gates IT Companies
Attempted 0/25 Correct 0 Score 0

Null pointer is used to tell which of the following?

  1. End of link list

  2. Empty pointer field of structure

  3. The link list is empty

  4. None of these


Correct Option: A

P is a pointer to the structure. A member “mem” of that structure is referenced by

  1. *p.mem

  2. (*p).mem

  3. *(p.mem)

  4. None of these


Correct Option: B

The prefix expression for the infix expression a*(b+c)/e-f is

  1. /*+bc-ef

  2. -/*+abcef

  3. -/*a+bcef

  4. None of these


Correct Option: C

A stack can be used to

  1. allocate resources by the operating system

  2. schedule jobs on round-robin basis

  3. process procedure call in program

  4. none of these


Correct Option: C
Explanation:

 Stack is an abstract data type that serves as a collection of elements, with two principal operations: push, which adds an element to the collection, and pop, which removes the last element that was added.So It can be used to process procedure call in program.

In link list, a node contains at least

  1. node address field

  2. data field

  3. next address field

  4. none of these


Correct Option: C

In 'C', malloc ( ) function returns a pointer to

  1. Integer

  2. Character

  3. Structure

  4. String


Correct Option: A

The total number of comparisons in bubble sort is

  1. o(n)2

  2. o(n2)

  3. o(2n)

  4. None of these


Correct Option: B

Degree of a vertex is

  1. Number of a edges which has that vertex as an endpoint

  2. The number of neighbors if has

  3. Both (1) and (2)

  4. None of the above


Correct Option: C

A tree consists of

  1. finite number of nodes

  2. finite set of directed access

  3. both (1) and (2)

  4. none of these


Correct Option: A

Which among the following is not a representation of graph?

  1. Adjacency matrix

  2. Edge list

  3. Adjacency list

  4. None of these


Correct Option: B

The criterian for data structure evolution is

  1. Space utilization

  2. Time efficiency

  3. Both (1) and (2)

  4. None of these


Correct Option: C

Pick up the invalid data structure operation from the following.

  1. Traversing

  2. Searching

  3. Merging

  4. None of these


Correct Option: D

Pick up non dynamic data structure from the following.

  1. List

  2. Stack

  3. Tree

  4. None of these


Correct Option: D

Which data structures are used to evaluate a postfix expression?

  1. Stacks

  2. Queues

  3. Dequeues

  4. None of these


Correct Option: A

Memory allocation at the run time is known as

  1. Static memory allocation

  2. Dynamic memory allocation

  3. Paging

  4. None of these


Correct Option: B

What is the level of root node of a tree?

  1. -1

  2. 0

  3. 1

  4. None of these


Correct Option: B

“Get a Node, store new element and Insert the new node at the top” refers to insert operation in non empty

  1. Stack

  2. Queue

  3. Array

  4. None of these


Correct Option: A

The tree traversal technique in which the root is traversed before its children is known as

  1. Post-order traversal

  2. Pre-order traversal

  3. In-order traversal

  4. None of these


Correct Option: B

Memory allocation at the compile time is known as

  1. Static memory allocation

  2. Dynamic memory allocation

  3. Paging

  4. None of these


Correct Option: A

In which of the following trees balance factor of each node be either of 1, -1or 0?

  1. Threaded tree

  2. Lexical ordered binary tree

  3. AVL tree

  4. None of these


Correct Option: C

Which of the following is an example of linear data structure?

  1. Linked list

  2. Binary tree

  3. Graph

  4. None of these


Correct Option: A

Which of the following is a hash function?

  1. Folding

  2. Quadratic Probing

  3. Chaining

  4. Open addressing


Correct Option: A

A vertex with degree one in a graph is called

  1. Leaf

  2. Pendent vertex

  3. End vertex

  4. None of these


Correct Option: B

Following data structure can filter from overflow problem

  1. Stack Implemented using array

  2. Linked list

  3. Circularly linked list

  4. None of these


Correct Option: A

“FRONT=REAR” pointer refers to empty

  1. Stack

  2. Queue

  3. Arrays

  4. None of these


Correct Option: B
- Hide questions