shell编程实例

1. 在/home文件夹中创建一百个文件夹。文件夹名称依次为a1……a100.
2.  编写一个脚本。自己主动将用户主文件夹下全部小于5KB的文件打包成XX.tar.gz.(提示:用ls。grep,find等命令。文件一般指普通文件)
3.写一个程序,能够将/et/passwd的第一列取出,并且每一列都以一行字符串“the 1 account is “root””来显示
4. 编写一个程序,他的作用是先查看一下/root/test/logical这个名称是否存在。若不存在,则创建一个文件。

使用touch来创建,创建完毕后离开;假设存在的话,推断该名称是否为文件。若为文件则将之删除后新建一个文件夹。文件名称为loglical。之后离开;假设存在的话,并且该名称为文件夹,则删除此文件夹。


5.编写一个shell脚本。从键盘读入10个数。显示最大值和最小值。


6.编写一个脚本,打印不论什么数的乘法表。如输入3则打印
  1*1=1
  2*1=2 2*2=4
  3*1=3 3*2=6 3*3=9

7.编写一个脚本,输入自己的生日时间(YYYYMMDD)。计算还有多少天多少个小时是自己的生日。



每一个实例都是自己通过找资料写出来的,通过自己编写。确实学到不少东西。

Shell脚本高级编程教程,希望对你有所帮助。 Example 10-23. Using continue N in an actual task: 1 # Albert Reiner gives an example of how to use "continue N": 2 # --------------------------------------------------------- 3 4 # Suppose I have a large number of jobs that need to be run, with 5 #+ any data that is to be treated in files of a given name pattern in a 6 #+ directory. There are several machines that access this directory, and 7 #+ I want to distribute the work over these different boxen. Then I 8 #+ usually nohup something like the following on every box: 9 10 while true 11 do 12 for n in .iso.* 13 do 14 [ "$n" = ".iso.opts" ] && continue 15 beta=${n#.iso.} 16 [ -r .Iso.$beta ] && continue 17 [ -r .lock.$beta ] && sleep 10 && continue 18 lockfile -r0 .lock.$beta || continue 19 echo -n "$beta: " `date` 20 run-isotherm $beta 21 date 22 ls -alF .Iso.$beta 23 [ -r .Iso.$beta ] && rm -f .lock.$beta 24 continue 2 25 done 26 break 27 done 28 29 # The details, in particular the sleep N, are particular to my 30 #+ application, but the general pattern is: 31 32 while true 33 do 34 for job in {pattern} 35 do 36 {job already done or running} && continue 37 {mark job as running, do job, mark job as done} 38 continue 2 39 done 40 break # Or something like `sleep 600' to avoid termination. 41 done 42 43 # This way the script will stop only when there are no more jobs to do 44 #+ (including jobs that were added during runtime). Through the use 45 #+ of appropriate lockfiles it can be run on several machines 46 #+ concurrently without duplication of calculations [which run a couple 47 #+ of hours in my case, so I really want to avoid this]. Also, as search 48 #+ always starts again from the beginning, one can encode priorities in 49 #+ the file names. Of course, one could also do this without `continue 2', 50 #+ but then one would have to actually check whether or not some job 51 #+ was done (so that we should immediately look for the next job) or not 52 #+ (in which case we terminate or sleep for a long time before checking 53 #+ for a new job).
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值