Free Online Tutorial For Programmers, Contains a Solution For Question in Programming. Quizzes and Practice / Company / Test interview Questions.
Course Overview:
In this course, we can learn the following concepts
Algorithms and types:
8 Tips to crack interview 1.Research about the company Before going into an interview, it's important to research the company you're applying to. This includes the company's history, mission statement, and values. You should also look into recent news or press releases, and familiarize yourself with the company's products or…
Algorithms Definition The set of rules to be followed in calculations is an algorithm, Problem-solving operation is an algorithm, These set of rules or instructions solve a class of problems Terms related to algorithms Every algorithm must satisfy the following properties, These properties can measure the effectiveness of the software,…
Hash Table Introduction Is a data structure that implements an associative array abstract data type, a structure that can map keys to values A hash table uses a hash function to compute an index, also called a hash code Hash function Is a function that maps data of arbitrary size…
Set What is set? Set is a collection of unique values A value in the Set may only occur once Write a code const setInstance = new Set() setInstance.add(2); setInstance.add(3); setInstance.add(2); setInstance.add(3); setInstance.has(1); setInstance.has(3); console.log(setInstance); // Set(2) { 2, 3 } Set operations Union: A set algorithm that compares 2…
Graph Introduction Is a group of vertices and edges that are used to connect these vertices Each item is called node or vertex Edges connect the nodes Write a code Let's write a code in javascript // Graph in javascript class Graph { constructor() { this.numberOfNodes = 0; this.adjacentList =…
[su_youtube url="https://youtu.be/PgexmiPps2o" title="Binary Search Tree"] [su_youtube url="https://youtu.be/IoSVVlDz7b4" title="AVL Tree"] Binary Search Tree Definition: Is an ordered tree Is a binary tree where nodes with lesser values are placed to the left of the root node and nodes with equal or greater values are placed to the right Rules Rule 1:…
[su_youtube url="https://youtu.be/wr3mQ3GmQAc" title="Binary Tree"] Binary Tree What is a binary tree? The binary tree starts from the root node The root node has no parent Nodes have at most two children or 1 or 0 We refer to the children as left and right They are recursively defined Every node…
[su_youtube url="https://youtu.be/2IhBtV2kYf8" title="Tree Data structure"] [su_youtube url="https://youtu.be/1vv2hHSxQMg" title="Properties of Tree Data structure"] [su_youtube url="https://youtu.be/k7fNwaBSTM0" title="Types of Tree Data structure"] Tree What is a tree? A tree is a data structure that represents hierarchical data The nodes in the tree have a 1:N parent-child relationship Every tree has a root…
[su_youtube url="https://youtu.be/JagMrQMvWBk" title="Queue"] [su_youtube url="https://youtu.be/9aqkEoJO65o" title="Types of Queue"] Queues What are queues? The queues are First in First out (FIFO) data structures Its the opposite of stacks The printer is the best example of a queue Doubly ended queues Its a data structure which is both First in First out…
[su_youtube url="https://youtu.be/KP8Lw2FD6x0" title="Stack"] Stacks What are stacks? The stacks are Last in First out (LIFO) data structures Stack is like a pile of plates In the beginning, the pile may be empty, but eventually, a plate can be added to the pile Only the most recently added plate can be…