0% found this document useful (0 votes)
4 views30 pages

PH.D - Computer Science & Engineering - 2020

The document outlines a PhD Computer Science and Engineering exam held on September 20, 2020, featuring a series of objective questions related to data structures, memory management, and algorithms. Each question includes multiple-choice answers with associated marks. The exam covers various topics such as stacks, queues, CPU interrupts, memory management, and algorithm complexity.
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
4 views30 pages

PH.D - Computer Science & Engineering - 2020

The document outlines a PhD Computer Science and Engineering exam held on September 20, 2020, featuring a series of objective questions related to data structures, memory management, and algorithms. Each question includes multiple-choice answers with associated marks. The exam covers various topics such as stacks, queues, CPU interrupts, memory management, and algorithm complexity.
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

Module Name : PhD Computer Science and Engineering or Computer Science-E

Exam Date : 20-Sep-2020 Batch : 16:00-18:00

Sr. Client Question Negative


Question Body and Alternatives Marks
No. ID Marks
Objective Question
1 1 How many stacks are required for reversing a word algorithm? 4.0 1.00

A1
one
:

A2
two
:

A3
three
:

A4
four
:

Objective Question
2 2 Which of the following properties is associated with a queue? 4.0 1.00

A1
First In Last Out
:

A2
First In First Out
:

A3
Last In First Out
:

A4
Last In Last Out
:

Objective Question
3 3 The essential condition which is checked before deletion in a linked queue is? 4.0 1.00

A1
Underflow
:

A2
Overflow
:

A3
Front value
:

A4
Rear value
:

Objective Question
4 4 Which one of the following is not an application of Stack Data Structure? 4.0 1.00

A1
Managing function calls
:
A2
The stock span problem
:

A3
Arithmetic expression evaluation
:

A4
Managing virtual memory
:

Objective Question
5 5 Which of the following is the most widely used external memory data structure? 4.0 1.00

A1
AVL tree
:

A2
B-tree
:

A3
Red-black tree
:

A4
Both AVL tree and Red-black tree
:

Objective Question
6 6 4.0 1.00

A1
AFDBCE
:

A2
CBAFED
:

A3
ABDCEF
:

A4
EFDCBA
:

Objective Question
7 7 The prefix form of A-B/ (C * D ^ E) is? 4.0 1.00

