Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd
Upload
23 views

Introductiont To Data Structure & Algorithm

Data structure organizes data in memory and specifies how data is stored and accessed. There are two categories of data structures - primitive and non-primitive. Primitive structures like integers and characters are directly operated on by machines, while non-primitive structures like arrays and linked lists are more sophisticated structures derived from primitive ones. Common data structure operations include traversing, inserting, deleting, searching, and sorting data. An algorithm is a set of steps to solve a problem and has characteristics like being unambiguous, finite, and language-independent. The importance of algorithms lies in both theoretical problem-solving and practical implementation. Algorithm efficiency is measured by time and space complexity.

Uploaded by

akash kurhe
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
23 views

Introductiont To Data Structure & Algorithm

Data structure organizes data in memory and specifies how data is stored and accessed. There are two categories of data structures - primitive and non-primitive. Primitive structures like integers and characters are directly operated on by machines, while non-primitive structures like arrays and linked lists are more sophisticated structures derived from primitive ones. Common data structure operations include traversing, inserting, deleting, searching, and sorting data. An algorithm is a set of steps to solve a problem and has characteristics like being unambiguous, finite, and language-independent. The importance of algorithms lies in both theoretical problem-solving and practical implementation. Algorithm efficiency is measured by time and space complexity.

Uploaded by

akash kurhe
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

What is Data Structure?

The data structure name indicates itself that organizing the data in memory.

The data structure is not any programming language like C, C++, java, etc. It is a set of algorithms
that we can use in any programming language to structure the data in the memory.

Data structure mainly specifies the following things:

1. Organization of Data
2. Accessing methods
3. Degree of associativity
4. Processing alternatives for information

Data Structure can be classified in to two broad categories:

1. Primitive data structure


2. Non primitive data structure

1) Primitive Data Structure


Primitive data structure are basic structures and are directly operated upon by machine
instructions. Primitive data structure has different representation on the different
computers. Primitive data structure is divided in to four categories:

 Integer
 Floating point numbers
 Character constants
 Pointers

2) Non primitive data structure


Non-primitive data structure are more sophisticated data structures. Non-primitive data
structure is derived from the primitive data structures. The non-primitive data structures
emphasize on structuring of a group of homogeneous (same type) or heterogeneous
(different type) data items.

Non-primitive data structure are categorized into following:

 Array
 Linked list
 Queue
 Tree
 Graph

Join Our Telegram Group to Get Notifications, Study Materials, Practice test & quiz:
https://t.me/ccatpreparations Visit: https://ccatpreparation.com
 Stack

Data structure operations


 Traversing Accessing each element exactly once, is knows as traversing. It is also
known as visiting.
 Insertion Adding a new element to data structure.
 Deletion Removing an element from the data structure.
 Searching Finding the location of an item in data structure.
 Sorting Arranging the items in ascending or descending order is known as sorting.

What is an Algorithm?
An algorithm is a finite set of instructions or logic, written in order, to accomplish a certain predefined task.
Algorithm is not the complete code or program, it is just the core logic(solution) of a problem, which can be
expressed either as an informal high level description as pseudocode or using a flowchart.

Characteristics of an Algorithm
The following are the characteristics of an algorithm:

o Input: An algorithm has some input values. We can pass 0 or some input value to an
algorithm.
o Output: We will get 1 or more output at the end of an algorithm.

Join Our Telegram Group to Get Notifications, Study Materials, Practice test & quiz:
https://t.me/ccatpreparations Visit: https://ccatpreparation.com
o Unambiguity: An algorithm should be unambiguous which means that the instructions in an
algorithm should be clear and simple.
o Finiteness: An algorithm should have finiteness. Here, finiteness means that the algorithm
should contain a limited number of instructions, i.e., the instructions should be countable.
o Effectiveness: An algorithm should be effective as each instruction in an algorithm affects the
overall process.
o Language independent: An algorithm must be language-independent so that the instructions
in an algorithm can be implemented in any of the languages with the same output.

Importance of Algorithms
1. Theoretical importance: When any real-world problem is given to us and we break the
problem into small-small modules. To break down the problem, we should know all the
theoretical aspects.
2. Practical importance: As we know that theory cannot be completed without the practical
implementation. So, the importance of algorithm can be considered as both theoretical and
practical.

An algorithm is said to be efficient and fast, if it takes less time to execute and consumes less
memory space. The performance of an algorithm is measured on the basis of following properties:

1. Time Complexity
2. Space Complexity

Join Our Telegram Group to Get Notifications, Study Materials, Practice test & quiz:
https://t.me/ccatpreparations Visit: https://ccatpreparation.com

You might also like