Skip to main content

USER related commands in UNIX


whoami
The command lets you know the user name of the current shell you are at.

Example:
root@Microknoppix:/home/knoppix# whoami
root
root@Microknoppix:/home/knoppix# su knoppix
knoppix@Microknoppix:~$ whoami
knoppix

su
The su command is used to become another user during a login session. Invoked without a username, su defaults to becoming the superuser. The optional argument - may be used to provide an environment similar to what the user would expect had the user logged in directly.

Example :
root@Microknoppix:/home/knoppix# su knoppix
password:
knoppix@Microknoppix:~$

knoppix@Microknoppix:/root$ su -
password:
root@Microknoppix:~#

knoppix@Microknoppix:/root$ su
password:
root@Microknoppix:~#

finger
The finger displays information about the system users.
Example:
root@Microknoppix:~# finger knoppix
Login: knoppix Name: Knoppix User
Directory: /home/knoppix Shell: /bin/bash
On since Sun Jun 30 01:43 (UTC) on console from :0
2 hours 8 minutes idle
(messages off)
On since Sun Jun 30 01:43 (UTC) on :0 (messages off)
On since Sun Jun 30 03:31 (UTC) on pts/0 from :0
No mail.
No Plan.

root@Microknoppix:~# finger root
Login: root Name: root
Directory: /root Shell: /bin/bash
Never logged in.
No mail.
No Plan.




who
Print information about users who are currently logged in.

who -a, who --all
knoppix@Microknoppix:/root$ who -a
2013-06-30 01:43 1858 id=si term=0 exit=0
system boot 2013-06-30 01:43
run-level 5 2013-06-30 01:43 last=S
2013-06-30 01:43 2482 id=1
2013-06-30 01:43 2486 id=x1
2013-06-30 01:43 2485 id=4
2013-06-30 01:43 2484 id=3
2013-06-30 01:43 2483 id=2
knoppix - console 2013-06-30 01:43 old 2486 (:0)
knoppix ? :0 2013-06-30 01:43 ? 2486
knoppix + pts/0 2013-06-30 03:31 . 12227 (:0)

who -d, who --dead
To print dead processes
knoppix@Microknoppix:/root$ who -d
2013-06-30 01:43 1858 id=si term=0 exit=0
who -p, who --process
To print active processes spawned by init.

knoppix@Microknoppix:/root$ who -p
2013-06-30 01:43 2482 id=1
2013-06-30 01:43 2486 id=x1
2013-06-30 01:43 2485 id=4
2013-06-30 01:43 2484 id=3
2013-06-30 01:43 2483 id=2

who -q, who--count
To list all login names and number of users logged on
knoppix@Microknoppix:/root$ who -q
knoppix susilaarya susil
# users=3


Comments

Post a Comment

Popular posts from this blog

Design and Operations ( Employee- Model )

-- DB design drop table emp_Salary; drop table emp_Designation; drop table emp; drop table Designations; drop table Departments; drop table Salary_Bands; drop table Addresses; Create table emp( emp_id number, emp_Name varchar2(20), emp_address_id varchar2(10), emp_created_date date, emp_created_by varchar2(20), constraint e_pk primary key(emp_id) ); Create table Departments( dept_id number, dept_name Varchar2(20), constraints dept_pk primary key(dept_id) ); Create table Designations( dept_id number references Departments(dept_id), desg_id number, desg_description varchar2(20), constraints desg_pk primary key(dept_id,desg_id) ); Create table emp_Designation( emp_id number references emp(emp_id), emp_des_dept_id number references departments(dept_...
Post a Comment
Read more

Minimum / Maximum from the given list

File: Execute.java -------------------------------------------------------------------------------------- package org.developersbrain.Solutions; public class Execute { public static int min(int[] arrList){ int minV1=0; int minV2=0; int aLen=arrList.length; minV1=arrList[0]; minV2=arrList[aLen-1]; for(int i=0,j=aLen-1;i<=aLen/2;i++,j--){ if(minV1 > arrList[i]){ minV1=arrList[i]; } if(minV2 > arrList[j]){ minV2=arrList[j]; } } if(minV2<=minV1){ return minV2; }else{ return minV1; } } public static int max(int[] arrList){ int minV1=0; int minV2=0; int aLen=arrList.length; minV1=arrList[0]; minV2=arrList[aLen-1]; for(int i=0,j=aLen-1;i<=aLen/2;i++,j--){ if(minV1 < arrList[i]){ minV1=arrList[i]; } if(minV2 < arrList[j]){ minV2=arrList[j]; } } if(minV2>=minV1){ return minV2; }else{ return minV1; } } ...
Post a Comment
Read more

SQL - Binary Search Tree

Problem Statement You are given a table,   BST , containing two columns:   N  and   P,  where   N   represents the value of a node in   BST , and   P   is the parent of   N . Write a query to find the node type of   BST   ordered by the value of the node. Output one of the following for each node: ·          Root : If node is root node. ·          Leaf : If node is leaf node. ·          Inner : If node is neither root nor leaf node. Sample Input                 N          P 1 2 3 2 6 8 9 8 2 5 8 5 5         null Sample Output 1 Leaf 2 Inner 3 Leaf 5 Root 6 Leaf 8 Inner 9 Leaf Explanation The   BST ...
Post a Comment
Read more