19. In RDBMS, what is the efficient data structure used in the internal storage representation?
B+ tree. Because in B+ tree, all the data is stored only in leaf nodes, that makes searching easier. This corresponds to the records that shall be stored in leaf nodes.
20. What is a spanning Tree?
A spanning tree is a tree associated with a network. All the nodes of the graph appear on the tree once. A minimum spanning tree is a spanning tree organized so that the total edge weight between nodes is minimized.
21. Does the minimum spanning tree of a graph give the shortest distance between any 2 specified nodes?
No. The Minimal spanning tree assures that the total weight of the tree is kept at its minimum. But it doesn't mean that the distance between any two nodes involved in the minimum-spanning tree is minimum.
22. Which is the simplest file structure? (Sequential, Indexed, Random)
Sequential is the simplest file structure.
23. Whether Linked List is linear or Non-linear data structure?
According to Access strategies Linked list is a linear one.
According to Storage Linked List is a Non-linear one.
According to Storage Linked List is a Non-linear one.
source: indiabix.com
Print
PDF
For Further Reading,
- Latest DB Analyzer for Sanchaya Post dtd 12/08/2013
- Weblink -9 Useful Tool
- Download Inspector Software Setup
- Changing of Server Authentication Mode in SQL Server 2008 R2
- How to log in to Gmail with your Google Account - Gmail Tutorials
- Bad Sectors
- TOP 10 MOST COMMON COMPUTER PROBLEMS
- SMART DRIVER BACKUP TOOL VERSION 2.12
- Free Software to Fix Dead Pixel on Monitors [Windows]
- Latest software from Software Development Centre, Chennai
About the Author
0 comments:
Post a Comment