Skip to main content

UNIX Introduction to Unix | Test Your Understanding - Introduction to Unix

Image
By Astrio Jather

 UNIX

 Introduction to Unix

 Test Your Understanding - Introduction to Unix

Feedback

Congratulations! You have passed by securing more that 80%.

Question 1

Correct
Mark 1.00 out of 1.00
Flag question

Question text

What will be the output of the given code snippet?

~]$ dc

4

5

+

3

p

 blank 


   
5438

Feedback

Question 2

Correct
Mark 1.00 out of 1.00
Flag question

Question text

Fill the specific date format in the given echo statement, to print the date in dd/mm/yyyy format.

 echo `date + blank / blank / blank `


     
%m%dd%d%y%M%Y

Feedback

Labels:

Comments

Post a Comment

Must Read:

Arrange Buildings

By Astrio Jather
1. You are given a number n, which represents the length of a road. The road has n plots on it's each side. 2. The road is to be so planned that there should not be consecutive buildings on either side of the road. 3. You are required to find and print the number of ways in which the buildings can be built on both side of roads. Input Format A number n Output Format A number representing the number of ways in which the buildings can be built on both side of roads. Constraints 0 < n <= 45 Sample Input 6 Sample Output 441 Solution: import java.io.*; import java.util.*; public class Main{ public static void main(String[] args) throws Exception {     // write your code here     Scanner scn = new Scanner(System.in);     long n = scn.nextInt();     long ob = 1;     long os = 1;     for (int i = 2; i <= n; i++) {       long nb = os;       long ns = os + ob;       ob = nb;   ...
Post a Comment
Read more

Coin Change Combination

By Astrio Jather
1. You are given a number n, representing the count of coins. 2. You are given n numbers, representing the denominations of n coins. 3. You are given a number "amt". 4. You are required to calculate and print the number of combinations of the n coins using which the       amount "amt" can be paid. Note 1: You have an infinite supply of each coin denomination i.e. same coin denomination can be                    used for many installments in payment of "amt" Note 2: You are required to find the count of combinations and not permutations i.e.                   2 + 2 + 3 = 7 and 2 + 3 + 2 = 7 and 3 + 2 + 2 = 7 are different permutations of same                    combination. You should treat them as 1 and not 3. Input Format A number n n1 n2 .. n number of elements A number amt Output Format A number representing the count of ...
Post a Comment
Read more

Algorithm Analysis and Design Concepts Hands-On | Replace Character

By Astrio Jather
 Algorithm Analysis and Design Concepts  Hands-On  Replace Character String – Replace Characters   Write a recursive function 'public static String replace(String str,char from,char to) ' that changes all occurrences of 'from' in ‘str’ to ‘to’. For example, if str were "codebook ", and from = 'o' and to = 'e', then, str would become "cedebeek". F unction Definitions: public static String replace(String str, char from, char to) Problem Requirements: Keyword Min Count Max Count for 0 0 while 0 0   Note:  Create the main() inside the class 'ReplaceDriver' Refer sample input and output for formatting specifications. Sample Input and Output : Enter the string Asia Enter the character to be replaced a Enter the character to be replaced with i The modified string is Asii Evaluation Result: Result Description Summary of tests *Note: All the test cases might not have same weightage +------------------------------+ | 8 tests run/ 8 t...
Post a Comment
Read more

Software Engineering Concepts Hands-On

By Astrio Jather
  Software Engineering Concepts  Hands-On
Post a Comment
Read more

Subscribe to Get's Answer by Email