Kopieren und bearbeiten

sdp4

Beschreibung

SDP4 Quiz am sdp4, erstellt von Csse 1502 am 21/05/2017.
Csse 1502
Quiz von Csse 1502, aktualisiert more than 1 year ago
Csse 1502
Erstellt von Csse 1502 vor etwa 7 Jahre
978
1
0

Zusammenfassung der Ressource

Frage 1

Frage
Re-balancing of AVL tree costs
Antworten
  • O(logn)
  • O(nlogn)
  • O(1)
  • O(n)

Frage 2

Frage
In what tree, for every node the height of its left subtree and right subtree differs at least by one
Antworten
  • Threaded binary tree
  • BST
  • AVL tree
  • Complete tree

Frage 3

Frage
Which of the following is true about the total number of nodes in a binary tree with depth two?
Antworten
  • It is at most four
  • It is at most seven
  • There is no bound on the number of nodes
  • It is at most two

Frage 4

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

Frage 5

Frage
The result of postfix expression: 4 2 + 3 5 1 - * +
Antworten
  • 18
  • 10
  • 15
  • 8

Frage 6

Frage
The infix expression A+((B-C)*D) is correctly represented in prefix notation as
Antworten
  • A+BC-D*
  • ABC-D*+
  • +A*-BCD
  • A+B-C*D

Frage 7

Frage
The result of postfix expression: 5 7 + 6 2 - *
Antworten
  • 40
  • 38
  • 46
  • 48

Frage 8

Frage
The prefix expression reverse to postfix: * + A B + C D
Antworten
  • A B + C D + * *
  • A B + C D + *
  • None of them
  • A B + C D * +

Frage 9

Frage
What the result of the following expression: 2 3 8 * + 4 48 4 2 + / 6 * + -
Antworten
  • -26
  • 12
  • -20
  • -10

Frage 10

Frage
By definition, a(n)______ graph contains edges that can be traversed in either direction.
Antworten
  • undirected
  • directed
  • disconnected
  • connected

Frage 11

Frage
What is the weight of a minimum spanning tree of the following graph?
Image:
Image (image/png)
Antworten
  • 31
  • 35
  • 41
  • 38
  • 29

Frage 12

Frage
Which of the following algorithms use a dynamic programming approach (not greedy)? Выберите один или несколько ответов:
Antworten
  • Floyd Algorithm
  • Bellman-Ford Algorithm
  • Dijkstra Algorithm
  • Prim Algorithm

Frage 13

Frage
The MST of the graph below:
Image:
Image (image/png)
Antworten
  • 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

Frage 14

Frage
What is the Run-time of the Dijkstra’s original algorithm? (without min priority queue)
Antworten
  • O(E+V)
  • O(E+VlogV)
  • O(E^2)
  • O(V^2)

Frage 15

Frage
Choose the algorithm with not greedy approach ….
Antworten
  • Prim Algorithm
  • Dijkstra Algorithm
  • Floyd Algorithm
  • Kruskal Algorithm

Frage 16

Frage
The Floyd-Warshall algorithm for all-pair shortest paths computation is based on:
Antworten
  • Greedy paradigm
  • Dynamic Programming paradigm
  • None
  • Divide-and-Conquer paradigm

Frage 17

Frage
The sequence of visited nodes by Dijkstra algorithm:
Image:
Image (image/png)
Antworten
  • S, B, A, С, t
  • None of them
  • S, A, B, C, t
  • S, B, A, t

Frage 18

Frage
The following heap : 18 15 9 14 11 2 7 6 12 3, add there 17 and choose right sequence:
Antworten
  • 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

Frage 19

Frage
In the deletion operation of max heap, the root is replaced by:
Antworten
  • 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

Frage 20

Frage
Delete max element from the heap and choose the answer: 18 17 9 14 15 2 7 6 12 3 11
Antworten
  • 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

Frage 21

Frage
In a min heap
Antworten
  • 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

Frage 22

Frage
The result of this postfix expression: 10 5 + 60 6 / * 8 – is
Antworten
  • 82
  • 284
  • 273
  • 142

Frage 23

Frage
Please find the postfix expression from prefix: - * - + a b c / e f - g / h i
Antworten
  • 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 / - -

Frage 24

