Describe the ways for selecting data structure, Database Management System

Assignment Help:

Ways for Selecting Data Structure

Algorithms operate on data structure. Therefore, selection of the best algorithm means selecting the best data structure from whole bunch. The data structures do not add any information to analysis model, but they systematize it in a form which is convenient for algorithms which uses it. Many such data structure contains lists, arrays, stacks, queues, trees etc.

Some variations on these data structures are main concern queues, binary trees etc. Most of the object oriented languages provide different sets of generic data structures as part of their already defined class libraries.

 


Related Discussions:- Describe the ways for selecting data structure

Explain weak and strong entity sets, Explain weak and strong entity sets? ...

Explain weak and strong entity sets? Weak and Strong entity sets: A physically powerful entity set has a primary key. All tuples in the group are distinguishable through that k

Relational schema for person, Example: RELATIONAL SCHEMA for PERSON: ...

Example: RELATIONAL SCHEMA for PERSON: PERSON (PERSON_ID: integer, NAME: string, AGE: integer, ADDRESS: String) RELATION INSTANCE In this instance, m = 3 and n = 4

What is odbc and what is its function, Question: (a) What is ODBC and w...

Question: (a) What is ODBC and what is its function? (b) What is Web application server, and how does it work from a database perspective? (c) What does e-commerce mean

Differentiate between pl/sql functions and procedures, Oracle & Distributed...

Oracle & Distributed Databases 1. Differentiate between PL/SQL functions and procedures. 2. Draw the diagram of logical structure of oracle database and explain it in brief.

Define seek time, Define seek time. The time for repositioning the arm ...

Define seek time. The time for repositioning the arm is known as the seek time and it enhances with the distance that the arm is known as the seek time.

Keys - relational database integrity, Candidate Key:  In a relation R, a ca...

Candidate Key:  In a relation R, a candidate key for R is a subset of the set of attributes of R, which have the differnt two properties: (1)        Uniqueness:                N

Define catalog and meta data, Define Catalog and meta data ? A catalog ...

Define Catalog and meta data ? A catalog is a compilation of records elaborating the contents of a particular collection or group of collections. Metadata (Meta data, or someti

What is entity in dbms, What is entity in DBMS? Entity: A DBMS entity i...

What is entity in DBMS? Entity: A DBMS entity is either a thing in the modelled world or a drawing element in an ERD.

Explain what is aggregation, Explain what is Aggregation ? Aggregation...

Explain what is Aggregation ? Aggregation: This is used whenever we intend to show a relationship between an entity and the relationship. There is no provision for this in th

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd