Breaking News
You are here: Home / Notes / SEM-3 / Advance C and Data Structure

Category Archives: Advance C and Data Structure

Feed Subscription

this is a subcategory of sem-3

Introduction to datastructure

datastructure

  Definition: – Data may be organized in many ways the logical or mathematical model of particular organization of data is called a data structure. The choice of a particular data model depends on two considerations. “It must be rich enough in structure to mirror the actual relationships of the data is the real world.” The structure should be simple enough ... Read More »

Linear Array

Linear Array

Linear Array: – A finite ordered set of homogeneous element. “Finite” means there is a specific number of an element in the Array. “Ordered” means the elements are arranged so that there is 0th,1st,2nd,….so on. “Homogeneous” means all elements in the array must be of same data type. In Simple, An Array is an element in which we can store multiple values with same data ... Read More »

Stack

Stack

Stack :- [LIFO] A stack is a linear structure in which items may be added or removed only at one end, called the top of the stack. The elements are removed from a stack in the reverse order of that in which they were inserted into the stack. Stack is automatically used by same programs such as recursion, conversion of infix to ... Read More »

Polish Notation and their manipulation

Polish Notation and their manipulation

Polish Notation and their manipulation :-                            I.      Infix Notation :- Operator symbol is placed between its two operands. Infix expressions require repeated scanning of expression in order to obtain the result.                         E.g.  : – A + B*C/D+E                         II.       Polish Notation :- The operator symbol is placed before its two operand. It is also called prefix notation.   E.g.  : – (A ... Read More »

Queue

Queue

Queue :- A Queue is a linear list of element in which deletion can take place only at one end, called the Front, and insertion can take place only at other end, called Rear. Queue are also called FIRST-IN-FIRST-OUT (FIFO) lists, Since the first element in a queue will be first element out of the queue. Deletion <-                                                      <- Insertion ... Read More »

Linked List

Linked List

Linked List :- Advantages and disadvantages of an Array.   Advantages :- 1)    Array locations are easily accessible using array. 2)    Array is a useful data structure to store relatively permanent data. 3)    Address calculation is very easy since the memory is allocated sequentially. 4)    Operations like sorting, merging, traversing and searching become easy with array.   Disadvantages :- 1)      We can not increase the ... Read More »

Sorting

Sorting

Sorting: – Sorting is fundamental operation of computer science. Sorting refers to the operation of arranging the data in some given order, such as increasing or decreasing, with numerical data, or alphabetically, with character data. Sorting may seem to be a trivial task. Actually, sorting efficiently may be quite complicated. There are so many kind of sorting techniques are present.   ... Read More »

Data structure ALL types of Algorithms

Data structure ALL types of Algorithms

1.      To Travels an Array: – LA = Linear Array. LB = Lower Bound. UB = Upper Bound. Operation = Process. Step 1 [Initialize Counter] Set k = LB Step 2 Repeat Step 3 & 4 while k ≤ UB Step 3 (Visit Element) Apply Process to LA[k] Step 4 [Increase Counter] Set k++ or k = k+1 [End of Step 2 ... Read More »

Pointer

Pointer

what are pointers? Pointers are basically the same as any other variable. However, what is different about them is that instead of containing actual data, they contain a pointer to the memory location where information can be found. This is a very important concept. Many programs and ideas rely on pointers as the basis of their design, linked lists for ... Read More »

Scroll To Top