Frage
If this tree is used for sorting, then new no 8 should be placed as the
Image:
Image (image/png)
Antworten
  • 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

Frage 25

Frage
Number of possible binary trees with 3 nodes is (Kahoot 100%)
Antworten
  • 9
  • 3
  • 14
  • 5

Frage 26

Frage
The result of this postfix expression: 4 5 7 2 + - *
Antworten
  • -10
  • -11
  • -16
  • -5

Frage 27

Frage
Which of the following statements about binary trees is true?
Antworten
  • 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.

Frage 28

Frage
A binary tree T has 20 leaves. The number of nodes in T having two children is
Antworten
  • Any number between 10 and 20
  • 18
  • 19
  • 17

Frage 29

Frage
Choose the Bipartite graph from the following graphs...
Antworten

Frage 30

Frage
Each of the following indicates a reasonable way to implement graphs except
Antworten
  • a BST
  • a Boolean matrix
  • an adjacency list
  • an edge list

Frage 31

Frage
Postfix expression is just a reverse of prefix expression.
Antworten
  • Верно
  • Неверно

Frage 32

Frage
Choose the regular expression which -- "Search all string which start with "a"
Antworten
  • a*
  • a+
  • a$
  • ^a

Frage 33

Frage
Which of the following algorithms use a greedy approach?
Antworten
  • Prim, Kruskal, Floyd
  • Prim, Kruskal, Dijkstra
  • Prim, Bellman-Ford, Floyd
  • Prim, Kruskal, Bellman-Ford

Frage 34

Frage
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?
Image:
Image (image/png)
Antworten
  • B
  • C
  • D
  • A

Frage 35

Frage
Heap with n elements with the smallest element at the root, 7 smallest element can be found
Antworten
  • O(1)
  • O(n)
  • O(nlogn)
  • O(logn)

Frage 36

Frage
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
Image:
Image (image/png)
Antworten
  • C
  • B
  • D
  • A

Frage 37

Frage
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
Antworten
  • a-q, b-p, c-p
  • a-p, b-p, c-p
  • a-r, b-q, c-p
  • a-p, b-r, c-q

Frage 38

Frage
Time complexity of Depth First Traversal of is
Antworten
  • Θ(|V|*|E|)
  • Θ(|V|)
  • Θ(|V|+|E|)
  • Θ(|E|)

Frage 39

Frage
The time complexity of heap sort in worst case is
Antworten
  • O(nlogn)
  • O(n)
  • O(n2)
  • O(logn)

Frage 40

Frage
Which of the following algorithms has lowest worst case time complexity?
Antworten
  • Quick sort
  • Selection sort
  • Insertion sort
  • Heap sort

Frage 41

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

Frage 42

Frage
Heap is an example of
Antworten
  • BST
  • Complete BST
  • Spanning tree
  • General tree

Frage 43

Frage
What is the run-time complexity of the Floyd-Warshall algorithm? (worst case performance)
Antworten
  • O(V^2)
  • O(V*E)
  • O(V+E)
  • O(V^3)

Frage 44

Frage
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
Antworten
  • O(n/d)
  • O(n*d)
  • O(d)
  • O(n)

Frage 45

Frage
Which of the following statements is true of both depth-first and breadth-first searches?
Antworten
  • 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.

Frage 46

Frage
BST run-time complexity of search function in worst case is
Antworten
  • O(n)
  • O(logn)
  • O(n^2)
  • O(nlogn)

Frage 47

Frage
In a binary min heap containing n numbers, the smallest element can be found in time
Antworten
  • O(1)
  • O(logn)
  • O(n)
  • none of this

Frage 48

Frage
A full binary tree n leaves contains
Antworten
  • n nodes,
  • 2n-1 nodes
  • n nodes
  • 2n nodes

Frage 49

Frage
Which one of the following array represents a binary max-heap?
Antworten
  • 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

Frage 50

Frage
In a binary max heap containing n numbers,the smallest element can be found in time
Antworten
  • O(n)
  • O(logn)
  • O(1)
  • O(nlogn)

Frage 51

Frage
The maximum number of nodes on level i of a binary tree is
Antworten
  • 2i-1
  • i+1
  • 3i-1
  • 2i+2

Frage 52

