1.
Which of the following is/are the levels of implementation of data structure
[Link] level
[Link] level
[Link] level
[Link] of the above
Ans: D
2.……………….. level is where the model becomes compatible executable code.
[Link] level
[Link] level
[Link] level
[Link] of the above
Ans:c
3.…………… is not the component of data structure.
[Link]
[Link] Structures
[Link]
[Link] of the above
ans:d
[Link] of the following is not the part of ADT description?
[Link]
[Link]
[Link] of the above
[Link] of the above
Ans:d
[Link] of the following data structure is non linear type?
[Link]
[Link]
[Link]
[Link]
Ans:d
[Link] of the following data structure is linear type?
[Link]
[Link]
[Link] tree
[Link]
Ans:d
[Link] represent hierarchical relationship between elements, Which data structure is suitable?
[Link]
[Link]
[Link]
[Link]
Ans:c
[Link] the following.
a) Completeness i) How long does it take to find a solution
b)Time Complexity ii) How much memory need to perform the search.
c)Space Complexity iii) Is the strategy guaranteed to find the solution when there in one.
a.a-iii, b-ii, c-i
b.a-i, b-ii, c-iii
c.a-iii, b-i, c-ii
d.a-i, b-iii, c-ii
Ans:c
[Link] new data are to be inserted into a data structure, but there is not available space; this situation is usually
[Link]
[Link]
[Link]
[Link]
Ans:b
[Link] of the following is true about the characteristics of abstract data types?
i)It exports a type.
ii)It exports a set of operations.
[Link], False
[Link], True
[Link], True
[Link], False
Ans:c
[Link] of the following data structures are indexed structures?
[Link] arrays
[Link] lists
[Link]
[Link]
Ans:a
[Link] on a data structure may be …..
[Link]
[Link]
[Link]
[Link] of the above
Ans:d
[Link] of the following are the operations applicable an primitive data structures?
[Link]
[Link]
[Link]
[Link] of the above
Ans:d
[Link] of the following data structure is non-linear type?
[Link]
[Link]
[Link]
[Link]
Ans:d
[Link] indirect change of the values of a variable in one module by another module is called
[Link] change
[Link]-module change
[Link] effect
[Link]-module update
Ans:c
[Link] operation of processing each element in the list is known as
[Link]
[Link]
[Link]
[Link]
Ans:d
[Link] of the following data structure can't store the non-homogeneous data elements?
[Link]
[Link]
[Link]
[Link] of the above
Ans:a
The difference between linear array and a record is
a. An array is suitable for homogeneous data but hte data items in a r data type
[Link] a record, there may not be a natural ordering in opposed to linear
c. A record form a hierarchical structure but a lienear array does not
d. All of above
Ans:d
[Link] data abstraction which allows conceptual representation of data in database management system is cons
[Link] design model
[Link] model
[Link] model
[Link] friendly model
Ans:b
[Link] abstraction concepts, process of assigning similar entities to similar entity types systematically is c
[Link]
[Link]
[Link]
[Link] abstract
Ans:a
[Link] if the following is/are the levels of implementation of data structure
[Link] level
[Link] level
[Link] level
[Link] of the above
Ans:d
[Link] data type is most suitable for storing a number 65000 in a 32-bit system?
[Link]
[Link]
[Link]
[Link]
Ans:a
[Link] of the following is a User-defined data type?
[Link] int Boolean;
[Link] enum {Mon, Tue, Wed, Thu, Fri} Workdays;
[Link] {char name[10], int age};
[Link] of the mentioned
Ans:d
[Link] is the worst case time complexity of linear search algorithm?
a.Ο(1)
b.Ο(n)
c.Ο(log n)
d.Ο(n2)
Ans:b
[Link] algorithm is
a.a piece of code to be executed.
b.a loosely written code to make final code.
c.a step by step procedure to solve problem.
[Link] of the above.
Ans:c
[Link] context with time-complexity, find the odd out −
[Link] from Linked List.
[Link] in Hash Table
[Link] edge in Adjacency Matrix
[Link] a Binary Heap
Ans:d
[Link] search is an improved variant of binary search. It is necessary for this search algorithm to work th
[Link] collection should be in sorted form and equally distributed.
[Link] collection should be in sorted form and but not equally distributed.
[Link] collection should be equally distributed but not sorted.
[Link] of the above.
Ans:a
[Link] the array is already sorted, which of these algorithms will exhibit the best performance
[Link] Sort
[Link] Sort
[Link] Sort
[Link] Sort
Ans:b
[Link] of these algorithmic approach tries to achieve localized optimum solution −
[Link] approach
[Link] and conquer approach
[Link] approach
[Link] of the above
Ans:a
[Link] analysis of an algorithm assumes that −
[Link] algorithm has been tested before in real environment.
[Link] other factors like CPU speed are constant and have no effect on implementation.
[Link] algorithm needs not to be practical.
[Link] of the above.
Ans:b
[Link] algorithm analysis does not include −
[Link] Complexity
[Link] Complexity
[Link] Complexity
[Link] of the above
Ans:c
. Which of the following asymptotic notation is the worst among all?
a.Ο(n+9378)
b.Ο(n3)
c.nΟ(1)
d.2Ο(n)
Ans:b
. Two main measures for the efficiency of an algorithm are
[Link] and memory
[Link] and capacity
[Link] and space
[Link] and space
Ans:c
. The time factor when determining the efficiency of algorithm is measured by
[Link] microseconds
[Link] the number of key operations
[Link] the number of statements
[Link] the kilobytes of algorithm
Ans:b
Array:
[Link] of the following is not possible with an array in C programming language −
[Link]
[Link]
[Link] Allocation
[Link] of strings
Ans:c
[Link] of arrays in C programming langauge starts from
a.0
b.1
[Link] 0 or 1
[Link]
Ans:a
[Link] of the following data structure can’t store the non-homogeneous data elements?
[Link]
[Link]
[Link]
[Link]
Ans:a
[Link] use of pointers to refer elements of a data structure in which elements are logically adjacent is ….
[Link]
[Link] allocation
[Link]
[Link]
Ans:b
[Link] are best data structures
[Link] relatively permanent collections of data
[Link] the size of the structure and the data in the structure are constantly changing
[Link] both of above situation
[Link] non of above situation
Ans:a
[Link] of the following statement is false?
[Link] are dense lists and static data structure.
[Link] elements in linked list need not be stored in adjacent space in memory
[Link] store the next data element of a list.
[Link] lists are collection of the nodes that contain information part and next pointer.
Ans:c
7.A …………………… does not keep track of address of every element in the list.
[Link]
[Link]
[Link] array
[Link]
Ans:c
[Link] array declaration need not give, implicitly or explicitly, the information about
[Link] name of array
[Link] data type of array
[Link] first data from the set to be stored
[Link] index set of the array
Ans:c
[Link] elements of an array are stored successively in memory cells because
[Link] this way computer can keep track only the address of the first element and the addresses of other element
[Link] architecture of computer memory does not allow arrays to store other than serially
[Link] of above
[Link] of above
Ans:a
[Link] memory address of the first element of an array is called
[Link] address
[Link] address
[Link] address
[Link] address
Ans:d
[Link] memory address of fifth element of an array can be calculated by the formula
[Link](Array[5]=Base(Array)+w(5-lower bound), where w is the number of words per memory cell for the array
[Link](Array[5])=Base(Array[5])+(5-lower bound), where w is the number of words per memory cell for the array
[Link](Array[5])=Base(Array[4])+(5-Upper bound), where w is the number of words per memory cell for the arra
[Link] of above
Ans:a
[Link] dimensional arrays are also called
[Link] arrays
[Link] arrays
[Link] of above
[Link] of above
Ans:c
13.A variable P is called pointer if
a.P contains the address of an element in DATA
b.P points to the address of first element in DATA
c.P can store only memory addresses
d.P contain the DATA and the address of DATA
Ans:a
[Link] is right way to Initialize array?
[Link] num[6] = { 2, 4, 12, 5, 45, 5 };
[Link] n{} = { 2, 4, 12, 5, 45, 5 };
[Link] n{6} = { 2, 4, 12 };
[Link] n(6) = { 2, 4, 12, 5, 45, 5 };
Ans:a
[Link] array elements are always stored in ________ memory locations.
[Link]
[Link]
[Link] and Random
[Link] of the above
Ans:a
[Link] of the array need not be specified, when
[Link] is a part of definition
[Link] is a declaratrion
[Link] is a formal parameter
[Link] of these
Ans:d
[Link] does the following declaration mean? int (*ptr)[10];
[Link] is array of pointers to 10 integers
[Link] is a pointer to an array of 10 integers
[Link] is an array of 10 integers
[Link] is an pointer to array
Ans:b
[Link] passed as an argument to a function is interpreted as
[Link] of the array.
[Link] of the first elements of the array.
[Link] of the first element of the array.
[Link] of element of the array.
Ans:c
[Link] of the following correctly accesses the seventh element stored in arr, an array with 100 elements?
[Link][6]
[Link][7]
[Link]{6}
[Link]{7}
Ans:a
[Link] smallest element of an array’s index is called its
[Link] bound
[Link] bound
[Link]
[Link]
Ans:a
[Link] searching technique that takes O (1) time to find a data is
a. Linear Search
b. Binary Search
c. Hashing
d. Tree Search
Ans:c
[Link] h is any hashing function and is used to hash n keys in to a table of size m, where n<=m, the expected numb a
particular key x is :
[Link] than 1
[Link] than n
[Link] than m
[Link] than n/2
Ans:a
29.A technique for direct search is
[Link] Search
[Link] Search
[Link] Search
[Link]
Ans:d
Sorting and Searching
[Link] is not true about insertion sort?
[Link] the worst case performance when the initial array is sorted in reverse order.
[Link] case and average case performance is Ο(n2)
[Link] be compared to the way a card player arranges his card from a card deck.
[Link] of the above.
Ans:d
[Link] of the following has search efficiency of Ο(1) −
[Link]
[Link]
[Link] Table
[Link]-List
Ans:c
[Link] of the following algorithm is not stable?
[Link] Sort
[Link] Sort
[Link] Sort
[Link] Sort
Ans:b
[Link] of the below mentioned sorting algorithms are not stable?
[Link] Sort
[Link] Sort
[Link] Sort
[Link] Sort
Ans:a
5.A pivot element to partition unsorted list is used in
[Link] Sort
[Link] Sort
[Link] Sort
[Link] Sort
Ans:b
[Link] of the following algorithm does not divide the list −
[Link] search
[Link] search
[Link] sort
[Link] sort
Ans:a
[Link] required to merge two sorted lists of size m and n, is
a.Ο(m | n)
b.Ο(m + n)
c.Ο(m log n)
d.Ο(n log m)
Ans:b
[Link] sort algorithm is an example of
[Link] approach
[Link] binary search
[Link] Programming
[Link] and conquer
Ans:d
[Link] sort running time depends on the selection of
[Link] of array
[Link] element
[Link] of values
[Link] of the above
Ans:b
[Link] one of the below is not divide and conquer approach?
[Link] Sort
[Link] Sort
[Link] Sort
[Link] Sort
Ans:b
[Link] of the following searching techniques do not require the data to be in sorted form
[Link] Search
[Link] Search
[Link] Search
[Link] of the above
Ans:c
[Link] of the below given sorting techniques has highest best-case runtime complexity
[Link] sort
[Link] sort
[Link] sort
[Link] sort
Ans:b
[Link] many swaps are required to sort the given array using bubble sort - { 2, 5, 1, 3, 4} ?
a.4
b.5
c.6
d.7
Ans:a
[Link] adaptive sorting algorithm −
[Link] to new computers.
[Link] advantage of already sorted elements.
[Link] input which is already sorted.
[Link] of the above.
Ans:b
[Link] following sorting algorithms maintain two sub-lists, one sorted and one to be sorted −
[Link] Sort
[Link] Sort
[Link] Sort
[Link] A & B
Ans:d
[Link] worst case complexity of binary search matches with −
[Link] search
[Link] search
[Link] sort
[Link] of the abov
Ans:b
[Link] number of comparisons done by sequential search is ………………
a.(N/2)+1
b.(N+1)/2
c.(N-1)/2
d.(N+2)/2
Ans:b
[Link] ……………, search start at the beginning of the list and check every element in the list.
[Link] search
[Link] search
[Link] Search
[Link] Tree search
Ans:a
[Link] True or False.
i)Binary search is used for searching in a sorted array.
ii)The time complexity of binary search is O(logn).
[Link], False
[Link], True
[Link], False
[Link], True
Ans:d
[Link] of the following is not the internal sort?
[Link] Sort
[Link] Sort
[Link] Sort
[Link] Sort
Ans:c
[Link] general, the binary search method needs no more than ……………. comparisons.
a.[log2n]-1
b.[logn]+1
c.[log2n]
d.[log2n]+1
Ans:d
[Link] Worst case occur in linear search algorithm when
[Link] is somewhere in the middle of the array
[Link] is not in the array at all
[Link] is the last element in the array
[Link] is the last element in the array or is not there at all
Ans:d
[Link] Average case occur in linear search algorithm
[Link] Item is somewhere in the middle of the array
[Link] Item is not in the array at all
[Link] Item is the last element in the array
[Link] Item is the last element in the array or is not there at all
Ans:a
[Link] of the following is not the required condition for binary search algorithm?
[Link] list must be sorted
[Link] should be the direct access to the middle element in any sublist
[Link] must be mechanism to delete and/or insert elements in list
[Link] of above
Ans:c
[Link] of the following is not a limitation of binary search algorithm?
[Link] use a sorted array
[Link] of sorted array is expensive when a lot of insertion and deletions are needed
[Link] must be a mechanism to access middle element directly
[Link] search algorithm is not efficient when the data elements are more than 1000
Ans:d
[Link] search algorithm can not be applied to
[Link] linked list
[Link] binary trees
[Link] linear array
[Link] array
Ans:a
[Link] number of interchanges required to sort 5, 1, 6, 2 4 in ascending order using Bubble Sort is
a.6
b.5
c.7
d.8
Ans:b
[Link] worst case Quick Sort has order
a.O (n log n)
b.O (n^2 /2)
c.O (log n)
d.O (n^2 /4)
Ans:b
33.A sort which relatively passes through a list to exchange the first element with any element less than it and
then element is called
[Link] sort
[Link] sort
[Link] sort
[Link] sort
Ans:d
[Link] of the following sorting algorithms does not have a worst case running time of O (n^2) ?
[Link] sort
[Link] sort
[Link] sort
[Link] sort
Ans:b
[Link] quick sort algorithm exploit _________ design technique.
[Link]
[Link] programming
[Link] and Conquer
[Link]
Ans:c
[Link] total number of companions required to merge 4 sorted files containing 15, 3, 9 and 8 records into a single
a.66
b.39
c.33
d.15
Ans:c
[Link] complexity of searching an element from a set of n elements using Binary search algorithm is
a.O(n)
b.O(log n)
c.O(n^2)
d.O(n log n)
Ans:b
[Link] of the following sorting methods would be most suitable for sorting a list which is almost sorted
[Link] Sort
[Link] Sort
[Link] Sort
[Link] Sort
Ans:a
[Link] sort is also known as
[Link] sort
[Link] sort
[Link] sort
[Link] of these
Ans:d
[Link] goal of hashing is to produce a search that takes
a.O(1) time
b.O(n^2 ) time
c.O(log n ) time
d.O(n log n ) time
Ans:a
[Link] best average behaviour is shown by
[Link] Sort
[Link] Sort
[Link] Sort
[Link] Sort
Ans:a
[Link] that n elements are to be sorted. What is the worst case time complexity of Bubble sort?
a.O(1)
b.O(logn)
c.O(n)
d.O(n^2)
Ans:d
43.A characteristic of the data that binary search uses but the linear search ignores is the___________.
[Link] of the elements of the list.
[Link] of the list.
[Link] value in list.
[Link] of elements of the list.
Ans:a
[Link] binary search, average number of comparison required for searching an element in a list if n numbers is
a.log2 n
b.n /2
c.n
d.n-1
Ans:a
[Link] worst case of quick sort has order
a.O(n^2 )
b.O(n)
c.O (n log2 n)
d.O (log2 n)
Ans:a
[Link] technique is suitable for performing a search in a small array or in an unsorted array?
[Link] search
[Link]
[Link] search
[Link]
Ans:c
[Link] finds the largest element in the array, and puts it in the proper place?
[Link] sort
[Link] sort
[Link] sort
[Link] of the above
Ans:a
[Link] running time of heap sort is __________.
a.G(N*lgN)
b.N(N*lgN)
c.O(N*lgN)
[Link] of the above
Ans:c
[Link] perform the heap sort, you need to create a tree with all nodes greater than their __________.
[Link]
[Link]
[Link]
[Link] of the above
Ans:b
9.__________ refers to the set of all possible solutions to a problem.
[Link] searching
[Link]-force search
[Link] space
[Link] of the above
Ans:c
[Link] running time of the following sorting algorithm depends on whether the partitioning is balanced or unbalanc
[Link] sort
[Link] sort
[Link] sort
[Link] sort
View Answer c
[Link] merging two sorted lists of sizes m and n into a sorted list of size m + n, we require comparisons of
a.O(m)
b.O(n)
c.O(m+n)
d.O(log(m) + log(n))
Ans:c
Linked list
[Link] -> [Link]; will make
[Link] inaccessible
[Link] inaccessible
[Link] node inaccessible
[Link] of the above
ANs:a
2.A circular linked list can be used for
[Link]
[Link]
[Link] Stack & Queue
[Link] Stack or Queue
Ans:c
[Link] doubly linked lists
a.a pointer is maintained to store both next and previous nodes.
[Link] pointers are maintained to store next and previous nodes.
c.a pointer to self is maintained for each node.
[Link] of the abov
Ans:b
4.………… is very useful in situation when data have to stored and then retrieved in reverse order.
[Link]
[Link]
[Link]
[Link] list
Ans:a
[Link] advantage of …………….. is that they solve the problem if sequential storage representation. But
disadva sequential lists.
[Link]
[Link] Lists
[Link]
[Link]
Ans:b
[Link] is an extra element at the head of the list called a ……….
[Link]
[Link]
[Link] header
[Link] head
Ans:b
[Link] node in a linked list has two pairs of ………….. and ……………….
[Link] field and information field
[Link] field and avail field
[Link] field and information field
[Link] field and link field
Ans:a
[Link] disadvantage in using a circular linked list is …………………….
[Link] is possible to get into infinite loop
[Link] node points to first node.
[Link] consuming
[Link] more memory space
Ans:a
9.A linear list in which each node has pointers to point to the predecessor and successors nodes is called as
[Link] Linked List
[Link] Linked List
[Link] Linked List
[Link] Linked List
Ans:c
[Link] lists are best suited
[Link] relatively permanent collections of data
[Link] the size of the structure and the data in the structure are constantly changing
[Link] both of above situation
[Link] none of above situation
Ans:b
[Link] situation when in a linked list START=NULL is
[Link]
[Link]
[Link]
[Link]
Ans:a
[Link] of the following is two way list?
[Link] header list
[Link] header list
[Link] list with header and trailer nodes
[Link] of above
Ans:d
[Link] a circular linked list
[Link] are all linked together in some sequential manner.
[Link] is no beginning and no end.
[Link] are arranged hierarchically.
[Link] and backward traversal within the list is permitted.
Ans:b
14.A linear collection of data elements where the linear node is given by means of pointer is called?
[Link] list
[Link] list
[Link] list
[Link] of the above
Ans:a
[Link] of the following operations is performed more efficiently by doubly linked list than by singly linked list?
[Link] a node whose location in given
[Link] of an unsorted list for a given item
[Link] a node after the node with given location
[Link] a list to process each node
Ans:a
[Link] would be the asymptotic time complexity to add a node at the end of singly linked list, if the pointer is ini of the
list?
a.O(1)
b.O(n)
c.θ (n)
d.θ (1)
Ans:c
17.A variant of linked list in which last node of the list points to the first node of the list is?
[Link] linked list
[Link] linked list
[Link] linked list
[Link] linked list
Ans:c
[Link] doubly linked lists, traversal can be performed?
[Link] in forward direction
[Link] in reverse direction
[Link] both directions
[Link] of the above
Ans:c
19. What kind of linked list is best to answer question like “What is the item at position n?”
[Link] linked list
[Link] linked list
[Link] linked list
[Link] implementation of linked list
Ans:d
20.A variation of linked list is circular linked list, in which the last node in the list points to first node of the list. On list is?
[Link] waste memory space since the pointer head already points to the first node and thus the list node does not node.
[Link] is not possible to add a node at the end of the list.
[Link] is difficult to traverse the list as the pointer of the last node is now not NULL
[Link] of above
Ans:c
21.A variant of the linked list in which none of the node contains NULL pointer is?
[Link] linked list
[Link] linked list
[Link] linked list
[Link] of the above
Ans:c
[Link] circular linked list, insertion of node requires modification of?
[Link] pointer
[Link] pointer
[Link] pointer
[Link] no modification
Ans:b
[Link] a linked list of n elements. What is the time taken to insert an element after an element pointed by s
a.O (1)
b.O (log n)
c.O (n)
d.O (n log n)
Ans:a
[Link] a linked list with n nodes, the time taken to insert an element after an element pointed by some pointer is
a.0 (1)
b.0 (log n)
c.0 (n)
d.0 (n log n)
Ans:a
25.A linear collection of data elements where the linear node is given by means of pointer is called
[Link] list
[Link] list
[Link] list
[Link] of these
Ans:a
[Link] 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)
Ans:c
27.A collection of data items of similar type arranged in a sequence is termed as?
[Link] space
[Link] data structure
[Link] structure
[Link]
Ans:d
28.A linked list is a linear collection of homogeneous elements called______.
[Link]
[Link]
[Link]
[Link] of the above
Ans:b
[Link] on what on what can a linked list be classified into various other types?
[Link] number of pointers in a node
[Link] purpose for which the pointers are maintained
[Link] (a) and (b)
[Link] of the above
Ans:c
[Link] a singly-linked list (linear linked list), how many fields does each node consists of?
[Link]
[Link]
[Link]
[Link]
Ans:c
[Link] last node of the singly-linked list contains__________.
[Link]
[Link]
[Link]
[Link] of the above
Ans:b
32.A linked list contains a list pointer variable _____that stores the address of the first node of the list.
[Link]
[Link]
[Link]
[Link] list
Ans:a
[Link] maintain a linked list in memory, how many parallel arrays of equal size are used?
[Link]
[Link]
[Link]
[Link]
Ans:b
[Link] memory is allocated dynamically to a linked list, a new node can be inserted anytime in the list. For this,
th maintains a special linked list known as___________.
[Link] pool
[Link] bank
[Link] storage list
[Link] of the above
Ans:c
[Link] creating a linked list or inserting an element into a linked list, whenever a request for the new node
arriv searches through the ------------for the block of desired size.
[Link] pool
[Link] bank
[Link] storage list
[Link] of the above
Ans:c
[Link] does creating a node mean?
[Link] its structure
[Link] memory to it
[Link]
[Link] of the above
Ans:d
37._________a list means accessing its elements one by one to process all or some of the elements.
[Link]
[Link]
Ans:c
Ans:b
[Link]
[Link] of the above
Ans:a
[Link] list is generally considered as an example of _________ type of memory allocation.
[Link]
[Link]
[Link] Time
[Link] of these
Ans:b
[Link] Node contain minimum two fields one field called data field to store data. Another field is of type ______
[Link] to Class
[Link] to an Integer
[Link] to Character
[Link] to Node
Ans:d
[Link] the Singly linked list having n elements. What will be the time taken to add an node at the end of
link pointing to first node of the list.
a.O(1)
b.O(n-1)
c.O(n)
d.O(n^2)
[Link] concatenation of two lists is to be performed in O(1) time. Which of the following implementations of a list
[Link] Implementation of List
[Link] Linked List
[Link] Doubly Linked List
[Link] Linked List
[Link] the following linked list representation. Which of the following statement is used to create a node
? struct node {
int data;
struct node *next; }start = NULL;
struct node *new_node;
a.new_node=(struct node *)malloc((struct node));
b.new_node=(struct *)malloc(sizeof(struct node));
c.new_node=(struct node)malloc(sizeof(struct node));
d.new_node=(struct node *)malloc(sizeof(struct node));
Ans:d
[Link] node *current = start->next
what "current" will contain if it is variable of type struct node ?
[Link] of 2nd Node
[Link] Field of 2nd Node
[Link] Field of 2nd Node
[Link] of these
Ans:a
[Link] a list contains no elements it is said to be
[Link]
[Link]
[Link]
[Link]
Ans:b
[Link] is a memory efficient double linked list?
[Link] node has only one pointer to traverse the list back and forth
[Link] list has breakpoints for faster traversal
[Link] auxiliary singly linked list acts as a helper list to traverse through the doubly linked list
[Link] of the mentioned
Ans:a
[Link] does the following function do for a given Linked List with first node as head? void
fun1(struct node* head)
if(head == NULL) return; fun1(head->next); printf("%d ", head->data);
}
[Link] all nodes of linked lists
[Link] all nodes of linked list in reverse order
[Link] alternate nodes of Linked List
[Link] alternate nodes in reverse order
Ans:b
Stacks and queues:
[Link] is used for
[Link] Resource Allocation
[Link] First Traversal
[Link]
[Link] of the above
Ans:c
[Link]() and pop() functions are found in
[Link]
[Link]
[Link]
[Link]
Ans:c
[Link] number of queues required for priority queue implementation?
a.5
b.4
c.3
d.2
Ans:d
[Link] data structure is used for breadth first traversal of a graph?
[Link]
[Link]
[Link]
[Link] of the above
Ans:a
5.A queue data-structure can be used for −
[Link] parsing
[Link]
[Link] allocation
[Link] of the above
Ans:c
[Link] locality is a concern, you can use _______ to traverse the graph.
[Link] First Search
[Link] First Search
[Link] BFS or DFS
[Link] of the above!
Ans:b
[Link] analysis are more accurate than apriori analysis because −
[Link] contains the real data.
[Link] assumes all other factors to be dynamic.
[Link] assumes all other factors to be constant.
[Link] is a result of reverse-engineering.
Ans:b
[Link] notation is also known as
[Link] Polish Notation
[Link] Notation
[Link] Reverse Notation
[Link] Notation
Ans:d
[Link] conversion from prefix to postfix using stack data-structure, if operators and operands are pushed and poppe run-
time complexity is
a.Ο(1)
b.Ο(n)
c.Ο(log n)
d.Ο(n2)
Ans:b
[Link] queue is implemented using arrays, what would be the worst run time complexity of queue and dequeue oper
a.Ο(n), Ο(n)
b.Ο(n), Ο(1)
c.Ο(1), Ο(n)
d.Ο(1), Ο(1)
Ans:d
[Link] data structure works on
[Link]
[Link]
[Link]
[Link] of the above
Ans:b
[Link] of the following uses FIFO method
[Link]
[Link]
[Link] Table
[Link] Search Tree
Ans:a
[Link] C programming, when we remove an item from bottom of the stack, then −
[Link] stack will fall down.
[Link] will rearranged items.
[Link] will convert to LIFO
[Link] operation is not allowed.
Ans:b
[Link] data structure can be used to check if a syntax has balanced parenthesis ?
[Link]
[Link]
[Link]
[Link]
Ans:d
[Link] data structure can be used to check if a syntax has balanced parenthesis ?
[Link]
[Link]
[Link]
[Link]
Ans:a
[Link] an item into the stack when stack is not full is called …………. Operation and deletion of item form
the empty is called ………..operation.
[Link], pop
[Link], push
[Link], delete
[Link], insert
Ans:a
17.……………. Is a pile in which items are added at one end and removed from the other.
[Link]
[Link]
[Link]
[Link] of the above
Ans:b
[Link] data structure allows deleting data elements from and inserting at rear?
[Link]
[Link]
[Link]
[Link] search tree
Ans:b
19.A ……. is a data structure that organizes data similar to a line in the supermarket, where the first one in line is t
[Link] linked list
[Link] linked list
[Link] of them
[Link] of them
Ans:a
[Link] data structure is used in breadth first search of a graph to hold nodes?
[Link]
[Link]
[Link]
[Link]
Ans:b
[Link] the data structure which allows deletions at both ends of the list but insertion at only one end.
[Link] restricted dequeue
[Link] restricted qequeue
[Link] queues
[Link]
Ans:a
[Link] a queue, the initial values of front pointer f rare pointer r should be …….. and ……….. respectively.
a.0 and 1
b.0 and -1
c.-1 and 0
d.1 and 0
Ans:b
[Link] a circular queue the value of r will be ..
a.r=r+1
b.r=(r+1)% [QUEUE_SIZE – 1]
c.r=(r+1)% QUEUE_SIZE
d.r=(r-1)% QUEUE_SIZE
Ans:c
[Link] of the following statement is true?
i)Using singly linked lists and circular list, it is not possible to traverse the list backwards.
ii)To find the predecessor, it is required to traverse the list from the first node in case of singly linked list.
a.i-only
[Link]-only
[Link] i and ii
[Link] of the above
Ans:c
[Link] will be the value of top, if there is a size of stack STACK_SIZE is 5
a.5
b.6
c.4
[Link] of the above
Ans:c
26.………… is not the operation that can be performed on queue.
[Link]
[Link]
[Link]
[Link]
Ans:d
[Link] of the following is not the type of queue?
[Link] queue
[Link] ended queue
[Link] queue
[Link] queue
Ans:b
[Link] is/are the application(s) of stack
[Link] calls
[Link] number Arithmetic
[Link] of arithmetic expressions
[Link] of the above
Ans:d
29.A data structure where elements can be added or removed at either end but not in the middle is called …
[Link] lists
[Link]
[Link]
[Link]
Ans:d
[Link] does top value of the stack changes?
[Link] deletion
[Link] checking underflow
[Link] the time of deletion
[Link] deletion
Ans:d
[Link] data structure required to check whether an expression contains balanced parenthesis is
[Link]
[Link]
[Link]
[Link]
Ans:a
[Link] postfix form of A*B+C/D is
a.*AB/CD+
[Link]*CD/+
c.A*BC+/D
[Link]+/*
Ans:b
[Link] the following circular queue can accommodate maximum six elements with the following data front = 2 rear = 4
queue = _______, L, M, N, ___, ___
What will happen after ADD O operation takes place?
[Link] = 2 rear = 5 queue = ______, L, M, N, O, ___
[Link] = 3 rear = 5 queue = L, M, N, O, ___
[Link] = 3 rear = 4 queue = ______; L, M, N, O, ___
[Link] = 2 rear = 4 queue = L, M, N, O, ___
Ans:a
[Link] is the postfix form of the following prefix: *+ab–cd
[Link]+cd–*
[Link]+*–
[Link]+*cd–
[Link]+*cd–
Ans:a
8.A queue is a,
[Link] (First In First Out) list
[Link] (Last In First Out) list
[Link] array
[Link] tree
Ans:a
[Link] prefix form of A-B/ (C * D ^ E) is,
a.-/*^ACBDE
b.-ABCD*^DE
c.-A/B*C^DE
d.-A/BC*^DE
Ans:c
[Link] happens when the stack is full and there is no space for a new element, and an attempt is made to push
[Link]
[Link]
[Link]
[Link] of the above
Ans:a
[Link] total number of elements in a stack at a given point of time can be calculated from the value of______.
[Link]
[Link]
[Link]
[Link]
Ans:b
[Link] are the sequence of popped out values if the sequence of operations - push(1), push(2), pop, push(1),
pu push(2), pop are performed on a stack.
a.2, 2, 1, 1, 2
b.2, 2, 1, 2, 2
c.2, 1, 2, 2, 1
d.2, 1, 2, 2, 2
Ans:a
[Link] can be used to implement
[Link]
[Link] sort
[Link] sort
[Link] first search
Ans:b
0.A priority queue is used to implement a stack S that stores characters PUSH(C)is implemented as INSERT(Q,C
appropriate integer key chosen by the [Link] is implemented as DELETEMIN(Q)(Q). For a
sequ keys chosen are in
[Link]-increasing order [Link]-decreasing orde
[Link] increasing order [Link] decreasing order
Ans:d
