Skip to main content

UNIX Introduction to Unix | Pre-Quiz

Image
By Astrio Jather

 

Feedback

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

Question 1

Correct
Mark 1.00 out of 1.00
Flag question

Question text

 Solaris is the name of a flavor of UNIX from _____________.



Select one:
 

Feedback

Question 2

Correct
Mark 1.00 out of 1.00
Flag question

Question text

Match the following:


HP-UX


 

AIX            

 

Linux

 

Solaris


 

Feedback

Question 3

Correct
Mark 1.00 out of 1.00
Flag question

Question text

The OS decides which process gets the processor, when and for how much time it is called _______.

Select one:
 

Feedback

Question 4

Correct
Mark 1.00 out of 1.00
Flag question

Question text

Which helps us to access the functions provided by the kernel to do the services of the OS?



Select one:
 

Feedback

Question 5

Correct
Mark 1.00 out of 1.00
Flag question

Question text

What will keep track of the printers and the USB connected to a computer? 


Select one:
 

Feedback

Labels:

Comments

Post a Comment

Must Read:

Algorithm Analysis and Design Concepts Data Structure and Algorithms Post-Quiz

By Astrio Jather
Algorithm Analysis and Design Concepts       Data Structure and Algorithms            Post-Quiz  
Post a Comment
Read more

RDBMS Data Definition Language | Create Payments table

By Astrio Jather
  Refer the below schema and create the table payments. Column Name Datatype Size Constraint Constraint name Reference table – Column name Payment_ID Varchar2 3 PRIMARY KEY PK_PAYMENTS   Ticket_ID Varchar2 3 FOREIGN KEY   FK_PAYMENTS_TICKETS TICKETS - TICKET_ID BD_ID Number 11 FOREIGN KEY   FK_PAYMENTS_BOOKINGDETAILS BOOKINGDETAILS-BD_ID DISCOUNT_ID Varchar2 3 FOREIGN KEY   FK_PAYMENTS_DISCOUNTS DISCOUNTS-DISCOUNT_ID Result Description Summary of tests +------------------------------+ | 3 tests run / 3 test passed | +------------------------------+
Post a Comment
Read more

Programming using Java Hands On - Arrays | Find & Display the position of a number

By Astrio Jather
  Write a java program to find the given number from the array of elements and display its position. If the number is not present in an array then display it as 0. Assume the position starts from 1. Sample Input 1 Enter the array size 4 Enter the values 9 32 17 4 Enter the number to find 17 Sample Output 1 3 Sample Input  2 Enter the array size 3 Enter the values 29 53 11 Enter the number to find 49 Sample Output  2 0 Result Description Summary of tests *Note: All the test cases might not have same weightage +------------------------------+ |4 tests run / 4 tests passed | +------------------------------+ TEST CASE PASSED
Post a Comment
Read more

Logic Development | Object Oriented Programming Pre Quiz

By Astrio Jather
 
Post a Comment
Read more

Programming using Java Hands On - Control Structures | Bill Generation

By Astrio Jather
Bill Generation Tom went to a movie with his friends in a multiplex theatre and during break time he bought pizzas, puffs and cool drinks.  Consider   the following prices :  Rs.100/pizza Rs.20/puffs Rs.10/cooldrink Generate a bill for What Tom has bought. Sample Input 1: Enter the no of pizzas bought:10 Enter the no of puffs bought:12 Enter the no of cool drinks bought:5 Sample Output 1: Bill Details No of pizzas:10 No of puffs:12 No of cooldrinks:5 Total price=1290 ENJOY THE SHOW!!! Result Description Summary of tests *Note: All the test cases might not have same weightage +------------------------------+ | 6 tests run/ 6 tests passed | +------------------------------+
Post a Comment
Read more

Count Binary Strings

By Astrio Jather
1. You are given a number n. 2. You are required to print the number of binary strings of length n with no consecutive 0's. Note: In this problem, you are given a number n. All we need to print is the number of binary strings of length n with no consecutive 0's For example: Sample Input: 3 Sample Output: 5 How 5? We have a total of eight binary numbers for length 3, out of which we have 5 numbers in which there are no consecutive zeros. Input Format A number n Output Format A number representing the number of binary strings of length n with no consecutive 0's. Constraints 0 < n <= 45 Sample Input 6 Sample Output 21 Solution: import java.io.*; import java.util.*; public class Main{ public static void main(String[] args) throws Exception {     // write your code here     Scanner sc = new Scanner(System.in);     int n = sc.nextInt();          int dp[][] = new int[n+1][2];     dp[1][0] = 1;     dp[1][1] ...
Post a Comment
Read more

Inverted Pattern

By Astrio Jather
  /* @ToDo  Inverted Pattern 1   2   3   4   5    1   2   3   4    1   2   3    1   2    1    */ #include   <iostream> using   namespace   std ; int   main (){       #ifndef  ONLINE_JUDGE          freopen ( "../asset/input.txt" , "r" , stdin );          freopen ( "../asset/output.txt" , "w" , stdout );     #endif     // Code here!!      int   n ;  cin >> n ;      for ( int   i = 0 ; i < n ; i ++){          for ( int   j = 1 ; j <= n - i ; j ++)  ...
Post a Comment
Read more

0-1 Pattern

By Astrio Jather
  /* @ToDo  0-1 Pattern     1     0   1     0   1   0     1   0   1   0     1   0   1   0   1 */ #include   <iostream> using   namespace   std ; int   main (){       #ifndef  ONLINE_JUDGE          freopen ( "../asset/input.txt" , "r" , stdin );          freopen ( "../asset/output.txt" , "w" , stdout );     #endif     // Code here!!      int   n ;  cin >> n ;      int   sign  =  1 ;      for ( int   i = 1 ; i <= n ; i ++){    ...
Post a Comment
Read more

Subscribe to Get's Answer by Email