Branch Master CSE Round 1(Quiz)

Branch Master CSE Round 1(Quiz)

University

30 Qs

quiz-placeholder

Similar activities

Основы C#. часть1 (Переменные, операторы)

Основы C#. часть1 (Переменные, операторы)

7th Grade - University

25 Qs

CPP Mid Term SPOT test

CPP Mid Term SPOT test

5th Grade - University

25 Qs

VAC - Java -Applets and Servlets

VAC - Java -Applets and Servlets

University

25 Qs

Feb 20, 2025 AP CompSci - 1st Period

Feb 20, 2025 AP CompSci - 1st Period

12th Grade - University

25 Qs

C Programming

C Programming

University - Professional Development

30 Qs

C PROGRAMMING

C PROGRAMMING

University

25 Qs

XTK022

XTK022

University

25 Qs

C_Upto_Array

C_Upto_Array

University

25 Qs

Branch Master CSE Round 1(Quiz)

Branch Master CSE Round 1(Quiz)

Assessment

Quiz

Computers

University

Hard

Created by

UMA SHANKAR MISHRA

Used 5+ times

FREE Resource

30 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

To access the services of the operating system, the interface is provided by the ___________
Library
System calls
Assembly instructions
API

2.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which one of the following is not true?
kernel remains in the memory during the entire computer session
kernel is made of various modules which can not be loaded in running operating system
kernel is the first part of the operating system to load into memory during booting
kernel is the program that constitutes the central core of the operating system

3.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which of the following protocol does not exist at the data link layer?
ZigBee Smart Energy
LoRaWAN
WirelessHART
Secure MQTT

4.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which of the following is the example of a short-range wireless network?
VPN
Wi-Fi
Internet
WWW

5.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which interface does the fingerprint sensor use?
UART interface
CoAP interface
SPI interface
I2P interface

6.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Condition for a Circular Queue to be full-
Rear ==Max Size
Rear + 1 == (Front +1) % size
(Rear + 1) % size == Front
(Front + 1)% size == Rear

7.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

In a binary search tree (BST), which traversal gives the elements in sorted order?
Pre-order
In-order
Post-order
Level order

Create a free account and access millions of resources

Create resources
Host any resource
Get auto-graded reports
or continue with
Microsoft
Apple
Others
By signing up, you agree to our Terms of Service & Privacy Policy
Already have an account?