Frage
Which algorithms – can find vertices x & y if there are presented a path between them?
Antworten
  • DFS
  • BFS
  • Both BFS and DFS
  • None of them

Frage 53

Frage
Choose the trasitive closure for the graph below
Image:
Image (image/png)
Antworten
  • 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

Frage 54

Frage
What is the run-time complexity of the Kruskal's algorithm? (average performance)
Antworten
  • O(ElogV)
  • O(V^3)
  • O(VlogE)
  • O(V^2)

Frage 55

Frage
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?
Image:
Image (image/png)
Antworten
  • P, S, R, U
  • P, Q, S, U
  • P, Q, R, U
  • P, Q, R, S, U

Frage 56

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

Frage 57

Frage
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; }
Antworten
  • The code prints all ASCII values and its characters
  • Error: x undeclared identifier
  • The code generates an infinite loop
  • Error: while statement missing

Frage 58

Frage
What is the output of the following program? #include <stdio.h> int main(){ char *nstring=”Hello”; while(*nstring) printf(“%c”, *nstring++); }
Antworten
  • ello
  • Runtime error
  • Compile error
  • Hello

Frage 59

Frage
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; }
Antworten
  • 30
  • 500
  • 200
  • 100

Frage 60

Frage
What statement can print \n on the screen? #include <stdio.h> int main(){ printf("\\n"); return 0; }
Antworten
  • None
  • printf(“n\”);
  • printf(“\\n”);
  • printf(“n”);
  • printf(“\n”);

Frage 61

Frage
How many times the program will print “Hello”? #include<stdio.h> int main(){ printf("Hello"); main(); return 0; }
Antworten
  • 0
  • Compilation error
  • Unlimited times
  • Till stack run over

Frage 62

Frage
What is the built library function to compare two strings?
Antworten
  • IsEqual();
  • Strcmp();
  • Strcompare();
  • Strstr();

Frage 63

Frage
According to ANSI specification, how to declare main() function with command-line arguments?
Antworten
  • int char main(int argc, *argv)
  • None
  • int main(){ int char (*argv argc); }
  • int main(int argc, char *argv[])

Frage 64

Frage
Queue worst time complexity to delete some value…
Antworten
  • O(1)
  • O(n^2)
  • O(log n)
  • O(n)

Frage 65

Frage
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?
Image:
Image (image/png)
Antworten
  • A
  • B
  • D
  • C

Frage 66

Frage
What is the worst time complexity of the hash table in Big O notation?
Antworten
  • O(n logn)
  • O(n)
  • O(1)
  • O(log n)

Frage 67

Frage
Stack works by the principle
Antworten
  • LILO
  • FIFO
  • LIFO
  • FILO

Frage 68

Frage
Linked list is generally considered as an example of ____ type of memory allocation.
Antworten
  • Compile time
  • Static
  • Dynamic
  • Local

Frage 69

Frage
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.
Image:
Image (image/png)
Antworten
  • 42,46,33,23,34,52
  • 46,42,34,52,23,33
  • 34,42,23,52,33,46
  • 46,34,42,23,52,33

Frage 70

Frage
An algorithm is
Antworten
  • 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

Frage 71

Frage
What is the best time complexity of the binary search?
Antworten
  • O(n)
  • O(1)
  • O(log n)
  • O(n logn)

Frage 72

Frage
What is the sorting algorithms is presented on the example below?
Image:
Image (image/png)
Antworten
  • Insertion sort
  • Radix sort
  • Quick sort
  • Bucket sort

Frage 73

Frage
Which sorting algorithms is most efficient to sort string consisting of ASCII characters?
Antworten
  • Quick sort
  • None
  • Counting sort
  • Merge sort

Frage 74

Frage
A pivot element to partition unsorted list is used in
Antworten
  • Quick sort
  • Insertion sort
  • Merge sort
  • Selection sort

Frage 75

Frage
What is the gcc?
Antworten
  • The command to create new file
  • The command to show all errors during compiling
  • The command doesn’t exist
  • The compiler

Frage 76

Frage
What is rmdir command in Unix OS?
Antworten
  • This command creates a directory
  • This command copies a file
  • This command removes a file
  • This command removes(deletes) a directory

Frage 77

Frage
What is touch command in Unix OS?
Antworten
  • 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

