- 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
Ayush Singh has Published 179 Articles
![Ayush Singh](https://www.tutorialspoint.com/assets/profiles/680995/profile/60_3152495-1689250670.png)
Ayush Singh
331 Views
The following actions must be taken in Ubuntu Server 14.04 in order to configure a caching DNS server. Start by running the relevant command the package management provides to install the DNS server software. After installation, modify the configuration file to set up the DNS server. For optimum performance, define ... Read More
![Ayush Singh](https://www.tutorialspoint.com/assets/profiles/680995/profile/60_3152495-1689250670.png)
Ayush Singh
77 Views
You must use the proper sorting algorithms in order to organise an array in increasing order using the specified operations. Determine the most effective method first depending on the array size and data properties. Bubble Sort, Merge Sort, and Quick Sort are examples of popular sorting algorithms. Apply the chosen ... Read More
![Ayush Singh](https://www.tutorialspoint.com/assets/profiles/680995/profile/60_3152495-1689250670.png)
Ayush Singh
219 Views
In the field of network analysis, the number of nodes with the highest degree, signifying the greatest number of connections to other nodes in the network, is referred to as the "count of nodes with maximum connection" in an undirected graph. The number of edges that incident upon a node ... Read More
![Ayush Singh](https://www.tutorialspoint.com/assets/profiles/680995/profile/60_3152495-1689250670.png)
Ayush Singh
60 Views
For Q queries, do the following to see if node X is in node Y's subtree or vice versa: Starting at node Y, navigate its subtree while keeping an eye out for node X. If discovered, X is in Y's subtree. Start at node X and navigate its subtree to ... Read More
![Ayush Singh](https://www.tutorialspoint.com/assets/profiles/680995/profile/60_3152495-1689250670.png)
Ayush Singh
265 Views
The number of disconnected subgraphs created by the remaining vertices in a graph following the removal of Q specified vertices is represented by the count of connected components. There are no edges linking the various components; instead, each connected component is made up of a collection of vertices connected by ... Read More
![Ayush Singh](https://www.tutorialspoint.com/assets/profiles/680995/profile/60_3152495-1689250670.png)
Ayush Singh
109 Views
Analyse the connectedness of each edge in the Graph to locate edges whose removal won't break the Graph. We can identify which edges are essential for preserving connectivity between nodes by methodically examining the effect of eliminating individual edges. "Bridge edges" or "critical edges" are edges that, when eliminated, nonetheless ... Read More
![Ayush Singh](https://www.tutorialspoint.com/assets/profiles/680995/profile/60_3152495-1689250670.png)
Ayush Singh
49 Views
We can use the following technique to find the cheapest way to multiply X or right−rotate its digits from 1 to N. To monitor the initial lowest cost, create a cost variable. Check to see if N is evenly divided by X at each stage as you progress from N ... Read More
![Ayush Singh](https://www.tutorialspoint.com/assets/profiles/680995/profile/60_3152495-1689250670.png)
Ayush Singh
225 Views
In this topic, we seek the relationally constrained lexicographically minimal permutation of numbers from 1 to N. The relation describes the relative order of certain of the permutation's components. We ensure that the resulting permutation is the least possible when comparing lexicographically by carefully organising the numbers based on this ... Read More
![Ayush Singh](https://www.tutorialspoint.com/assets/profiles/680995/profile/60_3152495-1689250670.png)
Ayush Singh
534 Views
Diverse domains, including CS, social networks, and logistics, use directed graphs, also known as digraphs. Arrows indicating the direction of links serve to depict the interconnections between the various components. They have the ability to represent intricate connections, handle data quickly, and facilitate pathfinding algorithms. Their drawbacks, however, include the ... Read More
![Ayush Singh](https://www.tutorialspoint.com/assets/profiles/680995/profile/60_3152495-1689250670.png)
Ayush Singh
3K+ Views
Graphs are used in different disciplines. They are utilised in biology to represent gene interactions, in transportation for route optimisation, and in social networks for user connection analysis. The visual representation of intricate relationships and the capacity to see patterns and trends are two benefits of graphs. However, dealing with ... Read More