Technical Aptitude Test

Technical Aptitude Test

University

30 Qs

quiz-placeholder

Similar activities

Information assurance and security

Information assurance and security

University

25 Qs

Empowerment Technology (SUMMATIVE)

Empowerment Technology (SUMMATIVE)

12th Grade - University

25 Qs

AD S1 week5

AD S1 week5

University

25 Qs

Computer Pretest1(Arduino Grade8_t1)

Computer Pretest1(Arduino Grade8_t1)

3rd Grade - University

25 Qs

Intro. to PCs Quiz 1

Intro. to PCs Quiz 1

9th Grade - University

25 Qs

IoT Quiz - 1

IoT Quiz - 1

University - Professional Development

25 Qs

data mining

data mining

University

30 Qs

CCC14 Chapter 4 - Spreadsheet

CCC14 Chapter 4 - Spreadsheet

University

25 Qs

Technical Aptitude Test

Technical Aptitude Test

Assessment

Quiz

Computers

University

Hard

Created by

shilpa sanap

Used 3+ times

FREE Resource

30 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

In the Internet stack the protocol data unit(PDU) for the application layer is
Segment
Message
Datagram
None of these

2.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

Which two statements describe the IP address 10.16.3.65/23? 1. The subnet address is 10.16.3.0 255.255.254.0. 2. The lowest host address in the subnet is 10.16.2.1 255.255.254.0. 3. The last valid host address in the subnet is 10.16.2.254 255.255.254.0. 4. The broadcast address of the subnet is 10.16.3.255 255.255.254.0.
1 and 3
2 and 4
1, 2 and 4
2, 3 and 4

3.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

Given the following relation instance- x y z 1 4 2 1 5 3 1 6 3 3 2 2 Which functional dependencies are satisfied by the instance?
XY -> Z and Z -> Y
YZ -> X and Y -> Z
YZ -> X and X -> Z
XZ -> Y and Y -> X

4.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

Given relations r(w, x) and s(y, z), the result of select distinct w, x from r, s is guaranteed to be same as r, provided
r has no duplicates and s is non-empty
r and s have no duplicates
s has no duplicates and r is non-empty
r and s have the same number of tuples

5.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

Which of the following concurrency control protocols ensure both conflict serializability and freedom from deadlock? I. 2-phase locking II. Time-stamp ordering
I only
II only
Both I and II
Neither I nor II

6.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

A function f defined on stacks of integers satisfies the following properties. f(∅) = 0 and f (push (S, i)) = max (f(S), 0) + i for all stacks S and integers i. If a stack S contains the integers 2, -3, 2, -1, 2 in order from bottom to top, what is f(S)?
6
3
4
2

7.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

The best data structure to check whether an arithmetic expression has balanced parentheses is a
Queue
Stack
tree
list

Create a free account and access millions of resources

Create resources

Host any resource

Get auto-graded reports

Google

Continue with Google

Email

Continue with Email

Classlink

Continue with Classlink

Clever

Continue with Clever

or continue with

Microsoft

Microsoft

Apple

Apple

Others

Others

By signing up, you agree to our Terms of Service & Privacy Policy

Already have an account?