Frage 78

Frage
“.” In Unix like systems
Antworten
  • Refers to the containing directory
  • Refers to your home directory
  • Refers to the root directory
  • Refers to the current directory

Frage 79

Frage
The default executable generation on Unix for a C program is
Antworten
  • a.exe
  • default.out
  • a.out
  • out.a

Frage 80

Frage
In the given below statement,what does the “arr” indicate? char *arr[30];
Antworten
  • 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

Frage 81

Frage
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; }
Antworten
  • clean k;
  • delete k;
  • free(k);
  • memfree(k);

Frage 82

Frage
Which library functions help users to dynamically allocate memory?
Antworten
  • malloc(), memalloc()
  • macalloc(), calloc()
  • realloc(), calloc()
  • malloc(), calloc()

Frage 83

Frage
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; }
Antworten
  • #include <ctype.h>
  • #include <math.h>
  • #include <string.h>
  • #include <stdlib.h>

Frage 84

Frage
Accessing top element in stack is constant time operation
Antworten
  • Верно
  • Неверно

Frage 85

Frage
Process of Removing element from the stack is called as…(C++)
Antworten
  • push
  • pop
  • delete
  • clean

Frage 86

Frage
A linked list in which the last node of Linked list points to the first is called a______
Antworten
  • doubly LL
  • singly LL
  • hybrid LL
  • circular LL

Frage 87

Frage
A doubly linked list performs traversal in____
Antworten
  • none
  • either direction
  • circular direction
  • any direction

Frage 88

Frage
LL is used to implement the Stack then which of the following node is - Top of the Stack?
Antworten
  • middle node
  • first node
  • any node
  • last node

Frage 89

Frage
What is the worst time complexity of the binary search algorithm?
Antworten
  • O(1)
  • O(logn)
  • none
  • O(n)

Frage 90

Frage
What is the worst time complexity of the bubble sort?
Antworten
  • O(n^2)
  • O(n)
  • O(nlogn)
  • O(n^3)

Frage 91

Frage
Which of the following sorting algorithms has the lowest worst-case complexity?
Antworten
  • Bubble Sort
  • Selection Sort
  • Quick Sort
  • Merge Sort

Frage 92

Frage
What is make command in Unix OS?
Antworten
  • 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

Frage 93

Frage
What is ls command in UNIX OS?
Antworten
  • 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

Frage 94

Frage
Unix command mv ___
Antworten
  • This command renames an entity
  • This command removes(deletes) a directory
  • This command removes a file
  • This command copies a file

Frage 95

Frage
The keyboard used to transfer control from a function back to the calling function is
Antworten
  • switch
  • return
  • go back
  • go to

Frage 96

Frage
What is the result of the program? #include<stdio.h> int main() { int const a = 5; a++; printf("%d", a); }
Antworten
  • Stack is run over
  • None
  • 5
  • Compilation error

Frage 97

Frage
What value strcmp() function returns when two strings are the same?
Antworten
  • true
  • 0
  • -1
  • 1

Frage 98

Frage
Stack time complexity to insert some value …
Antworten
  • O(1)
  • O(n)
  • O(logn)
  • O(n/logn)

Frage 99

Frage
Which if the following is not a type of Linked list?
Antworten
  • hybrid LL
  • singly LL
  • doubly LL
  • circular LL

Frage 100

Frage
Queue can be implemented using a list
Antworten
  • Верно
  • Неверно

Frage 101

Frage
Which of the following container has search efficiency of O(1) (Best case)
Antworten
  • Doubly Linked List
  • Hash table
  • Heap
  • Linked List

Frage 102

Frage
“/” in Unix like systems
Antworten
  • refers to the current directory
  • refers to the containing directory
  • refers to your home directory
  • refers to the root directory

Frage 103

Frage
Unix command pwd_____
Antworten
  • 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

Frage 104

Frage
A linked-list is a dynamic structure
Antworten
  • Верно
  • Неверно

Frage 105

Frage
What are two operators for ascending members of a structure and when are they used?
Antworten
  • none
  • and->
  • and this
  • and-->

Frage 106

Frage
What is the malloc & calloc?
Antworten
  • allocate the dynamic memory
  • allocate the dynamic memory and save zero there
  • create new variable
  • free dynamic memory

