Docsity
Docsity

Prepare for your exams
Prepare for your exams

Study with the several resources on Docsity


Earn points to download
Earn points to download

Earn points by helping other students or get them with a premium plan


Guidelines and tips
Guidelines and tips

SAFDGTRYTGFHYsaafdghjm, Exams of Basics of Data Warehousing

TFGHFGJGFJGHJGHGFHFGHdfghjklasdvdbhyhhfgfd

Typology: Exams

2017/2018

Uploaded on 04/29/2018

shwetha-kulloli
shwetha-kulloli 🇮🇳

5

(1)

2 documents

1 / 4

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
Introduction to Data Structure
Computer is an electronic machine which is used for data processing and manipulation.
When programmer collects such type of data for processing, he would require to store all of
them in computer’s main memory.
In order to make computer work we need to know
o Representation of data in computer.
o Accessing of data.
o How to solve problem step by step.
For doing this task we use data structure.
What is Data Structure?
Data structure is a representation of the logical relationship existing between individual
elements of data.
Data Structure is a way of organizing all data items that considers not only the elements
stored but also their relationship to each other.
We can also define data structure as a mathematical or logical model of a particular
organization of data items.
The representation of particular data structure in the main memory of a computer is called as
storage structure.
The storage structure representation in auxiliary memory is called as file structure.
It is defined as the way of storing and manipulating data in organized form so that it can be
used efficiently.
Data Structure mainly specifies the following four things
o Organization of Data
o Accessing methods
o Degree of associativity
o Processing alternatives for information
Algorithm + Data Structure = Program
Data structure study covers the following points
o Amount of memory require to store.
o Amount of time require to process.
o Representation of data in memory.
o Operations performed on that data.
Data Structures are normally classified into two broad categories
pf3
pf4

Partial preview of the text

Download SAFDGTRYTGFHYsaafdghjm and more Exams Basics of Data Warehousing in PDF only on Docsity!

Introduction to Data Structure

  • Computer is an electronic machine which is used for data processing and manipulation.
  • When programmer collects such type of data for processing, he would require to store all of them in computer’s main memory.
  • In order to make computer work we need to know o Representation of data in computer. o Accessing of data. o How to solve problem step by step.
  • For doing this task we use data structure.

What is Data Structure?

  • Data structure is a representation of the logical relationship existing between individual elements of data.
  • Data Structure is a way of organizing all data items that considers not only the elements stored but also their relationship to each other.
  • We can also define data structure as a mathematical or logical model of a particular organization of data items.
  • The representation of particular data structure in the main memory of a computer is called as storage structure.
  • The storage structure representation in auxiliary memory is called as file structure.
  • It is defined as the way of storing and manipulating data in organized form so that it can be used efficiently.
  • Data Structure mainly specifies the following four things o Organization of Data o Accessing methods o Degree of associativity o Processing alternatives for information
  • Algorithm + Data Structure = Program
  • Data structure study covers the following points o Amount of memory require to store. o Amount of time require to process. o Representation of data in memory. o Operations performed on that data. Data Structures are normally classified into two broad categories
  1. Primitive Data Structure
  2. Non-primitive data Structure

Data types A particular kind of data item, as defined by the values it can take, the programming language used, or the operations that can be performed on it. Primitive Data Structure

  • Primitive data structures are basic structures and are directly operated upon by machine instructions.
  • Primitive data structures have different representations on different computers.
  • Integers, floats, character and pointers are examples of primitive data structures.
  • These data types are available in most programming languages as built in type. o Integer: It is a data type which allows all values without fraction part. We can use it for whole numbers. o Float: It is a data type which use for storing fractional numbers. o Character: It is a data type which is used for character values.

Pointer: A variable that holds memory address of another variable are called pointer.

Non primitive Data Type

  • These are more sophisticated data structures.
  • These are derived from primitive data structures.
  • The non-primitive data structures emphasize on structuring of a group of homogeneous or heterogeneous data items.
  • Examples of Non-primitive data type are Array, List, and File etc.
  • A Non-primitive data type is further divided into Linear and Non-Linear data structure o Array: An array is a fixed-size sequenced collection of elements of the same data type. o List: An ordered set containing variable number of elements is called as Lists. o File: A file is a collection of logically related information. It can be viewed as a large list of records consisting of various fields.

Linear data structures

F 0 A 7 Multi Graph F 0 A 7 Simple Graph F 0 A 7 Null Graph F 0 A 7 Weighted Graph

Operation on Data Structures Design of efficient data structure must take operations to be performed on the data structures into account. The most commonly used operations on data structure are broadly categorized into following types

  1. Create The create operation results in reserving memory for program elements. This can be done by declaration statement. Creation of data structure may take place either during compile-time or run- time. malloc() function of C language is used for creation.
  2. Destroy Destroy operation destroys memory space allocated for specified data structure. free() function of C language is used to destroy data structure.
  3. Selection : Selection operation deals with accessing a particular data within a data structure.
  4. Updation: It updates or modifies the data in the data structure.
  5. Searching :It finds the presence of desired data item in the list of data items, it may also find the locations of all elements that satisfy certain conditions.
  6. Sorting : Sorting is a process of arranging all data items in a data structure in a particular order, say for example, either in ascending order or in descending order.
  7. Merging : Merging is a process of combining the data items of two different sorted list into a single sorted list.
  8. Splitting : Splitting is a process of partitioning single list to multiple list.
  9. Traversal: Traversal is a process of visiting each and every node of a list in systematic manner.