For the following questions answer them individually
Let A(1:8, -5:5, -10:5) be a three dimensional array. How many elements are there in the array A? elements are there in the array A?
The number of rotations required to insert a sequence of elements 9,6,5,8,7,10 into an empty AVL tree is?
The following stepsin a linkedlist
p = getnode()
info (p) = 10
next (p) = list
list = p
result in which type of operation?
Which of the following productions eliminate left recursion in the productions given below
$$S\rightarrow Aa\mid b$$
$$A\rightarrow Ac\mid Sd\mid ε$$
Considerthe following psuedocode:
$$X: integer := 1$$
$$y: integer := 2$$
procedure add
$$X:=X+y$$
procedure second (P: procedure)
$$x : integer := 2$$
$$P()$$
procedurefirst
$$y : integer := 3$$
second(add)
first()
write_integer(x)
Whatdoesit print if the language uses dynamic scoping with deep binding?
In an array of 2N elements that is both 2-ordered and 3-ordered, what is the maximum numberofpositions that an element can be from its position if the array were 1-ordered?
lf the frame buffer has 8 bits per pixel and 8 bits are allocated for each of the R, G, B components, what would be the size of the lookup table?