Professional Documents
Culture Documents
20 bits
24 bits
32 bits
up
down
Left
Copy of the variable is c Copy of the variable is Created both
Little-Endian
Big-Endian
Bi-Endian
0
1 0 or 1
i value is incremented if i value is incremented ii value is incremented if
signed
unsigned
short
0X80000
0X7FFFF
0X00000
45
0 garbage
5% %d
-135
Hi
05
-3
Hello
Compilation Error
33 11
integers
24 11
24 5
integers and charactersintegers and floats
x=10 y=2
x=10 y=4
Right shifting operator cast operator
Compilation error
sizeof operator
0 Garbage
z2
z1z2
Compilation error
Address operator can notAddress operator can be
Use of register declarati
Adding 9 integers
20 error
p1 + 2
p2 2
p2 + p1
BC
3 10
j = j + 1;
33
j =+ 1;
10 3
j++;
Hello Hello
world world
Hello world
20
25
45
45
6
-16
declared in the main ( ) fdeclared in any function
declared outside the bod
library function
user defined function header
scale factor
a zero
length factor
a non zero number
pointer factor
a negative number
123
-1 2 3
12345
printf ( )
scanf ( )
putchar ( )
reads a character from areads an integer from agives the current position
gives an error message assigns a value 16 to i assigns a value 18 to i
2^16-1
a string
2^15-1
a string constant
2^16
a character
must yield the same valumust yield different valmay or may not yield the
prints 8
prints 6
prints 6 or 8 depending
mi
mix
mixx
It is assumed to be preseIt is assumed to be pre It results in a syntax erro
automatic
external
static
3
4
5
prints the name of the soprints argv.
prints the number of co
ABDULbbbbb
bbbbbABDUL
ABDULbbbbbbbbbb
a++
!a>5
a|b
198.736
malloc
IO.H
198.73
free
STDLIB.H
198.74
alloc
CONIO.H
# remdef
# pragma
# undef
a=1.5, p=3.6
remainder( )
a=2, p=3
mod( )
97
2801
176
2600
10
20
\a
square(x)
T
sqr(x)
\0
sqrt(x)
143
123
246
An invoking function musEvery function returns a
A function may contain
hello
Queue
hye
Stack
4
syntax error
Linked List
8
20
\n
\r
endp
end0p
end
1000 Zero
realloc
Pointers
AB + CD*E *F*
2^(d-1)+1
O(n^2)
left, root, right
2, 3 or 4 children
malloc
String
AB+ CDE + * F*
2^(d+1)-1
O(n)
root, left, right
1, 2 or 3 children
calloc
Structure
AB+ CD EF + **
2^(d-1)-1
O(n log n)
right, root, left
2, 4 or 6 children
Quick sort
BST
Merge sort
Complete Binary Tree
7
m+n
O(n)
D,F,G,A,B,C,H,E
Insertion sort
AVL-tree
6
mn
O(2n)
F,H,D,G,E,B,C,A
9
1
6
10
max(m, n)
O(n^2)
C,G,H ,F,E,D,B,A
11
0
5
15
2
4
Insertion sort
Radix sort
Merge sort
Linked list
Array
String
Height of its left subtreeHeight of its right subt Its distance from the roo
First element of the list Last element of the listRandomly chosen element
O (n)
O (lg n)
O (n^2)
50
65
61
more than n
more than n+1
more than (n+1)/2
Quick Sort
Heap Sort
Shell Sort
Threaded binary trees. AVL Tree
B+ tree
2
3
4
0
8
16
Inorder
Preorder
Postorder
15
30
14
4
3
5
Stack
Queue
Dequeue
Queue
Stack
In-built structure
Binary Search Tree.
AVL Tree.
Heap.
its time complexity is co preserves the original oits space complexity is c
AVL Tree.
Complete Binary Tree. B Tree.
Queue.
Graph.
Stack.
Inorder.
Preorder.
Postorder.
+AB-*CD.
-+A B C * D.
-+A B * C D.
n*(n-2).
n*(n-1).
n*(n-1)/2.
O (n).
O (2n).
O (n^ 2 )
Trees
Graphs
Priority Queues
0,1 or 1
2,1 or 0
0,1 or 2
Simulation , event drive Postfix and prefix mani Dictionary systems, pol
LL, RL and LR, RR
LL, RR and LR, RL
LR, RR and LL, RL
Huffman coding, linear hBucket addressing, HufChaining, Huffman codin
Insertion sort
Selection sort
Quick sort
Adjacency tree
Adjacency linked list
Adjacency graph
O(2^n)
O(n^3)
O(n^2)
Overflow of run-time staUnderflow of registers Overflow of I/O cycles
4
8
16
O (n)
O (log n)
O (n log n)
1
2
3
End Key
Stop Key
Sentinel
Deleting a node whose loSearching of an unsorted
Inserting a new node aft
Preorder
Inorder
Postorder
9 edges
11 edges
10 edges
15
8
1
Array
Queue
Stack
log n
(n-1)/2
n/2
31
16
32
2*n
4*n
n
n+1 nodes
2n-1 nodes
2n+1 nodes
Inorder
Preorder
Postorder
stack
Queue
Deque
fully parenthesised infix postfix expression
partially parenthesised i
Create a node when freeTraverse the nodes when
Create a node when linked
insertion sort
binary search
radix sort
merge sort
quick sort
selection sort
indexed sequential searcinterpolation search
sequential search
AB^C*D-EF/GH+/+
AB^CD-EP/GH+/+*
ABCDEFGH+//+-*^
/+-AB*CD.
/*+-ABCD*EF.
*/*+AB-CDEF.
selection sort.
insertion sort.
Heap sort.
log2 n nodes
n+1 nodes.
2n nodes.
n edges.
a cycle of odd length. no cycle of odd length.
queues.
stacks.
linked lists.
Binary search tree
AVL - tree
Complete tree
Answer
None
right
Not created in both
None
None
B
B
B
B
C
None
long
None
B
D
B
None of these
None of these
121 D
None of these
compilation error
D
integers,floats,and doubA
None of these
B
Token pasting operator C
None of these
None of these
None of the above
D
A
None of these
garbage value
assigns 5 to a
None of the above
a+ mode
D
C
A
p2 p1
bc
10 10
j += 1;
A
B
90 A
-1 A
declared any where in t C
statement
A
increment factor
an integer
D
D
12 C
getchar ( )
D
sets the position to the C
assigns a value 19 to i A
2^15
an alphabet
B
B
is syntactically wrong
1 9 8 . 7 35
calloc
STDIO.H
C
C
D
# define
a=1, p=3
rem( )
C
C
3A
/n
No built-in function
D
C
226
A
Every function must be d
A
hellohye
Tree
\p
A
B
2C
D
error
Syntax error
C
B
D
B
B
A
B
B
C
A
B
C
C
B
Heap sort
B-tree
C
C
5C
min(m, n)
B
O(log n)
A
D,F,H,G,E,B,C,A
D
20 A
1
C
3B
Bubble sort
A
None of these
A
None of these
C
Median of the list
A
O (n lg n)
D
69 C
more than n(n-1)/2
D
Bubble Sort
D
Heap
C
5C
4B
Any order
B
16 C
6B
None of these
A
None of the above
B
Threaded Binary Tree. C
it sorts any volume of d B
B+ tree
A
Tree.
C
Any order.
B
- + *ABCD.
C
n*(n-1)*(n-2)
C
O (log n).
A
Linked List
D
All the above
A
Fixed block storage alloD
LR, RL and LR, RL
B
Chaining, Bucket addresD
Merge sort
C
Adjacency queue
B
O(2n)
Underflow of run-time s A
32 C
O (n^2)
C
4D
Transposition
C
Traversing the list to p A
Any of the three orders B
9 vertices
A
4D
Tree
C
(n+1)/2
D
15 A
The task cannot be accoD
n(n-1)/2 nodes
B
Anyorder
B
none of these
A
more than one of the abA
None of these.
A
polynomial manipulatio B
none of these
B
tree search
A
AB^D +EFGH +//*+
A
**AB+CD/EF.
C
quick sort.
C
2n+l nodes.
D
n^2 edges.
C
strings.
B
Threaded binary tree
B