A1
-/*^ACBDE
:

A2
-ABCD*^DE
:

A3
-A/B*C^DE
:
A4
-A/BC*^DE
:

Objective Question
8 8 4.0 1.00

A1
Insert at the front end of the dequeue
:

A2
Insert at the rear end of the dequeue
:

A3
Fetch the element at the rear end of the dequeue
:

A4
Fetch the element at the front end of the dequeue
:

Objective Question
9 9 Which of the following does not interrupt a running process? 4.0 1.00

A1
A device
:

A2
Timer
:

A3
Scheduler process
:

A4
Power failure
:

Objective Question
10 10 A CPU handles interrupt by executing interrupt service subroutine _________ 4.0 1.00

A1
by checking interrupt register after execution of each instruction.
:

A2
by checking interrupt register at the end of the fetch cycle.
:
A3 whenever an interrupt is registered.
:

A4
by checking interrupt register at regular time interval.
:

Objective Question
11 11 Which of the following is not the internal memory of the system (computer)? 4.0 1.00

A1
CPU register
:

A2
Cache
:

A3
Main memory
:

A4
Magnetic disc
:

Objective Question
12 12 A CPU has two modes: Privileged and non-privileged. In order to change the mode from privileged to non-privileged 4.0 1.00

A1
A hardware interrupt is needed.
:

A2
A software interrupt is needed.
:

A3
A privileged instruction (which does not generate an interrupt) is needed.
:

A4
A non-privileged instruction (Which does not generate an interrupt) is needed.
:

Objective Question
13 13 A main memory unit with a capacity of 4 megabytes is built using 1M × 1-bit DRAM chips. Each DRAM chip has 1K rows 4.0 1.00
of cells with 1K cells in each row. The time taken for a single refresh operation is 100 nanoseconds. The time required to
perform one refresh operation on all the cells in the memory unit is

A1
100 nanoseconds
:

A2 10
: 100 x 2 nanoseconds

A3 20
: 100 x 2 nanoseconds

A4 30
: 100 x 2 nanoseconds

Objective Question
14 14 4.0 1.00
A1 AR = 1111 0010, BR = 0000 0000
: CR = 1010 1000, DR = 1110 1010

A2 AR = 1111 0010, BR = 0000 0000


: CR = 0000 1000, DR = 1110 1010

A3 AR = 1111 0010, BR = 1111 0000


: CR = 1111 1011, DR = 1110 1010

A4 AR = 1111 0010, BR = 0000 1101


: CR = 1010 1000, DR = 1110 1010

Objective Question
15 15 The initial value of the register R = 1101 1101. What will be the sequence of binary values in R after a logical shift-left, 4.0 1.00
followed by a circular shift-right, followed by a logical shift-right and a circular shift-left?

A1
0101 1100
:

A2
0001 1100
:

A3
0101 1110
:

A4
0101 1001
:

Objective Question
16 16 Consider a 4-way set associative cache (initially empty) with total 16 cache blocks. The main memory consists of 256 blocks 4.0 1.00
and the request for memory blocks is in the following order: 0, 255, 1, 4, 3, 8, 133, 159, 216, 129, 63, 8, 48, 32, 73, 92, 155.
Which one of the following memory block will NOT be in cache if LRU replacement policy is used?

A1
108
:

A2
216
:

A3
532
:

A4
1064
:

Objective Question
17 17 In a two pass assembler the object code generation is done during __________ 4.0 1.00

A1
Zeroth Pass
:

A2
First Pass
:
A3
Second Pass
:

A4
After the two passes
:

Objective Question
18 18 Which of the following does not interrupt a running process? 4.0 1.00

A1
A device
:

A2
Timer
:

A3
Scheduler Process
:

A4
Power failure
:

Objective Question
19 19 4.0 1.00

A1
P1, P2, P3
:

A2
P1, P3, P2
:

A3
P3, P2, P1
:

A4
P3, P1, P2
:

Objective Question
20 20 A process executes the code 4.0 1.00

fork( );
fork( );
fork ( );

The total number of child processes created is

A1
3
:

A2
4
:
A3
7
:

A4
8
:

Objective Question
21 21 Consider the virtual page reference string 1, 2, 3, 2, 4, 1, 3, 2, 4, 1. On a demand paged virtual memory system running on a 4.0 1.00
computer system that main memory size of 3 pages frames which are initially empty. The number of page faults under LRU
page replacements policy is

A1
6
:

A2
7
:

A3
8
:

A4
9
:

Objective Question
22 22 Let the page fault service time be 10ms in a computer with average memory access time being 20ns. If one page fault is 4.0 1.00
generated for every 10^6 memory accesses, what is the effective access time for the memory?

A1
21ns
:

A2
23ns
:

A3
30ns
:

A4
35ns
:

Objective Question
23 23 Hiring problem can be solved using ___________ 4.0 1.00

A1
Dynamic programming
:

A2
Backtracking
:

A3
Randomised algorithms
:

A4
Heuristic algorithms
:

Objective Question
24 24 If inputs are given in a sequence and if one set of inputs affect the running time of next set of inputs ________ analysis is 4.0 1.00
performed.

A1 Random
:

A2
Probabilistic
:

A3
Amortized
:

A4
Time
:

Objective Question
25 25 Longest Common Subsequence problem can be solved using _______ approach. 4.0 1.00

A1
Greedy
:

A2
Dynamic Programming
:

A3
Backtracking
:

A4
Probabilistic
:

Objective Question
26 26 Problems which have efficient algorithms are class _________problem. 4.0 1.00

A1
P
:

A2
NP
:

A3
NP-Hard
:

A4
NP-Complete
:

Objective Question
27 27 ______algorithms are efficient algorithms that find solutions to NP-hard optimization problems with provable guarantees on 4.0 1.00
the distance of the returned solution to the optimal one.

A1
Approximation
:

A2
Threaded
:

A3
Optimisation
:

A4
Amortised
:

Objective Question
28 28 If length of the rod is 8 and the values of different pieces are given as following, then the maximum obtainable value is 22 4.0 1.00
(by cutting in two pieces of lengths 2 and 6).
length = 1 2 3 4 5 6 7 8
price = 1 5 8 9 10 17 17 20
What is the worst case running time for the above problem?

A1
O(n)
:

A2
O(logn)
:

A3 2
: O(n )

A4
O(nlogn)
:

Objective Question
29 29 Apply Master theorem to T(n)=3.T(n/2)+n^2 and write what is f(n). 4.0 1.00

A1
f(n)=n/2+n^2
:

A2
f(n)=n/2
:

A3
f(n)=n^2
:

A4
f(n)=3n/2
:

Objective Question
30 30 Which of the given options provides the increasing order of asymptotic complexity of functions f1, f2, f3 and f4? 4.0 1.00
i. f1(n) = 2^n
ii. f2(n) = n^(3/2)
iii. f3(n) = nlogn
iv. f4(n) = n^(logn)

A1
f3, f2, f1, f4
:

A2
f2, f3, f1, f4
:

A3
f2, f3, f4, f1
:

A4
f3, f2, f4, f1
:

Objective Question
31 31 The mode of 8237 in which the device transfers only one byte per request is 4.0 1.00

A1
Block Transfer Mode
:

A2
Single Transfer Mode
:
A3
Demand Transfer Mode
:

A4
Cascade Mode
:

Objective Question
32 32 The register bank of Execution Unit of 80286 is used as 4.0 1.00

A1
16-bit General Purpose Registers
:

A2
16-bit Segment Registers
:

A3
Special Purpose Registers
:

A4
Status and Control Registers
:

Objective Question
33 33 In 8255, If the value of the pin STB (Strobe Input) falls to low level, then 4.0 1.00

A1
Input port is loaded into input latches
:

A2
Input port is loaded into output latches
:

A3
Output port is loaded into input latches
:

A4
Output port is loaded into output latches
:

Objective Question
34 34 The register that stores all the interrupt requests in it in order to serve them one by one on a priority basis is 4.0 1.00

A1
Interrupt Request Register
:

A2
In-Service Register
:

A3
Priority Resolver
:

A4
Interrupt Mask Register
:

Objective Question
35 35 If the 80286 need to use system bus, then the signal that is to be active is 4.0 1.00

A1
SRDY
:
A2 SRDYEN
:

A3
ARDYEN
:

A4
ARDY
:

Objective Question
36 36 In Case of BT Instruction, If the Bit Position in the Destination Operand Specified by the Source Operand, is ‘1’, then 4.0 1.00

A1
Zero Flag is Reset
:

A2
VM Flag is Set
:

A3
RF Flag is Reset
:

A4
Carry Flag is Set
:

Objective Question
37 37 Let E1 and E2 be two entities in an E/R diagram with simple single-valued attributes. R1 and R2 are two relationships 4.0 1.00
between E1 and E2, where R1 is one-to-many and R2 is many-to-many. R1 and R2 do not have any attributes of their own.
What is the minimum number of tables required to represent this situation in the relational model?

A1
2
:

A2
3
:

A3
4
:

A4
5
:

Objective Question
38 38 Consider the join of a relation R with a relation S. If R has m tuples and S has n tuples, then the maximum and minimum 4.0 1.00
sizes of the join respectively are:

A1
m+n and 0
:

A2
mn and 0
:

A3
m+n and m-n
:

A4
mn and m+n
:

Objective Question
39 39 Which of the following statements are TRUE about an SQL query? 4.0 1.00
P: An SQL query can contain a HAVING clause even if it does not have a GROUP BY clause
Q: An SQL query can contain a HAVING clause only if it has a GROUP BY clause
R: All attributes used in the GROUP BY clause must appear in the SELECT clause
S: Not all attributes used in the GROUP BY clause need to appear in the SELECT clause

A1
P and R
:

A2
P and S
:

A3
Q and R
:

A4
Q and S
:

Objective Question
40 40 The two tables in a schema defined as follows and there are four queries given: 4.0 1.00
Student (reg_num, name), Exam (reg_num, mark)

Query 1:

SELECT S.reg_num, [Link]


FROM Student S INNER JOIN Exam E
ON S.reg_num = E.reg_num;

Query 2:

SELECT S.reg_num, [Link]


FROM Student S LEFT OUTER JOIN Exam E
ON S.reg_num = E.reg_num;

Query 3:

SELECT S.reg_num, [Link]


FROM Student S RIGHT OUTER JOIN Exam E
ON S.reg_num = E.reg_num;

Query 4:

SELECT S.reg_num, [Link]


FROM Student S FULL OUTER JOIN Exam E
ON S.reg_num = E.reg_num;

Find the query which will surely have the output that carries all the resulting records of the remaining three queries?

A1
Query 1
:

A2
Query 2
:

A3
Query 3
:

A4
Query 4
:

Objective Question
41 41 A table is in 2NF if it is in 1NF and if 4.0 1.00

A1
No column that is not a part of the primary key is dependent on only a portion of the alternate key.
:

A2
No column that is not a part of the primary key is dependent on only a portion of the primary key.
:
A3
No column that is not a part of the primary key is dependent on only a portion of the foreign key.
:

A4
No column that is not a part of the super key is dependent on only a portion of the superkey.
:

Objective Question
42 42 4.0 1.00

A1
:

A2
:

A3
:

A4
:

Objective Question
43 43 Which of the following concurrency control protocols ensure both conflict serializability and freedom from deadlock? 4.0 1.00

1. Two-phase locking
2. Time-stamp ordering

A1
1 only
:

A2
2 only
:

A3
Both 1 and 2
:

A4
Neither 1 nor 2
:

Objective Question
44 44 4.0 1.00

A1
:

A2
:

A3
:
A4
:

Objective Question
45 45 The address of a class B host is to be split into subnets with a 6-bit subnet number. What is the maximum number of subnets 4.0 1.00
and the maximum number of hosts in each subnet?

A1
62 subnets and 1022 hosts
:

A2
62 subnets and 1024 hosts
:

A3
64 subnets and 1024 hosts
:

A4
64 subnets and 1022 hosts
:

Objective Question
46 46 Suppose the round trip propagation delay for a 10 Mbps Ethernet having 48-bit jamming signal is 46.4 ms. The minimum 4.0 1.00
frame size is:

A1
94
:

A2
416
:

A3
464
:

A4
512
:

Objective Question
47 47 In a block, the mask is [Link]; What is the prefix length? 4.0 1.00

A1
/20
:

A2
/21
:

A3
/22
:

A4
/19
:

Objective Question
48 48 In a token ring network, the transmission speed is 107 bps and the propagation speed is 200 metres/micro second. The 1-bit 4.0 1.00
delay in this network is equivalent to:

A1
500 metres of cable
:

A2 200 metres of cable


:

A3
20 metres of cable
:

A4
50 metres of cable
:

Objective Question
49 49 An organization has a class B network and wishes to form subnets for 80 departments. The subnet mask would be: 4.0 1.00

A1
[Link]
:

A2
[Link]
:

A3
[Link]
:

A4
[Link]
:

Objective Question
50 50 A 2000-character text file has to be transmitted by using a 1,200 baud modem. How long will it take? 4.0 1.00

A1
2 seconds
:

A2
12 seconds
:

A3
20 seconds
:

A4
120 seconds
:

Objective Question
51 51 A 4 KHz noise less channel with one sample ever 125 per sec is used to transmit digital signals. Differential PCM with 4-bit 4.0 1.00
relative signal value is used. Then how many bits per second are actually sent?

A1
8 Kbps
:

A2
16 Kbps
:

A3
32 Kbps
:

A4
64 Kbps
:

Objective Question
52 52 The code 10011100101 received. Using hamming encoding algorithm, what is the original code sent? 4.0 1.00

A1 1010110
:

A2
1000101
:

A3
1011001
:

A4
1001101
:

Objective Question
53 53 4.0 1.00

A1
4
:

A2
5
:

A3
6
:

A4
8
:

Objective Question
54 54 4.0 1.00

A1
:

A2
:

A3
:

A4
:

Objective Question
55 55 4.0 1.00

A1
3
:

A2
4
:

A3
6
:

A4 1
:

Objective Question
56 56 4.0 1.00

A1
All palindromes
:

A2
All odd length palindromes
:

A3
Strings that begin and end with same symbol
:

A4
All even length palindromes
:

Objective Question
57 57 4.0 1.00

A1
:

A2
:

A3
:

A4
:

Objective Question
58 58 4.0 1.00

A1
:

A2
:

A3
:

A4
:

Objective Question
59 59 4.0 1.00

A1
Right Linear
:

A2
Left Linear
:

A3
Neither Right linear nor Left Linear
:

A4
Both Left and Right Linear
:

Objective Question
60 60 DAG representation of a basic block allows 4.0 1.00

A1
Automatic detection of local common sub expressions
:

A2
Detection of induction variables
:

A3
Automatic detection of loop variant
:

A4
Detection of local variables
:

Objective Question
61 61 Which of the following is/are the implementation of three address statements? 4.0 1.00

A1
Quadruples
:

A2
Triples
:

A3
direct quadruples
:

A4
both Quadruples and Triples
:

Objective Question
62 62 4.0 1.00

A1
{r}
:

A2 {w}
:

A3
{w,y}
:

A4
{w,$}
:

Objective Question
63 63 Assume that the SLR parser for a grammar G has n1 states and the LALR parser for G has n2 states. Hence which one is 4.0 1.00
true?

A1
n1 is necessarily less than n2
:

A2
n1 is necessarily equal to n2
:

A3
n1 is necessarily greater than n2
:

A4
n1 and n2 are independent of each other
:

Objective Question
64 64 4.0 1.00

A1
:

A2
:

A3
:

A4
:

Objective Question
65 65 4.0 1.00

A1
:

A2
:

A3
:
A4
:

Objective Question
66 66 The action ‘STACK(A, B)’ of a robot arm specify to _______________ 4.0 1.00

A1
Place block B on Block A
:

A2
Place blocks A, B on the table in that order
:

A3
Place blocks B, A on the table in that order
:

A4
Place block A on block B
:

Objective Question
67 67 Which is not necessary for an agent to solve an online search problem? 4.0 1.00

A1
Actions
:

A2
Step-cost function
:

A3
Goal-test
:

A4
Optimization
:

Objective Question
68 68 A 3-input neuron is trained to output a zero when the input is 110 and a one when the input is 111. After generalization, the 4.0 1.00
output will be zero when and only when the input is?

A1
000 or 110 or 011 or 101
:

A2
010 or 100 or 110 or 101
:

A3
000 or 010 or 110 or 100
:

A4
100 or 111 or 101 or 001
:

Objective Question
69 69 Which method is effective for escaping from local minima? 4.0 1.00

A1
Updating heuristic estimate
:

A2
Reducing heuristic estimate
:
A3 Eliminating heuristic estimate
:

A4
Optimizing heuristic estimate
:

Objective Question
70 70 Which of the following is true for neural networks? 4.0 1.00
(i) The training time depends on the size of the network.
(ii) Neural networks can be simulated on a conventional computer.
(iii) Artificial neurons are identical in operation to biological ones.

A1
All are true
:

A2
(ii) is true
:

A3
(i) and (ii) are true
:

A4
None of the mentioned is true
:

Objective Question
71 71 Which one of the following attributes is important for presenting text in a multimedia document? 4.0 1.00

A1
Color
:

A2
Character format
:

A3
Font
:

A4
Color, Character format and Font
:

Objective Question
72 72 A three dimensional object can also be represented using 4.0 1.00

A1
Method
:

A2
Equation
:

A3
Point
:

A4
Pixel
:

Objective Question
73 73 Plasma device converts 4.0 1.00

A1
Electrical energy into light
:
A2
Light into electrical energy
:

A3
Light into graphical energy
:

A4
Electrical energy into graphical energy
:

Objective Question
74 74 A bitmap is collection of ___________________ that describes an image. 4.0 1.00

A1
Bits
:

A2
Colours
:

A3
Algorithms
:

A4
Pixels
:

Objective Question
75 75 Which transformation distorts the shape of an object such that the transformed shape appears as if the object were composed 4.0 1.00
of internal layers that had been caused to slide over each other?

A1
Rotation
:

A2
Scaling up
:

A3
Scaling down
:

A4
Shearing
:

Objective Question
76 76 Which keys allows user to enter frequently used operations in a single key stroke? 4.0 1.00

A1
Function keys
:

A2
Cursor control keys
:

A3
Track ball
:

A4
Control keys
:

Objective Question
77 77 Expansion of line DDA algorithm is 4.0 1.00
A1
Digital difference analyzer
:

A2
Direct differential analyzer
:

A3
Data differential analyzer
:

A4
Digital differential analyzer
:

Objective Question
78 78 In Audio and Video Compression, each frame is divided into small grids, called 4.0 1.00

A1
Frame.
:

A2
Packets.
:

A3
Pixels.
:

A4
Mega Pixels.
:

Objective Question
79 79 CMM model in Software Engineering is a technique of __________. 4.0 1.00

A1
Developing the software.
:

A2
Improving the software process.
:

A3
Checking the project design quality.
:

A4
Measuring the project risk.
:

Objective Question
80 80 Which of the following activity is not come under SQA 4.0 1.00

A1
White box testing
:

A2
Black box testing
:

A3
Integration testing
:

A4
Unit testing
:
Objective Question
81 81 The refinement of requirements can be done in the 4.0 1.00

A1
Waterfall model
:

A2
Prototyping model
:

A3
Evolutionary model
:

A4
Spiral model
:

Objective Question
82 82 Product Quality Metrics does not include 4.0 1.00

A1
Mean Time to Failure
:

A2
Defect Density
:

A3
System functionality
:

A4
Customer Satisfaction
:

Objective Question
83 83 The Function Point count for a software product is dependent on 4.0 1.00

A1
User’s view of the product
:

A2
Customer’s view of the product
:

A3
Developer’s view of the product
:

A4
Tester's view of the product
:

Objective Question
84 84 Input for estimating the effort, cost, and time required for developing the product is ________ of the project. 4.0 1.00

A1
Requirements
:

A2
Size
:

A3
Scope
:

A4 Quality
:

Objective Question
85 85 The relation between the Function point metric and LOC metric is 4.0 1.00

A1
Inverse proportional
:

A2
Direct Proportional
:

A3
Depends upon the programming language alone
:

A4
Depends upon the programming language and the quality of the design
:

Objective Question
86 86 Structural complexity metric of a module depends on 4.0 1.00

A1
Fan-out of the module
:

A2
Fan-in of the module
:

A3
Input variables of the module
:

A4
Control structure of the module
:

Objective Question
87 87 If result = 2 + 3 * 5, what is the value of result? 4.0 1.00

A1
25
:

A2
14
:

A3
10
:

A4
17
:

Objective Question
88 88 What is the value stored in result after executing the following line in a program? 4.0 1.00
result = 6/2*3;

A1
1.2
:

A2
9
:

A3 1
:

A4
0
:

Objective Question
89 89 What is the right way to access value of structure variable book{ price, page }? 4.0 1.00

A1
:

A2
:

A3
:

A4
:

Objective Question
90 90 4.0 1.00

A1
The code will not compile and will give “Duplicate main() method declaration” error
:

A2
The code will compile correctly but will give a runtime exception
:

A3
The code will compile correctly and will print “In first main()” (without quotes) when it is run
:

A4
The code will compile correctly and will print “a” (without quotes) when it is run
:

Objective Question
91 91 4.0 1.00
A1
2 -6 5
:

A2
2 -6 1
:

A3
221
:

A4
Compiler error
:

Objective Question
92 92 4.0 1.00

A1
Constructor 2
:

A2
Constructor 4
:

A3
Constrcutor 1
:

A4
Type mismatch error
:

Objective Question
93 93 4.0 1.00
A1
Prints "Hello World"
:

A2
Generates a runtime error
:

A3
Does nothing
:

A4
Generates a compile time error.
:

Objective Question
94 94 4.0 1.00

A1 a = 3 s = Blue
:

A2
a = 5 s = Yellow
:

A3
a = 3 s = Yellow
:

A4
a = 5 s = Blue
:

Objective Question
95 95 With respect to Big Data ecosystem, Cassandra is 4.0 1.00

A1
an operating system
:

A2
a programming language
:

A3
is a protocol
:

A4
a database management system
:

Objective Question
96 96 In the context of Big data, ETL stands for 4.0 1.00

A1
Extract, Transform, Load
:

A2
Extract, Transcribe, Load
:

A3
Extend, Transform, Load
:

A4
Expect, Transfer, Load
:

Objective Question
97 97 Which of the following is an in-memory data processing engine? 4.0 1.00

A1
Spark
:

A2
CSS
:

A3
Segmenter
:

A4
Selector
:

Objective Question
98 98 In the context of IoT, FOTA stands for 4.0 1.00
A1
Firmware Over-the-Air
:

A2
Firmware On Tele Applications
:

A3
Faster Organization Towards Accuracy
:

A4
Faster Overlapping Text Adapter
:

Objective Question
99 99 In machine learning, the number of correct predictions by the model, over all predictions made is called 4.0 1.00

A1
Precision
:

A2
Recall
:

A3
F-measure
:

A4
Accuracy
:

Objective Question
100 100 Which of the following is a container platform 4.0 1.00

A1
Docker
:

A2
Android
:

A3
CouchDB
:

A4
C - Apps
:

You might also like