CS_DATA_STRUCT

1

Inheritance is ...

1

Qucksort is implemented recursively

1

Waiting line of people is similar to which data structure?

1

Which of the graph implementations is more simple?

1

To use Binary Search items should be ...

1

Reference "rear" of CircularArray is usually indicates ...

1

If there is no path path from vertex to any other vertex that graph is considered to be ?

1

Can we implement the queue using LinkedList?

1

What is not perfect in this code: ave = sum / count;

1

Returns the reference to the element at position index

1

Indicate exponential time complexity in terms of big-O notation?

1

Traversing graph visiting a start node first, then all nodes that are adjacent to it next.

1

A ________ graph is one where [E] is much less than [V]^2.

1

Which method returns an object at the top of a Stack in JAVA?

1

The ____________ algorithm finds minimum spanning tree for a graph.

1

traverese left subtree, Visit root node, traverse right subtree traversal is called?

1

Data structure based on BST where all items are sorted and unique is?

1

Graph is considered to be ___________ if there is a path from each vertex to any other vertex.

1

What is the difference between ArrayList and Vector?

1

Visit root node, traverese left subtree, traverse right subtree traversal is called?

1

First in last out structure is ...

1

Which container is not appropriate to implement Stack in Java?

1

Average time complexity of Bubble sort is?

1

Every class has __________ as a superclass.

1

traverse left subtree, traverse right subtree, visit root node traversal is called ?

1

A ___________ tree is a binary tree used to store a code that facilitates file compression.

1

Distance from the root to its deepest leaf is known as __________ of a tree?

1

The node of a tree without children is called ... ?

1

Which structure is better to use when printing many documents from multiple computers at one printer?

1

A collision occurs when ... ?

1

A __________ graph is one in which [E] is close to but less than [V]^2.

1

Average time complexity of Merge sort is?

1

The _________ is used to implement the special kind of a queue called priority queue.

1

Average time complexity of Shell sort is?

1

If there is at least one abstract method in a class, that class is called ...

1

Finding the shortest path algorithm is called?

1

Which part is accessible to user?

1

Dijkstra's algorithm use ______ algorithm to traverse all nodes.

1

A list can _ or _ as elements added or removed.

1

What is the time complexity of recursive Binary Search algorithm?

1

Why do we need BFS and DFS algorithms?

1

Choosing pivot and place all items smaller than pivot to the left and bigger ones to the right, then repeat the same with two branches is similar to _____________ sort algorithm.

1

Show the method which exists in DoubleLinkedList and not exist in SingleLinkedList?

1

What determines whether you should use quadratic sort or a logarithmic sort algorithm?

1

The Collection is a _________ of a List

1

The _________ level of a node is a measure of its distance from the root.

1

A queue _ in ___ out data structure.

1

for(int i=0; i< size; i++){
if(theData[i]==entry){
return i;
}
return -1;
}
This method is similar to which method of ArrayList?

1

______________ exception is an error normally not due to programmer.

1

______________ exception is an error normally due to programmer.

1

Distance from the deepest leaf to the root of a tree is called?

1

ListIterator and Iterator is the same thing in JAVA.

1

The function that calls itself is called ...

1

If you want to call different constructor of current class you would use ...

1

Which method adds an item on the top of the Stack in JAVA?

1

In open addressing you can not remove an item to be deleted, so what should you do instead?

1

What is the best time complexity of recursively finding fibbonachi nuber?

1

A __________ is a sequence of vertices in which each successive vertex is connected to its predecessor. (Graphs)

1

Searching a binary search tree costs?

1

Average time complexity of Selection sort is?

1

Full name of this course is ?

1

In ___________ graph is {v, u} is edge then {u, v} is not necessary an edge.

1

Average time complexity of Quick sort is?

1

Ideal data structure for a contact list is ?

1

Each recursive function has two cases and _.

1

Array reallocation cost is ______?

1

It is possible to implement all recursive algorithms without recursion

1

Set of connections between vertices of a graph is called?

1

Hiding access to data members of a class is called ...

1

Using a hash table enables us to retrive an item in a __________ time.

1

Is it possible to implement multiple interfaces?

1

Sets the element on position index to reference entry

1

Which of the graph implementation is more efficient in terms of memory usage?

1

In the queue implemented as a LinkedList, poll() function should ...

1

Which function is used to add new item in the queue?

1

Recursive solutions are more beautiful and easy to understand.

1

Which structure is widely used to calculate the value of postfix expression?

1

This returns true if the collection contains obj.

1

Redefinition of the method of superclass in a subclass with the same name and number of parameters is...

1

If you want to call the constructor of superclass you would use ...

1

Element insertion to a Binary Search tree costs?

1

Distance from the deepest leaf to the root of a tree is called?

1

What is the time complexity of adding an item in front of a LinkedList?

1

The collection of abstract methods is called?

1

This method returns a string that textually represents an object.

1

Graph where each edge has a direction is called?

1

Which of the following is not example of visibility in JAVA.

1

A tree where left child is less and right child is more than its parent called?

1

How to handle exceptions

1

Is it possible to inherit from multiple classes?

1

Vertex is ________ to another vertex if there is an edge connecting them.

1

If two or more keys will be encoded to the same index of a hashtable, it is called.

1

Returns entry at the front of a Deque without removing it

1

Complete binary tree where all children must be bigger than parents is ?

1

Which function return first added item in the queue?

1

Gets the size of the ArrayList

1

Traversing graph visiting a start node first, then choose one node that is adjacent to it next.

1

The relationship when one class is a subclass of another is called ...

1

Recursive nonlinear data structure that is used to represent data organized in a hirarchy?

1

Which of them is not an example of Data Structure

1

Two JAVA API implementation of Set and Map are:

1

Which of them is not a feature of Collection Interface?

1

Indicate two ways of graph implementations

1

Indicate logarithmic time complexity in terms of big-O notation?

1

What are the two parts of ADT?

1

public xxx(int index){
return theData[index];
}
this behaviour is similar to which method of ArrayList class?

1

Indicate the relationship of HashtableOpen and Entry classes?

1

Which method removes an item on the top of a Stack in JAVA?

1

How to remove item from LinkedList?

1

Find the slowest time

1

Node of a graph is called?

1

calculate the value of "4 7 * 20 -"

1

Complete binary tree where all children must be smaller than parents is ?

1

The relationship when one class is defined inside the definition of another is called...

1

Prim's algorithm is used to calculate __________.

1

Which of them has more methods?

1

A ___________ of a node is a tree whose root is a child of that node.

1

Structured set of data is called _______.

1

Circular Array is usually used to implement ...

1

int xxx(int x){
if(n==1) return 1;
return x*xxx(x-1);
}
this function calculates

1

JAVA API uses ____________ to implement both Set and Map interfaces.

1

Average time complexity of Insertion sort is?

1

What is the time complexity of ArrayList remove(index) method?

1

Does binary search tree contain duplicates?

1

for (i<n)
if (a[i] == item)
return i;
This algotithm is similar to ...

1

Would an operating system use stack or queue to determine which print job should be handled next?

1

What is popularly used to traverse SingleLinkedList?

1

Quadratic probing is usually used to ?

1

To apply Dijkstra's algorithm graph should be.

1

Inventor of merge sort is ?

1

instanceof used to test ...

1

Most sorting algorithm are divided into two basic groups.

1

Attempt to convert a string that is not numeric to a number faults ...

1

Average time complexity of Heap sort is?

1

A hash table uses hashing to transform an items key into a table index so that iterations, retrievals and deletions can be performed in expected ___________ time.

1

Data structure similar to tree but it doesn't have limitation according to number of parents is?

1

Set of ordered pairs whose element are known as the key and value is ?

1

Ability of object of one class to act like it is an object of another class is?

1

A is a special cas of a graph. A is a connected graph that contain no cycles.

1

What relationship class Node and LinkedList have?

1

Which of the following is recursive algorithm?

1

Can we access the element of a set by index?

1

List two ways of organizing hashtable.

1

This method of a binary tree class return true if tree is a leaf and false otherwise?

1

ADT that enables a user to access information (data) corresponding to a specified key.

1

An ordered set of instructions is called.

1

OOP stands for?

1

Is it possible to traverse contaning of a list this way?
for( int nextInt : aList ){ ... }

1

Which structure is widely used in finding palindrome problem?

1

Adding an item to the beginning of CircularArray costs?

1

What is the attribute of CircularList?

1

Attempt to access array element using index less than 0 faults ...

1

What does method empty return for empty stack?

1

Elements of a List are accessed by means of an __________

1

If we call remove() function for the queue, which item will be removed?

1

This method associates specified value with the specified key in the map.

1

Indicate linear time complexity in terms of big-O notation?

1

A tree where all nodes should have 2 children and leaves have no children is called?

1

Insert and remove items from a heap costs?

1

What is the time complexity of adding element in the beginning of ArrayList?

1

Adjacent matrix representing undirected graph should be?

1

Which of the following in java is very similar to "contract"?

1

Where new item added in the queue?

1

Which method searches for target and returns its position in LinkedList?

1

A ___________ path is a simple path in which only the first and last items are the same.

1

Graph where each edge has a direction is called?

1

Redefinition of method with the same name but different number of parameters is called...

1

Recursive implementation works faster than lopped one.

1

If there are no abstract methods in the class we call that class ...

1

Which part is not accessible to user?

1

What is the time complexity of insert(index) method in ArrayList

1

What is the feature of Deque?

1

The function that calls itself is called ...

1

int xxx(int x, int y, int z){
if(z==1){return 1;}
return xxx(x+y, x, z-1);
}
this function is

1

What is the time complexity of Linear Search algorithm?

1

The node of a tree without children is called ... ?

1

Tree where every item must have at most 2 children is called?

1

What is the benefit of encoding letters trough Huffman tree.

1

A set view of a map can be obtained through method_______?

1

You apply method ____________ to set view to get an object that facilitates sequential access to the Map elements.

1

If you want to call data member of superclass you would use ...

1

In a Huffman tree, the item with the lowest frequency of occurrence will have the ___________ code.

1

A Stack is __ in _ out data structure.

Quiz on CS_DATA_STRUCT, created by Dina Kim on 26/03/2019.

CS_DATA_STRUCT

Inheritance is ...

Qucksort is implemented recursively

Waiting line of people is similar to which data structure?

Which of the graph implementations is more simple?

To use Binary Search items should be ...

Reference "rear" of CircularArray is usually indicates ...

If there is no path path from vertex to any other vertex that graph is considered to be ?

Can we implement the queue using LinkedList?

What is not perfect in this code: ave = sum / count;

Returns the reference to the element at position index

Indicate exponential time complexity in terms of big-O notation?

Traversing graph visiting a start node first, then all nodes that are adjacent to it next.

A ________ graph is one where [E] is much less than [V]^2.

Which method returns an object at the top of a Stack in JAVA?

The ____________ algorithm finds minimum spanning tree for a graph.

traverese left subtree, Visit root node, traverse right subtree traversal is called?

Data structure based on BST where all items are sorted and unique is?

Graph is considered to be ___________ if there is a path from each vertex to any other vertex.

What is the difference between ArrayList and Vector?

Visit root node, traverese left subtree, traverse right subtree traversal is called?