Q1.
Address stored in the pointer variable is of type ___
Integer
Floating
Array
Character
Answer - A
[Link] Condition is caused due to
Multi-Processing OS
Multi-Programming OS
Both of the above
None of the above
Answer - C
[Link] the following infix expression to postfix expression - A / B^C+D*E-A*C
ABC/ADE*+AC*-
ABC^/D*E+AC*-
ABC^/DE*+A*C-
ABC^/DE*+AC*-
Answer - D
[Link] average depth of a binary search tree is:
O(n^0.5)
O(n)
O(log n)
O(n log n)
Answer - C
Q5.A web cookie is a small piece of data
[Link] from the user and stored in the server while a user is browsing a website.
[Link] from a server and stored in the user's machine.
[Link] from root server to all servers.
[Link] of the above.
Answer - A
[Link] one of these is not a Database System Type?
Relational
Hierarchical
Network
MySql
Answer - D
[Link] constructors, can there be more than one destructor in a class?
True
False
Answer - B
[Link] logical operators in the C language evaluated with the short circuit?
True
False
Depends on the compiler
Depends on the standard
Answer - A
[Link] a full binary tree if the number of internal nodes is I, then number of leaves are?
L=2l
L=l+1
L=l-1
L=2l-1
Answer - B
[Link] search engines stores information about many web pages by a
Web Indexer
Web Crawler
Web Organizer
Web Router
Answer - B
[Link] are the worst case and average case complexities of a binary search tree?
O(n) , O(n)
O(logn) ,O(logn)
O(logn) ,O(n)
O(n), O(logn)
Answer - D
[Link] of the following can be used to get the remainder when an integer a is divided by
integer b?
a/b
b/a
a%b
b%a
Answer - C
[Link] of the following is not a type of inheritance?
Multiple
Multilevel
Distributive
Hierarchical
Answer - C
[Link] of the following true about FILE *fp
FILE is a keyword in C for representing files and fp is a variable of FILE type.
FILE is a structure and fp is a pointer to the structure of FILE type
FILE is a stream
FILE is a buffered stream
Answer - B
[Link] SQL, how can you insert a new record into the "Persons" table?
INSERT VALUES ('Jimmy', 'Jackson') INTO Persons
INSERT INTO Persons VALUES ('Jimmy', 'Jackson')
INSERT ('Jimmy', 'Jackson') INTO Persons
Answer - B
Q16.A complex problem which can be broken down into repeating sub-problems can be
solved by a method known as:
Recursion
Multithreaded Programming
Dynamic Programming
Functional Composition
Answer - C
[Link] offered by TCP is
Full-duplex
Half-duplex
Semi-duplex
Byte by byte
Answer - A
[Link] sizeof(void) in a 32-bit C compiler is ___
0
1
2
4
Answer - D
[Link] number of ways in which the numbers 1, 2, 3, 4, 5, 6, 7 can be inserted in an empty
binary Note: The height of a tree search tree, such that the resulting tree has height 6, is with
a single node is 0.
2
4
32
64
Answer - D
[Link] type of value does izeof return?
char
short
unsigned int
long
Answer - C
[Link] a relation is in BCNF, it is also in:
1NF
2NF
3NF
All of the above
Answer - D
Q22.A person wants to visit some places. He starts from a vertex and then wants to visit
every vertex till it finishes from one vertex, backtracks and then explore other vertex from
same vertex.
What algorithm he should use?
Depth First Search
Breadth First Search
Trim's algorithm
None of the mentioned
Answer - A
[Link] time required to examine the packet's header and determine where to direct the
packet is part of
Processing delay
Queuing delay
Transmission delay
All of the above
Answer - A
[Link] stands for?
Domain Name System
Direct Name System
Direct Network System
Domain Network System
Answer - A
Q25. How many copies of a static member of the class are created?
One per object
Zero
One
None of the above
Answer - C
[Link] SQL, how do you select all the records from a table named "Persons" where the
"LastName" is alphabetically between (and including) "Hansen" and "Pettersen"?
SELECT LastName>'Hansen' AND LastName<'Pettersen' FROM Persons
SELECT * FROM Persons WHERE LastName BETWEEN 'Hansen' AND 'Pettersen'
SELECT * FROM Persons WHERE LastName>'Hansen' AND LastName<'Pettersen’
Answer - B
[Link] of consecutive memory locations is called as
Function
Loop
Array
Pointer
Answer - C
[Link] many abstract methods should an abstract class have?
Zero
One
Two
Three
Answer - B
[Link] following numbers are inserted into an empty binary search tree in the given order:
10, 1, 3, 5, 15, 12, 16 What is the height of the binary search tree?
3
4
5
6
Answer - A
Q30. How many distinct binary search trees can be created out of 4 distinct keys?
4
14
24
42
Answer - B
Q31. What is the job of Assembler in C programming?
It converts source code into assembly code
It converts a assembly language program into machine language
It convert code generated by Preprocessor to assembly code
None of the above
Answer - B
[Link] is the function of the union operation?
It combines the results of any two different queries
It combines the results of two different queries which have the same set of attributes in the
select clause
It combines the results of two different queries which have the same condition in the where
clause
It gives the Cartesian product of the results of any 2 queries
Answer - B
[Link] delay does depend on
Packet length
Distance between the routers
Both of the above
None of the mentioned
Answer - B
[Link] of the following is the fastest storage unit?
Hard Disk Drive
Solid State Drive
CPU registers
Random Access Memory
Answer - C
[Link] handling is targeted at
Run-time error
Compile time error
Logical error
All of the above
Answer - A
[Link] HTTP request message is sent in ___ part of three-way handshake.
First
Second
Third
None of the above mentioned
Answer- D
[Link] is the output of the code given below?
#include <stdio.h>
int main()
{
int a = 10, b = 5, c = 5;
int d;
d=b+c== a;
printf("%d", d);
}
Syntax error
1
5
10
Answer - B
[Link] a computer is first turned on or restarted, a special type of absolute loader is
executed called:
Compile and Go loader
Windows loader
Bootstrap loader
Relating loader
Answer- C
[Link] is the output of the code below?
#include<stdio.h>
int main()
{
int a@ = 10;
printf("%d", a@);
return 0;
}
10
10@
@
[Error] stray '@' in program
Answer- D
[Link] of the following is true about linked list implementation of stack?
[Link] push operation, if new nodes are inserted at the beginning of linked list, then in pop
operation, nodes must be removed from end.
[Link] push operation, if new nodes are inserted at the end, then in pop operation, nodes must
be removed from the beginning.
[Link] of the above
[Link] of the above
Answer - D
[Link] function ___ obtains block of memory dynamically.
calloc
malloc
both calloc and malloc
free
Answer- C
[Link] is the output for the code given below? Assume that main function returns 0.
#include <stdio.h>
int main() {
int i;
for (i=0; i < -5; i--) {
printf("*");
}
}
*
*****
Nothing
Infinite Asterix
Answer- C
[Link] will be the output of the code given below?
#include<stdio.h>
int x = 10;
int main()
{
int x = 0;
printf("%d",x);
return 0;
}
10
Compilation Error
Undefined
0
Answer- D
[Link] of the following has a search efficiency of O(1)?
Tree
Heap
Hash table
Linked list
Answer- C
[Link] it possible to run program without main() function?
Yes
No
Answer - No
[Link] output of program
#include<stdio.h>
void main()
{
int var1=10;
{
int var1 = 20;
printf("%d %d", var1, var1);
}
printf("%d %d", var1, var1);
}
10 10 10 10
20 20 20 20
20 20 10 10
10 10 20 20
Answer - C
Q47. What part of object-oriented technology defines superclass and subclass relationships?
Inheritance
Scalability
Encapsulation
Polymorphism
Answer- A
[Link] the output of the following program?
#include<stdio.h>
int main()
{
int a = 100, b = 200, c = 300;
if(!a >= 500)
b = 300;
c = 400;
printf("%d,%d,%d", a, b, c);
return 0;
}
100,300,300
100,200,400
100,200,300
100,300,400
Answer- B
[Link] many times loop will get executed?
#include<stdio.h>
int main()
{
int i=0;
while(i <= 255)
{
printf("%d", i);
i++;
}
return 0;
}
1 Time
255 Times
Infinite Times
256 Times
Answer - D
[Link] will be the postfix expression for following infix expression: b * c + d/e
b*cde/+
bcd*e/+
bc*de/+
bc*de+/
Answer - C
[Link] is the output of the code below?
class Main {
public static void main(String args[]) {
try {
throw 10;
}
catch(int e) {
[Link]("Got the Exception " + e);
}
}
}
Got the Exception 10
Program will crash
Compile error
None of the above
Answer - C
[Link] of the following is not the member of class?
Static function
Friend function
Const function
Virtual function
Answer- B
[Link] of the following is a linear data structure? Please select all that apply.
Array
Queue
Stack
All of the above
Answer - D
[Link] will be the output for the code given below?
#include <iostream>
using namespace std;
int main ()
{
int x, y;
x = 2;
y = ++x * ++x;
cout << x << y;
x = 2;
y = x++ * ++x;
cout << x << y;
return 0;
}
412412
41248
49416
41649
Answer- B
[Link] will be the output for the code given below?
#include <stdio.h>
int main()
{
int i = 0;
switch (i)
{
}
case '0': printf("Hello");
break;
case '1': printf("World");
break;
default: printf("HelloWorld");
return 0;
}
Hello
World
HelloWorld
Compile-time error
Answer- D
[Link] multiple copies of the same data items
Data reduction
Data integrity
Data consistency
Data redundancy
Answer- D
[Link] is the output of the code given below?
#include <stdio.h>
void main()
{
int x = 97;
int y sizeof(x++);
printf("x is %d", x);
}
x is 97
x is 98
x is 99
Run time error
Answer - A
[Link] of the following statement is correct?
A constructor is called at the time of declaration of an object
A constructor is called at the time of use of an object.
A constructor is called at the time of declaration of a class.
A constructor is called at the time of use of a class
Answer- A
[Link] the numbers 7, 5, 1, 8, 3, 6, 0, 9, 4, 2 are inserted in that order into an initially
empty binary search tree. The binary search tree uses the usual ordering on natural
numbers. What is the in-order traversal sequence of the resultant tree?
7510324689
0243165987
0123456789
9864230157
Answer - C
[Link] values GET, POST, HEAD etc are specified in ___ message of HTTP
Request line
Response line
Status line
Entity body
Answer - A
[Link] is the output of the code given below?
#include <stdio.h>
int main() {
switch (20%13/2) {
case 0:
printf("Case 0");
case 1:
printf("Case 1");
case 2:
printf("Case 2");
default:
printf("Default case");
}
return 0;
}
Case 0
Case 1
Case 2
Default case
Answer- D
[Link] of the following is false about a binary search tree?
The left child is always lesser than its parent
The right child is always greater than its parent
The left and right sub-trees should also be binary search trees
None of the mentioned
Answer- D
[Link] plain HTML is used to create following type of website
Completely Dynamic Website
Completely Flash Website
Completely Static Website
None of these
Answer - C
Q64.A doubly linked list is declared as given below. Where Fwd and Bwd represent forward
and backward link to the adjacent elements of the list. Which of the following segments of
code deletes the node pointed to by X from the doubly linked list, if it is assumed that X
points to neither the first nor the last node of the list?
struct Node {
int Value;
struct Node *Fwd;
struct Node *Bwd;
);
X->Bwd->Fwd = X->Fwd; X->Fwd->Bwd = X->Bwd;
X->[Link] = X->Fwd: [Link]->Bwd = X->Bwd;
[Link]->Fwd = [Link]; X->[Link] = [Link];
X->Bwd->Fwd = X->Bwd; X->Fwd->Bwd = X->Fwd;
Answer- A
[Link] following function reverse() is supposed to reverse a singly linked list.
There is one line missing at the end of the function.
Link list node */
struct node
int data;
struct node next;
};
head ref is a double pointer which points to head (or start) pointer
of linked list "/
static void reverse(struct node** head_ref)
{
struct node* prev NULL;
struct node current *head_ref;
struct node next;
while (current != NULL)
{
next current->next;
current->next prev;
prev current;
current next;
}
/*ADD A STATEMENT HERE*/
}
*head_ref = prev;
*head_ref = current;
*head_ref = next;
*head_ref=NULL;
Answer - A
[Link] of the following occupies more memory in c?
long
int
double
char
Answer - C
[Link] time required to search an element in a linked list of length n is
O (log n)
O(1)
O(n)
O(n^2)
Answer- C
[Link] SQL, how do you select all the records from a table named "Persons" where the
value of the column "FirstName" starts with an "a"?
SELECT * FROM Persons WHERE FirstName LIKE 'a%'
SELECT * FROM Persons WHERE FirstName='%a%'
SELECT * FROM Persons WHERE FirstName='a'
SELECT * FROM Persons WHERE FirstName LIKE '%a'
Answer- A
[Link] is the time complexity for finding the height of the binary tree?
h = O(loglogn)
h = O(nlogn)
h = O(n)
h = O(log n)
Answer - C
[Link] is the output of the code given below?
#include <stdio.h>
int main() {
char* p = "deltax";l
char c;
for (int i = 0; i < 3; i++) {
c = *p++;
}
printf("%c", c);
}
d
l
t
a
Answer- l
[Link] a singly linked list of the form where F is a pointer to the first element in the
linked list and L is the pointer to the last element in the list. The time of which of the following
operations depends on the length of the list?
Delete the first element of the list
Delete the last element of the list
Add an element after the last element of the list
Interchange the first two elements of the list
Answer - B
[Link] is the time complexity of the following function?
function findElement(array, target) (
for (var i = 0 i < [Link]; i ++) (
if (array[i] === target) {
return array[i];
}
}
return null;
}
O(n ^ 2)
O(n^ * log(n) )
O(log(n))
O(1)
O(n)
Answer- E
[Link] the following query and choose the correct option
SELECT DISTINCT name FROM student WHERE ID IS NOT NULL;
The query is syntactically wrong
The query gives all the possible student names where a finite value exists for ID
The query gives the names of the students that have a null ID and it also excludes identical
names
The query gives the student names where a finite value exists for ID and it excludes identical
names
Answer- D
[Link] of the following ways are correct to comment out preprocessing of any line?
-#include<stdio.h>
// #include<stdio.h>
"#include<stdio.h>
##include<stdio.h>
Answer - B
[Link] sectors on disks are often known as
good blocks
destroyed blocks
bad blocks
none of the mentioned
Answer - C
Q76.A thread is also called:
Light Weight Process(LWP)
Heavy Weight Process(HWP)
Process
None of the mentioned
Answer- A
[Link] happens when you execute the below code?
Void main()
int i;
for(i=0; i<5; ++i++)
{ { printf("Hello"); } }
Hello is printed 5 times
Compilation Error
Hello is printed 2 times
Hello is printed 3 times
Answer - B
Q78. A full binary tree with 2n+1 nodes contains …………….
(A) n leaf nodes
(B) n non-leaf nodes
(C) n-1 leaf nodes
(D) n-1 non-leaf nodes
Answer: B
Q79. Which of the following statements about stacks is incorrect?
(A) Stacks can be implemented using linked lists.
(B) Stacks are first-in, first-out (FIFO) data structures.
(C) New nodes can only be added to the top of the stack.
(D) The last node (at the bottom) of a stack has a null (0) link.
Answer: B
Q80. If a node in a BST has two children, then its in-order predecessor has ………….
(A) no left child
(B) no right child
(C) two children
(D) no child
Answer: B
Q81. The worst case complexity of binary search matches with ……………
(A) interpolation search
(B) linear search
(C) merge sort
(D) none of the above
Answer: B
Q82. A binary tree in which if all its levels except possibly the last, have the maximum
number of nodes and all the nodes at the last level appear as far left as possible, is known
as
(A) full binary tree
(B) AVL tree
(C) threaded tree
(D) complete binary tree
Answer: A
Q83. A linear list of elements in which deletion can be done from one end (front) and
insertion can take place only at the other end (rear) is known as a ……………..
(A) Queue
(B) Stack
(C) Tree
(D) Linked list
Answer: A
Q84. What is the postfix form of the following prefix expression -A/B*C$DE ?
(A) ABCDE$*/-
(B) A-BCDE$*/-
(C) ABC$ED*/-
(D) A-BCDE$*/
Answer: A
Q85. The following formula will produce:
Fn = Fn-1 + Fn-2
(A) Armstrong Number
(B) Fibonacci Series
(C) Euler Number
(D) Prime Number
Answer: B
Q86. All possible spanning trees of graph G:
(A) have same number of edges and vertices.
(B) have same number of edges and but not vertices.
(C) have same number of vertices but not edges.
(D) depends upon algorithm being used.
Answer: A
Q87. A full binary tree with n leaves contains ………….
(A) n nodes
(B) log n2 nodes
(C) 2n –1 nodes
(D) 2n nodes
Answer: C
Q88. The Θ notation in asymptotic evaluation represents ………..
(A) Base case
(B) Average case
(C) Worst case
(D) NULL case
Answer: B
Q89. A sort which relatively passes through a list to exchange the first element with any
element less than it and then repeats with a new first element is called …………….
(A) Insertion sort
(B) Selection sort
(C) Heap sort
(D) Quick sort
Answer: D
Q90. Which of the following sorting algorithms does not have a worst case running time of
O(n2) ?
(A) Insertion sort
(B) Merge sort
(C) Quick sort
(D) Bubble sort
Answer: B
Q91. An undirected graph G with n vertices and e edges is represented by adjacency list.
What is the time required to generate all the connected components?
(A) O(n)
(B) O(e)
(C) O(e+n)
(D) O(e2)
Answer: C
Q92. A stable sorting algorithm:
(A) does not crash.
(B) does not run out of memory.
(C) does not change the sequence of appearance of elements.
(D) does not exists.
Answer: C
Q93. Consider a linked list of n elements. What is the time taken to insert an element after
an element pointed by some pointer?
(A) O(1)
(B) O(log2 n)
(C) O(n)
(D) O(n log2 n)
Answer: A
Q94. How many pointers are contained as data members in the nodes of a circular, doubly
linked list of integers with five nodes?
(A) 5
(B) 8
(C) 10
(D) 15
Answer: C
Q95. The smallest element of an array’s index is called its
(A) lower bound
(B) upper bound
(C) range
(D) extraction
Answer: A
Q96. In a circular linked list:
(A) components are all linked together in some sequential manner.
(B) there is no beginning and no end.
(C) components are arranged hierarchically.
(D) forward and backward traversal within the list is permitted.
Answer: B
Q97. What is the worst case run-time complexity of binary search algorithm?
(A) Ο(n2)
(B) Ο(nlog n)
(C) Ο(n3)
(D) Ο(n)
Answer: D
Q98. A graph with n vertices will definitely have a parallel edge or self loop of the total
number of edges are …………..
(A) more than n
(B) more than n+1
(C) more than (n+1)/2
(D) more than n(n-1)/2
Answer: D
Q99. Interpolation search is an improved variant of binary search. It is necessary for this
search algorithm to work that:
(A) data collection should be in sorted form and equally distributed.
(B) data collection should be in sorted form and but not equally distributed.
(C) data collection should be equally distributed but not sorted.
(D) None of these.
Answer: A
Q100. The minimum number of multiplications and additions required to evaluate the
polynomial P = 4×3+3×2-15x+45 is
(A) 6 & 3
(B) 4 & 2
(C) 3 & 3
(D) 8 & 3
Answer: C
Q101. Which of the following is an example of dynamic programming approach?
(A) Fibonacci Series
(B) Tower of Hanoi
(C) Dijkstra’s Shortest Path
(D) All of the above
Answer: D
Q102. A queue data-structure can be used for ……………
(A) expression parsing
(B) recursion
(C) resource allocation
(D) all of these
Answer: C
Q103. The maximum degree of any vertex in a simple graph with n vertices is:
(A) n–1
(B) n+1
(C) 2n–1
(D) n
Answer: A
Q104. The data structure required for Breadth First Traversal on a graph is ………….
(A) Queue
(B) Stack
(C) Array
(D) Tree
Answer: A
Q105. The quick sort algorithm exploit …………….. design technique.
(A) Greedy
(B) Dynamic programming
(C) Divide and Conquer
(D) Backtracking
Answer: C
Q106. The number of different directed trees with 3 nodes are:
(A) 2
(B) 3
(C) 4
(D) 5
Answer: B
Q107. One can convert a binary tree into its mirror image by traversing it in
(A) in-order
(B) pre-order
(C) post-order
(D) any order
Answer: C
Q108. The total number of comparisons required to merge 4 sorted files containing 15, 3, 9
and 8 records into a single sorted file is ………….
(A) 66
(B) 39
(C) 15
(D) 3
Ans: ?
Q109. Minimum number of moves required to solve a Tower of Hanoi puzzle is …………..
(A) 2^n2
(B) 2n-1
(C) 2n – 1
(D) 2n – 1
Answer: C
Q110. What kind of linked list begins with a pointer to the first node, and each node contains
a pointer to the next node, and the pointer in the last node points back to the first node?
(A) Circular, singly-linked list.
(B) Circular, doubly-linked list.
(C) Singly-linked list.
(D) Doubly-linked list.
Answer: A
Q111. A sorted file contains 16 items. Using binary search, the maximum number of
comparisons to search for an item in this file is ………..
(A) 15
(B) 8
(C) 1
(D) 4
Answer: D
Q112. Which of the following is not possible with an array in C programming language?
(A) Declaration
(B) Definition
(C) Dynamic Allocation
(D) Array of strings
Answer: C
Q113. One can determine whether an infix expression has balanced parenthesis or not by
using ………….
(A) Array
(B) Queue
(C) Stack
(D) Tree
Answer: C
Q114. An adaptive sorting algorithm …………..
(A) adapts to new computers
(B) takes advantage of already sorted elements
(C) takes input which is already sorted
(D) None of these
Answer: B
Q115. The average number of key comparisons done in successful sequential search in a
list of length n is …………..
(A) log n
(B) (n-1)/2
(C) n/2
(D) (n+1)/2
Answer: D
Q116. What are the time complexities of finding 8th element from beginning and 8th element
from end in a singly linked list? Let n be the number of nodes in linked list, you may assume
that n>8.
(A) O(n) and O(n)
(B) O(1) and O(1)
(C) O(n) and O(1)
(D) O(1) and O(n)
Answer: D
Q117. Recursion is memory-intensive because:
(A) Recursive functions tend to declare many local variables.
(B) Previous function calls are still open when the function calls itself and the activation
records of these previous calls still occupy space on the call stack.
(C) Many copies of the function code are created.
(D) It requires large data values.
Answer: B
Q118. The maximum number of nodes in a binary tree of depth 5 is ……………
(A) 31
(B) 16
(C) 32
(D) 15
Answer: A
Q119. The traveling salesman problem is an example of ……………….
(A) Dynamic Algorithm
(B) Greedy Algorithm
(C) Recursive Approach
(D) Divide & Conquer
Answer: B
Q120. In a min-heap:
(A) parent nodes have values greater than or equal to their Childs
(B) parent nodes have values less than or equal to their Childs
(C) both statements are true
(D) both statements are wrong
Answer: A
Q121. n elements of a Queue are to be reversed using another queue. The number of “ADD”
and “REMOVE” operations required to do so is:
(A) 2*n
(B) 4*n
(C) n
(D) The task cannot be accomplished
Answer: D
Q122. A complete binary tree with n leaf nodes has …………..
(A) n+1 nodes
(B) 2n-1 nodes
(C) 2n+1 nodes
(D) n(n-1)/2 nodes
Answer: B
Q123. A binary tree can be converted in to its mirror image by traversing it in …………..
(A) In-order
(B) Pre-order
(C) Post-order
(D) Any order
Answer: B
Q124. The time required to delete a node x from a doubly linked list having n nodes is
………….
(A) O(n)
(B) O(log n)
(C) O(1)
(D) O(n log n)
Answer: C
Q125. In doubly linked lists:
(A) a pointer is maintained to store both next and previous nodes.
(B) two pointers are maintained to store next and previous nodes.
(C) a pointer to self is maintained for each node.
(D) none of these
Answer: B
Q126. One can convert an infix expression to a postfix expression using a …………..
(A) Stack
(B) Queue
(C) Deque
(D) None of these
Answer: A
Q127. Which one of the below mentioned is linear data structure?
(A) Queue
(B) Stack
(C) Arrays
(D) All of these
Answer: D
Q128. Which of the following types of expressions do not require precedence rules for
evaluation?
(A) fully parenthesised infix expression
(B) postfix expression
(C) partially parenthesised infix expression
(D) more than one of the above
Answer: A
Q129. Overflow conditions in the linked list may occur when attempting to ………….
(A) Create a node when the free space pool is empty.
(B) Traverse the nodes when the free space pool is empty.
(C) Create a node when the linked list is empty.
(D) None of these.
Answer: A
Q130. Linked lists are not suitable data structures for which one of the following problems?
(A) Insertion sort
(B) Binary search
(C) Radix sort
(D) Polynomial manipulation
Answer: B
Q131. Which of the following is/are the levels of implementation of data structure
A) Abstract level
B) Application level
C) Implementation level
D) All of the above
Answer: D
Q132. A binary search tree whose left subtree and right subtree differ in hight by at most 1
unit is called ……
A) AVL tree
B) Red-black tree
C) Lemma tree
D) None of the above
Answer: A
Q133. ……………….. level is where the model becomes compatible executable code
A) Abstract level
B) Application level
C) Implementation level
D) All of the above
Answer: C