Article Categories
- All Categories
-
Data Structure
-
Networking
-
RDBMS
-
Operating System
-
Java
-
MS Excel
-
iOS
-
HTML
-
CSS
-
Android
-
Python
-
C Programming
-
C++
-
C#
-
MongoDB
-
MySQL
-
Javascript
-
PHP
Articles by Ajay yadav
Page 3 of 4
Windows UAC protection Bypass
UAC (User account control ) is a windows IS security that enables a user to perform limited number of admin operations. Overall, it prevents normal users from performing specific actions that could pose a security risk to the system by requiring users to have admin-level permission. For security reasons enabling UAC to detect application installations and prompt for elevation to prevent regular user accounts from installing unauthorized software on clients is a best practice within Windows OS environments.In this tutorial, we shall investigate how to elevate the admin-level right from the end of a normal logged-in user by bypassing UAC ...
Read MoreReset Kali Linux Password
The Kali Linux is a Debian-derived Linux distribution designed for penetration testing and digital forensics adopted by both hackers and security professionals. It is highly probable that the user could not have been login owing to the forgotten password or not able to reset the password after installing it in the virtual environment or in the dual boot along with other OS. Hence, this article is designed to teach the aspiring penetration tester how to reset the Kali Linux password.The user is, typically stuck by confronting the following experience while not able to login to the Kali system as follows.But, ...
Read MoreRegistry Forensic
The Windows Registry also holds information regarding recently accessed files and considerable information about user activities, besides configuration information. Hence, this article serves the purpose is to provide you with a depth understanding of the Registry and Wealth of information it holds. Today most administrators and forensic analysts, the registry probably looks like the entrance to a dark.Windows RegistryThe system was largely managed by several files-specifically, autoexec.bat, config.sys, win.ini (on windows) and system.ini. So, various settings within these files determined what programs were loaded and how the system looked and responded to user input, a central hierarchical database that maintains configuration ...
Read MoreCyber Attack Symptoms
If we think an advance level of anti-virus has been installed on our computer, and we are fully secure as it performs a full system threat infection scan regularly. However, there may be instances where the scan did not detect any threat, or you cannot perform a scan. In these scenarios, we recommend that to notice the aggressive methods or symptoms to detect threats or attack.If it has been noticed an unwarranted presence of PowerShell in the task manager then our computer is definitely under attack.If a connection found to be established on port 4444 or 445 without your cognizance ...
Read MorePrinting Different pattern Bash in C++
This article is intended to print a half-pyramid pattern bash using the C++ programming language. In the view of the stipulated pattern to be printed, the following algorithm is being orchestrated to achieve our goal as;AlgorithmStep-1 Set the length of the Bash (Height) Step-2 Outer loop to handle the number of rows Step-3 Inner loop to handle columns Step-4 Print the pattern with the character (@) Step-5 Set the pointer to a new line after each row (outside the inner loop) Step-6 Repeat the loop till the Bash HeightExampleSo, the following C++ source code is ultimately carved out by complying ...
Read MorePrinting Pyramid in C++
This article yields a “pyramid-like structure” as an output using the C++ programming code. In which the pyramid height and space are being determined by traversing double for loop constructs as following;Example Live Demo#include using namespace std; int main() { int space, rows=6; for(int i = 1, k = 0; i
Read MoreSort an Array of string using Selection sort in C++
The Selection Sort algorithm sorts an exhibit by more than once finding the base component from the unsorted part and putting it toward the start. In each emphasis of determination sort, the base component from the unsorted subarray is picked and moved to the arranged subarray.Example Live Demo#include #include using namespace std; #define MAX_LEN 50 void selectionSort(char arr[][50], int n){ int i, j, mIndex; // Move boundary of unsorted subarray one by one char minStr[50]; for (i = 0; i < n-1; i++){ // Determine minimum element in unsorted array ...
Read MoreSorting string in Descending order C++
The sorting in ascending or descending order, however, can duly be performed by using string sort method and other means too in the C++ programming. But here, the string compare (first words with the second) and copy (copy the first word in a temp variable) method involved in the inner and outer traversing loop to put the words in descending order as following.Example Live Demo#include using namespace std; int main(){ char str[3][20]={"Ajay","Ramesh","Mahesh"}; char t[20]; int i, j; for(i=1; i
Read Morestable_sort() in C++ STL
The stable_sort method of STL first sorts the components with name as the key in ascending order and afterward the components are arranged with their segment as the key. Moreover, The stable_sort() calculation is viewed as steady in light of the fact that the overall request of comparable components is kept up. Here is the source code of the C++ program which exhibits the stable_sort() calculation demonstrated as follows;Example Live Demo#include using namespace std; int main(){ int arr[] = { 11, 15, 18, 19, 16, 17, 13, 20, 14, 12, 10 }; int n = sizeof(arr) / sizeof(arr[0]); stable_sort(arr, arr + n); cout
Read MoreStein’s Algorithm for finding GCD in C++
Stein's Algorithm used for discovering GCD of numbers as it calculates the best regular divisor of two non-negative whole numbers. It replaces division with math movements, examinations, and subtraction. In the event that both an and b are 0, gcd is zero gcd(0, 0) = 0. The algorithm for GCD(a, b) as follows;AlgorithmSTART Step-1: check If both a and b are 0, gcd is zero gcd(0, 0) = 0. Step-2: then gcd(a, 0) = a and gcd(0, b) = b because everything divides 0. Step-3: check If a and b are both even, gcd(a, b) = 2*gcd(a/2, ...
Read More