Frage 107

Frage
A local variable is stored in __
Antworten
  • heap segment
  • stack segment
  • code segment
  • none

Frage 108

Frage
Which scanf(statement will you use to scan a float variable (a) and double variable (b)?
Antworten
  • scanf(“%f%lf”, &a, &b);
  • scanf(“%lf%lf”, &a, &b);
  • scanf(“%f%f”, &a, &b);
  • scanf(“%Lf%Lf”, &a, &b);

Frage 109

Frage
A single line comment in C language source code can begin with __
Antworten
  • :
  • /*
  • ;
  • //

Frage 110

Frage
Only top element can be accessed in stack
Antworten
  • верно
  • неверно

Frage 111

Frage
Each Node contain minimum two fields one field called data field to store data. Another field _
Antworten
  • pointer to Node
  • pointer to character
  • pointer to an integer
  • pointer to class

Frage 112

Frage
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?
Antworten
  • 46, 42, 34, 52, 23, 33
  • 34, 42, 23, 52, 33, 46
  • 42, 23, 34, 52, 46, 33
  • 46, 34, 42, 23, 52, 33

Frage 113

Frage
How do you specify double constant 3.14 as a long double?
Antworten
  • %Lf
  • %ld
  • %f
  • %lf

Frage 114

Frage
What built in library function to adjust the allocated dynamic memory size
Antworten
  • calloc
  • malloc
  • recalloc
  • realloc

Frage 115

Frage
Queue works by the principle
Antworten
  • Last in First out
  • none
  • First in First out FIFO
  • First in Last out

Frage 116

Frage
How to convert some data to the lower case in C programming language?
Antworten
  • toupper(); #include <ctype.h>
  • tolower();, #include <stdlib.h>
  • toupper(); #include <stdlib.h>
  • tolower();, #include <ctype.h>

Frage 117

Frage
How to create the boolean type in C without usage of #include <stdbool.h>
Antworten
  • _Bool
  • boolean
  • _Boolean
  • bool

Frage 118

Frage
“r+” in fopen function tries to open the file for …
Antworten
  • read & write
  • append new content to the file
  • only reading this file
  • reading and append new content to the file

Frage 119

Frage
Linked list works by the FIFO method
Antworten
  • верно
  • неверно

Frage 120

Frage
What is best time complexity of search operation in the LL?
Antworten
  • O(logn)
  • none
  • O(1)
  • O(n)

Frage 121

Frage
What is the general formula for double hashing in the hast table?
Antworten
  • 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

Frage 122

Frage
What function can be used to free the memory allocated by calloc()?
Antworten
  • delete();
  • strcat();
  • free();
  • memfree();

Frage 123

Frage
Identify the incorrect file opening mode from the following
Antworten
  • r
  • x
  • w
  • a

Frage 124

Frage
In the stack process of inserting an element in the stack is called as _____
Antworten
  • push
  • insert
  • pop
  • create

Frage 125

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

Frage 126

Frage
The merge sort algorithm is based on:
Antworten
  • Divide-and-Conquer paradigm
  • Greedy paradigm
  • Dynamic Programming paradigm
  • None of these

Frage 127

Frage
Recursion uses more memory space than iteration because
Antworten
  • 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

Frage 128

Frage
Shell sort uses
Antworten
  • quick sort
  • insertion sort
  • selection sort
  • merge sort

Frage 129

Frage
What is the result of the program below? #include <stdio.h> int main(){ int a=9, b=&a, *pointer=b+0; printf("%u", *pointer); }
Antworten
  • Address of pointer
  • Compile error
  • Segmentation fault
  • 9
  • 0

Frage 130

Frage
What is the maximum number of nodes that a perfectly balanced tree with a height of 7 can contain?
Antworten
  • (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)

Frage 131

Frage
Find the MST from the graph below:
Image:
Image (image/png)
Antworten
  • (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)

Frage 132

Frage
The minimum cost of path from A node to I node by the following graph:
Image:
Image (image/png)
Antworten
  • 19
  • 10
  • 16
  • 26

Frage 133

Frage
Add element “K” in the following max heap: g,c,f,b,a,d
Antworten
  • None of them
  • c,g,b,a,d,f,k
  • k,c,g,b,a,d,f
  • c,g,b,a,k,d,f

Frage 134

Frage
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.
Image:
Image (image/png)
Antworten
  • (2+3)*(4-1) = 15
  • (3+2)*(4-1) = 15
  • (3+2)*(4-1) = 16
  • (3+2)*(1-4) = 15

Frage 135

Frage
Find the cost of MST in the graph below:
Image:
Image (image/png)
Antworten
  • 47
  • 36
  • 46
  • 50

Frage 136

Frage
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?
Image:
Image (image/png)
Antworten
  • (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)

Frage 137

Frage
Find the minimum path from a to i Dijkstra algorithm. Choose the sequence of visited Nodes.
Image:
Image (image/png)
Antworten
  • a->c->d->b->e->g->
  • a->c->g->b->e->d->
  • a->c->d->b->g->e->
  • a->d->g->b->e->

Frage 138

Frage
What is the run-time complexity of the Floyd-Warshall algorithm?(best case performance)
Antworten
  • O(V*E)
  • O(V+E)
  • O(V^3)
  • O(V^2)

Frage 139

Frage
The Dijkstra and the Bellman-Ford algorithms both determine
Antworten
  • 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

Frage 140

Frage
Choose the algorithm with not-greedy approach
Antworten
  • Prim Algorithm
  • Floyd Algorithm
  • Dijkstra Algorithm
  • Kruskal Algorithm

Frage 141

Frage
Having parenthesis in an expression tree serves to balance it better.
Antworten
  • True
  • False

Frage 142

Frage
What are two operators for accessing members of a structure and when are they used?
Antworten
  • . and->
  • . and this
  • None
  • . and--->

Frage 143

Frage
\ What is the difference between a and a+ modes?
Antworten
  • 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

Frage 144

Frage
The nodes of a ______linked list can be traversed_____.
Antworten
  • Singly, forward and backward
  • Doubly, forward only
  • Doubly, backward only
  • Singly, forward only

Frage 145

Frage
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?
Image:
Image (image/png)
Antworten
  • 34,52,42,23,33,46
  • 33,46,42,34,52,23
  • 46,34,42,23,52,33
  • 42,46,33,23,34,52

Frage 146

Frage
What is the formula to calculate the load factor of hash table? (n number of elements, m size of table)
Antworten
  • ɻ= n/m
  • ɻ =n*m
  • ɻ =n/sqrt(m)
  • ɻ =n/m^2

Frage 147

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

Frage 148

Frage
What are algorithms appropriate to find the minimum spanning tree?What are algorithms appropriate to find the minimum spanning tree? Выберите один или несколько ответов:
Antworten
  • Prim algorithm
  • Floyd algorithm
  • Bellman-Ford algorithm
  • Kruskal's algorithm

Frage 149

Frage
The approach helps to balance tree (One or multiple)
Antworten
  • AVL
  • BST
  • Red Black Tree
  • none

Frage 150

Frage
String in C (One or multiple)
Antworten
  • char* name;
  • char name[4] = “Hello”;
  • none
  • char name[10];

Frage 151

Frage
String in C programming language… (One or multiple)
Antworten
  • char name[6] = “Ernur”;
  • char name[5] = “Ernur”;
  • char* name = “Ernur”;
  • char name;

Frage 152

Frage
Identify the C compiler in UNIX like operating systems. (One or multiple)
Antworten
  • vc++
  • cc
  • Borland
  • gcc
Zusammenfassung anzeigen Zusammenfassung ausblenden

Möchten Sie mit GoConqr kostenlos Ihre eigenen Quiz erstellen? eigenen Mehr erfahren.

ähnlicher Inhalt

Geschichte Deutschlands
max.grassl
Zeiten Englisch
Janine Egli
Faust I
barbara91
The American Dream
barbara91
Collocation - Business English - EBC - WU
Geht euch nichts an
Ausgewählte Dramentheorien im Überblick
Carolyn Li
HIST
Esther Buchas
WIRK - 2.0
stelly Welly
MS-1.3 Foliensatz 6-7
Markus Voßmann
STADA Jörg Matthes 2021
Julia W.
Vetie Geflügel 2019
Mascha K.
Bibliothek durchsuchen