Skip to main content

Chapter -3: Data Structure (DSA -Technology369kk )

 Data Structure (DS) : 

  • Data may be organized in many different ways logical or mathematical model of a program particularly organization of data. This organized data is called “Data Structure”. Or The organized collection of data is called a ‘Data Structure’.
  • So, It can be used efficiently way. 
  • Some most example of DS are ARRAYS, STACK, QUEUE, LINKED LIST, TREE, .. etc. 
  • It is also used for aspect of Computer Science i.e, Operating System, Compiler Design, Artificial Intelligence, Graphics Design etc.  

Table of Contents 

Data Structure=Organized data +Allowed operations 

  • Data Structure involves two complementary goals.
    •  The first goal is to identify and develop useful, mathematical entities and operations and to determine what class of problems can be solved by using these entities and operations. 
    • The second goal is to determine representation for those abstract entities to implement abstract operations on this concrete representation. 

Data Structure: 

  • Data may be organized in many different ways logical or mathematical model of a program particularly organization of data. This organized data is called “Data Structure”. Or The organized collection of data is called a ‘Data Structure.

Primitive DS:

  • Primitive Data structures are directly supported by the language ie; any operation is directly performed in these data items.
  • Ex: integer, Character, Real numbers etc.

Non-Primitive DS:

  • Non-primitive data types are not defined by the programming language, but are instead created by the programmer. 

Linear data structures: 

  • Linear data structures organize their data elements in a linear fashion, where data elements are attached one after the other. 
  • Linear data structures are very easy to implement, since the memory of the computer is also organized in a linear fashion. Some commonly used linear data structures are arrays, linked lists, stacks and queues.

 Non-Linear data structures:

  • In nonlinear data structures, data elements are not organized in a sequential fashion. Data structures like multidimensional arrays, trees, graphs, tables and sets are some examples of widely used nonlinear data structures. 
  • Example: Tree, Graphs, Tables, Sets. 

Operations on the Data Structures: 

There are following can be performed on the data structures: 

1. Traversing 2. Searching 3. Inserting 4. Deleting 5. Sorting 6. Merging

  1. Traversing : - It is used to access each data item exactly once so that it can be processed.
  2. Searching :  - It is used to find out the location of the data item if it exists in the given collection of data items.
  3. Inserting: - It is used to add a new data item in the given collection of data items. 
  4. Deleting :  It is used to delete an existing data item from the given collection of data items.
  5. Sorting:  - It is used to arrange the data items in some order i.e. in ascending or descending
  6. Merging : It is used to combine the data items of two sorted files into single file in the sorted form.





Comments

Post a Comment

Popular posts from this blog

Assignment of ITA/ Information Technology and Application BCA- Technology369kk

Q1. What is  computer Explain basic computer architecture and Difference components.  2. Discuss the use of memory in computer system, Explain memory hierarchy  in details. 3. What is software? Explain difference types of software with explain. 4. Write short notes on the given:- (I) Internet. (II) LAN (Local area network ) (III) Search engine (IV) Web browser  Q 1.What is computer Explain basic computer architecture, Difference components of computer.   Computer :- Computer is defined as an electronic device that takes input data and instructions from the user and after processing them, it generates useful and desired output quickly.   A computer is designed to execute applications and provides a variety of solutions through integrated hardware and software components.                            It is fast and automatic device. It works with the help of programs and represents the d...
2 comments
Read more

C++ and Java Practical All Questions Answers - BCA -Technology369kk

C++ and Java  In this post see most important questions for practical questions given by college all questions with answers . Guys I want to say that this is only for suggested post for your practical please request to you change same alphabets, words or anything  methods name and variables name because if you write all words same then this is copy paste for another peoples.  Used Topics:  Keywords, Variables, Condition Statements, Function , Array, Structure, Pointer.                           In OOPs, Class and Objects, Constructor, Poly morph, Encapsulation, Access Specifiers,                               Inheritance etc.  So, Without Time Lose Come to the Points, let's go start Now:        *************************************************************************  C++ 12 ...
Post a Comment
Read more

Assignment of PMO (Principal of Management and Organization) - Technology369kk

 ** Assignment Of PMO ** Agenda: -  4 Questions discuss in this post. Question 1. Write a d etails note on selection why it Called. negative process.  Question 2. Write a details note on 'span of control. Question 3. Planning is an essential process, do you agree ? Discuss  Question 4. Write a note on management function. Q 1. Write a d etails note on selection why it called negative process.  Ans :-  Selection is the process of choosing the most suitable candidates out of the several candidates available.          Selection is a negative process because there may be more rejected then those selected in most of the candidates that is called selection is a negative process. → Selection process has the following steps:-  [ A .] Screening of applicants - Based on the screening of applicants only those candidates. It Called further process of selection. Who are found eligible for the job Standards of the the organization. [ B .] S...
3 comments
Read more