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

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

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

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

command1 || command2

command1 && command2

command1 // command2

command1 | command2

cat /etc/shells

cat /tmp/shells

cat /root/shell

echo $SHELLS

var left-shifted 2 bits

var mutliplied by 2 bits

var reduced 2 bits

None of the above

$$

$#

$_

$!

positional

variable

Named

internal

!

$$

&

+

arch

tar

ar

aux

${string:position:length}

${string:length:position}

${string:length-position}

${string::length::position}

AVL trees.

JBL trees

Red-black Trees

Blue-Green Trees

Push algorithm

Pop algorithm

Push-Re label method

Discoverer Route.

Dynamic programming

Cyclic coding

Huffmann coding

Greedy algorithm.

Algorithm1 beats algorithm2 when n tends to infinity

Algorithm2 beats algorithm when n tends to infinity

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

Algorithm1 performs the same as algorithm2

Big-O

Small-O

Omega

theta

Global Cache

Garbage Collector

Generation Code

None

Fuctional Code Link

Framework Class Language

Framework Class Library

None

Windows Cardspace Foundation

Windows Communication Foundation

Workflow Calculation Format

None

Base Class Language

Base Class Library

Binary Coded Language

None

Common Interface Language

Common Intermediate Language

Common Interpreter Language

None

Common Language Runtime

Common Language Routine

Class Library Routine

None