SYBSC IT - SEM III - MCQ
MCQ – Multiple
Choice Questions
SAMPLE MCQ
IMPORTANT MCQ QUESTIONS AND ANSWER.......................
AS PER UNIVERSITY OF MUMBAI
SYLLABUS
It Will be helpful to
regular students of Mumbai university colleges who are going to give the online
examinations of SEM I, and SEM III class
of students.
If it is helpful to you
so also share it among your friends so that they will be also benefited from it.
ANSWERS ARE HIGHLIGHTED IN BOLD
S.Y.BSCIT- 3 SEM
APPLIED MATHEMATICS
1. |
|
(2 points) |
|
◯ |
|
|
|
⚫ |
|
|
|
◯ |
|
|
|
◯ |
|
2. |
|
(2 points) |
|
⚫ |
determinant |
|
◯ |
non determinant |
|
◯ |
consitsent |
|
◯ |
non-consistent |
3. |
|
(2 points) |
|
⚫ |
|
|
|
◯ |
|
|
|
◯ |
|
|
|
◯ |
|
4. |
|
(2 points) |
|
◯ |
asynchronous |
|
⚫ |
periodic |
|
◯ |
aperiodic |
|
◯ |
sysnchronous |
5. |
|
(2 points) |
|
◯ |
discrete |
|
◯ |
non-continuous |
|
◯ |
non-discrete |
|
⚫ |
continuous |
6. |
|
(2 points) |
|
◯ |
|
|
|
◯ |
|
|
|
⚫ |
|
|
|
◯ |
|
7. |
|
(2 points) |
|
◯ |
non-linear |
|
◯ |
lienar |
|
⚫ |
transpose |
|
◯ |
non-tirvial |
8. |
|
(2 points) |
|
◯ |
240 |
|
⚫ |
120 |
|
◯ |
360 |
|
◯ |
520 |
9. |
|
(2 points) |
|
◯ |
sine waves |
|
◯ |
square |
|
◯ |
triangular |
|
⚫ |
sinusoidal function |
10. |
|
(2 points) |
|
◯ |
|
||
|
◯ |
|
||
|
⚫ |
|
||
|
◯ |
|
11. |
|
(2 points) |
|
◯ |
0.185 |
|
◯ |
0.313 |
|
◯ |
0.45 |
|
⚫ |
0.196 |
12. |
|
(2 points) |
|
◯ |
|
|
|
⚫ |
|
|
|
◯ |
|
|
|
◯ |
|
S.Y.BSCIT- 3 SEM
COMPUTER NETWORKS
1. |
|
(2 points) |
|
◯ |
2 |
|
◯ |
3 |
|
◯ |
many |
|
⚫ |
1 |
2. |
A ____________ signal is a combination of 2 or more simple sine waves |
(2 points) |
|
◯ |
periodic |
|
◯ |
analog |
|
◯ |
digital |
|
⚫ |
composite |
3. |
UDP is __________ protocol |
(2 points) |
|
◯ |
user data |
|
◯ |
usual datagram |
|
⚫ |
user datagram |
|
◯ |
user dataset |
4. |
ALOHA is a type of ____________ protocols |
(2 points) |
|
⚫ |
random access |
|
◯ |
channelization |
|
◯ |
CSMA |
|
◯ |
controlled access |
5. |
HTTP protocol works in the _________ layer |
(2 points) |
|
◯ |
presentation |
|
⚫ |
application |
|
◯ |
datalink |
|
◯ |
session |
6. |
|
(2 points) |
|
⚫ |
set up phase |
|
◯ |
connection |
|
◯ |
breaking |
|
◯ |
joining |
7. |
CRC is |
(2 points) |
|
◯ |
Cyclic remote check |
|
◯ |
Cyclical redundancy checksum |
|
⚫ |
Cyclic redundancy check |
|
◯ |
Cyclomatic redundancy check |
8. |
|
(2 points) |
|
◯ |
electric |
|
⚫ |
electronic |
|
◯ |
electricity |
|
◯ |
electrical |
9. |
WDM is |
(2 points) |
|
◯ |
Wave division multiplexing |
|
⚫ |
Wavelength division multiplexing |
|
◯ |
Wavedata division multiplexing |
|
◯ |
Waveform division multiplexing |
10. |
Datagram network is - |
(2 points) |
|
◯ |
packet switching |
|
⚫ |
Connectionless |
|
◯ |
Connection-oriented |
|
◯ |
virtual circuit method |
11. |
A __________ is a 3-layer device that routes packet based on their logical
addresses. |
(2 points) |
|
⚫ |
router |
|
◯ |
hub |
|
◯ |
repeater |
|
◯ |
switch |
12. |
|
(2 points) |
|
◯ |
Open smart path first |
|
◯ |
Open small path first |
|
⚫ |
Open shortest path first |
|
◯ |
Open small path fast |
S.Y.BSCIT- 3 SEM
Data Structures
1. |
____ notation represented as “O” |
(2 points) |
|
⚫ |
big O |
|
◯ |
alpha notation |
|
◯ |
omega notaion |
|
◯ |
theta notation |
2. |
Asymptotic notation is |
(2 points) |
|
⚫ |
theta notation |
|
◯ |
alpha notation |
|
◯ |
beta notation |
|
◯ |
gamma notation |
3. |
Which of the following statements for a simple graph is correct? |
(2 points) |
|
◯ |
every trail is a path as well as every path is trail |
|
◯ |
every trail is a path |
|
⚫ |
every path is trail |
|
◯ |
path and trail have no relation |
4. |
Linked list is considered as an example of ___________ type of memory
allocation. |
(2 points) |
|
⚫ |
dynamic |
|
◯ |
compile time |
|
◯ |
static |
|
◯ |
heap |
5. |
What is a hash table? |
(2 points) |
|
◯ |
a structure that maps values to keys |
|
⚫ |
A structure that maps keys to values |
|
◯ |
a structure used to implement stack and queue |
|
◯ |
a structure used for storage |
6. |
What is the time complexity of pop() operation when the stack is
implemented using an array? |
(2 points) |
|
⚫ |
O(1) |
|
◯ |
O(nlogn) |
|
◯ |
O(logn) |
|
◯ |
o(n) |
7. |
In _____ is linear data structure which stores the elements in a node in a
linear fashion but not necessarily contaguous. |
(2 points) |
|
◯ |
queue |
|
◯ |
tree |
|
⚫ |
linked list |
|
◯ |
arrays |
8. |
Which of the following sorting algorithm is of divide and conquer type? |
(2 points) |
|
◯ |
bubble sort |
|
⚫ |
merge sort |
|
◯ |
selection sort |
|
◯ |
insertion sort |
9. |
____ notation represented as Ω |
(2 points) |
|
⚫ |
omega notation |
|
◯ |
theta notation |
|
◯ |
alpha notation |
|
◯ |
big o |
10. |
How do you initialize an array in C? |
(2 points) |
|
◯ |
int arr(3) = {1,2,3}; |
|
⚫ |
int arr[3] = {1,2,3}; |
|
◯ |
int arr[3] = (1,2,3); |
|
◯ |
int arr(3)= (1,2,3); |
11. |
Following which one is not stack operation |
(2 points) |
|
◯ |
pop |
|
◯ |
push |
|
◯ |
peek |
|
⚫ |
enqueue |
12. |
Which of the following properties is associated with a queue? |
(2 points) |
|
◯ |
last in last out |
|
◯ |
first in last out |
|
⚫ |
first in first out |
|
◯ |
last in first out |
S.Y.BSCIT- 3 SEM
Database Management System (DBMS)
1. |
Which of the following is a low level
operator? |
(2 points) |
|
◯ |
insert |
|
◯ |
delete |
|
◯ |
update |
|
⚫ |
directory |
2. |
Given the basic ER and relational models, which of the following is
INCORRECT? |
(2 points) |
|
◯ |
An attribute of an entity can have more than one value |
|
◯ |
An attribute of an entity can be composite |
|
◯ |
In a row of a relational table, an attribute can have exactly one
value or a NULL value |
|
⚫ |
In a row of a relational table, an attribute can have more than one
value |
3. |
_____________ express the number of entities to which another entity can
be associated via a relationship set. |
(2 points) |
|
◯ |
participation contraints |
|
◯ |
relational cardinality |
|
⚫ |
mapping cardinality |
|
◯ |
relational contraints |
4. |
The relationship between DEPARTMENT and EMPLOYEE is a |
(2 points) |
|
⚫ |
One-to-many relationship |
|
◯ |
Many-to-many relationship |
|
◯ |
One-to-one relationship |
|
◯ |
Many-to-one relationship |
5. |
An entity set that does not have sufficient attributes to form a primary
key is termed a __________ |
(2 points) |
|
◯ |
strong entity set |
|
⚫ |
weak entity set |
|
◯ |
variable set |
|
◯ |
variant set |
6. |
The term attribute refers to a ___________ of a table. |
(2 points) |
|
⚫ |
column |
|
◯ |
key |
|
◯ |
tuple |
|
◯ |
record |
7. |
Which of the following is an attribute that can uniquely identify a row in
a table? |
(2 points) |
|
◯ |
alternate key |
|
◯ |
foreign key |
|
⚫ |
candidate key |
|
◯ |
secondary key |
8. |
Which of the following is the comparison operator in tuple relational
calculus |
(2 points) |
|
◯ |
=> |
|
⚫ |
= |
|
◯ |
% |
|
◯ |
- |
9. |
Which is a bottom-up approach to database design that design by examining
the relationship between attributes: |
(2 points) |
|
◯ |
Functional dependency |
|
⚫ |
normalization |
|
◯ |
decomposition |
|
◯ |
Database modelling |
10. |
___________ is widely used today for protecting data in transit in a
variety of applications such as data transfer on the Internet, and on
cellular phone networks. |
(2 points) |
|
◯ |
internet security |
|
⚫ |
encryption |
|
◯ |
data mining |
|
◯ |
architectural security |
11. |
A relational database consists of a collection of |
(2 points) |
|
◯ |
records |
|
◯ |
fields |
|
◯ |
keys |
|
⚫ |
tables |
12. |
____________ is preferred method for enforcing data integrity |
(2 points) |
|
◯ |
cursors |
|
◯ |
stored procedure |
|
⚫ |
constraint |
|
◯ |
triggers |
Comments
Post a Comment