Class 12 Computer Science Chapter 7 Notes

Class 12 Computer Science Chapter 7 Notes 

Part -1

Computer science chapter 7 data structure class 12 

What is data -

Data refers to the factual information used to represent events, objects, or concepts in a manner that can be communicated, stored, and processed by humans or machines. 

such as:

1. Numbers (e.g., temperatures, ages)

2. Text (e.g., names, descriptions)

3. Images (e.g., photos, diagrams)

4. Audio (e.g., sounds, music)

5. Video (e.g., movies, surveillance footage)

What is data type-

A Data type defines a set of values along with well-defined operations stating its input-output behaviour.

What is data structure-

A Data structure is a physical implementation that clearly defines a way of storing, accessing, manipulating data stored in a data structure. The data stored in a data structure has a specific work pattern.

The data structures can be classified into two types:

1. Simple Data Structures: These data structures are normally built from primitive data types like integers, reals, characters, boolean. Following data structures can be termed as simple data structures:

Such as:

Array or Linear Lists

2. Compound Data Structures. Simple data structures can be combined in various ways to form more complex structures called compound data structures. 

Compound data structures are classified into following two types:

(i)Linear data structures: These data structures are single level data structures. A data structure is said to be linear if its elements form a sequence.

linear data structures  are : (a) Stack (b) Queue (c) Linked List

(ii)Non-Linear data structures. These are multilevel data structures. 

Example of non-linear data structure is Tree.

Linear Lists Arrays

Linear Lists or Arrays refer to a named list of a finite number n of similar data elements. Each of the data elements can be referenced respectively usually 0, 1, 2 by a set of consecutive numbers, , 3,...n. If the name of a linear list of 10 elements is LIL, then its elements will be

referenced as shown: LIL [0], LIL[1], LIL[2], LIL[3], ..........LIL[9]

Stacks

Stacks data structures refer to the lists stored and accessed in a special way, where LIFO (Last In First Out) technique is followed. In Stacks, insertions and deletions take place only at one end, called the top.

Queues

Queues data structures are FIFO (First In First Out) lists, where insertions take place at the "rear" end of the queues and deletions take place at the "front" end of the queues.

 Linked Lists

Linked lists are special lists of some data elements linked to one another. The logical ordering is represented by having each element pointing to the next element.

Trees

Trees are multilevel data structures having a hierarchical relationship among its elements called nodes. Topmost node is called the root of the tree and bottommost nodes are called leaves of the tree.

Thanks for visit my blog