Tutorialspoint.dev
Welcome To Tutorialspoint.dev
Officially launched 18th May 2019
Advanced Data Structure D-E-Shaw Trie

Trie (Insert and Search)

Trie is an efficient information reTrieval data structure. Using Trie, search complexities can be brought to optimal limit (key length). If we store keys in binary s...
Java Java

Retrieving Elements from Collection in Java (For-each, Iterator, ListIterator & EnumerationIterator)

Prerequisite : Collection in Java Following are the 4 ways to retrieve any elements from a collection object: For-each For each loop is meant for traversing items in...
JavaScript javascript-functions javascript-object

Object.entries() In JavaScript

Object and Object Constructors in JavaScript? In the living world of object-oriented programming we already know the importance of classes and objects but unlike othe...
JavaScript Misc javascript-functions

Map.entries( ) In JavaScript

What is a map in JavaScript? Map is a data structure in JavaScript which allows storing of [key, value] pairs where any value can be either used as a key or value. T...
JavaScript javascript-array

JavaScript array.entries() Method

The array.entries() is an inbuilt function in JavaScript which is used to get a new Array that contains the key and value pairs for each index of an array. Syntax: ar...
JavaScript javascript-functions javascript-typedArray

JavaScript typedArray.entries() with Examples

The typedArray.entries() is an inbuilt function in JavaScript which gives a new array iterator object containing the key and value pairs of the given typedArray objec...
DBMS Misc Misc

Web Information Retrieval Vector Space Model

It goes without saying that in general a search engine responds to a given query with a ranked list of relevant documents.The purpose of this article is to describe a...
GATE CS Operating Systems Operating Systems

Operating System Page Table Entries

Prerequisite – Paging Page table has page table entries where each page table entry stores a frame number and optional status (like protection) bits. Many of ...
Advanced Data Structure Pattern Searching Trie

Pattern Searching using a Trie of all Suffixes

Problem Statement: Given a text txt[0..n-1] and a pattern pat[0..m-1], write a function search(char pat[], char txt[]) that prints all occurrences of pat[] in txt[]. ...
Advanced Data Structure Trie Trie

Trie (Delete)

In the previous post on trie we have described how to insert and search a node in trie. Here is an algorithm how to delete a node from trie. During delete operation w...

Subscribe to Our Newsletter