Quiz
sdp4
Crie uma conta grátis para terminar este quiz
Salve seu progresso e veja sua nota final.
Já tem uma conta? Inicie sessão
Perguntas do quiz (152)
1 Re-balancing of AVL tree costs
- AO(logn)
- BO(nlogn)
- CO(1)
- DO(n)
2 In what tree, for every node the height of its left subtree and right subtree differs at least by one
- AThreaded binary tree
- BBST
- CAVL tree
- DComplete tree
3Which of the following is true about the total number of nodes in a binary tree with depth two?
- AIt is at most four
- BIt is at most seven
- CThere is no bound on the number of nodes
- DIt is at most two
4 Which of the following is not a valid binary search tree?
- A
- B
- C
- D
- A
5The result of postfix expression: 4 2 + 3 5 1 - * +
- A18
- B10
- C15
- D8
6The infix expression A+((B-C)*D) is correctly represented in prefix notation as
- AA+BC-D*
- BABC-D*+
- C+A*-BCD
- DA+B-C*D
7 The result of postfix expression: 5 7 + 6 2 - *
- A40
- B38
- C46
- D48
8 The prefix expression reverse to postfix: * + A B + C D
- AA B + C D + * *
- BA B + C D + *
- CNone of them
- DA B + C D * +
9 What the result of the following expression: 2 3 8 * + 4 48 4 2 + / 6 * + -
- A-26
- B12
- C-20
- D-10
10By definition, a(n)______ graph contains edges that can be traversed in either direction.
- Aundirected
- Bdirected
- Cdisconnected
- Dconnected
11What is the weight of a minimum spanning tree of the following graph?
- A31
- B35
- C41
- D38
- E29
12Which of the following algorithms use a dynamic programming approach (not greedy)?
Выберите один или несколько ответов:- AFloyd Algorithm
- BBellman-Ford Algorithm
- CDijkstra Algorithm
- DPrim Algorithm
13The MST of the graph below:
- A3, 1, 2, 9, 4, 7, 5
- B3, 1, 2, 9, 10, 7, 5
- C3, 1, 2, 9, 11, 7, 5
- D3, 1, 2, 9, 4, 7, 8
14 What is the Run-time of the Dijkstra’s original algorithm? (without min priority queue)
- AO(E+V)
- BO(E+VlogV)
- CO(E^2)
- DO(V^2)
15Choose the algorithm with not greedy approach ….
- APrim Algorithm
- BDijkstra Algorithm
- CFloyd Algorithm
- DKruskal Algorithm
16The Floyd-Warshall algorithm for all-pair shortest paths computation is based on:
- AGreedy paradigm
- BDynamic Programming paradigm
- CNone
- DDivide-and-Conquer paradigm
17The sequence of visited nodes by Dijkstra algorithm:
- AS, B, A, С, t
- BNone of them
- CS, A, B, C, t
- DS, B, A, t
18 The following heap : 18 15 9 14 11 2 7 6 12 3, add there 17 and choose right sequence:
- A18 17 9 14 15 2 7 12 6 3 11
- B18 15 9 14 11 2 7 6 12 3 17
- C18 17 9 14 15 2 7 6 11 12 3
- D18 17 9 14 15 2 7 6 12 3 11
19In the deletion operation of max heap, the root is replaced by:
- ALast element of the last level
- BNext available value in the right sub-tree
- CNext available value in the left sub-tree
- DAny random value from the heap
20Delete max element from the heap and choose the answer: 18 17 9 14 15 2 7 6 12 3 11
- A17 15 9 14 12 11 2 7 6 3
- B17 15 9 14 11 2 7 6 12 3
- C17 9 14 15 2 7 6 12 3 11
- D17 15 14 12 11 9 2 7 6 3
21In a min heap
- AA minimum values are sorted
- BParent nodes have less value than child nodes
- CMaximum value is contained by the root node
- DChild nodes have less value than parent nodes
22 The result of this postfix expression: 10 5 + 60 6 / * 8 – is
- A82
- B284
- C273
- D142
23 Please find the postfix expression from prefix: - * - + a b c / e f - g / h i
- Aa b + c - - e f / * g h i / -
- Ba b + c - e f / * g h - i / -
- Ca b + c - e f / * g h i / -
- Da b + c - e f / * g h i / - -
24 If this tree is used for sorting, then new no 8 should be placed as the
- Aright child of the node labelled 5
- Bright child of the node labelled 30
- Cleft child of the node labelled 10
- Dleft child of the node labelled 30
25 Number of possible binary trees with 3 nodes is (Kahoot 100%)
- A9
- B3
- C14
- D5
26The result of this postfix expression: 4 5 7 2 + - *
- A-10
- B-11
- C-16
- D-5
27 Which of the following statements about binary trees is true?
- AA binary tree contains exactly two nodes.
- BExactly two paths exist between any two nodes in a binary tree.
- CEvery node of a binary tree has at most two children.
- DEvery node of a binary tree has at most two predecessors.
28 A binary tree T has 20 leaves. The number of nodes in T having two children is
- AAny number between 10 and 20
- B18
- C19
- D17
29 Choose the Bipartite graph from the following graphs...
- A
- B
- C
- D
- A
30 Each of the following indicates a reasonable way to implement graphs except
- Aa BST
- Ba Boolean matrix
- Can adjacency list
- Dan edge list
31 Postfix expression is just a reverse of prefix expression.
- AВерно
- BНеверно
32Choose the regular expression which -- "Search all string which start with "a"
- Aa*
- Ba+
- Ca$
- D^a
33Which of the following algorithms use a greedy approach?
- APrim, Kruskal, Floyd
- BPrim, Kruskal, Dijkstra
- CPrim, Bellman-Ford, Floyd
- DPrim, Kruskal, Bellman-Ford
34A 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?
- AB
- BC
- CD
- DA
35Heap with n elements with the smallest element at the root, 7 smallest element can be found
- AO(1)
- BO(n)
- CO(nlogn)
- DO(logn)
36 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
- AC
- BB
- CD
- DA
37 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- Aa-q, b-p, c-p
- Ba-p, b-p, c-p
- Ca-r, b-q, c-p
- Da-p, b-r, c-q
38Time complexity of Depth First Traversal of is
- AΘ(|V|*|E|)
- BΘ(|V|)
- CΘ(|V|+|E|)
- DΘ(|E|)
39The time complexity of heap sort in worst case is
- AO(nlogn)
- BO(n)
- CO(n2)
- DO(logn)
40 Which of the following algorithms has lowest worst case time complexity?
- AQuick sort
- BSelection sort
- CInsertion sort
- DHeap sort
41 BST: 50, 15, 62, 5, 20,58, 91, 3,8 The number of nodes in the left of the root is
- A4
- B5
- C3
- D7
42 Heap is an example of
- ABST
- BComplete BST
- CSpanning tree
- DGeneral tree
43What is the run-time complexity of the Floyd-Warshall algorithm? (worst case performance)
- AO(V^2)
- BO(V*E)
- CO(V+E)
- DO(V^3)
44 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
- AO(n/d)
- BO(n*d)
- CO(d)
- DO(n)
45Which of the following statements is true of both depth-first and breadth-first searches?
- ATheir implementations each require a stack of nodes.
- BFrom a given starting node, they will not necessarily explore all other nodes in a graph.
- CTheir implementations each require a queue of nodes.
- DThey can each be used calculate the shortest path between two nodes in a weighted graph.
46 BST run-time complexity of search function in worst case is
- AO(n)
- BO(logn)
- CO(n^2)
- DO(nlogn)
47 In a binary min heap containing n numbers, the smallest element can be found in time
- AO(1)
- BO(logn)
- CO(n)
- Dnone of this
48A full binary tree n leaves contains
- An nodes,
- B2n-1 nodes
- Cn nodes
- D2n nodes
49Which one of the following array represents a binary max-heap?
- A25,12,16,13,10,8,14,
- B25,14,12,14,10,8,16
- C25,14,16,13,10,8,12
- D25,12,16,13,10,8,14
50In a binary max heap containing n numbers,the smallest element can be found in time
- AO(n)
- BO(logn)
- CO(1)
- DO(nlogn)
51The maximum number of nodes on level i of a binary tree is
- A2i-1
- Bi+1
- C3i-1
- D2i+2
52Which algorithms – can find vertices x & y if there are presented a path between them?
- ADFS
- BBFS
- CBoth BFS and DFS
- DNone of them
53 Choose the trasitive closure for the graph below
- A1 1 1 1
1 1 1 1
1 1 1 1
0 0 0 1 - B1 0 1 1
1 1 1 1
1 1 1 1
0 0 0 0 - C1 1 1 1
1 1 1 1
1 1 0 0
0 0 0 1 - D1 0 0 1
1 1 1 1
0 1 0 1
0 0 0 1
- A1 1 1 1
54 What is the run-time complexity of the Kruskal's algorithm? (average performance)
- AO(ElogV)
- BO(V^3)
- CO(VlogE)
- DO(V^2)
55Suppose 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?
- AP, S, R, U
- BP, Q, S, U
- CP, Q, R, U
- DP, Q, R, S, U
56How does the use of parenthesis change the expression tree? Which graph below represents the equation 3+2*4-1
- A
- B
- C
- D
- A
57 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;
}- AThe code prints all ASCII values and its characters
- BError: x undeclared identifier
- CThe code generates an infinite loop
- DError: while statement missing
58What is the output of the following program?
#include <stdio.h>
int main(){
char *nstring=”Hello”;
while(*nstring)
printf(“%c”, *nstring++); }- Aello
- BRuntime error
- CCompile error
- DHello
59 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;
}- A30
- B500
- C200
- D100
60 What statement can print \n on the screen?
#include <stdio.h>
int main(){
printf("\\n");
return 0;
}- ANone
- Bprintf(“n\”);
- Cprintf(“\\n”);
- Dprintf(“n”);
- Eprintf(“\n”);
61How many times the program will print “Hello”?
#include<stdio.h>
int main(){
printf("Hello");
main();
return 0;
}- A0
- BCompilation error
- CUnlimited times
- DTill stack run over
62What is the built library function to compare two strings?
- AIsEqual();
- BStrcmp();
- CStrcompare();
- DStrstr();
63 According to ANSI specification, how to declare main() function with command-line arguments?
- Aint char main(int argc, *argv)
- BNone
- Cint main(){
int char (*argv argc);
} - Dint main(int argc, char *argv[])
64Queue worst time complexity to delete some value…
- AO(1)
- BO(n^2)
- CO(log n)
- DO(n)
65The 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?
- AA
- BB
- CD
- DC
66 What is the worst time complexity of the hash table in Big O notation?
- AO(n logn)
- BO(n)
- CO(1)
- DO(log n)
67 Stack works by the principle
- ALILO
- BFIFO
- CLIFO
- DFILO
68 Linked list is generally considered as an example of ____ type of memory allocation.
- ACompile time
- BStatic
- CDynamic
- DLocal
69A 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.
- A42,46,33,23,34,52
- B46,42,34,52,23,33
- C34,42,23,52,33,46
- D46,34,42,23,52,33
70An algorithm is
- AA loosely written code to make final code
- BA step by step procedure to solve problem
- CAll of the above
- DA piece of code to be executed
71What is the best time complexity of the binary search?
- AO(n)
- BO(1)
- CO(log n)
- DO(n logn)
72What is the sorting algorithms is presented on the example below?
- AInsertion sort
- BRadix sort
- CQuick sort
- DBucket sort
73Which sorting algorithms is most efficient to sort string consisting of ASCII characters?
- AQuick sort
- BNone
- CCounting sort
- DMerge sort
74A pivot element to partition unsorted list is used in
- AQuick sort
- BInsertion sort
- CMerge sort
- DSelection sort
75What is the gcc?
- AThe command to create new file
- BThe command to show all errors during compiling
- CThe command doesn’t exist
- DThe compiler
76What is rmdir command in Unix OS?
- AThis command creates a directory
- BThis command copies a file
- CThis command removes a file
- DThis command removes(deletes) a directory
77What is touch command in Unix OS?
- AThis command builds products based on rules contained in a file
- BThis command updates the last modification time of a file or directory
- CThese commands allow you to view the contents of a file without editing the file
- DThis family of commands allows you to open files for editing
78“.” In Unix like systems
- ARefers to the containing directory
- BRefers to your home directory
- CRefers to the root directory
- DRefers to the current directory
79The default executable generation on Unix for a C program is
- Aa.exe
- Bdefault.out
- Ca.out
- Dout.a
80In the given below statement,what does the “arr” indicate? char *arr[30];
- Aarr is a pointer to an array
- Barr is a array of 30 characters
- Carr is a array of function
- Darr is a array of 30 character pointers
81What 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; }- Aclean k;
- Bdelete k;
- Cfree(k);
- Dmemfree(k);
82Which library functions help users to dynamically allocate memory?
- Amalloc(), memalloc()
- Bmacalloc(), calloc()
- Crealloc(), calloc()
- Dmalloc(), calloc()
83Which 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;
}- A#include <ctype.h>
- B#include <math.h>
- C#include <string.h>
- D#include <stdlib.h>
84Accessing top element in stack is constant time operation
- AВерно
- BНеверно
85Process of Removing element from the stack is called as…(C++)
- Apush
- Bpop
- Cdelete
- Dclean
86A linked list in which the last node of Linked list points to the first is called a______
- Adoubly LL
- Bsingly LL
- Chybrid LL
- Dcircular LL
87A doubly linked list performs traversal in____
- Anone
- Beither direction
- Ccircular direction
- Dany direction
88LL is used to implement the Stack then which of the following node is - Top of the Stack?
- Amiddle node
- Bfirst node
- Cany node
- Dlast node
89What is the worst time complexity of the binary search algorithm?
- AO(1)
- BO(logn)
- Cnone
- DO(n)
90What is the worst time complexity of the bubble sort?
- AO(n^2)
- BO(n)
- CO(nlogn)
- DO(n^3)
91Which of the following sorting algorithms has the lowest worst-case complexity?
- ABubble Sort
- BSelection Sort
- CQuick Sort
- DMerge Sort
92What is make command in Unix OS?
- AThis command builds products based on rules contained in a makefile
- BThis command compiles a Java program
- CThis command is most commonly used to display the contents of a file on the terminal
- DThis is the compiler, which can take many options
93What is ls command in UNIX OS?
- AThis command creates a directory
- BThis command renames an entity
- CThis command list the contents of a directory
- DThis command displays the path of the current directory
94Unix command mv ___
- AThis command renames an entity
- BThis command removes(deletes) a directory
- CThis command removes a file
- DThis command copies a file
95The keyboard used to transfer control from a function back to the calling function is
- Aswitch
- Breturn
- Cgo back
- Dgo to
96What is the result of the program?
#include<stdio.h>
int main() {
int const a = 5;
a++;
printf("%d", a);
}- AStack is run over
- BNone
- C5
- DCompilation error
97What value strcmp() function returns when two strings are the same?
- Atrue
- B0
- C-1
- D1
98Stack time complexity to insert some value …
- AO(1)
- BO(n)
- CO(logn)
- DO(n/logn)
99Which if the following is not a type of Linked list?
- Ahybrid LL
- Bsingly LL
- Cdoubly LL
- Dcircular LL
100Queue can be implemented using a list
- AВерно
- BНеверно
101Which of the following container has search efficiency of O(1) (Best case)
- ADoubly Linked List
- BHash table
- CHeap
- DLinked List
102“/” in Unix like systems
- Arefers to the current directory
- Brefers to the containing directory
- Crefers to your home directory
- Drefers to the root directory
103Unix command pwd_____
- AThis command removes a file
- BThis command creates a directory
- CThis command displays manual pages for various commands
- DThis command displays the path of the current directory
104A linked-list is a dynamic structure
- AВерно
- BНеверно
105What are two operators for ascending members of a structure and when are they used?
- Anone
- Band->
- Cand this
- Dand-->
106What is the malloc & calloc?
- Aallocate the dynamic memory
- Ballocate the dynamic memory and save zero there
- Ccreate new variable
- Dfree dynamic memory
107
A local variable is stored in __- Aheap segment
- Bstack segment
- Ccode segment
- Dnone
108Which scanf(statement will you use to scan a float variable (a) and double variable (b)?
- Ascanf(“%f%lf”, &a, &b);
- Bscanf(“%lf%lf”, &a, &b);
- Cscanf(“%f%f”, &a, &b);
- Dscanf(“%Lf%Lf”, &a, &b);
109A single line comment in C language source code can begin with __
- A:
- B/*
- C;
- D//
110Only top element can be accessed in stack
- Aверно
- Bневерно
111Each Node contain minimum two fields one field called data field to store data. Another field _
- Apointer to Node
- Bpointer to character
- Cpointer to an integer
- Dpointer to class
112A 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?- A46, 42, 34, 52, 23, 33
- B34, 42, 23, 52, 33, 46
- C42, 23, 34, 52, 46, 33
- D46, 34, 42, 23, 52, 33
113How do you specify double constant 3.14 as a long double?
- A%Lf
- B%ld
- C%f
- D%lf
114What built in library function to adjust the allocated dynamic memory size
- Acalloc
- Bmalloc
- Crecalloc
- Drealloc
115Queue works by the principle
- ALast in First out
- Bnone
- CFirst in First out FIFO
- DFirst in Last out
116How to convert some data to the lower case in C programming language?
- Atoupper(); #include <ctype.h>
- Btolower();, #include <stdlib.h>
- Ctoupper(); #include <stdlib.h>
- Dtolower();, #include <ctype.h>
117How to create the boolean type in C without usage of #include <stdbool.h>
- A_Bool
- Bboolean
- C_Boolean
- Dbool
118“r+” in fopen function tries to open the file for …
- Aread & write
- Bappend new content to the file
- Conly reading this file
- Dreading and append new content to the file
119Linked list works by the FIFO method
- Aверно
- Bневерно
120What is best time complexity of search operation in the LL?
- AO(logn)
- Bnone
- CO(1)
- DO(n)
121What is the general formula for double hashing in the hast table?
- Ah( k, i) = ( h1(k) + i * h2(k)) mod m
- Bnone
- Ch(x) = x mod m
- Dh (k, i) = ( h’(k) + i^2) mod m
122What function can be used to free the memory allocated by calloc()?
- Adelete();
- Bstrcat();
- Cfree();
- Dmemfree();
123Identify the incorrect file opening mode from the following
- Ar
- Bx
- Cw
- Da
124In the stack process of inserting an element in the stack is called as _____
- Apush
- Binsert
- Cpop
- Dcreate
125What is the output of the following program?
#include <stdio.h>
int main(){
int a[] = {2,1};
printf("%d", *a);
}- A2
- B0
- C1
- DCompile error
126The merge sort algorithm is based on:
- ADivide-and-Conquer paradigm
- BGreedy paradigm
- CDynamic Programming paradigm
- DNone of these
127Recursion uses more memory space than iteration because
- ANone of them
- Bit uses stack instead of queue & every recursive call has to be stored
- Cevery recursive call has to be stored
- Dit uses stack instead of queue
128Shell sort uses
- Aquick sort
- Binsertion sort
- Cselection sort
- Dmerge sort
129What is the result of the program below?
#include <stdio.h>
int main(){
int a=9, b=&a, *pointer=b+0;
printf("%u", *pointer);
}- AAddress of pointer
- BCompile error
- CSegmentation fault
- D9
- E0
130What is the maximum number of nodes that a perfectly balanced tree with a height of 7 can contain?
- A(2**8)-1 = 255 (Maximum)
(2**7) = 128 (Minimum) - B(2**7)-1 = 127 (Maximum)
(2**5) = 32 (Minimum) - C(2**7)-1 = 127 (Maximum)
(2**6) = 64 (Minimum) - D(2**6)-1 = 63 (Maximum)
(2**5) = 32 (Minimum)
- A(2**8)-1 = 255 (Maximum)
131Find the MST from the graph below:
- A(FB), (HC), (BC), (IH), (AB), (EC), (ED), (EG)
- B(FB), (HC), (BC), (IH), (AB), (EA), (ED), (EG)
- C(FB), (HC), (BC), (IH), (AB), (EA), (ED), (HE)
- D(FB), (HC), (BC), (IH), (AB), (EC), (FD), (EG)
132The minimum cost of path from A node to I node by the following graph:
- A19
- B10
- C16
- D26
133Add element “K” in the following max heap: g,c,f,b,a,d
- ANone of them
- Bc,g,b,a,d,f,k
- Ck,c,g,b,a,d,f
- Dc,g,b,a,k,d,f
134 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.
- A(2+3)*(4-1) = 15
- B(3+2)*(4-1) = 15
- C(3+2)*(4-1) = 16
- D(3+2)*(1-4) = 15
135 Find the cost of MST in the graph below:
- A47
- B36
- C46
- D50
136 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?
- A(A, D), (A, B), (A, C), (C, F), (G, E), (F, G)
- B(A, B), (A, D), (D, F), (F, G), (G, E), (F, C)
- C(E, G), (C, F), (F, G), (A, D), (A, B), (A, C)
- D(A, D), (A, B), (D, F), (F, C), (F, G), (G, E)
137 Find the minimum path from a to i Dijkstra algorithm. Choose the sequence of visited Nodes.
- Aa->c->d->b->e->g->
- Ba->c->g->b->e->d->
- Ca->c->d->b->g->e->
- Da->d->g->b->e->
138 What is the run-time complexity of the Floyd-Warshall algorithm?(best case performance)
- AO(V*E)
- BO(V+E)
- CO(V^3)
- DO(V^2)
139The Dijkstra and the Bellman-Ford algorithms both determine
- Athe shortest path between all nodes in a graph
- Bthe shortest path between two nodes in a graph
- Cwhether a graph is directed or undirected
- Dthe edge with the greatest weight in a graph
- Ewhether or not a graph is a tree
140 Choose the algorithm with not-greedy approach
- APrim Algorithm
- BFloyd Algorithm
- CDijkstra Algorithm
- DKruskal Algorithm
141Having parenthesis in an expression tree serves to balance it better.
- AVerdadeiro
- BFalso
142What are two operators for accessing members of a structure and when are they used?
- A. and->
- B. and this
- CNone
- D. and--->
143\ What is the difference between a and a+ modes?
- Aa - open for appending, a+ - open for reading and appending
- Ba - open for reading and appending, a+ - open for appending
- Ca -open for appending, a+ - open for reading and writing
- Da - open for appending, a+ - open for writing and appending
144The nodes of a ______linked list can be traversed_____.
- ASingly, forward and backward
- BDoubly, forward only
- CDoubly, backward only
- DSingly, forward only
145 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?
- A34,52,42,23,33,46
- B33,46,42,34,52,23
- C46,34,42,23,52,33
- D42,46,33,23,34,52
146What is the formula to calculate the load factor of hash table? (n number of elements, m size of table)
- Aɻ= n/m
- Bɻ =n*m
- Cɻ =n/sqrt(m)
- Dɻ =n/m^2
147Which of the following is a balanced tree for the numbers 1-9? There may be more than one answer.
- A
- B
- C
- D
- A
148What are algorithms appropriate to find the minimum spanning tree?What are algorithms appropriate to find the minimum spanning tree?
Выберите один или несколько ответов:- APrim algorithm
- BFloyd algorithm
- CBellman-Ford algorithm
- DKruskal's algorithm
149The approach helps to balance tree
(One or multiple)- AAVL
- BBST
- CRed Black Tree
- Dnone
150String in C
(One or multiple)- Achar* name;
- Bchar name[4] = “Hello”;
- Cnone
- Dchar name[10];
151String in C programming language…
(One or multiple)- Achar name[6] = “Ernur”;
- Bchar name[5] = “Ernur”;
- Cchar* name = “Ernur”;
- Dchar name;
152Identify the C compiler in UNIX like operating systems. (One or multiple)
- Avc++
- Bcc
- CBorland
- Dgcc
Informações
- Descrição
- SDP4 Quiz sobre sdp4, criado por Csse 1502 em 21-05-2017.
- Autor
- Csse 1502
- Idioma
- English
- Visualizações
- 993
- Etiquetas
- Avaliação
- 5,0 de 5 · 1 avaliação Avalie este quiz