CSD-Full
ad
(Choice 2) When converting a method from a recursive version into an iterative version, a. Program clarity can be diminished. b. The brevity of program formulation is not be lost c. The program always runs slower. d. The brevity of program formulation lost. However, the brevity may not be an issue in Java.
ac
(Choice 2) Which of the following about stack are true: A.Operations of stack are based on Last in First out structure. B.A stack can be accessed at two ends for storing and retrieving data. C.The most top element is the latest added element. D. The operation pop takes the most bottom element in stack
bc
(Choice 2) Which of the following statement about the Binary Tree is true a. Binary Trees can be implemented as linked lists. b. Binary Trees can be implemented as arrays c. The search process of Binary Search Tree takes O( n ) time in the worst case. d. On the average, The search process of Binary Search Tree always takes O( n ) time
ac
(Choice 2) Which of the following statement about the Tree Traversal is false a. Tree traversal is the process of visiting each node in the tree some times. b. Tree traversal process can not be implemented without using stack. c. Postorder tree traversal can be only implemented in recursion. d. Tree traversal can be implemented in queue
bc
(Choice 2) Which of the following statements are false: a. The data area allocated for a method in stack is called an activation record or stack frame. b. An activation record still exists after a method owning it ends c. An activation record contains code of method owning it d. The sate of each method, including main(), is characterized by the contents of all automatic variables, the values of the method's parameters and the return address.
bc
(Choice 2) Which of the following statements are true: a. Global variables must be stored in activation record. b. The recursive version increases program readability, improves self-documentation and simplifies coding. c. The return address is address of the caller's instruction immediately following the call. d. In the most cases, the code of nonrecursive implementation is shorter than it is in the recursive implementation.
ac
(Choose 2 :) Select correct statement(s) about Doubly Linked List: A. Deleting a node at the end of the list takes constant time O( 1 ). B. Inserting a new node at the end of the list requires O( n ) steps. C. The node which is deleted from the list will be claimed by the garbage collector. D. Methods for processing doubly linked list are simpler than those of singly linked list.
bc
(Choose 2) In the circular array version of the Queue class, which operations require O(n) linear time for their worst-case behavior A. dequeue() B. enqueue() when the capacity has been reached C. clear() D. firstEl()
cd
(Choose 2) Select correct statement(s): A. A linked list is a collection of nodes storing data and links to other nodes B. A linked structure is a data structure composed of nodes, each node holding some information and a reference to another node in the list. C. A singly linked list is a node that has a link only to its successor in this sequence D. Inserting a new node at the end of the singly linked list without tail field requires O( n ) steps.
bd
(Choose 2) Select correct statements about Linked List: A. The nodes in doubly linked list contain only references to the predecessors. B. Skip lists was motivated by the need to speed up the searching process. C. In the worst case, search time of skip list is O(lgn) D. The efficiency of search in singly and doubly linked lists can be improved by dynamically organizing the list in a certain manner using Self-Ogranizing Lists.
ce
(Choose 2) Select incorrect statement about skip list: A. Searching is efficient. B. Insertion and Deletion are very inefficient. C. The search time is O (lgn) in the worst case. D. `maxLevel` of skip list which has 20 elements is 5 E. In 20-element skip list, the node in position 3 points to the node in position 7
ac
(Choose 2) Which of the following statements about the Stack are true A. Popping operation in the linked list implementation is executed in the constant time O(1) B. Clear operation in the linked list implementation is executed in the constant time O(1) C. Popping operation in the array implementation is executed in the constant time O(1) D. Pushing operation in the linked list implementation is always executed in the constant time O(1)
cd
(Choose 2:) Which of the following operations take O( 1)time: A. Deleting one any node in linked list B. Inserting one node to the end of singly linked list without tail. C. Deleting one node from the begin of doubly linked list D. Searching one node in singly linked list without tail in the best case.
ace
(Choose 3 :) Which of sentences about singly linked list are true: A. Deleting a node at the beginning of the list takes constant time `O ( 1 )`. B. Deleting last node of the list always takes `O ( lgn )` time. C. On the average, delete operation executes O ( n ) steps. D. Search operation takes O ( n ) time in the best case. E. There is no immediate access to the predecessor of any node in list.
abe
(Choose 3) Select correct statement: A. Breath-First traversal is implemented using queue. B. For a binary tree with n nodes, there are n! different traversals. C. The complexity of searching a node is the length of the path leading to this node. D. A search can takes lg ( n ) time units in the worst case. E. The complexity of searching depends on the shape of the tree and the position of the node in the tree.
cde
(Choose 3) Which of the following concepts of tree are true: A. Each node can be reachable from the root through some paths. B. Path is number of arcs. C. The level of a node is the length of the path from the root to the node plus 1. D. The height of a nonempty tree is the maximum level of a node in the tree. E. The level of a node must be between 1 and height of the tree.
bce
(Choose 3) Which of the following methods of queue are true: A. push(el) — Put the element el on the top of the queue. B. isEmpty() — Check to see if the queue is empty. C. enqueue(el) — Put the element el at the end of the queue. D. dequeue() — Take the last element from the queue. E. firstEl() — Return the first element in the queue without removing it. F. lastEl() — Return the last element in the queue without removing it.
ab
(choose 2) Select true statements about stack) A. Stack can be implemented by linked list. B.The Java implementation of the stack is potentially fatal. C. peek () method removes the top element of the stack and return it. D.pop () method returns copy of the top element in the stack.
ab
(choose 2) When a method call is executed, which information is not saved in the activation record? A.Current depth of recursion B.Instances of classes. C.Location where the method should return when done D. Local variables
ab
(choose 2) Which of the following can be executed in constant time O ( n ) A.when deleting a node of a singly linked list in the worst case. B.when deleting a node of a singly linked list in the average case. C.when searching is executed in a skip list in the ideal situation. D.when insertion sort is executed in the worst case.
a
A properties of queue is ___________ can be accessed at once. A.Only one item B.Multiple-items C.Two items D.None of the others.
b
A property of a stack is _________ can be accessed at once. A.Multiple-items B.Only one item C.Two items D.None of the others.
a
A queue is implemented using a doubly linked list, which of the following operations require O( n) time? A.clear (remove all elements from the queue). B.enqueue C.dequeue D.None of the others
a
A recursive method may be eliminated by using ................. a. All of the others. b. Stacks c. Iteration statements
d
An advantage of a linked list is _______ A. Quick searching. B. All of the others. C. None of the others. D. Its size can be expanded and shrunk rapidly.
c
Consider algorithm of the 8-queen problem: 1 Which of the following statements is true: a. The algorithm ends after finding one solution. b. The algorithm does not find symmetric solutions. c. The algorithm finds all solutions. d. None of the others.
d
Consider the following algorithm: 1 What is maximum number of activation records (including its caller) in runtime stack when calling TriangularNumber(10) A.9 B.13 C.7 D.11
b
Consider the following alogorithm: 1 What is output when calling TriangularNumber(4) A.15 B.10 C.6 D.20
c
Consider the following function: void fun(int n) { if (n < 0) { System.out.println( "-" ); fun(-n); } else if(n<15)System.out.println( n ); else { fun(n/15); System.out.println( n%15 ); } } What values of n are directly handled by the stopping (base) case ? a. n < 0 b. n < 15 c. n >= 0 && n<15 d. n >= 15
c
Consider the following function: void fun(int n) { if (n < 0) { System.out.println( "-" ); fun(-n); } else if(n<15)System.out.println( n ); else { fun(n/15); System.out.println( n%15 ); } } What values of n are directly handled by the stopping (base) case? a. n < 0 b. n < 15 c. n >= 0 && n<15 d. n >= 15
a
Consider the following function: 1 Which call will result in the most recursive calls? a. fun(-1012); b. fun(100); c. fun(0); d. fun(1012);
d
Consider the following pseudocode: 1 A.(1) B.(2) C.(3) D.(4)
a
Consider the following pseudocode: 1 What is written to the screen for the input"Good\\Morn\\in\\\g"? A. gMoG B. gMoo C. GoMg D. gMor
c
Consider the following pseudocode: declare a queue of characters while(there are more characters in the word to read) {read a character if a character is '\' then dequeue and write the dequeued character to the screen else enqueue the character into the queue } What is written to the screen for the input "HowAre\\\You\\To\\\\Day" ? A.owAreYouT B.HowAreYo C.HowAreYou D.wAreYouTo
c
Consider the following pseudocode: declare a stack of characters while(there are more characters in the word to read) {read a character if a character is '\' then pop and write the popped character to the screen else push the character into the stack } What is written to the screen for the input " Go \\odMorn \\ in\\\g" ? A.oGnrnid B.oGnrniM C.oGnrnio D.oGnrndo
a
Fill in blank to form a correct statement: "A recursive method is a method that invokes itself directly or indirectly. For a recursive method to terminate there must be one or more ____________". a. Base cases b. Steps c. Limit conditions d. Conditions
a
How many recursive calls to calculate the 5th Fibonacci number? a. 15 b. 22 c. 9 d. 32
a
Imagine we have the singly linked list, the head reference allows to manage this list. Show what would happen if we applied the following statements to this list? for (temp = head; temp.next != null; temp = temp.next) { } temp.next = head; A. This will create a circularly linked list. B. We have lost control this list, the head is overwritten by the other reference. C. Nothing happens, the temp reference points at the end of the list. D. Insert the temp node successfully.
a
Imagine we have the two singly linked lists, managed by two references: list1 and list2. What would happen if we applied the following statements to these two lists? for (temp = list1; temp.next != null; temp = temp.next) { } temp.next = list2; A. list2 is concatenated after list1, forming an unique singly linked list. B. list2 no longer points to the head of the second list, the second list is lost forever. C. list1 points to the head of the second list, list2 is managed by list1 now. D. Nothings happens, this is simply list traversal operation.
a
In a circular singly linked list, we can use only one permanent reference, the tail. The familiar reference, the head, is: A. The successor of the tail. B. The predecessor of the tail. C. The implicit reference. D. The null reference.
b
In a real computer, what will happen if you make a recursive call without making the problem smaller? a. The program keeps running until you press Ctrl-C b. The run-time stack overflows, halting the program c. The operating system detects the infinite recursion because of the "repeated state" d. The results are nondeterministic
d
In a single method implementation, how many recursive calls can be used? a. 1 b. 2 c. n (where n is the argument of the method). d. There is no fixed maximum number.
a
In a singly linked list, we can use the tail reference to ... A. insert or delete a node at the end of list easily. B. guarante not to delete the empty list. C. perform counting the number of nodes in the list easily. D. faster search a node in the list.
b
In all cases, nonrecursive implementation is faster recursive implementation. a. True b. False
a
In the array implementation of queue, enqueuing can be executed in constant time O(1) A.True B.False
d
In the array version of the Queue, which operations require O(n) time for their worst-case behavior? A.dequeue B.insert when the queue is not full. C.isEmpty D.None of the others
e
In the array version of the Stack class, which operation requires linear time for their worst case? A.is-empty B.topEl C.Pop D.push when the array is not yet full. E.None of the others.
b
In the doubly linked list implementation of queue, enqueuing can be executed in constant time O( n). A. True B.False
d
In the linked-list version of the Queue, which operations require linear time for their worst-case behavior? A.dequeue B.insert C.isEmpty D.None of the others
c
In the linked-list version of the Stack class, which operation requires linear time for the worst case? Assume that addtoTail, deletefromTail are used. A.is-empty B.topEl C.Pop D.Push E.None of the others.
a
Let's look at the recursive algorithm that generates Fibonacci numbers. This algorithm belongs to type recursive algorithm ... a. excessive b. tail c. non-tail d. indirect
a
Linked lists allow easy insertion and deletion of information because such operations have a local impact on the list. A. True B. False
a
Recursive definitions on most computers are eventually implemented using a run-time stack and this implementation is done by the operating system. a. True b. False
b
Select a correct statement about a singly linked list. A. A new node can be inserted into any position, except first position, without any traversal. B. Deleting a node at the beginning of a list involves setting head to point to head.next. C. All of the others. D. Deleting the last node takes O(1) time.
b
Select a correct statement about singly linked lists. A. Linked lists allow random accesses to any node. B. A node with a specified value (info) can be found by traversing the list. C. Each node of the list is identified by an integral index. D. All of the others.
a
Select an incorrect statement. a. Recursion is always more efficient than loops. b. Recursion can make the conceptual design of an algorithm's implementation easier. c. Recursion, gone wrong, can lead to an overflow stack error.
d
Select false statement: A.Stack is applied to Java Virtual Machine. B. Stack can be implemented using linked list. C.In the array list, popping is executed in constant time O ( 1 ) . D.In the array list, poping is executed in O (lgn) to the worst case
a
Select incorrect statement about Recursion: a. The anchor or ground case allows for the construction of new objects out of basic elements or objects that have already been constructed b. Recursive definitions serve generating new elements and testing whether an element belongs to a set c. Recursive definitions are frequently used to define functions and sequences of numbers d. None of above
b
Select incorrect statement about skip list: A. In a skip list of n nodes, for each k and i such that 1 ≤ k ≤ `|__lgn__|` and 1 ≤ i ≤ `|__n/2^(k- 1)__|` - 1, the node in position `2^(k-1)` • i points to the node in position `2^(k-1)` • (i + 1) B. The number of reference fields indicates the level of each node, and the number of levels is maxLevel = `[lgn]`+ 1 C. All of the others. D. None of the others.
a
Select the best choice. A stack can be implemented using ..... a. All of the others. b. An array c. A singly linked list d. A double linked list d. A circular linked list
a
Select the statement that is most correct. Suppose we are considering a doubly linked list and p is a node in the list which has both predecessor and successor nodes. What does the java code snippet below do? Node p1,p2; p1 = p.prev; // prev is a link to previous node p2=p.next; p2.prev = p1; p1.next = p2; A. It deletes the node p. B. It deletes the node before p. C. It deletes the node after p. D. It does not make any change on the list.
b
Select the statement that is most correct. Suppose we are considering a singly linked list and p is a node in the list which has successor node. What does the java code snippet below do? Node q = p.next; p.next = q.next; A. It deletes the node before p. B. It deletes the node after p. C. It deletes the node p. D. It does not make any change on the list.
a
Select the statement that is most correct. Which of the following applications may use a stack? A.Evaluating arithmetic expressions. B.Store all variables in a program. C.Store a waiting list of printing jobs. D.Multi-programming.
a
Select the statement that is most correct. Which of the following applications may use a stack? A.Evaluating arithmetic expressions. B.Store all variables in a program. C.Store a waiting list of printing jobs. D.Multi-programming.
d
Select the statement that is the most correct . a. There is no difference between a recursive method and a non-recursive method. b. For a recursive method to terminate there must be one or more steps. c. For a recursive method to terminate there must be one or more limit conditions. d. A recursive method is a method that invokes itself directly or indirectly. For a recursive method to terminate there must be one or more base cases
c
Select the statement that is the most correct. Basically, the complexity of finding the position of the minimum value in a doubly linked list of integer numbers is ..... A. O( nlogn ) B. O( n2 ) C. O( n ) D. O( 1 )
b
Select the statement that is the most correct. Basically, the complexity of inserting a node after a given node in a singly linked lists is ..... A. O( n2 ) B. O( 1 ) C. O( log n ) D. O( n )
b
Select the statement that is the most correct. Which of the following applications may use a stack? A.Store all variables in a program. B.Auxiliary data structure for algorithms. C.Store a waiting list of printing jobs. D.Multi-programming.
a
Specify the correct implementation of dequeue() method of a queue. This queue uses java.util.LinkedList for storing data and the head of the list is treated as the head of the queue. (Choose the most suitable one) A. Object dequeue(){ if (isEmpty()) return(null); return(pool.removeFirst(); } B. void dequeue(Object x){ if (isEmpty()) return(null); pool.remove(pool.size()-1); } C. Object dequeue(){ if (isEmpty()) return; return(pool.remove(pool.size()-1)); } D.Object dequeue(){ if (isEmpty()) return(null); return(pool.removeLast()); }
d
Specify the statement that is most correct about a circular linked list. A. Circular linked list is a normal doubly-linked list B. In circular linked-list, it is required to define head and tail node C. Circular linked list is a normal linked list D. Circular linked list is a linked list in which the last node of the list points to the first node in the list.
b
State True or False: In a singly-linked list, there is no efficient way to insert a node before a given node in the middle or at the end of the list, but we can insert a node after a given node or at the beginning of the list with time complexity O(1). A. False B. True
b
Suppose temp refers to a node in a linked list (using the SLLNode class with instance variables called info and next). What boolean expression will be true when temp refers to the tail node of the list? A. (temp == null) B. (temp.next == null) C. (temp.info == null) D. None of the others.
a
Suppose temp refers to some node in a doubly linked list. What boolean expression can be used to check whether temp refers to the first node of the list? A. temp.previous == null B. temp.previous.next.previous == null C. temp == null D. All of the others.
a
Suppose temp refers to the third node in the doubly linked list that has more than 5 nodes . What statement changes temp so that it refers to the first node? A. temp = temp.previous.previous.next.previuos B. temp = temp.previous.next.previous C. temp = temp.previous.next.next.previous D. None of the others
d
Suppose that the variable temp refers to a node in a linked list (using the SLLNode class with instance variables called info and next). What statement changes temp so that it refers to the next node? A. temp ++; B. temp = next ; C. temp += next D. temp = temp . next ;
d
Suppose the f( n ) function is defined on the set of integer numbers as below. What is the value of f(-5)? 1 a. 18 b. 10 c. 15 d. 3
a
Suppose we are considering a doubly linked list which is not empty. Select the most correct java code snippet that inserts new node with value x at the head of the list (the new node will be the first node in the list). A. Node q = new Node(x); q.prev=null; q.next = head; head.prev = q; head = q; B. Node q = new Node(x); q.next = head; head.prev = q; head = q; C. Node q = new Node(x); q.prev=null; q.next = head; head.prev = q; D. Node q = new Node(x); q.prev=null; q.next = head; head = q;
c
Suppose we are considering a singly linked list and p is some node in the list which has successor node. Select the most correct java code snippet that deletes the successor node of p (the node after p). A. Node q = p.next; q.next = p.next.next; B. p = p.next; p.next = null; C. Node q = p.next; p.next = q.next; D. p.next= null;
a
The Horner's method is used to calculate the sum of the first n powers of a base b: sum(b, n) = 1 + b **(1 + b *** (1 + b**(1 + ... + b))) The similar recursive expression is ... a. 1 + b * sum(b, n - 1) b. 1 + sum(b, n - 1) c. (1 + b) * sum(b, n - 1) d. sum(1 + b, n - 1)
d
The operation for adding an entry to a stack is traditionally called: A.add B.append C.insert D.push
c
The operation of visiting each element in the list exactly once is known as A. Inserting B. Merging C. Traverse D. Sorting
d
The problem of printing a string in reverse order can be implemented using ________ a. Recursion. b. Iteration. c. Stack. d. All of the others
a
There are two aproaches to writing repetitive algorithms: a. iteration and recursion. b. tail recusion and nontail recursion. c. direct recursion and indirect recursion. d. nested recursion and excessive recursion.
a
U04 - Q018 The operation for adding an entry to a queue is traditionally called: A.enqueue B.append C.insert D.add
a
U04 - Q028 In the array implementation of the queue, which operations require constant time? A.All of the others. B.enqueue C.isEmpty D.dequeue
a
U04 - Q032 Suppose we are implementing a stack using a singly linked list where the head of the list is treated as the top of the stack. Specify the correct implementation of push() method of the stack. (Choose the most suitable one) A. void push(Object x) { Node p = new Node(x); p.next = head; head=p; } B. void push(Object x) { Node p = new Node(x); p.next = head; } C. void push(Object x) { Node p = new Node(x); p.next = null; head=p; } D. void push(Object x) { Node p = new Node(x); p.next = head; head=p.next; }
a
When a method call is executed, which information does its activation record contain? a. None of the others. b. Code of the method. c. Current depth of recursion. d. Name of the method. e. Global variables.
c
When a method call is executed, which information is not saved in the activation record? a. Local variables of the calling method. b. Location where the method should return when done. c. Current depth of recursion. d. Values for all parameters are transferred to the called method.
b
Which boolean expression indicates whether the data in two nodes (p and q) are the same. Assume that neither p nor q is null. A. p == q B. p.info == q.info or p.info.equals(q.info) C. p.next == q.next D. None of the others.
d
Which of the following applications may use a stack? A.A parentheses balancing program. B.Keeping track of local variables at run time. C.Syntax analyzer for a compiler. D.All of the others.
a
Which of the following problems may use stacks implicitly or explicitly? A.All of the others B.Traverse a Binary tree using Depth First Search. C.Eight-queen problem. D.Evaluate a prefix expression..
a
Which of the following problems may use the recursion technique? a. All of the others. b. Maze problems. c. Detect a cycle in a graph. d. Perform symbolic differentiation.
d
Which of the following statement about the Recursion is true A. Tail recursion is characterized by the use of only one recursive call at the very end of a method implementation. B.The backtracking technique uses recursion C.The recursive version increases program readability, improves self-documentation, and simplifies coding. D. All of the others
d
Which of these operations are likely to have a constant time for worst-case in the linked lists? A. addBefore (add a new element into before a known element in the list). B. countOccurrences (count number of existence of an element in the list). C. Delete (remove an element in the list). D. None of the others.
d
Which of these operations are likely to have a constant time for worst-case in the singly linked lists? A. InsertAfter (int index) : insert a new element into after an element in the list. B. removeLastOccurrence (): Removes the last occurrence of the specified element in list. C. get(int index):Returns the element at the specified position in this list. D. None of the others.
c
Which operation on a linked list will take O( n ) time for the worst case? A. Inserting a node. B. Deleting a node. C. All of the others. D. Updating a node.
d
With respect to recursion, select correct statement. a. Any iterative program may be written recursively. b. Every recursive method may be converted into an iterative version. c. Quicksort and mergesort are recursive in nature. d. All of the others.
c
With respect to recursion, select correct statement. (1) Recursive version executes slower than iterative version. (2) Iterative version executes slower than recursive version. (3) Recursive version needs more memory than iterative version (4) Iterative version needs more memory than recursive version Statements ..... and ...... are true. a. 1,4 b. 2,3 c. None of the other
d
With respect to the execution of recursive function (method), ....... a. The run-time stack contains an information that marks that this is a recursive call. b. All parameters will be shared in all running activation records of the called methods. c. The run-time stack does not contain dynamic link to caller's activation record. d. None of the others
