#Persuing Mtech From NIT RAIPUR#B.E. in INFORMATION TECHNOLOGY #C certificate in NSS # educator at unacademy in CBSE Category 

Megha Tamrakar

This course consists of compound data structure like- stack , queues, link list. Various operations and functionalities of these compound data structures are discussed in the course.

CBSE Class 12

Hindi

(Hindi) (NCERT) Data Structure- Part II (for Class 12th)

Data-structures

Programming - II

Computer Science

Class 6-12

Become a topper in your school and ace your board exams by learning from best educators in the country

CBSE

CBSE (Central Board of Secondary Education)

Stack: Definition, important points of stack, application of stacks, primitive operations on stack, overflow and underflow conditions.

Stack Data Structure: Part 1 (in Hindi)

Push algorithm and explanation with diagram , pop algorithm and explanation with diagram. Condition of overflow and under flow

Primitive Operations of Stack-(PUSH and POP): Part 1 (in Hindi)

What is infix expression, postfix expression and prefix expressions. Evaluation of postfix expression: numerical of evaluation of postfix expression

Evaluation of Postfix Expression using Stack: Part 1 (in Hindi)

Algorithm of evaluation of postfix expressions and program for implementation of postfix expressions.

Evaluation of Postfix Expressions using Stack: Part 2 (in Hindi)

Algorithm for conversion of infix to postfix expression using stack; example for implementation of the algorithm.

Algorithm of conversion from Infix to Postfix Expression:: Part 1 (in Hindi)

Conversion from infix to postfix expressions- solved examples with implementations of algorithm.

Example of Conversion From Infix to postfix Expressions

Queue: Linear queue definition and diagram, applications, front and rear specifications by diagram in queue

Queue: Linear queue(class 12th Data structure)

Algorithm for insertion with diagram and algorithm for deletion with diagram ; drawback of linear queue.

Linear Queue operations(class 12th)

Circular queue: definitions and descriptions, algorithm for insertion in circular queue and algorithm for deletion in circular queue.

Circular queue(for class 12th)

Link list- definition, types of link list, diagram representation of link list, basic terminologies of link list, operations on link list, disadvantages of link list.

Link list for (class 12th)

I am a B.Tech CSE student from Indira Gandhi Delhi technical university for women Delhi |Obtained 95% in Class 12 CBSE|A passionate teacher


Saumya Sharma

This course is about 2 dimensional and multi dimensional arrays. I will even discuss programs and questions that are based on CBSE examination point of view. I will start from scratch in the first lesson and will gradually increase the level of programs in further lessons.

Two Dimensional Arrays (Matrices): Class XII CBSE

This course is based on the NCERT syllabus of class 12th and the contents of the course are- 
 Arrays, Insertion in arrays, deletion in arrays, searching , linear search , binary search, bubble sort , insertion sort , selection sort and two-Dimensional arrays and compound data structures like- stack, queue and linked list

(NCERT) Data Structure (Class 12th)

B.tech from CSE branch ,having more than 4 years teaching experience ,my courses will help you to understand different programming languages

Jitendra Jangir

in this course I am going to cover each and every points related to data structure unit with previous year questions.

(Hindi) Data Structures for Class XII

This  course is about Arrays. It's the most crucial topic in programming. Students often have problems understanding it's concept. But, in my course , I have made it a lot more easier for them to have a good understanding of arrays

Arrays in C++ - Syntax, Detailed Explanation, Lots of Examples: Class XII

Shruti Mehra

This course is all about queues and its properties, and implementation of queues using arrays and linked list.

Lessons

10 lessons • 1h 34m

Invalid Date

NaN

Stack Data Structure: Part 1 (in Hindi)

Invalid Date

NaN

Primitive Operations of Stack-(PUSH and POP): Part 1 (in Hindi)

Invalid Date

NaN

Evaluation of Postfix Expression using Stack: Part 1 (in Hindi)

Invalid Date

NaN

Evaluation of Postfix Expressions using Stack: Part 2 (in Hindi)

Invalid Date

NaN

Algorithm of conversion from Infix to Postfix Expression:: Part 1 (in Hindi)

Invalid Date

NaN

Example of Conversion From Infix to postfix Expressions

Invalid Date

NaN

Queue: Linear queue(class 12th Data structure)

Invalid Date

NaN

Linear Queue operations(class 12th)

Invalid Date

NaN

Circular queue(for class 12th)

Invalid Date

NaN

Link list for (class 12th)