Write a shell script to delete all files present in a directory “dir1”. An

Write a shell script to delete all files present in a
directory “dir1”. Any error, if it occurs while carrying
out this operation should be stored in a file errorlog

Question Posted / pradip

0 Answers
2168 Views
I also Faced
E-Mail Answers

No Answer is Posted For this Question
Be the First to Post Answer

Post New Answer

More Engineering AllOther Interview Questions

Explain power?

0 Answers

can any one send me the configuration of cisco 1841 router????/

0 Answers ABC,

i m doing engg in IT .for getting job which courses i have to do?

0 Answers HCL,

what is the main fuction of OSPF in a internetwork? how does work of same network?

0 Answers

There are prime factors of two numbers a and b , write a program using this prime factors whether a is divisible by b?

0 Answers

how to reuse an outdated laptop?

0 Answers

What do u mean constructor in java ?

1 Answers

The factorial of a nonnegative integer n is written n! (pronounced “n factorial”) and is defined as follows: n! = n · (n - 1) · (n - 2) · … · 1 (for values of n greater than to 1) and n! = 1 (for n = 0 or n = 1). For example, 5! = 5 · 4 · 3 · 2 · 1, which is 120. Use while structures in each of the following: a) Write a program that reads a nonnegative integer and computes and prints its factorial. Use the following function prototype to calculate factorial: int myFactorial(int n); b) Write a program that estimates the value of the mathematical constant e by using the formula: Use the following function prototype to calculate e: double myE( ); Hint: Use an accuracy of 10 terms. c) Write a program that computes the value of ex by using the formula Use the following function prototype to calculate e: double myEx(int x);

2 Answers

what are the Types of End User in dbms?

0 Answers Oracle,

reduce the number of key strokes to execute this command : t char -t -v -f/dev/fd0

0 Answers

What is the time complexity T(n) of the nested loops below? For simplicity, you may assume that n is a power of 2. That is, n = 2k for some positive integer k. : i = n; while (i >= 1){ j = i; while (j <= n) { <body of the inner while loop > // Needs (1). j = 2 * j; } i = i/2; } :

2 Answers

write an algorithm in O(n) time for finding the kth smaalest element form an array of n elements , where n and k are entered by user

0 Answers

For more Engineering AllOther Interview Questions Click Here