- Trending Categories
Data Structure
Networking
RDBMS
Operating System
Java
MS Excel
iOS
HTML
CSS
Android
Python
C Programming
C++
C#
MongoDB
MySQL
Javascript
PHP
Physics
Chemistry
Biology
Mathematics
English
Economics
Psychology
Social Studies
Fashion Studies
Legal Studies
- Selected Reading
- UPSC IAS Exams Notes
- Developer's Best Practices
- Questions and Answers
- Effective Resume Writing
- HR Interview Questions
- Computer Glossary
- Who is Who
Tapas Kumar Ghosh has Published 150 Articles
![Tapas Kumar Ghosh](https://www.tutorialspoint.com/assets/profiles/641996/profile/60_877006-1681905500.jpg)
Tapas Kumar Ghosh
180 Views
In C++, the trie has an advanced data structure that is used for storing the collection of trees. The word tries came from the word retrieval and it is known as a digital tree or prefix tree. Let’s take an example of all possible joint by taking a given list ... Read More
![Tapas Kumar Ghosh](https://www.tutorialspoint.com/assets/profiles/641996/profile/60_877006-1681905500.jpg)
Tapas Kumar Ghosh
260 Views
The set bit is a binary representation form of 0 and 1. This digit 1 is called a set bit in reference to the computer. Let’s take an example to understand the setbit calculation − Let’s take an example to understand the setbit calculation − The set bit calculation of ... Read More
![Tapas Kumar Ghosh](https://www.tutorialspoint.com/assets/profiles/641996/profile/60_877006-1681905500.jpg)
Tapas Kumar Ghosh
428 Views
The Minimum Bottleneck Spanning tree is an undirected graph whose highest weight is considered as minimum as possible. Let’s take an example to understand the Minimum Bottleneck Spanning tree. In Figure I, we observe that there are three possible ways of spanning trees that have the common edge ... Read More
![Tapas Kumar Ghosh](https://www.tutorialspoint.com/assets/profiles/641996/profile/60_877006-1681905500.jpg)
Tapas Kumar Ghosh
2K+ Views
We have seen in various chapters of many books guiding on how to design the first letter of word using CSS. In CSS we can use the ::first-letter pseudo-element to design the first initial letter of a text paragraph. This allows us to apply particular styles to the initial letter ... Read More
![Tapas Kumar Ghosh](https://www.tutorialspoint.com/assets/profiles/641996/profile/60_877006-1681905500.jpg)
Tapas Kumar Ghosh
222 Views
To disable the link of any website, we use the properties of CSS like pointer-event set to none, and then the cursor can be set to default which will disable the active link and the users cannot access the links. Sometimes the link has to be disabled to bring some ... Read More
![Tapas Kumar Ghosh](https://www.tutorialspoint.com/assets/profiles/641996/profile/60_877006-1681905500.jpg)
Tapas Kumar Ghosh
313 Views
The Array range queries are a new interest of data structure. In this query, we have set the random element to the array and given the general query problem to solve the data structure problem efficiently. Armstrong number is the total of its digits' cubes. For example- 0, 1, 153, ... Read More
![Tapas Kumar Ghosh](https://www.tutorialspoint.com/assets/profiles/641996/profile/60_877006-1681905500.jpg)
Tapas Kumar Ghosh
3K+ Views
The travelling salesman problem(TSP) is a solution where a salesman has to start from one place and go to all other cities just once and then come back to their own place. TSP is all about finding the minimum distance path. The polynomial-time hardness is called NP Hard which defines ... Read More
![Tapas Kumar Ghosh](https://www.tutorialspoint.com/assets/profiles/641996/profile/60_877006-1681905500.jpg)
Tapas Kumar Ghosh
588 Views
C++ has a deque header file that handles the properties of stack and queue. In data structure for solving the problem in O(1) time complexity, it requires constant time. By using deque to this program we get the advantage to use both stack and queue. In this article, we are ... Read More
![Tapas Kumar Ghosh](https://www.tutorialspoint.com/assets/profiles/641996/profile/60_877006-1681905500.jpg)
Tapas Kumar Ghosh
694 Views
C++ has a predefined function find() which enables searching from the first element range until the last element. In this article, we are going to understand how we can use this find() function to check if a given word is present in a string or not. Let’s take an ... Read More
![Tapas Kumar Ghosh](https://www.tutorialspoint.com/assets/profiles/641996/profile/60_877006-1681905500.jpg)
Tapas Kumar Ghosh
349 Views
A Dominant set of a graph is NP-complete is the subset of vertices such that every vertex in the subset or adjacent vertex in the subset. The full form of NP is “Nondeterministic polynomial” which will check the problem in polynomial time and it means that we can check whether ... Read More