0
Alien head

programming languages Online Quiz - 217

Description: programming languages Online Quiz - 217
Number of Questions: 20
Created by:
Tags: programming languages
Attempted 0/20 Correct 0 Score 0

Which one is the correct syntax for string comparison ?

  1. if [ "$a" equals "$b" ]

  2. if [ "$a" -eq "$b" ]

  3. if [ "$a" = "$b" ]

  4. if [ "$a" <> "$b" ]


Correct Option: C

The syntax for OR list is

  1. command1 || command2

  2. command1 && command2

  3. command1 // command2

  4. command1 | command2


Correct Option: A

To find all available shells in your system type the following command

  1. cat /etc/shells

  2. cat /tmp/shells

  3. cat /root/shell

  4. echo $SHELLS


Correct Option: A

let "var <<= 2" results in

  1. var left-shifted 2 bits

  2. var mutliplied by 2 bits

  3. var reduced 2 bits

  4. None of the above


Correct Option: A

Built in Variable to tell you the PID of last started background process

  1. $$

  2. $#

  3. $_

  4. $!


Correct Option: D

The special variables $* and [email protected] denote all the _________ parameters

  1. positional

  2. variable

  3. Named

  4. internal


Correct Option: A

To start process and run it in background

  1. !

  2. $$

  3. &

  4. +


Correct Option: C

command to create and maintain library archives

  1. arch

  2. tar

  3. ar

  4. aux


Correct Option: C

Extract $length characters of substring from $string at $position.

  1. ${string:position:length}

  2. ${string:length:position}

  3. ${string:length-position}

  4. ${string::length::position}


Correct Option: A

Which of the following are Balanced Binary Search Trees?

  1. AVL trees.

  2. JBL trees

  3. Red-black Trees

  4. Blue-Green Trees


Correct Option: A,C

Name of very Efficient Maximum Flow Algorithm is

  1. Push algorithm

  2. Pop algorithm

  3. Push-Re label method

  4. Discoverer Route.


Correct Option: C

Which of the following techniques are used for optimization?

  1. Dynamic programming

  2. Cyclic coding

  3. Huffmann coding

  4. Greedy algorithm.


Correct Option: A,C,D

Time complexity of algorithm1 is T (n^2) and that of algorithm2 is T (n).Then which of the following statements are true?

  1. Algorithm1 beats algorithm2 when n tends to infinity

  2. Algorithm2 beats algorithm when n tends to infinity

  3. Nothing can be said about the performance of both algorithms for lower values of n

  4. Algorithm1 performs the same as algorithm2


Correct Option: B,C

Which of the following asymptotic notation is used to represent tighter bound?

  1. Big-O

  2. Small-O

  3. Omega

  4. theta


Correct Option: D

GC stands for

  1. Global Cache

  2. Garbage Collector

  3. Generation Code

  4. None


Correct Option: B

FCL stands for

  1. Fuctional Code Link

  2. Framework Class Language

  3. Framework Class Library

  4. None


Correct Option: C

WCF stands for

  1. Windows Cardspace Foundation

  2. Windows Communication Foundation

  3. Workflow Calculation Format

  4. None


Correct Option: B

BCL stands for

  1. Base Class Language

  2. Base Class Library

  3. Binary Coded Language

  4. None


Correct Option: B

CIL stands for

  1. Common Interface Language

  2. Common Intermediate Language

  3. Common Interpreter Language

  4. None


Correct Option: B

CLR stands for

  1. Common Language Runtime

  2. Common Language Routine

  3. Class Library Routine

  4. None


Correct Option: A
+ View questions