To get all running processes on the remote computer, you need to use – ComputerNameparameter in Get-process cmdlet, WMI class Win32_Process or using the Get-CimInstance cmdlet.With –ComputerName parameterGet-process -ComputerName Test-PCTo connect multiple computers use computer names separated by comma (,).Get-process -ComputerName Test-PC, Win2k8 With WMI object to get processes on multiple remote computers.Get-WmiObject Win32_Process -ComputerName Test-PC, Win2k8Get-CimInstance cmdlet to get processes on remote computers.Get-CimInstance Win32_Process -ComputerName Test-PC, Win2k8
You can also display the running process on the computer using the Get- CimInstance command with the same class Win32_Process that the WMI object is using.CommandGet-CimInstance Win32_ProcessOutputProcessId Name HandleCount WorkingSetSize VirtualSize --------- ---- ----------- -------------- ----------- 0 System Idle Process 0 8192 8192 4 System 6387 970752 5177344 96 Registry 0 76951552 173195264 568 smss.exe 53 495616 2203359674368 800 csrss.exe 883 4653056 2203416825856 896 csrss.exe 817 5349376 2203449389056 920 wininit.exe 156 4886528 2203387420672 956 winlogon.exe 264 9486336 2203423092736 8 services.exe 838 10129408 2203391979520 684 lsass.exe 1870 20848640 2203418796032
In this problem, we are given a string that may contain duplicate characters. Our task is to print all distinct permutations of the strings.Let’s take an example to understand the problem −Input: string = “XYZ” Output: XYZ XZY YXZ YZX ZYX ZXYTo solve this problem, we have to fix one element of the string. And then iterate all the elements of the strings.ExampleProgram to implement our solution, Live Demo#include #include using namespace std; int compare(const void* a, const void* b) { return (*(char*)a - *(char*)b); } void swapChar(char* a, char* b) { char t = *a; ... Read More
To get the running processes with a WMI object, you need to use class Win32_Process. With this method, you will get more properties than the Get-Process command.CommandGet-WmiObject –Class Win32_ProcessOutputGENUS : 2 __CLASS : Win32_Process __SUPERCLASS : CIM_Process __DYNASTY : CIM_ManagedSystemElement __RELPATH : Win32_Process.Handle="0" __PROPERTY_COUNT : 45 __DERIVATION ... Read More
In this problem, we are given a binary tree. Our task is to print all nodes of the tree that are full nodes.The binary tree is a tree in which a node can have a maximum of 2 child nodes. Node or vertex can have no nodes, one child or two child nodes.Example −A full node is a node that has both its left and right child available. In other words, a node with the left and right child is a full node. In the above binary tree, 4 and 9 are full nodes.Let’s take an example to understand the ... Read More
In this problem, we are given a sentence. Our task is to print all strings from the sentence that are funny words.Funny word is a word that follows the condition - The absolute difference between adjacent characters of the string and its reverse string is equal.|string[0] - string[1]| = |revstring[0]-revstring[1]|Let’s take an example to understand the problem −Input: string = ‘ABRS’ Output: Yes Explanation: Reverse string = SRBA |A-B| = 1 = |S-R| |B-R| = 16 = |R-B| |B-A| = 1 = |R-S|To solve this problem, we have to extract each string from the given sentence. And print if the ... Read More
In this problem, we are given three values L, R, and d. Our task is to print all good numbers within the range L to R that do not contain the d as its digit.A good number is a number in which every digit is larger than the sum of digits of its right (all less significant bits than it). For example, 732 is a good number, 7> 3+2 and 3>2.Now, let’s take an example to understand the problem, Input: L = 400 , R = 500 , k = 3 Output: 410, 420, 421Explanation − good numbers between 400 ... Read More
In this problem, we are given two integers K and n. Our task is to print all increasing sequences of length K using first n natural numbers.The increasing sequence is a sequence of numbers in which the value of the next element is greater than the previous one.Let’s take an example to understand the problem −Input: n = 4, K = 2 Output: 1 2 1 3 1 4 2 3 2 4 3 4To solve this problem, we will create a k length array that stores the current sequence of the array. And for every position in the array, ... Read More
In this problem, we are given two numbers a and b and an integer bound and we have to print all values less than binding which is the sum of squares of a and b.Bound >= ai + bjLet’s take an example to understand the problem −Input: a=2, b=3, bound=8 Output: 2 3 4 5 7To solve this problem, we will use nested loops using two variables i and j from 0. The outer loop will have ending condition xi = bound and the inner loop will have ending condition xi + yj > bound. For each iteration of the ... Read More
In this problem, we are given two string str1 and str2 and we have to print all interleaving strings from both the string.Interleaving string created using two given strings such that the order of characters of each string.Let’s take an example to understand the problem −Input: str1 = “XY” str2= “NS” Output: XYNS, XNYS, XNSY, NXYS, NXSY, NSXYTo solve this problem, we will take all the characters in the strings. Length of str1 = m and length of str2 = n so we will create all interleaved strings from these strings.For printing all interleaving strings, we will fix characters of ... Read More
Data Structure
Networking
RDBMS
Operating System
Java
iOS
HTML
CSS
Android
Python
C Programming
C++
C#
MongoDB
MySQL
Javascript
PHP