(i) Gate Qualified 2016
(ii) Mtech (Cyber Security) from NIT Kurukshetra.
(iii) UGC-Net Qualified 
(iv) Cyber security analyst at Honeywell

Sourav Newatia

A stack is an abstract data type that serves as a collection of elements, with two principal operations: Push, which adds an elements to the collection, and pop, which removes the recently added element that was not yet removed. We will cover stack inplementation using arrays and linkedlit

GATE (Graduate Aptitude Test in Engineering) 2020 & 2021 complete preparation with best educators. Know about the detailed syllabus, best books, exam pattern and dates, previous year question papers a

GATE - Iconic Pro

English

Stack - GATE (CS & IT)

C Programming

Programming & Data Structure

CS & IT

GATE - CSIT, DSAI & Interview Preparation

GATE, ESE and IIT-JAM

Ace the toughest competitive and government exams in India 

Test Preparation

This is all about course overview of stack. In this , the topic which is cover ed is introduction of stack , operations of stacks , implementation of stack and Recursion and also postfix and prefix impression.

Course overview

Stack is a linear data structure which follows a particular order in which the operations are performed. The order may be LIFO(Last In First Out) or FILO(First In Last Out).

Mainly the following three basic operations are performed in the stack:

Push: Adds an item in the stack. If the stack is full, then it is said to be an Overflow condition.
Pop: Removes an item from the stack. The items are popped in the reversed order in which they are pushed. If the stack is empty, then it is said to be an Underflow condition.
Peek or Top: Returns top element of stack.
isEmpty: Returns true if stack is empty, else false.

Stack Introduction : Part I

Stack Introduction : Part II

There are two ways to implement a stack:
Using array
Using linked list

We will cover the introduction , coding with array and with multiple array.

Stack Implementation : Part I

Stack Implementation : Part II

Stack Implementation : Part III

The process in which a function calls itself directly or indirectly is called recursion and the corresponding function is called as recursive function. Using recursive algorithm, certain problems can be solved quite easily. Examples of such problems are Towers of Hanoi (TOH), Inorder/Preorder/Postorder Tree Traversals, DFS of Graph, etc.

Recursion : Part I

The process in which a function calls itself directly or indirectly is called recursion and the corresponding function is called as recursive function. Using recursive algorithm, certain problems can be solved quite easily. Examples of such problems are Towers of Hanoi (TOH), Inorder/Preorder/Postorder Tree Traversals, DFS of Graph, etc.

We have seen the remaining two types of recursion.

Recursion :Part II

The process in which a function calls itself directly or indirectly is called recursion and the corresponding function is called as recursive function. Using recursive algorithm, certain problems can be solved quite easily. Examples of such problems are Towers of Hanoi (TOH), Inorder/Preorder/Postorder Tree Traversals, DFS of Graph, etc.

In thaa we cover the previous year of questions.

Recursion Part-III

While we use infix expressions in our day to day lives. Computers have trouble understanding this format because they need to keep in mind rules of operator precedence and also brackets. Prefix and Postfix expressions are easier for a computer to understand and evaluate.

Given two operands 
a and 
b and an operator 
\odot, the infix notation implies that O will be placed in between a and b i.e 
 a \odot b . When the operator is placed after both operands i.e 
ab\odot, it is called postfix notation. And when the operator is placed before the operands i.e 
 \odot a b, the expression in prefix notation.

Infix, Prefix, and Postfix Expression

Pursuing Bachelors in Computer Engineering. Have been teaching since the early age of 15. Published author in IEEE.

Viral Tagdiwala

This course involves the Basics of Pointers in C programming language.

Introduction to Pointers in C

 Btech in CSE and  Mtech in Intelligent Systems and Robotics . GATE Qualified. Currently working as an associate Software Developer at Globa

Akansha Aggarwal

This course discusses what are data structures, why data structures are so important and the diffferent types of data structures. The course also takes you through arrays in detail.

Introduction to Data Structures: GATE (CS and IT)

BTech IIIT Bhubaneswar, Qualified JEE Mains 2014,2015, Indian Engineering Olympiad AIR 37, GATE Qualified in 2018 (98.54 Percentile)

Subham Mishra

In this course storage class specifiers with standard output questions asked in campus interview and competitive exams will be covered.

(Hindi) Programming in C for GATE: Storage Class Specifiers

🌟YouTube👉Make It easy #padhai
⭐Currently Educator at Knowledge Gate

Vinay Mishra

In this course, the educator is discussing 
the concept of Data Structures & Algorithm where I'll tell you how to analyze and solve questions of Gate exams using the logic & we'll also learn the tricks & skills to solve any questions in quick time.Hope you'll like it!

Lessons

10 lessons • 1h 41m

Invalid Date

NaN

Course overview

Invalid Date

NaN

Stack Introduction : Part I

Invalid Date

NaN

Stack Introduction : Part II

Invalid Date

NaN

Stack Implementation : Part I

Invalid Date

NaN

Stack Implementation : Part II

Invalid Date

NaN

Stack Implementation : Part III

Invalid Date

NaN

Recursion : Part I

Invalid Date

NaN

Recursion :Part II

Invalid Date

NaN

Recursion Part-III

Invalid Date

NaN

Infix, Prefix, and Postfix Expression