Basic CS-Data Structures [3i Infotech Placement]: Sample Questions 26 - 28 of 52

Glide to success with Doorsteptutor material for competitive exams : get questions, notes, tests, video lectures and more- for all subjects of your exam.

Question 26

Data Structures
Edit

Describe in Detail

Essay▾

How many different trees are possible with 10 nodes?

Explanation

1014 different trees are possible with 10 nodes?

Consider a tree with 3 nodes (n = 3)

Maximum combination has 5 different (i.e., ) trees.

Five Different Trees

If n node, there exist different trees.

Question 27

Data Structures
Edit

Describe in Detail

Essay▾

In RDBMS, what is the efficient data structure used in the internal storage representation.

Explanation

In RDBMS, B + tree structure is the efficient data structure used in the internal storage representation.

B + Tree

Understanding of B + Tree
  • A “B + tree” is an n-array tree with a node, which consists of a large number of children per node.
  • Root is a leaf or a node containing more than two children- consists of a root internal nodes and leaves.
  • Same as a B tree, difference is that B + tree is an additional level added at bottom with leaves.
  • Primary value of the B + tree is in storing and maintaining the data.
  • Provides an efficient housing data structure format, which makes them simple in accessing and storing- Useful as database system index.

Question 28

Data Structures
Edit

Describe in Detail

Essay▾

What is data structure?

Explanation

Types of Data Structure

Data structure is:

  • A specialized format for organizing and storing data that considers not only the items stored, but their relationship to each other.
  • Knowledge about the relationship between data items results in efficient algorithms for the manipulation of data.
  • Eg, we have data player ′ s name ″ Hardik ′ and age 25.
  • Here, “Hardik” is of string data type and 25 is of integer data type.
  • We can organize this data record like player record.
  • Ex. “Dhoni” 28, “Gambhir” 31

Types of Data Structure Are

  • Linear data structure
  • Non-linear data structure

Linear Data Structure:

  • Used if elements combine to form any specific order.
  • Two techniques of representing linear structure within memory.
    • Provide the linear relationships among all the elements represented by linear memory location.
    • Provide the linear relationship among all the elements represented by using the concept of pointers or links.

Ex. of linear data structure:

  • Arrays
  • Queues
  • Stack
  • Linked lists

Non-linear data structure:

  • This structure is mostly used for representing data containing a hierarchical relationship among various elements.

Ex. of Non Linear Data Structure is listed below:

  • Graphs
  • Family of trees
  • Table of contents

Developed by: