sdp4

Please wait - loading…

Question 1 of 152

Re-balancing of AVL tree costs

Select one of the following:

O(logn)
O(nlogn)
O(1)
O(n)

Explanation

Question 2 of 152

In what tree, for every node the height of its left subtree and right subtree differs at least by one

Select one of the following:

Threaded binary tree
BST
AVL tree
Complete tree

Explanation

Question 3 of 152

Which of the following is true about the total number of nodes in a binary tree with depth two?

Select one of the following:

It is at most four
It is at most seven
There is no bound on the number of nodes
It is at most two

Explanation

Question 4 of 152

Which of the following is not a valid binary search tree?

Select one of the following:

Explanation

Question 5 of 152

The result of postfix expression: 4 2 + 3 5 1 - * +

Select one of the following:

Explanation

Question 6 of 152

The infix expression A+((B-C)*D) is correctly represented in prefix notation as

Select one of the following:

A+BC-D*
ABC-D*+
+A*-BCD
A+B-C*D

Explanation

Question 7 of 152

The result of postfix expression: 5 7 + 6 2 - *

Select one of the following:

Explanation

Question 8 of 152

The prefix expression reverse to postfix: * + A B + C D

Select one of the following:

A B + C D + * *
A B + C D + *
None of them
A B + C D * +

Explanation

Question 9 of 152

What the result of the following expression: 2 3 8 * + 4 48 4 2 + / 6 * + -

Select one of the following:

Explanation

Question 10 of 152

By definition, a(n)______ graph contains edges that can be traversed in either direction.

Select one of the following:

undirected
directed
disconnected
connected

Explanation

Question 11 of 152

What is the weight of a minimum spanning tree of the following graph?

Select one of the following:

Explanation

Question 12 of 152

Which of the following algorithms use a dynamic programming approach (not greedy)?
Выберите один или несколько ответов:

Select one of the following:

Floyd Algorithm
Bellman-Ford Algorithm
Dijkstra Algorithm
Prim Algorithm

Explanation

Question 13 of 152

The MST of the graph below:

Select one of the following:

3, 1, 2, 9, 4, 7, 5
3, 1, 2, 9, 10, 7, 5
3, 1, 2, 9, 11, 7, 5
3, 1, 2, 9, 4, 7, 8

Explanation

Question 14 of 152

What is the Run-time of the Dijkstra’s original algorithm? (without min priority queue)

Select one of the following:

O(E+V)
O(E+VlogV)
O(E^2)
O(V^2)

Explanation

Question 15 of 152

Choose the algorithm with not greedy approach ….

Select one of the following:

Prim Algorithm
Dijkstra Algorithm
Floyd Algorithm
Kruskal Algorithm

Explanation

Question 16 of 152

The Floyd-Warshall algorithm for all-pair shortest paths computation is based on:

Select one of the following:

Greedy paradigm
Dynamic Programming paradigm
None
Divide-and-Conquer paradigm

Explanation

Question 17 of 152

The sequence of visited nodes by Dijkstra algorithm:

Select one of the following:

S, B, A, С, t
None of them
S, A, B, C, t
S, B, A, t

Explanation

Question 18 of 152

The following heap : 18 15 9 14 11 2 7 6 12 3, add there 17 and choose right sequence:

Select one of the following:

18 17 9 14 15 2 7 12 6 3 11
18 15 9 14 11 2 7 6 12 3 17
18 17 9 14 15 2 7 6 11 12 3
18 17 9 14 15 2 7 6 12 3 11

Explanation

Question 19 of 152

In the deletion operation of max heap, the root is replaced by:

Select one of the following:

Last element of the last level
Next available value in the right sub-tree
Next available value in the left sub-tree
Any random value from the heap

Explanation

Question 20 of 152

Delete max element from the heap and choose the answer: 18 17 9 14 15 2 7 6 12 3 11

Select one of the following:

17 15 9 14 12 11 2 7 6 3
17 15 9 14 11 2 7 6 12 3
17 9 14 15 2 7 6 12 3 11
17 15 14 12 11 9 2 7 6 3

Explanation

Question 21 of 152

In a min heap

Select one of the following:

A minimum values are sorted
Parent nodes have less value than child nodes
Maximum value is contained by the root node
Child nodes have less value than parent nodes

Explanation

Question 22 of 152

The result of this postfix expression: 10 5 + 60 6 / * 8 – is

Select one of the following:

Explanation

Question 23 of 152

Please find the postfix expression from prefix: - * - + a b c / e f - g / h i

Select one of the following:

a b + c - - e f / * g h i / -
a b + c - e f / * g h - i / -
a b + c - e f / * g h i / -
a b + c - e f / * g h i / - -

Explanation

Question 24 of 152

If this tree is used for sorting, then new no 8 should be placed as the

Select one of the following:

right child of the node labelled 5
right child of the node labelled 30
left child of the node labelled 10
left child of the node labelled 30

Explanation

Question 25 of 152

Number of possible binary trees with 3 nodes is (Kahoot 100%)

Select one of the following:

Explanation

Question 26 of 152

The result of this postfix expression: 4 5 7 2 + - *

Select one of the following:

-10
-11
-16
-5

Explanation

Question 27 of 152

Which of the following statements about binary trees is true?

Select one of the following:

A binary tree contains exactly two nodes.
Exactly two paths exist between any two nodes in a binary tree.
Every node of a binary tree has at most two children.
Every node of a binary tree has at most two predecessors.

Explanation

Question 28 of 152

A binary tree T has 20 leaves. The number of nodes in T having two children is

Select one of the following:

Any number between 10 and 20
18
19
17

Explanation

Question 29 of 152

Choose the Bipartite graph from the following graphs...

Select one of the following:

Explanation

Question 30 of 152

Each of the following indicates a reasonable way to implement graphs except

Select one of the following:

a BST
a Boolean matrix
an adjacency list
an edge list

Explanation

Question 31 of 152

Postfix expression is just a reverse of prefix expression.

Select one of the following:

Верно
Неверно

Explanation

Question 32 of 152

Choose the regular expression which -- "Search all string which start with "a"

Select one of the following:

Explanation

Question 33 of 152

Which of the following algorithms use a greedy approach?

Select one of the following:

Prim, Kruskal, Floyd
Prim, Kruskal, Dijkstra
Prim, Bellman-Ford, Floyd
Prim, Kruskal, Bellman-Ford

Explanation

Question 34 of 152

A max-heap is a heap where the value of each parent is greater than or equal to the values of its children. Which of the following is a max-heap?

Select one of the following:

Explanation

Question 35 of 152

Heap with n elements with the smallest element at the root, 7 smallest element can be found

Select one of the following:

O(1)
O(n)
O(nlogn)
O(logn)

Explanation

Question 36 of 152

The elements 32, 15, 20, 30, 12, 25, 16 are inserted one by one in the given order into a Max Heap. The result Max Heap is

Select one of the following:

Explanation

Question 37 of 152

Group A Group B

a) Dijkstra's single shortest path algo p) Dynamic Programming

b) Bellmen Ford's single shortest path algo q) Greedy Algorithm

c) Floyd Warshell's all pair shortest path algo. r) Backtracking

Select one of the following:

a-q, b-p, c-p
a-p, b-p, c-p
a-r, b-q, c-p
a-p, b-r, c-q

Explanation

Question 38 of 152

Time complexity of Depth First Traversal of is

Select one of the following:

Θ(|V|*|E|)
Θ(|V|)
Θ(|V|+|E|)
Θ(|E|)

Explanation

Question 39 of 152

The time complexity of heap sort in worst case is

Select one of the following:

O(nlogn)
O(n)
O(n2)
O(logn)

Explanation

Question 40 of 152

Which of the following algorithms has lowest worst case time complexity?

Select one of the following:

Quick sort
Selection sort
Insertion sort
Heap sort

Explanation

Question 41 of 152

BST: 50, 15, 62, 5, 20,58, 91, 3,8 The number of nodes in the left of the root is

Select one of the following:

Explanation

Question 42 of 152

Heap is an example of

Select one of the following:

BST
Complete BST
Spanning tree
General tree

Explanation

Question 43 of 152

What is the run-time complexity of the Floyd-Warshall algorithm? (worst case performance)

Select one of the following:

O(V^2)
O(V*E)
O(V+E)
O(V^3)

Explanation

Question 44 of 152

For all binary search trees, where d represents the depth of a tree and n represents the number of nodes, the worst-case complexity of searching for an element is

Select one of the following:

O(n/d)
O(n*d)
O(d)
O(n)

Explanation

Question 45 of 152

Which of the following statements is true of both depth-first and breadth-first searches?

Select one of the following:

Their implementations each require a stack of nodes.
From a given starting node, they will not necessarily explore all other nodes in a graph.
Their implementations each require a queue of nodes.
They can each be used calculate the shortest path between two nodes in a weighted graph.

Explanation

Question 46 of 152

BST run-time complexity of search function in worst case is

Select one of the following:

O(n)
O(logn)
O(n^2)
O(nlogn)

Explanation

Question 47 of 152

In a binary min heap containing n numbers, the smallest element can be found in time

Select one of the following:

O(1)
O(logn)
O(n)
none of this

Explanation

Question 48 of 152

A full binary tree n leaves contains

Select one of the following:

n nodes,
2n-1 nodes
n nodes
2n nodes

Explanation

Question 49 of 152

Which one of the following array represents a binary max-heap?

Select one of the following:

25,12,16,13,10,8,14,
25,14,12,14,10,8,16
25,14,16,13,10,8,12
25,12,16,13,10,8,14

Explanation

Question 50 of 152

In a binary max heap containing n numbers,the smallest element can be found in time

Select one of the following:

O(n)
O(logn)
O(1)
O(nlogn)

Explanation

Question 51 of 152

The maximum number of nodes on level i of a binary tree is

Select one of the following:

2i-1
i+1
3i-1
2i+2

Explanation

Question 52 of 152

Which algorithms – can find vertices x & y if there are presented a path between them?

Select one of the following:

DFS
BFS
Both BFS and DFS
None of them

Explanation

Question 53 of 152

Choose the trasitive closure for the graph below

Select one of the following:

1 1 1 1

1 1 1 1

1 1 1 1

0 0 0 1
1 0 1 1

1 1 1 1

1 1 1 1

0 0 0 0
1 1 1 1

1 1 1 1

1 1 0 0

0 0 0 1
1 0 0 1

1 1 1 1

0 1 0 1

0 0 0 1

Explanation

Question 54 of 152

What is the run-time complexity of the Kruskal's algorithm? (average performance)

Select one of the following:

O(ElogV)
O(V^3)
O(VlogE)
O(V^2)

Explanation

Question 55 of 152

Suppose we run Dijkstra’s single source shortest-path algorithm. Find the minimum path from P to U and what sequence of visited points you have?

Select one of the following:

P, S, R, U
P, Q, S, U
P, Q, R, U
P, Q, R, S, U

Explanation

Question 56 of 152

How does the use of parenthesis change the expression tree? Which graph below represents the equation 3+2*4-1

Select one of the following:

Explanation

Question 57 of 152

What is the result of the program below?

#include <stdio.h>

int main(){

char *ch;

while(x=0; x<=255; x++)

printf(“ASCII value of %d character %c\n”,x,x);

return 0;

}

Select one of the following:

The code prints all ASCII values and its characters
Error: x undeclared identifier
The code generates an infinite loop
Error: while statement missing

Explanation

Question 58 of 152

What is the output of the following program?

#include <stdio.h>

int main(){

char nstring=”Hello”;

while(nstring)

printf(“%c”, *nstring++); }

Select one of the following:

ello
Runtime error
Compile error
Hello

Explanation

Question 59 of 152

What will be the output of the program?

#include <stdio.h>

int main(){

int k, num=30;

k=(num>5 ? (num <= 10? 100 : 200):500);

printf("%d\n", num);

return 0;

}

Select one of the following:

Explanation

Question 60 of 152

What statement can print \n on the screen?

#include <stdio.h>

int main(){

printf("\\n");

return 0;

}

Select one of the following:

None
printf(“n\”);
printf(“\\n”);
printf(“n”);
printf(“\n”);

Explanation

Question 61 of 152

How many times the program will print “Hello”?

#include<stdio.h>

int main(){

printf("Hello");

main();

return 0;

}

Select one of the following:

0
Compilation error
Unlimited times
Till stack run over

Explanation

Question 62 of 152

What is the built library function to compare two strings?

Select one of the following:

IsEqual();
Strcmp();
Strcompare();
Strstr();

Explanation

Question 63 of 152

According to ANSI specification, how to declare main() function with command-line arguments?

Select one of the following:

int char main(int argc, *argv)
None
int main(){

int char (*argv argc);

}
int main(int argc, char *argv[])

Explanation

Question 64 of 152

Queue worst time complexity to delete some value…

Select one of the following:

O(1)
O(n^2)
O(log n)
O(n)

Explanation

Question 65 of 152

The keys 12,18,13,2,3,23,5 and 15 are inserted into an initially empty hash table of length 10 using open addressing with hash function h(k)=k mod 10 and linear probing. What is the resultant hash table?

Select one of the following:

Explanation

Question 66 of 152

What is the worst time complexity of the hash table in Big O notation?

Select one of the following:

O(n logn)
O(n)
O(1)
O(log n)

Explanation

Question 67 of 152

Stack works by the principle

Select one of the following:

LILO
FIFO
LIFO
FILO

Explanation

Question 68 of 152

Linked list is generally considered as an example of ____ type of memory allocation.

Select one of the following:

Compile time
Static
Dynamic
Local

Explanation

Question 69 of 152

A hash table of length 10 uses open addressing with hash function h(k)=k mod 10, and linear probing. After inserting 6 values into an empty hash table, the table is as shown below.

Select one of the following:

42,46,33,23,34,52
46,42,34,52,23,33
34,42,23,52,33,46
46,34,42,23,52,33

Explanation

Question 70 of 152

An algorithm is

Select one of the following:

A loosely written code to make final code
A step by step procedure to solve problem
All of the above
A piece of code to be executed

Explanation

Question 71 of 152

What is the best time complexity of the binary search?

Select one of the following:

O(n)
O(1)
O(log n)
O(n logn)

Explanation

Question 72 of 152

What is the sorting algorithms is presented on the example below?

Select one of the following:

Insertion sort
Radix sort
Quick sort
Bucket sort

Explanation

Question 73 of 152

Which sorting algorithms is most efficient to sort string consisting of ASCII characters?

Select one of the following:

Quick sort
None
Counting sort
Merge sort

Explanation

Question 74 of 152

A pivot element to partition unsorted list is used in

Select one of the following:

Quick sort
Insertion sort
Merge sort
Selection sort

Explanation

Question 75 of 152

What is the gcc?

Select one of the following:

The command to create new file
The command to show all errors during compiling
The command doesn’t exist
The compiler

Explanation

Question 76 of 152

What is rmdir command in Unix OS?

Select one of the following:

This command creates a directory
This command copies a file
This command removes a file
This command removes(deletes) a directory

Explanation

Question 77 of 152

What is touch command in Unix OS?

Select one of the following:

This command builds products based on rules contained in a file
This command updates the last modification time of a file or directory
These commands allow you to view the contents of a file without editing the file
This family of commands allows you to open files for editing

Explanation

Question 78 of 152

“.” In Unix like systems

Select one of the following:

Refers to the containing directory
Refers to your home directory
Refers to the root directory
Refers to the current directory

Explanation

Question 79 of 152

The default executable generation on Unix for a C program is

Select one of the following:

a.exe
default.out
a.out
out.a

Explanation

Question 80 of 152

In the given below statement,what does the “arr” indicate? char *arr[30];

Select one of the following:

arr is a pointer to an array
arr is a array of 30 characters
arr is a array of function
arr is a array of 30 character pointers

Explanation

Question 81 of 152

What function is used to free the allocated memory for the program below?
#include <stdio.h>
#include<stdlib.h>
int main(){
int k;
k=(int) malloc(10* sizeof(int));
return 0; }

Select one of the following:

clean k;
delete k;
free(k);
memfree(k);

Explanation

Question 82 of 152

Which library functions help users to dynamically allocate memory?

Select one of the following:

malloc(), memalloc()
macalloc(), calloc()
realloc(), calloc()
malloc(), calloc()

Explanation

Question 83 of 152

Which header statement is missing in the given below program to get the desired output?
#include <stdio.h>
int main(){
double x=1234321;
if(isdigit(x)){
printf("%lf",x);
return 0;
}

Select one of the following:

#include <ctype.h>
#include <math.h>
#include <string.h>
#include <stdlib.h>

Explanation

Question 84 of 152

Accessing top element in stack is constant time operation

Select one of the following:

Верно
Неверно

Explanation

Question 85 of 152

Process of Removing element from the stack is called as…(C++)

Select one of the following:

push
pop
delete
clean

Explanation

Question 86 of 152

A linked list in which the last node of Linked list points to the first is called a______

Select one of the following:

doubly LL
singly LL
hybrid LL
circular LL

Explanation

Question 87 of 152

A doubly linked list performs traversal in____

Select one of the following:

none
either direction
circular direction
any direction

Explanation

Question 88 of 152

LL is used to implement the Stack then which of the following node is - Top of the Stack?

Select one of the following:

middle node
first node
any node
last node

Explanation

Question 89 of 152

What is the worst time complexity of the binary search algorithm?

Select one of the following:

O(1)
O(logn)
none
O(n)

Explanation

Question 90 of 152

What is the worst time complexity of the bubble sort?

Select one of the following:

O(n^2)
O(n)
O(nlogn)
O(n^3)

Explanation

Question 91 of 152

Which of the following sorting algorithms has the lowest worst-case complexity?

Select one of the following:

Bubble Sort
Selection Sort
Quick Sort
Merge Sort

Explanation

Question 92 of 152

What is make command in Unix OS?

Select one of the following:

This command builds products based on rules contained in a makefile
This command compiles a Java program
This command is most commonly used to display the contents of a file on the terminal
This is the compiler, which can take many options

Explanation

Question 93 of 152

What is ls command in UNIX OS?

Select one of the following:

This command creates a directory
This command renames an entity
This command list the contents of a directory
This command displays the path of the current directory

Explanation

Question 94 of 152

Unix command mv ___

Select one of the following:

This command renames an entity
This command removes(deletes) a directory
This command removes a file
This command copies a file

Explanation

Question 95 of 152

The keyboard used to transfer control from a function back to the calling function is

Select one of the following:

switch
return
go back
go to

Explanation

Question 96 of 152

What is the result of the program?
#include<stdio.h>
int main() {
int const a = 5;
a++;
printf("%d", a);
}

Select one of the following:

Stack is run over
None
5
Compilation error

Explanation

Question 97 of 152

What value strcmp() function returns when two strings are the same?

Select one of the following:

true
0
-1
1

Explanation

Question 98 of 152

Stack time complexity to insert some value …

Select one of the following:

O(1)
O(n)
O(logn)
O(n/logn)

Explanation

Question 99 of 152

Which if the following is not a type of Linked list?

Select one of the following:

hybrid LL
singly LL
doubly LL
circular LL

Explanation

Question 100 of 152

Queue can be implemented using a list

Select one of the following:

Верно
Неверно

Explanation

Question 101 of 152

Which of the following container has search efficiency of O(1) (Best case)

Select one of the following:

Doubly Linked List
Hash table
Heap
Linked List

Explanation

Question 102 of 152

“/” in Unix like systems

Select one of the following:

refers to the current directory
refers to the containing directory
refers to your home directory
refers to the root directory

Explanation

Question 103 of 152

Unix command pwd_____

Select one of the following:

This command removes a file
This command creates a directory
This command displays manual pages for various commands
This command displays the path of the current directory

Explanation

Question 104 of 152

A linked-list is a dynamic structure

Select one of the following:

Верно
Неверно

Explanation

Question 105 of 152

What are two operators for ascending members of a structure and when are they used?

Select one of the following:

none
and->
and this
and-->

Explanation

Question 106 of 152

What is the malloc & calloc?

Select one of the following:

allocate the dynamic memory
allocate the dynamic memory and save zero there
create new variable
free dynamic memory

Explanation

Question 107 of 152

A local variable is stored in __

Select one of the following:

heap segment
stack segment
code segment
none

Explanation

Question 108 of 152

Which scanf(statement will you use to scan a float variable (a) and double variable (b)?

Select one of the following:

scanf(“%f%lf”, &a, &b);
scanf(“%lf%lf”, &a, &b);
scanf(“%f%f”, &a, &b);
scanf(“%Lf%Lf”, &a, &b);

Explanation

Question 109 of 152

A single line comment in C language source code can begin with __

Select one of the following:

:
/*
;
//

Explanation

Question 110 of 152

Only top element can be accessed in stack

Select one of the following:

верно
неверно

Explanation

Question 111 of 152

Each Node contain minimum two fields one field called data field to store data. Another field _

Select one of the following:

pointer to Node
pointer to character
pointer to an integer
pointer to class

Explanation

Question 112 of 152

A hash table of length 10 uses quadratic function h(k)=k mod 10. After inserting 6 values into an empty hash table, the table is as shown below.
0
1
2 42
3 23
4 34
5
6 52
7 46
8
9 33
Which one of the following choices given a possible order in which the key values could have been inserted in the table?

Select one of the following:

46, 42, 34, 52, 23, 33
34, 42, 23, 52, 33, 46
42, 23, 34, 52, 46, 33
46, 34, 42, 23, 52, 33

Explanation

Question 113 of 152

How do you specify double constant 3.14 as a long double?

Select one of the following:

Explanation

Question 114 of 152

What built in library function to adjust the allocated dynamic memory size

Select one of the following:

calloc
malloc
recalloc
realloc

Explanation

Question 115 of 152

Queue works by the principle

Select one of the following:

Last in First out
none
First in First out FIFO
First in Last out

Explanation

Question 116 of 152

How to convert some data to the lower case in C programming language?

Select one of the following:

toupper(); #include <ctype.h>
tolower();, #include <stdlib.h>
toupper(); #include <stdlib.h>
tolower();, #include <ctype.h>

Explanation

Question 117 of 152

How to create the boolean type in C without usage of #include <stdbool.h>

Select one of the following:

_Bool
boolean
_Boolean
bool

Explanation

Question 118 of 152

“r+” in fopen function tries to open the file for …

Select one of the following:

read & write
append new content to the file
only reading this file
reading and append new content to the file

Explanation

Question 119 of 152

Linked list works by the FIFO method

Select one of the following:

верно
неверно

Explanation

Question 120 of 152

What is best time complexity of search operation in the LL?

Select one of the following:

O(logn)
none
O(1)
O(n)

Explanation

Question 121 of 152

What is the general formula for double hashing in the hast table?

Select one of the following:

h( k, i) = ( h1(k) + i * h2(k)) mod m
none
h(x) = x mod m
h (k, i) = ( h’(k) + i^2) mod m

Explanation

Question 122 of 152

What function can be used to free the memory allocated by calloc()?

Select one of the following:

delete();
strcat();
free();
memfree();

Explanation

Question 123 of 152

Identify the incorrect file opening mode from the following

Select one of the following:

Explanation

Question 124 of 152

In the stack process of inserting an element in the stack is called as _____

Select one of the following:

push
insert
pop
create

Explanation

Question 125 of 152

What is the output of the following program?
#include <stdio.h>
int main(){
int a[] = {2,1};
printf("%d", *a);

}

Select one of the following:

2
0
1
Compile error

Explanation

Question 126 of 152

The merge sort algorithm is based on:

Select one of the following:

Divide-and-Conquer paradigm
Greedy paradigm
Dynamic Programming paradigm
None of these

Explanation

Question 127 of 152

Recursion uses more memory space than iteration because

Select one of the following:

None of them
it uses stack instead of queue & every recursive call has to be stored
every recursive call has to be stored
it uses stack instead of queue

Explanation

Question 128 of 152

Shell sort uses

Select one of the following:

quick sort
insertion sort
selection sort
merge sort

Explanation

Question 129 of 152

What is the result of the program below?
#include <stdio.h>
int main(){
int a=9, b=&a, pointer=b+0;
printf("%u", pointer);
}

Select one of the following:

Address of pointer
Compile error
Segmentation fault
9
0

Explanation

Question 130 of 152

What is the maximum number of nodes that a perfectly balanced tree with a height of 7 can contain?

Select one or more of the following:

(2**8)-1 = 255 (Maximum)

(2**7) = 128 (Minimum)
(2**7)-1 = 127 (Maximum)

(2**5) = 32 (Minimum)
(2**7)-1 = 127 (Maximum)

(2**6) = 64 (Minimum)
(2**6)-1 = 63 (Maximum)

(2**5) = 32 (Minimum)

Explanation

Question 131 of 152

Find the MST from the graph below:

Select one of the following:

(FB), (HC), (BC), (IH), (AB), (EC), (ED), (EG)
(FB), (HC), (BC), (IH), (AB), (EA), (ED), (EG)
(FB), (HC), (BC), (IH), (AB), (EA), (ED), (HE)
(FB), (HC), (BC), (IH), (AB), (EC), (FD), (EG)

Explanation

Question 132 of 152

The minimum cost of path from A node to I node by the following graph:

Select one of the following:

Explanation

Question 133 of 152

Add element “K” in the following max heap: g,c,f,b,a,d

Select one of the following:

None of them
c,g,b,a,d,f,k
k,c,g,b,a,d,f
c,g,b,a,k,d,f

Explanation

Question 134 of 152

Translate the following expression tree graph into the mathematical equation that it represents.26. Translate the following expression tree graph into the mathematical equation that it represents.

Select one of the following:

(2+3)*(4-1) = 15
(3+2)*(4-1) = 15
(3+2)*(4-1) = 16
(3+2)*(1-4) = 15

Explanation

Question 135 of 152

Find the cost of MST in the graph below:

Select one of the following:

Explanation

Question 136 of 152

Consider the undirected graph below: Using Prim's algorithm to construct a minimum spanning tree starting with node A, which one of the following sequences of edges represents a possible order in which the edges would be added to construct the minimum spanning tree?

Select one of the following:

(A, D), (A, B), (A, C), (C, F), (G, E), (F, G)
(A, B), (A, D), (D, F), (F, G), (G, E), (F, C)
(E, G), (C, F), (F, G), (A, D), (A, B), (A, C)
(A, D), (A, B), (D, F), (F, C), (F, G), (G, E)

Explanation

Question 137 of 152

Find the minimum path from a to i Dijkstra algorithm. Choose the sequence of visited Nodes.

Select one of the following:

a->c->d->b->e->g->
a->c->g->b->e->d->
a->c->d->b->g->e->
a->d->g->b->e->

Explanation

Question 138 of 152

What is the run-time complexity of the Floyd-Warshall algorithm?(best case performance)

Select one of the following:

O(V*E)
O(V+E)
O(V^3)
O(V^2)

Explanation

Question 139 of 152

The Dijkstra and the Bellman-Ford algorithms both determine

Select one of the following:

the shortest path between all nodes in a graph
the shortest path between two nodes in a graph
whether a graph is directed or undirected
the edge with the greatest weight in a graph
whether or not a graph is a tree

Explanation

Question 140 of 152

Choose the algorithm with not-greedy approach

Select one of the following:

Prim Algorithm
Floyd Algorithm
Dijkstra Algorithm
Kruskal Algorithm

Explanation

Question 141 of 152

Having parenthesis in an expression tree serves to balance it better.

Select one of the following:

True
False

Explanation

Question 142 of 152

What are two operators for accessing members of a structure and when are they used?

Select one of the following:

. and->
. and this
None
. and--->

Explanation

Question 143 of 152

\ What is the difference between a and a+ modes?

Select one of the following:

a - open for appending, a+ - open for reading and appending
a - open for reading and appending, a+ - open for appending
a -open for appending, a+ - open for reading and writing
a - open for appending, a+ - open for writing and appending

Explanation

Question 144 of 152

The nodes of a __linked list can be traversed_.

Select one of the following:

Singly, forward and backward
Doubly, forward only
Doubly, backward only
Singly, forward only

Explanation

Question 145 of 152

A hash table of length 10 uses double hashing and hash function h(k)=k mod 10. After inserting 6 values into an empty hash table, the table is as shown
Which one of the following choices gives a possible order in which the key values could have been inserted in the table?

Select one of the following:

34,52,42,23,33,46
33,46,42,34,52,23
46,34,42,23,52,33
42,46,33,23,34,52

Explanation

Question 146 of 152

What is the formula to calculate the load factor of hash table? (n number of elements, m size of table)

Select one of the following:

ɻ= n/m
ɻ =n*m
ɻ =n/sqrt(m)
ɻ =n/m^2

Explanation

Question 147 of 152

Which of the following is a balanced tree for the numbers 1-9? There may be more than one answer.

Select one of the following:

Explanation

Question 148 of 152

What are algorithms appropriate to find the minimum spanning tree?What are algorithms appropriate to find the minimum spanning tree?
Выберите один или несколько ответов:

Select one or more of the following:

Prim algorithm
Floyd algorithm
Bellman-Ford algorithm
Kruskal's algorithm

Explanation

Question 149 of 152

The approach helps to balance tree
(One or multiple)

Select one or more of the following:

AVL
BST
Red Black Tree
none

Explanation

Question 150 of 152

String in C
(One or multiple)

Select one or more of the following:

char* name;
char name[4] = “Hello”;
none
char name[10];

Explanation

Question 151 of 152

String in C programming language…
(One or multiple)

Select one or more of the following:

char name[6] = “Ernur”;
char name[5] = “Ernur”;
char* name = “Ernur”;
char name;

Explanation

Question 152 of 152

Identify the C compiler in UNIX like operating systems. (One or multiple)

Select one or more of the following:

vc++
cc
Borland
gcc

Explanation

Check answer

["https://cdn.goconqr.com/uploads/media/image/9817774/image_primary_b0eb067f-e3bb-4a96-8dfd-3cc10b71b8a9.png","https://cdn.goconqr.com/uploads/media/image/9817782/image_primary_f8de5612-a8b7-404d-93b0-dea9963abc3f.png","https://cdn.goconqr.com/uploads/media/image/9817789/image_primary_23837ece-e085-4582-9cbd-335649c75a0e.png","https://cdn.goconqr.com/uploads/media/image/9817804/image_primary_a299868a-58dc-492d-9f42-d0f34b3699c0.png","https://cdn.goconqr.com/uploads/media/image/9817856/image_primary_5af7def5-4d60-45ba-8f8b-5d156f119a55.png","https://cdn.goconqr.com/uploads/media/image/9817859/image_primary_5459a67a-976a-4bb7-9d18-56f64217b855.png","https://cdn.goconqr.com/uploads/media/image/9817986/image_primary_6268b7d2-b699-4ec6-9491-5872f9c901ac.png","https://cdn.goconqr.com/uploads/media/image/9817991/image_primary_bc450ffa-10ff-4e60-972e-98775f5bed24.png","https://cdn.goconqr.com/uploads/media/image/9818041/image_primary_dfe085ac-49e3-4c7a-8985-c86c25711402.png","https://cdn.goconqr.com/uploads/media/image/9818490/image_primary_0a07fe7e-2e2c-4948-8896-30e47f523306.png","https://cdn.goconqr.com/uploads/media/image/9818516/image_primary_368d78ef-2041-4d89-a6bf-86e3820d472e.png","https://cdn.goconqr.com/uploads/media/image/9848683/image_primary_03af301b-6469-413f-bed3-ba0aa433cc19.png","https://cdn.goconqr.com/uploads/media/image/9848695/image_primary_871ae770-3613-4df9-9412-97c1a4668ea4.png","https://cdn.goconqr.com/uploads/media/image/9848706/image_primary_3d8903dd-c4e4-4a3e-9d58-139fcfbb112d.png","https://cdn.goconqr.com/uploads/media/image/9848721/image_primary_5678d97f-087c-45e2-9224-eebcb1def4d5.png","https://cdn.goconqr.com/uploads/media/image/9848729/image_primary_2ec0e788-ab06-42f9-8fd2-4abec2d2dc6e.png","https://cdn.goconqr.com/uploads/media/image/9848749/image_primary_7ac51ec7-dc9f-411c-9eaa-d0008d79a58d.png","https://cdn.goconqr.com/uploads/media/image/9848773/image_primary_936b37e7-dcae-44c9-8b8d-31665ca2dd0d.png","https://cdn.goconqr.com/uploads/media/image/9817750/image_primary_156c5354-c799-478e-bf4b-42a7689e7a8b.png","https://cdn.goconqr.com/uploads/media/image/9817752/image_primary_19cf6e88-97b0-4045-8ca6-b58f42ed3495.png","https://cdn.goconqr.com/uploads/media/image/9817753/image_primary_5ac998e9-baa6-4849-8d36-5df2ba76113e.png","https://cdn.goconqr.com/uploads/media/image/9817756/image_primary_f8ed8d67-af39-4814-a5d2-0d2cc2d6ebfa.png","https://cdn.goconqr.com/uploads/media/image/9817819/image_primary_fc1035d5-961f-48dc-be39-44a8c48ef792.png","https://cdn.goconqr.com/uploads/media/image/9817822/image_primary_78e00e86-b49e-4449-8a8e-73b9f46e0b9e.png","https://cdn.goconqr.com/uploads/media/image/9817824/image_primary_566da324-cfe1-4388-8d24-4f264399a36a.png","https://cdn.goconqr.com/uploads/media/image/9817826/image_primary_5e999d80-2057-4e24-9f94-d9704ede6f53.png","https://cdn.goconqr.com/uploads/media/image/9817996/image_primary_feb15fb1-4aec-477e-bf48-a7a8ec9de265.png","https://cdn.goconqr.com/uploads/media/image/9817997/image_primary_f8c7f08b-3364-4800-894c-7cc20e171e9f.png","https://cdn.goconqr.com/uploads/media/image/9818000/image_primary_f96add5d-b854-45e0-9c3b-deff19a3fc1d.png","https://cdn.goconqr.com/uploads/media/image/9818002/image_primary_c9f319e9-43b0-4983-ae26-79eda52db2ed.png","https://cdn.goconqr.com/uploads/media/image/9848784/image_primary_133a31bd-3341-4760-916b-93ffa92b25e7.png","https://cdn.goconqr.com/uploads/media/image/9848786/image_primary_e0e30365-063e-4602-9b45-a50f544795fe.png","https://cdn.goconqr.com/uploads/media/image/9848788/image_primary_1802c399-40ad-4c50-9a79-36372c709d32.png","https://cdn.goconqr.com/uploads/media/image/9848791/image_primary_ac710fd4-b34f-4b06-9e92-f3663561e5dc.png"]

	Created by Csse 1502 over 7 years ago

SDP4 Quiz on sdp4, created by Csse 1502 on 21/05/2017.

sdp4

Question 1 of 152

Re-balancing of AVL tree costs

Select one of the following:

Explanation

Question 2 of 152

In what tree, for every node the height of its left subtree and right subtree differs at least by one

Select one of the following:

Explanation

Question 3 of 152

Which of the following is true about the total number of nodes in a binary tree with depth two?

Select one of the following:

Explanation

Question 4 of 152

Which of the following is not a valid binary search tree?

Select one of the following:

Explanation

Question 5 of 152

The result of postfix expression: 4 2 + 3 5 1 - * +

Select one of the following:

Explanation

Question 6 of 152

The infix expression A+((B-C)*D) is correctly represented in prefix notation as

Select one of the following:

Explanation

Question 7 of 152

The result of postfix expression: 5 7 + 6 2 - *

Select one of the following:

Explanation

Question 8 of 152

The prefix expression reverse to postfix: * + A B + C D

Select one of the following:

Explanation

Question 9 of 152

What the result of the following expression: 2 3 8 * + 4 48 4 2 + / 6 * + -

Select one of the following:

Explanation

Question 10 of 152

By definition, a(n)______ graph contains edges that can be traversed in either direction.

Select one of the following:

Explanation

Question 11 of 152

What is the weight of a minimum spanning tree of the following graph?

Select one of the following:

Explanation

Question 12 of 152

Which of the following algorithms use a dynamic programming approach (not greedy)? Выберите один или несколько ответов:

Select one of the following:

Explanation

Question 13 of 152

The MST of the graph below:

Select one of the following:

Explanation

Question 14 of 152

What is the Run-time of the Dijkstra’s original algorithm? (without min priority queue)

Select one of the following:

Explanation

Question 15 of 152

Choose the algorithm with not greedy approach ….

Select one of the following:

Explanation

Question 16 of 152

The Floyd-Warshall algorithm for all-pair shortest paths computation is based on:

Select one of the following:

Explanation

Question 17 of 152

The sequence of visited nodes by Dijkstra algorithm:

Select one of the following:

Explanation

Question 18 of 152

The following heap : 18 15 9 14 11 2 7 6 12 3, add there 17 and choose right sequence:

Select one of the following:

Explanation

Question 19 of 152

In the deletion operation of max heap, the root is replaced by:

Select one of the following:

Explanation

Question 20 of 152

Delete max element from the heap and choose the answer: 18 17 9 14 15 2 7 6 12 3 11

Which of the following algorithms use a dynamic programming approach (not greedy)?
Выберите один или несколько ответов:

Group A Group B

a) Dijkstra's single shortest path algo p) Dynamic Programming

b) Bellmen Ford's single shortest path algo q) Greedy Algorithm

c) Floyd Warshell's all pair shortest path algo. r) Backtracking