C++ stl Part-2:-
Tags
- Algorithm (14)
- aptitude practice (2)
- array problems (3)
- Binary tree DS (20)
- binary tree question (2)
- Bit Magic (2)
- competitive programming (2)
- data structure (53)
- Database Management System (1)
- dynamic programming (5)
- dynamic programming practice problem (1)
- Game Theory (1)
- Graph Data Structure (1)
- Hashing Data Structure (6)
- heap data structure (1)
- interview prectice (60)
- java (2)
- Linked List (15)
- Linked list question (10)
- operating system (18)
- practice problem (3)
- queue (11)
- sorting algorithm (3)
- stack (16)
- Standard Template Library (STL) (5)
- Tree DataStructure (4)
cookthecode. Powered by Blogger.
Latest Update
About Me
Menu
Android App
About Us
Mohit Rajput ,CEO of cookthecode company. I am a computer geek who fell in love with computers since, the day I pressed mouse buttons.I like to spend most of my time with my laptop, programming, solving problems and Rubik's cube.
learn to code
Learn To Cook the Code
The best way to learn a new programming language is by writing programs in it.
- Dennis Ritchie
The best way to learn a new programming language is by writing programs in it.
- Dennis Ritchie
Translate
Blog Archive
-
▼
2017
(94)
-
▼
December
(45)
- Operating System | Process Scheduler | Scheduling ...
- Operating System | Process Scheduler | Preemptive ...
- Operating System | Process Management | CPU Schedu...
- How to efficiently implement k Queues in a single ...
- Reversing a Queue
- How to efficiently implement k stacks in a single ...
- How to implement 3 stacks with one array?
- Program to Implement Two Stacks in an Array
- Implement Stack using Queues
- LRU Cache Implementation
- Implement Queue using Stacks
- Circular Queue | (Introduction and Array Implement...
- What Is a Deque | Implementation using circular array
- Priority Queue | Application
- Applications of Queue data structure
- Queue Data Structure
- Largest Rectangular Area in a Histogram using stac...
- some real-world applications of a stack data struc...
- Sort a stack using a temporary stack
- Sort a stack using recursion
- Reverse a stack using recursion
- PROCESS STATE | Process Life Cycle | Context Switc...
- Understanding User and Kernel Mode
- Iterative Tower of Hanoi
- The Celebrity Problem
- The Stock Span Problem
- Operating System | Process Management | Introduction
- Process Control Block (PCB)
- What happens when we turn on computer?
- Stages of Linux Boot Process (Startup Sequence)
- How to implement stack using priority queue or heap?
- Create a customized data structure which evaluates...
- How to create mergable stack?
- Circle Sort algorithm
- Trains, Boats and Streams
- C++ Stl part-5
- Handshaking Lemma and Interesting Tree Properties
- Binary Tree (Types of Binary Tree)
- Binary Tree (Properties)
- C++ STL part-4
- C++ Stl part-3
- C++ stl Part-2
- What is the real life application of tree data str...
- Binary Tree (Introduction)
- Time, Speed and Distance
-
▼
December
(45)
Cook The Code
Tags
Algorithm
aptitude practice
array problems
Binary tree DS
binary tree question
Bit Magic
competitive programming
data structure
Database Management System
dynamic programming
dynamic programming practice problem
Game Theory
Graph Data Structure
Hashing Data Structure
heap data structure
interview prectice
java
Linked List
Linked list question
operating system
practice problem
queue
sorting algorithm
stack
Standard Template Library (STL)
Tree DataStructure
Popular
-
Folders in Operating system: in windows go to command line and type tree. You can see the folder tree structure. Linux file system...
-
Introduction to Dynamic Programming:- #reference Dynamic Programming is about. To always remember answers to the sub-problems you...
-
Program for FCFS Scheduling Given n processes with their burst times, the task is to find average waiting time and average turn around t...
-
some real-world applications of a stack data structure? To reverse a word . You push a given word to stack - letter by letter - and the...
-
How to implement 3 stacks with one array? #Approch 1:- Space (not time) efficient. You could: 1) Define two stacks beginning at the...
No comments:
Post a Comment