Bihar STET Computer Science Guide
Bihar STET Computer Science Guide
This book has been prepared considering Bihar STET computer science re-exam in
September 2020. We have included topics and MCQs considering level of
BELTRON. Every effort has been made to ensure that book should be to the point
and as per expected line of BELTRON STET. This book consists of 370+ pages so
it has ample content. I highly appreciate contribution of Mr. Javed (GK Practice
Set) & Mr. Nikhil Upadhyay to come up with this book.
I strongly admire efforts and advice of numerous people who had been engaged in
process of creation of this book.
COMPUTER SCIENCE
1
CONTENT TABLE
DBMS 33-48
C++ 49-64
MCQs 65-370
2
DATA COMMUNICATION & NETWORKING
3
Asynchronous Transmission: This type of transmission works in spurts and
inserts a start bit as well as a stop bit at its termination to inform the receiver
where it begins and ends.
Because of multiplexing, signal can be sent over very long distance without
distortion. Less number of wires required or circuit complexities decrease.
4
What is OSI Model?
Out of seven layers of OSI model, some deal with host while some deal with
various functions of network.
In OSI, there are seven layers with their individual functionality and we will
explain all of them one by one. List of layers are as below:
1. Physical Layer
5
2. Data Link Layer
3. Network Layer
4. Transport Layer
5. Session Layer
6. Presentation Layer
7. Application Layer
6
3. Network layer: this layer works for functional as well as
procedural means for data transfer in network.
4. Transport layer: This layer works for delivering message between
network hosts. Transport layer also accepts data from application
layer and get it ready for addressing at network layer.
5. Session layer: This layer controls connection between computers in
any network. When to connect and when not to connect.
6. Presentation layer: As clear from name, data presentation is done
over here like data compression, decompression, encryption,
decryption etc.
7. Application layer: this is the layer that communicates directly with
user. This layer provides services like user login, naming network
devices, formatting messages, e-mails, transfer of files and many
more.
7
Application Layer HTTP, SMTP, DHCP, FTP,TELNET
8
There are many types of computer network based on area that they cover and
their modus operandi. Here we will explain about four prominent types of
networks:
1. LAN
2. MAN
3. WAN
9
What is Computer Network Topology and Different Types?
1. Mesh Topology
2. Star Topology
3. Bus Topology
4. Ring Topology
5. Hybrid Topology
10
Star Topology: every device of the network will be connected to a central
device called hub. This network does not allow direct communication among
devices. Networking will be affordable as there will be requirement of only
one input/output port. For networking lesser cables would be required. If one
link fails then other links would still work fine.
Bus Topology: in this type of network, there will be one main cable and
concerned devices will be connected through drop lines. It is easy to install
this type of network. In compare to Mesh and Star both, there will be lesser
cable required for this type of network. This type of topology can’t be used
for broad network.
11
Ring Topology: A ring computer network is a topology in which every node
connects to exactly two nearby nodes, forming a continuous pathway for
signals through every node. This network is easy to install and devices can be
easily installed and removed from topology. Biggest problem with this type
of network is, if link fails at one point then entire network will collapse.
12
Hybrid Topology: we mentioned four different topologies above and mixture
of one or more topology is known as Hybrid topology. As per requirement,
one can change which topology to be selected. On other hand fault detection
will be not easy for this topology.
13
The main difference between circuit switching and packet switching is that
Packet Switching will be connectionless while circuit switching will be
connection-oriented.
14
A gateway in any network connects two different networks using
different protocols. On other hand Bridge is used to join two similar
types of networks.
Handshaking is a communication process where rules are set prior to
start of communication.
Nowadays IPV6 has broadly replaced IPV4.
Computer network topology is an arrangement of various data elements
of network. Example: Nodes, Links etc.
Peer to peer is decentralized style communication where every node
can communicate with other.
15
OPERATING SYSTEM
Memory Management
Process Management
Device Management
Disk’s File Management
System Security
Control of system performance
Coordination between other software and users
16
Memory management: it refers to management of Primary Memory or Main
Memory of system for execution of various programs. In multiprogramming,
the OS decides which process will be allotted memory when and how much
Multitasking: this is the condition when multiple jobs are executed by the
CPU simultaneously by interchanging among them. Switching occur so
frequently that the users can interact with every running program
simultaneously. This type of operating system is also known as Time-sharing
system.
18
Difference between Multi Programming and Multi Tasking?
When any program is loaded into the memory and it turns into a process, it
can be classified into four sections namely stack, heap, text and data.
Heap: this is dynamically allocated memory for any process during its run
time.
Process Scheduling: This is the activity of the process manager that handles
the elimination of the running process from the CPU and the selection of
some other process on basis of a planned strategy. A Process scheduler
schedules various processes to be assigned to the CPU based on pre-defined
scheduling algo.
Thread: this is a flow of execution through the process code, with its own
program counter which keeps track of which instruction to be executed next.
Types of Threads:
20
There are two primary types of threads:
Maximum time, devices will not need attention and when one does it will
have to wait until it is next considered by the polling. This is an inefficient
method and processors time will be wasted on unnecessary polls.
21
What is Interrupt I/O?
What is Semaphore?
What is deadlock?
22
DATA STRUCTURE
What is Array?
This is a type of data array where all elements have nearly the same value.
23
place in the memory. Each element points to the next member in this type of
data structure. It is the data structure consisting of a collection of various
nodes which together represent a sequence connection.
What is String?
A string is a data type and is often implemented as an array data structure of
bytes which stores a sequence of various elements. String may also denote
more general arrays or other sequence data types and structures.
Iteration Recursion
24
Which are different Data Structure Types and associated Pros and Cons?
There are numerous types of data structure as listed below:
1. STACK: Stack is a linear data structure type that follows a particular
order in which the operations are supposed to be performed. The order
can be LIFO or FILO
25
5. Binary Tree: A tree structure whose elements have maximum two
children is called a binary tree. Because every element in a binary tree
can have maximum 2 children, we also name them the left and right
child.
26
Heap Fast insertion, deletion, Slow access for other
access items
Pointers in Data Structure are used to store and manage addresses of the
dynamically allocated blocks of memory. Blocks are used to store data objects or
various arrays of objects. Structured and object oriented languages provide part of
memory known as heap or free store, from which objects are dynamically
allocated.
In STACK data structure, PUSH is the process of adding new element while POP
is the process of deleting an element from the top. These two are called primary
stack operations. On other hand, we have PEEK that is used to read values
from top of STACK.
1. Using arrays
2. Using pointer
Queues can be classified in many different ways. Here we will classify them in
three parts as listed below:
27
1. Circular Queue: insertion of new element in the queue is done at first
position if last location is full.
2. Double ended Queue also known as De-Queue: insertion and deletion
can be done at both ends of structure.
3. Priority queue: a priority number will be assigned to every element of
the queue and as per priority number processing is also done. If two
elements have same priority number then one that is inserted first will
be also processed first.
In computer science, a binary tree is a tree like structure in which every node
has at most two children that are referred to as the left child and the right
child.
1. Binary Search Tree: every node in data structure should have value
and no two nodes should have the same value. Given value from
the left child should be always lesser than root while value of the
right child should be larger.
2. Balanced Binary Tree: this is the type of binary tree in which the
largest path from the left sub tree is of the same length as of the
largest path in the right sub tree.
3. Parse Tree: parse tree or derivation tree is ordered and rooted tree
that represents the syntactic structure of any string according to
context-free grammar.
4. AVL Tree: this type of tree is self balancing binary search tree.
29
5. Spanning Tree: A spanning tree is also known as subset of Graph
G, which has vertices covered with minimum possible number of
edges.
30
3. What is the length of substring that is to be accessed
31
Which are different ways of Tree Traversal?
Linear data structure can be traversed in only one way while tree can be
traversed in numerous ways.
32
DBMS
What is Database?
What is DBMS?
Based on way data is stored and retrieved, DBMS are classified in many groups as
written below:
33
1. Hierarchical database: this model of DBMS is based on tree like structure
or parent-child structure of data. Every child component in database should
have one parent while parents can have more than one child. To retrieve
data, whole tree structure needs to be traversed from root node. The first
ever DBMS of the world was based on hierarchy model.
34
3. Relational Model: as clear by name data is organized in two dimensional
tables or rows & columns system. This model was brought by famous
scientist E F Codd in year 1970. In this DBMS model, rows & column create
table and collection of various tables required for relational DBMS system.
35
ER model works, there are three basic elements namely in this type of
database entity, attribute and relationship.
RELATION TABLE
TUPLE ROW
ATTRIBUTE COLUMN
36
What are various advantages of DBMS system?
1. Data Redundancy Problem Sorted: many copies of same file in any database
repository is a common problem in DBMS system. In DBMS, redundant
files can be identified immediately with few clicks.
2. Data Integrity: Integration generally means consistent and accurate data
collection. If there will be any consistency issue in any database then it
wouldn’t perform function properly.
3. Concurrent access: this is not possible to access same file by multiple people
in traditional style paper based data. DBMS gives ease of access as same
data can be shared among multiple people.
Data integrity constraint means various set of rules to maintain data integrity of
consistent information system. Constraints ensure that there will be no impact on
data because of various operations performed. It is quite clear that in absence of
constraints, data will get distorted and DBMS wouldn’t work properly.
1. Centralized database: Data is saved at any central system or server and users
access it from different locations as required.
2. Distributed Database: it is clear by name, information is stored at various
locations and accessed at different locations through network links.
Example: Google Cloud Storage
3. Operational database: information of various operations of any institution is
stored in this type of database. Analytics, reports, transaction records etc are
part of data here.
4. Relational database: data that sets in various pre-defined categories are
arranged in tables.
37
5. Cloud Storage: data is stored in virtual storage system. Cloud storage can be
classified as private, public and hybrid cloud.
6. Object oriented database system: this type of database is collection of object
oriented programming (example C++) and relational database arrangement.
Information is presented as object and various characteristics of OOPS are
also applicable, some of which are Polymorphism, Inheritance,
Encapsulation etc.
Entity: a component of any database that should have individual identity. Suppose
there is a company with numerous employees and we are supposed to create
database, then employee will be entity in database.
A weak entity can be turned into strong identity by adding various attributes.
38
Candidate key: column or set of various columns through which database
records can be uniquely related. Best candidate key in the table is called
primary key. Candidate key is also called minimal super key. Candidate key
is also called key without any redundant attribute.
Foreign key: primary key of any table is considered as foreign key of some
other table. This is also used to make relation from one table to some other
table.
39
Normalization is the process of arranging data in the database without any
redundancy and undesirable anomalies that emerge because of numerous actions
on database components.
Anomaly is the common word that is often used in definition of Normalization that
means inconsistency or discrepancy.
1. Update anomaly
2. Insert anomaly
3. Delete anomaly
Insert Anomaly: consider any new candidate joined college but not yet enrolled in
any branch then college wouldn’t be able to create record if Branch field does not
accept null value.
40
Delete anomaly: suppose college wants to close commerce section then complete
record of Vinod will be eliminated.
Though there are many ways to normalize data, we have listed here common
names:
First Normal Form (1NF): any row of table must not have column with more
than one value or there should not be any attribute in table with multiple
values.
41
Second Normal Form (2NF): A database table will be in accordance of 1NF rules
and there must not be any partial dependency on primary key in table. It does
not have any non-prime attribute that is functionally dependent on proper
subset of the candidate key of the relation. 2NF’s main function is stop data
redundancy in the table.
(Non-Prime Attribute: an attribute of table that is not present in any candidate key
is called a non-prime attribute)
42
In this case, student name is dependent on roll number. Course name is dependent
on course number of college. Result depends on course number too. Roll number
and course number are candidate keys.
43
Third Normal Form (3NF): Table must follow rules of 2NF and there should
be no transitive dependency in the table.
Dependencies:
44
It is possible that there can be more than one columns of primary key in
database table called composite primary key.
1NF: Attribute must have atomic values. Example: there is column named
COLOR and two given values are RED and BLUE. Because of two values
this is not in the 1NF. Keyword: Atomic Attribute Value
2NF: table must follow 1NF rules. All attribute of the table must depend on
the primary key. Problem will occur when there will be case of composite
45
primary key. Keyword: Partial Dependency, Problem of Composite
Primary Key
5NF: this is also known as project join normal form. Table is divided into
more than one table without loss of any information. Keyword: Project
Join
SQL
Full form of SQL is structured query language, it is the language used for
various operations on numerous databases. It was released in year 1974 and
developed by Donald Chamberlin & Raymond Boyce. This is a cross
platform database language so it works for numerous operating systems.
46
Which are different types of SQL languages statement to manage
database?
SQL statements:
TRUNCATE comes under DDL while DELETE comes in the DML section.
Truncate deletes all records of the database while Delete removes selectively
using WHERE clause in beginning. Data removed using TRUNCATE
statement can’t be recovered while data removed using DELETE can be
recovered using ROLLBACK statement of SQL.
48
C++
Q: What is C++?
A: We have already clarified that C++ got popular because it was based on object
oriented system. C is a procedural programming language while C++ has
procedural as well as object oriented properties. Class, object and many other
properties were first brought in C++ language. Characteristics of C++ or OOPS
programming:
49
5. Inheritance: Inheritance means transfer of properties from one class to other.
Code reusability is considered one of the important properties in
programming and it started with C++. In Inheritance, new class is formed
from an existing class of program so that properties can be inherited.
Existing class is known as base class while newly created class is known as
derived class.
6. Polymorphism: word polymorphism means many forms. It is ability to use
same function in different possible ways depending on the type of object that
invokes the function.
7. Overloading: this property can be considered as type of polymorphism. In
this, more than one function can have same name but there will be different
parameter list (data types). This way program becomes easy to understand
and flexible too.
What is a Compiler?
This is a computer program that translates high level programming language into a
low level programming language or machine language.
#include <iostream>
Int main()
// Two forward slashes in C++ mean that statement is a comment. It will have
no impact on rest of program.
50
#include <iostream>: any word in C++ that starts with # is known as
preprocessor. These lines are interpreted before compilation process.
Int main(): this is the function declaration line. Execution of all program start
from the main function.
C++ Syntax
#include <iostream>
using namespace std;
int main() {
cout << "Hello STET Candidates";
return 0;
}
In the above written program, #include <iostream> is the header file library,
COUT comes from same source. Using various header files, we add functionalities
to any C++ program.
We have also used “using namespace std”, it means we can name object and
variable from standard library.
C++ ignores any space left in program and COUT is the object used for the text
output.
Two \n\n in any statement will create a blank line. Same function can be achieved
using endl also.
#include <iostream>
using namespace std;
int main() {
cout << "Hi STET Candidates! \n\n";
51
cout << "There will be few question in STET from C++";
return 0;
}
When this program will run then there will be one line gap between two sentences
in COUT.
C++ COMMENTS
Double slash is used to comment any line. It should be put in the beginning of any
line. Compiler will ignore complete line that starts with //. This double slash is
used to comment any single line. To comment multiple lines use below method.
int x, y;
int sum;
52
cout << "Type any number: ";
cin >> x;
cout << "Type one more number: ";
cin >> y;
sum = x + y;
cout << "Sum is: " << sum;
Data type declaration is required to restrict type of data to be stored. There are
three types of data in C++ as listed below:
53
MEMORY REQUIRED TO STORE DIFFERENT DATA TYPES:
INTEGER 4 BYTES
CHARACTER 1 BYTES
Operators are used for various types of operations on variables in C++. Operators
can be classified into different groups as written below:
This is one of the important data type defined in C++ libraries. String means
collection of characters or letters. If you want to use string in C++ program, then
define <string> header file first.
54
Example:
#include <iostream>
#include <string>
Int main()
return 0;
As you run above program, you will get on display “You are selected in STET”
Concatenation of Strings
The + operator is used between strings to add them and make a new string. This is
called concatenation of string.
55
int a = 30;
int b = 20;
string a = "10";
string b = "20";
cout << "The length of given string is: " << [Link]();
In C++, <cmath> library, there are numerous functions that are used to perform
various mathematical operations. Some popular functions are SQRT, ROUND,
LOG etc.
C++ Conditions
C++ supports numerous logical conditions like <,>, =>, <=, == etc. Four common
conditions that are used in C++ are as below:
1. If
56
2. Else
3. Else If
4. Switch
} else {
Because 24 is more than 15 as well as 22, then output will be Good Day.
C++ Switch
int mon = 4;
switch (mon) {
case 1:
break;
57
case 2:
break;
case 3:
break;
case 4:
break;
This statement is used execute block that meets any pre-written condition.
int i = 1;
while (i < 6)
{
cout << i << "\n";
i++;
}
This program will print from 1 to 6 and every time, it will go to new line as \n is
used.
58
BREAK statement in C++ is used to jump out of SWITCH statement as well as
loop.
C++ Arrays
Array is used to store many values in a single variable. Square bracket is used to
declare an array. Example of array declaration:
// This program will print names of days in new line start from 0 till 3 as written
below
0 mon
1 tue
2 wed
3 thrus
C++ Pointers
This is a type of variable that stores address of some other variable. It is declared
as type *var-name; or Int *Name;
59
How to use in program pointer in program?
string* ptr = &food; // A pointer variable of name ptr, that stores the address of
food item
C++ Functions
Functions are blocks of code and execute whenever any required condition is met.
Data is passed through parameters in C++ functions. This is useful because
program needs to write code once and it is called wherever required. Functions are
predefined and it can be user defined too. Function can be defined using
parenthesis as well as colon. VOID means function does not have any value to
return you.
void myFunction() {
int main() {
return 0;
60
C++ Class
Class works as building block in C++ program and it establishes object oriented
programming. Object of class is considered its instance. When objects are created,
they inherit all variables and functions of that class.
};
int main() {
[Link] = 15;
return 0;
61
}
C++ Constructor
};
C++ Encapsulation
Encapsulation is an act to hide data from users. To achieve this privacy, class
variable is kept as private (it means variable can’t be accessed from outside). Get
and Set methods are used to read values of private variables.
62
class Worker {
private:
// Private attribute
int salary;
public:
void setSalary(int s) {
salary = s;
int getSalary() {
return salary;
};
C++ Inheritance
// Base class
Class Automobile {
63
Public:
void honk() {
};
public:
};
64
DBMS/SQL
1 Which one from below expresses the number of entities with which another
entity can be associated?
a) Mapping Cardinality
c) Instant Constraints
d) None
Answer: A
a) Stack
b) Data Structure
c) Linked list
d) Query
Answer: D
3 Which one from below is a special type of integrity constraint that relates two
relations?
a) Entity Constraints
65
b) Referential Constraints
c) Linked Constraints
d) Domain Constraints
Answer: B
d) None of above
Answer C
a) Prime Key
b) Primary Key
c) Composite Key
d) Foreign Key
Answer: D
a) Relational algebra
66
b) Arithmetic algebra
c) Both
d) None
Answer: C
7 In DBMS, for any query processing, which one is the lowest-level operator to
access data.
a) Syntax Search
b) Linear search
c) File scan
d) Access paths
Answer: C
a) Selection operation
b) Generalized selection
c) Primitive operation
d) Projection operation
Answer: D
67
9 Database is to DBMS as Boat is for
a) Pond
b) Desert
c) Farmland
d) None
Answer: A
a) Encryption key
b) Decryption key
c) Primary key
d) Authorised key
Answer: B
11 Which one from the below written encryption key is used to encrypt and
decrypt the data?
a) Public key
b) Private key
c) Symmetric key
d) Asymmetric key
68
Answer: C
12 Which SQL Query is used to delete a table and all its data from the database?
a) Create Table
b) Alter Table
c) Drop Table
d) None of these
Answer: C
13 Which one from below written requires no password travel across the internet?
a) Readable system
b) Manipulation system
c) Challenge–response system
d) Response system
Answer: C
a) Left to Left
b) Left to Right
69
c) Right to Right
d) Right to Left
Answer:
15 Which one from the below written provides the ability to query information
from the database and take various actions on the database?
c) Query
d) Relational Schema
Answer: A
16 To remove a relation from SQL database record, we will use the ______
command.
a) Delete
b) Purge
c) Remove
d) Drop table
Answer: D
70
17 Which one from below is used for manipulation of database records?
a) Query
b) DML
c) Relational
d) DDL
Answer: B
a) Facilitate data
b) Functional data
c) Facilitate dependency
d) Functional dependency
Answer: D
19 In SQL the spaces at the end of the string are removed by which function.
a) Upper
b) String
c) Trim
d) Lower
Answer: C
71
20 Which operator is used for appending two strings?
a) &
b) %
c) ||
d) _
Answer: C
a) Candidate key
b) Primary key
c) Foreign key
d) All of these
Answer: D
a) Different
b) Common
c) All
d) Repeating
72
Answer: B
a) First
b) Second
c) Third
d) Fourth
Answer: B
24 If we want to save all duplicates, we must write which one from below in place
of union.
a) Union all
b) Union some
c) Intersect all
d) Intersect some
Answer: A
a) Cardinality
b) Degree
73
c) Tuples
d) Entity
Answer: B
26 Which one from below written clause is an additional filter that is applied to the
result.
a) Select
b) Group-by
c) Having
d) Order by
Answer: C
a) Like Predicate
b) Null Predicate
c) In Predicate
d) Out Predicate
Answer: A
74
a) Tables
b) Fields
c) Records
d) Keys
Answer: A
a) Column
b) Key
c) Row
d) Entry
Answer: C
a) Attribute
b) Tuple
c) Field
d) Instance
Answer: B
75
31 The term attribute refers to which one from below:
a) Record
b) Column
c) Tuple
d) Key
Answer: B
32 For every attribute in a relation, there will be a set of permitted values known as
________ of that attribute.
a) Domain
b) Relation
c) Set
d) Schema
Answer: A
a) Different
b) Indivisbile
c) Constant
d) Divisible
76
Answer: B
a) Any
b) Same
c) Sorted
d) Constant
Answer: A
35 The subset of any super key is a candidate key under which condition?
Answer: A
a) Table
b) Schema
c) Relation
d) None of these
77
Answer: B
37 Which one from the below attribute can be considered as a primary key?
a) Name
b) Street
c) Id
d) Department
Answer: C
a) Id
b) Register number
c) Dept_id
d) Street
Answer: D
Answer: D
40 Which one from below is the one in which the primary key of one relation is
used as a normal attribute in another relation.
a) Referential relation
b) Referencing relation
c) Referenced relation
d) Referred relation
Answer: C
a) Physical Level
b) Critical Level
c) Logical Level
d) View Level
Answer: B
79
42 Using which one from below language can user request information from a
database?
a) Query
b) Relational
c) Structural
d) Compiler
Answer: A
c) Data isolation
Answer: D
c) Relational algebra
d) Query language
80
Answer: C
45 Which operation from below allows the combining of two relations by merging
pairs of tuples, one from each relation, into a single tuple.
a) Select
b) Join
c) Union
d) Intersection
Answer: B
a) Union
b) Join
c) Product
d) Intersect
Answer: A
47 Commonly used operation in any relational algebra for projecting a set of tuple
from a relation is
a) Join
b) Projection
81
c) Select
d) Union
Answer: C
48 which operator takes the results of two queries and returns only rows that is
common on both result sets.
a) Union
b) Intersect
c) Difference
d) Projection
Answer: B
49 Which one from below is a pictorial depiction of the schema of any database
that shows the relations in the database, their attributes, and primary keys and
foreign keys?
a) Schema diagram
b) Relational algebra
c) Database diagram
d) Schema flow
Answer: A
82
51 To remove a relation from an SQL database, we use which command.
a) Delete
b) Purge
c) Remove
d) Drop table
Answer: D
a) Integrity constraints
b) Transaction control
c) Authorization
d) DDL constraints
Answer: A
a) First
b) Second
c) Third
d) Fourth
Answer: A
83
54 A database table on the many side of a one to many or many to many
relationship must be:
Answer: D
d) Have all non key fields depend on the whole primary key
Answer: A
56 Functional Dependencies are the types of which constraints that are based on….
a) Key
b) Key revisited
c) Superset key
84
Answer: A
57 Which normal form simplifies and ensures that there are minimal data
aggregates and repetitive groups:
a) 1NF
b) 2NF
c) 3NF
Answer: C
58 Which normal form has a relation that possesses data with an individual entity?
a) 2NF
b) 3NF
c) 4NF
d) 5NF
Answer: C
a) 1NF
b) 2NF
85
c) 3NF
d) 4NF
Answer: C
a) 4 NF
b) 3 NF
c) 2 NF
Answer: A
a) Functional dependency
b) Equality-generating dependencies
c) Multivalued dependencies
d) Non-functional dependency
Answer: C
86
62 Which of the below written normal form is based on the multi-valued
dependencies?
a) First
b) Second
c) Third
d) Fourth
Answer: D
63 Which normal form has a relation that possesses data about individual entity?
a) 2NF
b) 3NF
c) 4NF
d) 5NF
Answer: C
a) Functional dependency
b) Multivalued dependency
c) Join dependency
d) Domain-key
87
Answer: C
Answer: C
c) Relational scheme
d) Functional dependencies
Answer: D
a) Entity sets
b) Attributes
c) Database
d) Tables
88
Answer: A
68 Which one from below has each related entity set has its own schema and there
is an additional schema for the relationship set?
Answer: A
a) Relational-and
b) Concatenation
c) Dot representation
Answer: B
70 _______ of course data gives the values of table attributes, like title and
department, of all courses at any point in time.
a) Instance
b) Snapshot
89
c) Both Instance and Snapshot
Answer: B
a) Tables
b) Fields
c) Records
d) Keys
Answer: A
a) Column
b) Key
c) Row
d) Entry
Answer: C
a) Attribute
90
b) Tuple
c) Field
d) Instance
Answer: B
a) Record
b) Column
c) Tuple
d) Key
Answer: B
a) Domain
b) Relation
c) Set
d) Schema
Answer: A
91
76 Which of the below written is not a Storage Manager Component?
a) Transaction Manager
b) Logical Manager
c) Buffer Manager
d) File Manager
Answer: B
a) Different
b) Indivisbile
c) Constant
d) Divisible
Answer: B
a) Any
b) Same
c) Sorted
d) Constant
Answer: A
92
79 Which term is often used to refer to a row?
a) Attribute
b) Tuple
c) Field
d) Instance
Answer: B
c) Relational scheme
d) Functional dependencies
Answer: D
81 Consider attributes namely ID, CITY and NAME. Which one of this can be
taken as a super key?
a) NAME
b) ID
c) CITY
d) CITY, ID
93
Answer: B
Answer: A
83 Which one is a property of the entire relation, rather than any individual tuple in
which each tuple is unique?
a) Rows
b) Key
c) Attribute
d) Fields
Answer: B
a) Name
b) Street
94
c) Id
d) Department
Answer: C
a) Id
b) Register number
c) Dept_id
d) Street
Answer: D
86 Any attribute in relation is a foreign key if the _______ key from one relation is
used as attribute in that relation.
a) Candidate
b) Primary
c) Super
d) Sub
Answer: B
87 The relation which has the attribute as a primary key is known as:
95
a) Referential relation
b) Referencing relation
c) Referenced relation
d) Referred relation
Answer: B
88 Which one from below is the primary key of one relation is used as a normal
attribute in another relation.
a) Referential relation
b) Referencing relation
c) Referenced relation
d) Referred relation
Answer: C
d) None
Answer: A
96
90 Which one from below written is a physical storage media?
a) Tape Storage
b) Optical Storage
c) Flash memory
Answer: D
a) Cache
b) Disk
c) Main memory
d) Flash memory
Answer: A
92 Which one from below stores several gigabytes of data but usually lost when
power failure?
a) Flash memory
b) Disk
c) Main memory
d) Secondary memory
97
Answer: C
a) NOR Flash
b) OR Flash
c) AND Flash
Answer: A
a) Flash memory
b) Disk
c) Main memory
d) Secondary memory
Answer: A
95 Which one from below is the cheapest memory device in terms of costs?
a) Semiconductor memory
98
b) Magnetic disks
c) Compact disks
d) Magnetic tapes
Answer: C
96 The primary medium for the long-term online storage of data is which one?
a) Semiconductor memory
b) Magnetic disks
c) Compact disks
d) Magnetic tapes
Answer: B
a) Transaction Manager
b) Logical Manager
c) Buffer Manager
d) File Manager
Answer: B
99
98 There are “record-once” type of the compact disk and digital video disk, which
can be written only once; such disks are also known as.
b) CD-R
c) DVD-W
d) CD-ROM
Answer: A
a) Direct-access
b) Random-access
c) Sequential-access
Answer: C
100 Which one from below written gives a logical structure of the database
graphically?
a) Entity-relationship diagram
b) Entity diagram
c) Database diagram
d) Architectural representation
100
Answer: A
101 The entity relationship set is represented in E-R diagram as which one from
below:
a) Double diamonds
b) Undivided rectangles
c) Dashed lines
d) Diamond
Answer: D
102 A Rectangles divided into two parts represents which one from below:
a) Entity set
b) Relationship set
d) Primary key
Answer: A
103 We indicate roles in E-R diagrams by labeling the lines that connect which one
101
c) Rectangle & rectangle
Answer: D
104 An entity set that does not have sufficient attributes to form a primary key is
known as:
b) Variant set
d) Variable set
Answer: C
105 For weak entity to be meaningful, it should be associated with another entity
set, known as:
a) Identifying set
b) Owner set
c) Neighbour set
Answer: A
102
106 Weak entity set is also known as
a) Underline
b) Double line
c) Double diamond
d) Double rectangle
Answer: C
107 If you are collecting and storing information of music collection, an album
would be considered in __?
a) Relation
b) Entity
c) Instance
d) Attribute
Answer: B
108 What term will be used to refer to a specific record in music database; for
instance; information stored about any specific album?
a) Relation
b) Instance
c) Table
d) Column
103
Answer: B
109 Which one from the below has each related entity set has its own schema and
there is an additional schema for the relationship set.
Answer: A
a) Relational-and
b) Concatenation
c) Dot representation
Answer: B
111 Designers use which one from below to tune the performance of systems to
support time-critical operations?
a) Denormalization
104
b) Redundant optimization
c) Optimization
d) Realization
Answer: A
112 The normal form which complies with multivalued dependencies and which is
in BCNF is
a) 4 NF
b) 3 NF
c) 2 NF
Answer: A
a) Functional dependency
b) Equality-generating dependencies
c) Multivalued dependencies
d) Non-functional dependency
Answer: C
105
114 Which one from below normal form is based on multivalued dependencies?
a) First
b) Second
c) Third
d) Fourth
Answer: D
115 Which of the below written normal form has a relation that possesses data
about any individual entity?
a) 2NF
b) 3NF
c) 4NF
d) 5NF
Answer: C
116 Which one of the below written has each related entity set has its own schema
and there is an additional schema for the relationship set?
106
Answer: A
a) Functional dependency
b) Multivalued dependency
c) Join dependency
d) Domain-key
Answer: C
Answer: C
119 Which one from below level of RAID refers to disk mirroring with block
striping?
a) RAID level 1
b) RAID level 2
107
c) RAID level 0
d) RAID level 3
Answer: A
a) Helical scanning
b) DAT
c) A laser beam
d) RAID
Answer: D
121 With multiple disks, we can improve the transfer rate by which one?
a) Striping
b) Dividing
c) Mirroring
d) Dividing
Answer: A
Answer: D
a) High availability
b) Low availability
c) High reliability
d) High durability
Answer: A
a) Boot crash
b) Read failure
c) Transaction failure
Answer: C
b) Boot error
c) Logical error
Answer: C
a) Database Schema
b) Physical Schema
c) Critical Schema
d) Logical Schema
Answer: C
c) Query Language
Answer: D
110
128 The database is partitioned into fixed-length storage units that is called
a) Parts
b) Blocks
c) Reads
d) Build
Answer: B
a) Bug in software
c) Hardware malfunction
Answer: D
130 Which one from below written is true for Seeheim model?
Answer: A
111
131 Which one of the below unit operation is used in Model view controller?
a) Is a Decomposition
Answer: B
a) Network Maintenance
b) Routine Maintenance
c) Schema Definition
133 Which layer provides a high-level view of data and actions on data?
a) Business logic
b) Presentation
c) User interaction
d) Data access
112
Answer: A
134 Which system is widely used for mapping from Java objects to relation?
a) Hibernate
b) Object oriented
c) Objective
Answer: A
Answer: D
136 Bitmap indices is specialized type of index designed for easy querying on
which one?
a) Bit values
b) Binary digits
c) Multiple keys
113
d) Single keys
Answer: C
137 Which one on the attribute A of relation r consists of one bitmap for each
value that A can take.
a) Bitmap index
b) Bitmap
c) Index
d) Array
Answer: A
a) Existence bitmap
b) Current bitmap
c) Final bitmap
d) Deleted bitmap
Answer: A
a) Database administrator
114
b) Database ample
c) Database analytics
d) None
Answer: A
a) Tablespace
b) Segments
c) Extents
d) Blocks
Answer: B
141 Indices whose search key specifies an order different from the sequential order
of the file is known as ___________ indice.
a) Nonclustered
b) Secondary
Answer: C
115
142 Which of the below written is a Data Model?
a) E-R model
Answer: D
143 What term is known for a specific record in music database; for instance;
information stored about any specific album?
a) Relation
b) Instance
c) Table
d) Column
Answer: B
a) Relation
b) Attribute
c) Tuple
d) Domain
116
145 Which is a reasonable way to represent the attributes in a large database?
a) Relational-and
b) Concatenation
c) Dot representation
Answer: B
146 Which of the below written represents a relationship among set of values?
a) A Row
b) A Table
c) A Field
d) A Column
147 The normal form that satisfies multivalued dependencies and which is also in
the BCNF is
a) 4 NF
b) 3 NF
c) 2 NF
d) None
Answer: A
117
148 Which one from below is a tuple-generating dependency?
a) Functional dependency
b) Equality-generating dependencies
c) Multivalued dependencies
d) Non-functional dependency
Answer: C
149 Which one of the below written normal form is based on multivalued
dependencies?
a) First
b) Second
c) Third
d) Fourth
Answer: D
(a)Commit
(b)Summit
(c)Culprit
(d)Bollit
118
Answer: A
151 Which one from below written comes under DCL command list?
[Link]
[Link]
[Link] Into
[Link]
Answer: B
152 Which command from below can be used to remove data from database?
a Drop
b Delete
c Truncate
Answer: D
[Link] file
[Link] record
[Link]
119
[Link]
Answer: B
[Link]
[Link]
[Link]
[Link]
Answer: A
[Link] level
[Link] level
[Link] level
[Link] level
Answer: B
Answer: D
[Link]
[Link]
[Link]
[Link]
Answer: B
158. If a relation schema is in BCNF then it may or may not be in which one?
a.1NF
b.2NF
c.3NF
d.4NF
Answer: D
121
[Link] manipulation language
Answer: A
[Link]
[Link]
[Link]
[Link]
Answer: C
a) Relation
b) Attribute
c) Tuple
d) Domain
Answer: A
122
[Link] is function of statement “Inner Join” in SQL?
[Link] will return all values from left table and matching values from right table
[Link] will return all values from right table and matching values from left table.
[Link]
Answer: C
[Link] key
[Link] key
[Link] of these
Answer: C
[Link]
[Link]
[Link] Structure
[Link]
Answer: A
123
[Link] is the meaning of ACID in database operation?
Answer: A
[Link] any one-to-many relationship in the table on the side of 'many' will be
called?
[Link]
[Link]
[Link]
[Link]
Answer: A
[Link]
[Link]
[Link]
[Link]
124
Answer: A
[Link] any database, multiple tables are often linked to maintain what?
[Link] entry
[Link] integrity
Answer: B
a) Select
b) Union
c) Rename
Answer: D
a. Tables
b. Queries
c. Relationship
125
d. Reports
Answer: C
[Link]
[Link] language
[Link]
[Link]
Answer: A
a. 2NF
b. 3NF
c. 4NF
d. 5NF
126
Answer: B
174. Which Normal form is also called Project Join normal form?
a. 2NF
b. 3NF
c. 4NF
d. 5NF
Answer: D
a. DDL
b. DML
c. DCL
d. PPL
Answer: A
a. Relation
b. Tuple
c. Attribute
127
d. Degree
Answer: B
d. None
Answer: A
a) Table
b) Relation
c) Attributes
d) Domain
a. Kybase
b. Mybase
c. Sybase
128
d. Thybase
Answer: C
a) Deletion
b) Insertion
c) Sorting
d) Updating
Answer: C
[Link]
Answer: A
a) Schema keys
b) Candidate keys
129
c) Domain keys
d) Attribute keys
Answer: D
130
NETWORKING
a) RFC
b) CSS
c) IDS
d) DMC
Answer: A
2 In which type of connection, more than two devices can share a single link.
a) Point-to-point
b) Primary
c) Multi-point
d) Secondary
Answer: C
a) Syntax
b) Semantics
c) Struct
131
d) Formatting
Answer: A
Answer: C
a) CNNET
b) NSFNET
c) ASAPNET
d) ARPANET
Answer: D
Transmission?
a) Full-duplex
132
b) Half-duplex
c) Simplex
d) None of these
Answer: C
a) PC
b) Smartphones
c) Servers
d) Switch
Answer: D
8 In any network with 30 computers, which topology would require the most
a) Star
b) Mesh
c) Bus
d) None of these
Answer: B
133
9 Three or more devices share a link in which connection?
a) Unipoint
b) Multipoint
c) Point to point
d) Simplex
Answer: B
a) Star
b) Mesh
c) Bus
d) Ring
Answer: A
a) Protocol
b) Medium
c) Signal
134
12 Which of the following written computer networks is built on the top of another
network?
a) prior network
b) chief network
c) prime network
d) overlay network
Answer: D
Answer: D
14 Which of the below written organization has authority over interstate &
international commerce in the communications field?
a) ITU-T
b) IEEE
c) ISO
d) FCC
135
Answer: D
Answer: A
b) Protocol
c) Transmission
d) Message
Answer: D
a) protocol architecture
b) protocol stack
136
c) protocol suite
d) protocol system
Answer: B
Answer: A
a) Full-duplex
b) Simplex
c) Half-duplex
d) Half-Simplex
Answer: A
137
20 Communication between a computer and a keyboard involves which type of
transmission?
a) Automatic
b) Half-duplex
c) Full-duplex
d) Simplex
Answer: D
b) ISP
Answer: C
138
Answer: A
a) Performance
b) Reliability
c) Security
a) Fibre cable
b) Coaxial cable
Answer: C
25 Which of the below written statements is not applicable for cable internet
access?
b) It includes HFCs
139
d) Analog signal is converted to digital signal in DSLAM
Answer: D
a) Mesh
b) Star
c) Ring
d) Bus
b) Cable access
c) Telephone access
d) Satellite access
Answer: D
a) DSL
b) FTTP
140
c) Cable
Answer: D
b) HFC
c) Optical cable
Answer: C
c) Shadow fading
Answer: D
31What is number of layers that are present in the Internet protocol stack (TCP/IP
model)?
141
a) 5
b) 7
c) 6
d) 10
Answer: A
a) 5
b) 7
c) 6
d) 10
Answer: B
33 Which of the below written layer is an addition to OSI model when compared
with TCP IP model?
a) Application layer
b) Presentation layer
c) Session layer
Answer: D
142
34 Application layer is implemented in which one from below?
a) End system
b) NIC
c) Ethernet
d) Packet transport
Answer: A
a) End system
b) NIC
c) Ethernet
d) Signal transmission
Answer: A
a) Data compression
b) Data encryption
c) Data description
143
Answer: D
a) Application layer
b) Session layer
c) Transport layer
d) Link layer
Answer: B
38 Which of the below written networks extends a private network across public
network?
Answer: B
a) broadcast network
b) unicast network
144
c) multicast network
d) anycast network
Answer: A
40 In the OSI model, as a data packet moves from the lower to the upper layers,
what happens to adder?
a) Added
b) Removed
c) Rearranged
d) Randomized
Answer: B
a) computer network
b) distributed system
c) networking system
d) mail system
Answer: B
145
42 Transmission data rate is decided by which layer?
a) network layer
b) physical layer
d) transport layer
Answer: B
a) application layer
b) session layer
c) presentation layer
d) physical layer
Answer: A
44 Which of the below written address is used to identify a process on a host by the
transport layer?
a) physical address
b) logical address
c) port address
d) specific address
146
Answer: C
45 Which of the below written layer is responsible for process to process delivery
in general network model?
a) network layer
b) transport layer
c) session layer
Answer: B
a) prior to
b) after
c) simultaneous to
d) with no link to
Answer: A
47 Which one from below is the physical path over which a messages travel?
a) Path
b) Medium
c) Protocol
147
d) Route
Answer: B
48 Which of the below written layer is used to link the network support layers and
user support layers?
a) session layer
c) transport layer
d) network layer
Answer: C
49 TCP/IP model does not have that layer but OSI model have that layer.
a) session layer
b) transport layer
c) application layer
d) network layer
Answer: A
a) 4
148
b) 5
c) 6
d) 7
Answer: D
a) bit-by-bit delivery
Answer: A
53 Which transmission media provides the highest transfer speed in any network?
a) coaxial cable
c) optical fiber
d) electrical cable
Answer: C
149
54 Bits can be sent over guided and unguided media as analog signal using which
one?
a) digital modulation
b) amplitude modulation
c) frequency modulation
d) phase modulation
Answer: A
a) Automatic
b) Half-duplex
c) Full-duplex
d) Simplex
Answer: D
150
Answer: D
b) flow control
Answer: C
a) line coding
b) channel coding
c) modulation
Answer: D
59 The physical layer translates logical communication requests from which layer
into hardware specific operations.
151
b) network layer
c) trasnport layer
d) application layer
Answer: A
a) analog modulation
b) digital modulation
c) multiplexing
d) phase modulation
Answer: C
61 Wireless transmission of signals can be done via which one from below?
a) radio waves
b) microwaves
c) infrared
Answer: D
Answer: A
63 Which of the following written tasks is not done by data link layer?
a) framing
b) error control
c) flow control
d) channel coding
Answer: D
a) Half-duplex
b) Full-duplex
c) Simplex
d) Automatic
153
65 Header of a frame generally contains which one from below:
a) synchronization bytes
b) addresses
c) frame identifier
Answer: D
Answer: A
67 When two or more bits in a data unit has been changed during the transmission,
the error is known as
a) random error
b) burst error
c) inverted error
d) double error
154
Answer: B
Answer: A
a) ethernet
c) hdlc
Answer: D
a) Multi-point
b) Point-to-Point
c) Primary
155
d) Secondary
Answer: B
a. Mesh
b. Star
c. Primary
d. Bus
Answer: D
a) bits
b) frames
c) packets
d) bytes
Answer: C
a) routing
b) inter-networking
156
c) congestion control
d) error control
Answer: D
Answer: C
b) a short VC number
Answer: B
76 Which of the below written routing algorithms can be used for network layer
design?
157
a) shortest path algorithm
Answer: D
Answer: C
78 A subset of a network that includes all the routers but contains no loops is
known as?
a) spanning tree
b) spider structure
c) spider tree
d) special tree
158
Answer: A
79 Which one from below written algorithm is not used for congestion control?
b) admission control
c) load shedding
Answer: D
a) ethernet
b) internet protocol
Answer: B
b) addressing
c) forwarding
d) routing
159
Answer: A
82 Transport layer aggregates data from different applications into a single stream
before passing it to which one?
a) network layer
c) application layer
d) physical layer
Answer: A
Answer: C
a) Physical
b) Transport
160
c) None of the above
d) Data link
Answer: A
a) is a connection-oriented protocol
Answer: D
a) socket
b) pipe
c) port
d) machine
Answer: A
161
87 The physical layer is concerned with which transmission over the physical
medium.
a. Programs
b. Protocols
c. Bits
d. Dialog
Answer: C
88 Which one from the below written is a version of UDP with congestion control?
Answer: A
a) port
b) pipe
c) node
d) protocol
162
Answer: A
Answer: B
Answer: A
92 Which of the below written protocol delay is faced by the packet in travelling
from one end system to another?
a) Propagation delay
b) Queuing delay
c) Transmission delay
163
d) All of the mentioned
Answer: D
a) Data link
b) Physical
c) Application
d) Transport
Answer: C
94 The time needed to check the packet’s header and determine where to direct the
packet is part of which one?
a) Processing delay
b) Queuing delay
c) Transmission delay
d) Propagation delay
Answer: A
95 When data packet moves from lower to upper layers, what happens to header?
a) Added
164
b) Rearranged
c) Modified
d) Subtracted
96 Which layer lies between the network layer and the application layer.
a) Data link
b) Physical
c) Transport
Answer: C
a) Data link
b) Network
c) Transport
165
99 In any network, If P is the only packet that is being transmitted and there was
no earlier transmission, which of the below written delays could be zero?
a) Propagation delay
b) Queuing delay
c) Transmission delay
d) Processing delay
Answer: B
100 Transmission delay does not depend on which one from below:
a) Packet length
c) Transmission rate
d) Bandwidth of medium
Answer: B
a) Packet length
b) Transmission rate
166
Answer: C
102 The sharing of any medium and its link by two or more devices is known as:
a) Fully duplexing
b) Multiplexing
c) Micropleixng
d) Duplexing
Answer: B
a) Packet switching
b) Circuit switching
c) Data switching
Answer: B
104 Which one from below multiplexing technique used to transmission of digital
signals?
a) FDM
b) TDM
c) WDM
167
d) FDM & WDM
Answer: B
105 If there are n signal sources of same data rate, then the TDM link will be
having _______ slots.
a) n
b) n/2
c) n*2
d) 2n
Answer: A
106 What of the below written main function of the transport layer?
a) Process-to-process delivery
b) Node-to-node delivery
c) Synchronization
Answer: A
107 The state when dedicated signals are idle are known as:
a) Death period
168
b) Poison period
c) Silent period
d) Stop period
Answer: C
a) Efficiency
b) Privacy
c) Anti jamming
Answer: D
a) Remote log-in
c) Mail service
Answer: D
169
110 In TDM, slots are further divided into which one?
a) Seconds
b) Frames
c) Packets
d) Bits
Answer: B
a) Internet
b) Botnet
c) Telnet
d) D-net
Answer: B
a) Vulnerability attack
b) Bandwidth flooding
c) Connection flooding
Answer: D
170
113 The Internet model consists of how many layers?
a) Three
b) Five
c) Seven
d) Eight
Answer: B
114 The DoS attack, in which attacker sends deluge of packets to the targeted host
is known as
a) Vulnerability attack
b) Bandwidth flooding
c) Connection flooding
d) UDP flooding
Answer: B
a) Active receiver
b) Passive receiver
c) Legal receiver
d) Partially-active receiver
171
Answer: B
a) Wired environment
b) WiFi
c) Ethernet LAN
d) Switched network
Answer: D
a) UDP traffic
b) TCP traffic
c) Sensitive traffic
d) Best-effort traffic
Answer: A
118 Which layer is the layer closest to the main transmission medium.
a. Network
b. Physical
c. Data link
172
d. Transport
Answer: B
a) Topology
b) Routing
c) Networking
d) Control
Answer: A
a) Star
b) Mesh
c) Ring
d) Bus
Answer: A
a) Star
b) Mesh
173
c) Ring
d) Bus
Answer: D
122 Data communication system spanning states, countries, or the whole world is
one of the below written?
a) LAN
b) WAN
c) MAN
d) PAN
Answer: B
123 Data communication system within a building or campus is one of the below
written:
a) LAN
b) WAN
c) MAN
d) PAN
Answer: A
174
124 What is full form of WAN?
Answer: B
a) Seconds
b) Frames
c) Packets
d) Bits
Answer: B
126 Which one of the below written multiplexing technique that shifts each signal
to a different carrier frequency?
a) FDM
b) TDM
d) PDM
175
Answer: A
a) Packet switched
b) Circuit switched
c) Bit switched
d) Line switched
Answer: B
Answer: B
a) Seconds
b) Frames
c) Packets
d) Bits
176
Answer: B
130 Which are various methods to move data through a network of numerous links
and switches?
Answer: D
a) Internet
b) Botnet
c) Telnet
d) D-net
Answer: B
132 As the resources are reserved between two communicating systems in circuit
switching, which one is achieved?
a) authentication
177
b) guaranteed constant rate
c) reliability
Answer: B
a) packet switching
b) circuit switching
c) line switching
d) frequency switching
Answer: A
c) Mail service
d) Error control
Answer: D
178
135 A piece of icon or image on a web page associated with another webpage is
known as:
a) url
b) hyperlink
c) plugin
d) extension
Answer: B
Answer: B
179
Answer: D
c) stream videos
Answer: A
Answer: C
a) sent from a website and stored in user’s web browser while a user is browsing a
website
b) sent from user and stored in the server while a user is browsing a website
180
c) sent from root server to all servers
Answer: A
141 Which of the below written is not used to generate dynamic web pages?
a) PHP
b) [Link]
c) JSP
d) CSS
Answer: D
a) VBScript
b) [Link]
c) JSP
d) PHP
Answer: A
181
a) convention for representing and interacting with objects in html documents
d) scripting language
Answer: A
Answer: A
a) 4 bytes
b) 128 bits
c) 8 bytes
d) 100 bits
Answer: B
182
146 The header length of an IPv6 datagram is how much?
a) 10bytes
b) 25bytes
c) 30bytes
d) 40bytes
Answer: D
a) Vulnerability attack
b) Bandwidth flooding
c) Connection flooding
Answer: D
a) broadcast
b) multicast
c) anycast
d) unicast
Answer: A
183
149 Which among of the below written features is present in IPv6 but not in IPv4?
a) Fragmentation
b) Header checksum
c) Options
d) Anycast address
Answer: D
150 Which of the below written field determines the lifetime of IPv6 datagram
a) Hop limit
b) TTL
c) Next header
d) Type of traffic
Answer: A
184
Answer: C
c) both device that allows wireless gazettes to connect to a wired network and
wireless devices itself
Answer: A
Answer: A
156 Which multiple access technique from below is used by IEEE 802.11 standard
for wireless LAN?
a) CDMA
b) CSMA/CA
185
c) ALOHA
d) CSMA/CD
Answer: B
Answer: A
158 A wireless network interface controller can work in which of the below
written?
a) infrastructure mode
b) ad-hoc mode
d) WDS mode
Answer: C
186
159 In wireless network an extended service set is a set of which of the below
written?
b) all stations
Answer: A
Answer: B
161 Which of the below written event is not possible in wireless LAN?
a) collision detection
187
Answer: A
Answer: B
Answer: A
a) a single network
165 To join the internet, the computer has to be connected to a which of the below
written?
b) internet society
d) different computer
Answer: C
166 Internet access by transmitting digital data over the wires of a local telephone
network is provided by which of the below written?
a) leased line
Answer: B
167 ISP exchanges internet traffic between their networks through which of the
below written?
189
b) subscriber end point
Answer: A
a) HTTP
b) DHCP
c) DNS
Answer: D
a) 32 bits
b) 64 bits
c) 128 bits
d) 265 bits
Answer: C
b) circuit switching
d) data switching
Answer: A
171 Which of the below written is not an application layer protocol used in
internet?
Answer: C
172 Which of the below written protocol assigns IP address to the client connected
in the internet?
a) DHCP
b) IP
c) RPC
d) RSVP
191
Answer: A
173 Which one of the below written is not used in media access control?
a) ethernet
d) packet switching
Answer: D
174 Which one of the below written is not used in media access control?
a) ethernet
d) packet switching
Answer: C
Answer: A
a) 100 ft
b) 200 ft
c) 100 m
d) 200 m
Answer: C
a) 10 mbps
b) 100 mbps
c) 1000 mbps
d) 10000 mbps
Answer: B
a) BNC
193
b) RJ-11
c) RJ-45
d) RJ-69
Answer: C
a) STP server
b) Hub/switch
c) PDC
d) Router
Answer: B
182 What is the maximum possible data transfer rate for optical fiber cable?
a) 10 mbps
b) 100 mbps
c) 1000 mbps
d) 10000 mbps
Answer: C
183 Which of the below written architecture uses CSMA/CD access method?
194
a) ARC net
b) Ethernet
c) Router
d) STP server
195
DATA STRUCTURE
Answer: B
2 Which of the below written data structure allows deletion from front and
insertion from rear side?
a)QUEUES
b)STACK
c)Linked List
d) Binary Tree
Answer: A
a) Binary trees
b) Scheduling of processes
196
c) Caching
d) Spatial locality
Answer: D
4 Which of the below written data structure permits deletion at both end but
insertion at one end
a) Priototy Queue
d) None of these
Answer: C
a)string
b)List
c)Stack
d)None of these
Answer: D
197
a) 15
b) 19
c) 11
d) 60
Answer: D
a) Deque
b) Linked List
c) Tree
d) Array
Answer: C
a) randomly
b) sequentially
c) exponentially
d) logarithmically
Answer: A
198
9 In which of the below written binary tree, there is either zero or two children per
node
d) none of these
Answer: A
a) Create
b) Push
c) Evaluation
d) Pop
Answer: D
a) Recursive
b) Sub Algo
c) POlish
d) Traversal
199
Answer: A
12 Pushing any element into stack data structure already having five elements and
stack size of 5, then stack becomes which of the below written?
a) Overflow
b) Crash
c) Underflow
d) User flow
Answer: A
a) tree graph
b) free tree
c) tree
Answer: D
200
d) Data Transfer between two asynchronous process
Answer: D
15 Which of the below written case does not exist in the complexity theory?
a) Null case
b) Worst Case
c) Average Case
d) Best Case
Answer: A
a) Stack
b) Queue
c) Array
d) Tree
Answer: A
201
b) processor and memory
Answer: C
a) Heap
b) Binary Tree
c) Array
d) Stack
Answer: D
19 For linear search algorithm system, when does worst case happens?
Answer: D
202
20 Which of the below written data structure is used for implementing recursion?
a) Queue
b) Stack
c) Array
d) List
Answer: B
Answer: A
a) Reversing a string
c) Implementation of recursion
d) Job scheduling
203
Answer: D
23 The type of expression in which of the below written operator succeeds its
operands is?
a) Infix Expression
b) Prefix Expression
c) Postfix Expression
Answer: C
24 Which of the below written data structure is not suitable for non-homogenous
data elements?
a) Pointer
b) Array
c) Stack
d) Linked List
Answer: B
25 The data structure required for Breadth First Traversal on any graph is which of
the below written?
a) Stack
b) Array
204
c) Queue
d) Tree
Answer: C
c) Ordered array
d) Linear tree
Answer: A
a) Ring Buffer
b) Square Buffer
c) Rectangle Buffer
d) Curve Buffer
Answer: A
205
a) Queue
b) Circular queue
c) Dequeue
d) Priority queue
Answer: C
a) Simulation of recursion
Answer: C
a) Ordinary queue
c) Circular queue
d) Priority queue
Answer: B
206
31 A linear collection of which of the below written data elements where the linear
node is given by means of pointer is called?
a) Linked list
b) Node list
c) Primitive list
d) Unordered list
Answer: A
a) Binary tree
b) Array
c) Pointer
d) Linked list
Answer: A
34 For breadth first search option, we use which type of data structure?
a) Queue
b) Stack
c) Array
d) Tree
207
Answer: A
35 Linked lists are not suitable to for the implementation of which of the below
written?
a) Insertion sort
b) Radix sort
c) Polynomial manipulation
d) Binary search
Answer: D
a) Dynamic
b) Static
c) Compile time
d) Heap
Answer: A
a) Data
b) Link
208
c) Data and Link
d) Node
Answer: B
a) Computational Time
b) Space Utilization
d) Speed Utilization
Answer: C
39 Which of the below written data structure comes in the linear type?
a) Stack
b) Tree
c) Binary Tree
d) Linked List
40 Which of the below written sorting algorithms can be used to sort a random
linked list with minimum time complexity?
209
a) Insertion Sort
b) Quick Sort
c) Heap Sort
d) Merge Sort
Answer: D
a) Insertion sort
b) Bubble sort
c) Merge sort
d) Heap sort
a) Fixed size
b) There are chances of waste of memory space if elements inserted in an array are
lesser than the allocated size
Answer: D
210
43 The data structure required to analyze whether an expression contains balanced
parenthesis is?
a) Stack
b) Queue
c) Array
d) Tree
Answer: A
44 What type of data structure would you mostly likely see in a non recursive
implementation of any recursive algorithm?
a) Linked List
b) Stack
c) Queue
d) Tree
Answer: B
45 The process of accessing any data stored in a serial access memory is similar to
manipulating data on which one from below?
a) Heap
b) Binary Tree
c) Array
d) Stack
211
Answer: D
a) Branch
b) Tree
c) Queue
d) Stack
Answer: D
47 Which of the below written data structure is used for implementing recursion?
a) Queue
b) Stack
c) Array
d) List
Answer: B
48 Which of the below written statement about stack data structure is not right?
212
c) Stack is the FIFO data structure
d) Null link is present in the last node at the bottom of the stack
Answer: C
a) Reversing a string
c) Implementation of recursion
d) Job scheduling
Answer: D
50 The type of expression in which operator succeeds its operands is known as?
a) Infix Expression
b) Prefix Expression
c) Postfix Expression
Answer: C
51 A linear list of elements in which deletion can be done from front end and
insertion can take place only at the rear end is known as?
213
a) Queue
b) Stack
c) Tree
d) Linked list
Answer: A
a) Stack
b) Array
c) Queue
d) Tree
Answer: C
c) Ordered array
d) Linear tree
Answer: A
214
54 Circular Queue is also known as which of the below written?
a) Ring Buffer
b) Square Buffer
c) Rectangle Buffer
d) Curve Buffer
Answer: A
55 A data structure in which elements can be inserted or deleted from both the ends
but not in the middle is known as?
a) Queue
b) Circular queue
c) Dequeue
d) Priority queue
Answer: C
a) Simulation of recursion
215
Answer: C
a) Ordinary queue
c) Circular queue
d) Priority queue
Answer: B
58 Linear collections of data elements where the linear node is given by means of
pointer are known as?
a) Linked list
b) Node list
c) Primitive list
d) Unordered list
Answer: A
59 In linked list data structure every node contain minimum of two field
information. One field is data field to store the data second field is?
a) Pointer to character
b) Pointer to integer
216
c) Pointer to node
d) Node
Answer: C
a) Travesal
b) Insertion
c) Deletion
d) Retrival
Answer: A
a) Array
b) List
c) Heap
d) Tree
Answer: D
a) Huffman codes
217
b) Interrupt handling in operating system
Answer: C
a) A low priority process might have to wait indefinitely for the CPU
c) Interrupt handling
d) Indefinite blocking
Answer: C
a) Easy to implement
Answer: D
218
65 Which is the time complexity to insert any node based on position in a priority
queue?
a) O(nlogn)
b) O(logn)
c) O(n)
d) O(n2)
Answer: C
66 How many stacks are needed for applying evaluation of infix expression
algorithm?
a) one
b) two
c) three
d) four
Answer: B
67 What is total number of passes does the evaluation of infix expression algorithm
makes through the input?
a) One
b) Two
c) Three
d) Four
219
Answer: A
a) Creation
b) Destruction
c) Selection
d) All above
Answer: D
Answer: B
70 Evaluate this statement using infix evaluation algorithm and select the correct
answer. 1+2*3-2
a) 3
220
b) 6
c) 5
d) 4
Answer: C
a) one
b) two
c) three
d) four
Answer: B
72 While evaluating any prefix expression, the string is read from which side?
a) left to right
b) right to left
c) center to right
Answer: B
b) precedence only
c) associativity only
Answer: A
Answer: B
76 Which of the below written bitwise operations will you use to set a particular bit
to 1?
a) OR
b) AND
c) XOR
d) NOR
Answer: A
222
77 Which of the below written bitwise operations will you use to set a particular bit
to 0?
a) OR
b) AND
c) XOR
d) NAND
Answer: B
78 Which of the below written bitwise operations will you use to toggle a
particular bit?
a) OR
b) AND
c) XOR
d) NOT
Answer: C
c) Can be stored and manipulated in the register set for long time period
223
d) Accessing Individual Elements is easy
Answer: D
c) Compressing bit array to byte/word array, the machine also has to support
byte/word addressing
d) Storing and Manipulating in the register set for long periods of time
Answer: D
c) Bloom filter
Answer: D
a) BitSet
224
b) BitVector
c) BitArray
d) BitStream
Answer: A
83 Which of the below written bitwise operator will you use to invert all the bits in
a bit array?
a) OR
b) NOT
c) XOR
d) NAND
Answer: B
84 Which of the below written hamming weight count mean in Bit array system?
Answer: A
225
85 Which of the below written operations returns the first occurrence of bit 1 in bit
arrays?
b) Find First On
Answer: B
Answer: B
87 If several elements are competing for the same bucket in any hash table, what it
will be called?
a) Diffusion
b) Replication
c) Collision
d) Duplication
226
Answer: C
Answer: A
Answer: B
Answer: C
a) Every element has equal chance of hashing into any of the slots
Answer: A
Answer: B
Answer: A
95 Which of the below written property does not hold for matrix multiplication?
a) Associative
b) Distributive
c) Commutative
d) Additive Inverse
Answer: C
a) Linked list
b) Linear Array
229
c) Binary Tree
d) None of these
Answer: B
b) Image processing
c) Graph theory
d) Sorting number
Answer: D
a) Internal complexity
d) Graph Plotting
Answer: D
100 A graph having an edge from every vertex to every other vertex is known as:
a) Tightly Connected
230
b) Strongly Connected
c) Weakly Connected
d) Loosely Connected
Answer: A
101 What will be the number for any unlabeled simple directed graph that can be
made with 1 or 2 vertices?
a) 2
b) 4
c) 5
d) 9
Answer: B
a) Straigh array
Answer: B
231
103 What will be the max possible number of edges in a directed graph with no
self loops having total 8 vertices?
a) 28
b) 64
c) 256
d) 56
Answer: D
104 What will be maximum number of edges present in simple directed graph with
7 vertices if there exists no cycles in that graph?
a) 21
b) 7
c) 6
d) 49
Answer: C
a) A queue with insert/delete defined for both front and rear ends
c) A queue that is implemented with both singly and doubly linked lists
232
Answer: A
Answer: D
107 How many child nodes every node of Ternary Tree contain?
a) 4
b) 6
c) 5
d) 3
Answer: D
108 Which of the below written is the name of the node having child nodes?
a) Brother
b) Sister
c) Mother
233
d) Parent
Answer: D
109 What is the depth of the root node of any ternary tree?
a) 2
b) 1
c) 0
d) 3
Answer: C
a) 1
b) 2
c) 3
d) 0
Answer: D
111 How many total extra nodes will be there in the full ternary tree than a
complete ternary tree?
a) 1
234
b) 2
c) 3
Answer: D
112 Which of the below written is the implementation of the ternary tree?
a) AVL Tree
b) Ternary Heap
c) Hash Table
d) Dictionary
Answer: B
Answer: C
b) Before Deletion
c) During Deletion
d) None
d) Binary trees
Answer: B
Answer: A
236
117 Which of the below written following property does not hold for matrix
multiplication?
a) Associative
b) Distributive
c) Commutative
d) Additive Inverse
Answer: C
a) O(n)
b) O(n2)
c) O(nlogn)
d) None
a) Stack
b) Tree
c) Graph
d) Array
237
Answer: A
b) Image processing
c) Graph theory
d) Sorting number
Answer: D
a) Linked List
b) Binary Tree
c) Linear Array
d) None of these
Answer: D
Answer: B
124 In general context, the index of the first element in an array is which of the
below written?
a) 0
b) -1
c) 2
d) 1
Answer: A
239
125 Process of inserting an element in stack is called which of the below:
a) Create
b) Push
c) Evaluation
d) Pop
Answer: B
126 In any stack, if user tries to remove any element from empty stack it will be
called?
a) Underflow
b) Empty collection
c) Overflow
d) Garbage Collection
Answer: A
127 Which data structure, you are likely see in a non recursive implementation of a
recursive algo?
a) Linked List
b) Stack
c) Queue
d) Tree
240
Answer: B
128 Which of the below written data structure is needed to convert infix notation to
postfix notation?
a) Branch
b) Tree
c) Queue
d) Stack
Answer: D
241
OPERATING SYSTEM
Answer: C
a) System calls
b) API
c) Library
d) Assembly instructions
Answer: A
a) The time taken by the dispatcher to stop one process and start some other
242
d) None of Above
4 Which of the below written error will be handle by the operating system?
a) power failure
Answer: D
a) New
b) Running
c) Ready
d) Finished
Answer: D
6 Through operating system, the resource management can be done using which
one from below:
243
b) space division multiplexing
Answer: C
7 Which are the requirements for the solution for the critical section problem?
a) Mutual Exclusion
b) Progress
c) Bounded Waiting
d) All of Above
a) Contiguous allocation
b) Linked allocation
c) Indexed allocation
a) VxWorks
b) Windows CE
244
c) RTLinux
d) Palm OS
Answer: D
a) monolithic kernel
b) hybrid kernel
c) microkernel
Answer: B
A. Use a protocol to make sure that the system will never enter a deadlock state.
B. Allow the system to enter the deadlock state and then recover.
Answer: D
a) fork
b) create
c) new
Answer: A
a) normal exit
b) fatal error
Answer: D
Answer: B
A) NTFS
B) BSD
C) EXT
Answer: D
247
18 A process stack does not contain which one?
a) Function parameters
b) Local variables
c) Return addresses
Answer: D
A) Manage Commands
B) Manage Users
C) Manage Programs
D) Manage Resources
Answer: D
A) Manage Commands
B) Manage Users
C) Manage Programs
D) Manage Resources
Answer: D
248
21 A Process Control Block (PCB) does not contain which of the following?
a) Code
b) Stack
c) Bootstrap program
d) Data
Answer: C
a) Output
b) Throughput
c) Efficiency
d) Capacity
Answer: B
249
C
a) New
b) Old
c) Waiting
d) Running
Answer: B
b) Data Structure
d) A Block in memory
Answer: B
26 The entry of all the PCBs of the current processes is known as:
a) Process Register
b) Program Counter
c) Process Table
d) Process Unit
250
Answer: C
Answer: D
28 A single thread of control allows the process to perform which one from below:
Answer: A
Answer: A
a) Job Queue
b) PCB queue
c) Device Queue
d) Ready Queue
Answer: B
D. None of Above
33 Which of the below written operating system reads and reacts in actual time?
A. I/O
B. Memory
C. CPU
253
b) It selects which process has to be executed next and allocates CPU
Answer: C
B. Storage allocation
C. Disk scheduling
b) Boot loader
c) Bootstrap loader
d) Relating loader
254
38 The only state transition that is initiated by the user process itself is known as
a) block
b) wakeup
c) dispatch
Answer: A
a) MS DOS
b) Windows 95
c) Windows 98
d) Windows 2000
255
Answer: C
a) Memory
b) Processes
42 The context of any process is in the PCB of process does not contain which
one?
c) memory-management information
Answer: D
43 Which of the below written need not necessarily be saved on a context switch
between processes?
256
b) Translation lookaside buffer
c) Program counter
Answer: B
a) A device
b) Timer
c) Scheduler process
d) Power failure
Answer: C
a) cooperating process
b) child process
c) parent process
d) init process
Answer: A
257
46 Operating system manages which one from below:
a) Memory
b) Processes
a) thread
b) pipe
c) semaphore
d) socket
Answer: C
Answer: A
258
50 Mutual exclusion can be provided which one from below
a) mutex locks
b) binary semaphores
Answer: C
a) [Link]
c) [Link]
d) [Link]
a) hardware level
b) software level
259
Answer: C
Answer: D
Answer: A
a) EXE
b) BAT
c) COM
56 A parent process calling which system call will be suspended until children
processes end.
a) wait
b) fork
c) exit
d) exec
Answer: A
a) Normally
b) Abnormally
c) Normally or abnormally
Answer: A
261
b) Device Queue
c) Process Identifier
Answer: C
Answer: A
62 The child process completes its execution, but the parent keeps executing until
the child process is called
a) Orphan
b) Zombie
c) Body
d) Dead
Answer: B
262
63 Which of the below written is not true?
a) kernel is the program that constitutes the central core of the operating system
b) kernel is the first part of any operating system to load in the memory during
booting.
c) kernel is made of various modules which can not be loaded in running operating
system
Answer: C
c) share data
Answer: A
65 Which of the below written two operations are provided by the IPC facility?
263
Answer: D
Answer: C
67 The link between two processes P and Q to send and receive messages is known
as:
a) communication link
b) message-passing link
c) synchronization link
Answer: A
68 Which of the below written is the main function of the command interpreter?
264
c) to handle the files in operating system
Answer: A
69 If any process fails, most operating system write the error information in which
one:
a) log file
c) new file
Answer: A
Answer: B
265
a) the queue can store at least one message
c) the sender keeps sending and the messages don’t wait in the queue
Answer: B
c) is referred to as a link
Answer: B
73 Bounded capacity & unbounded capacity queues are referred to as which one?
a) Programmed buffering
b) Automatic buffering
d) No buffering
Answer: B
74 The first program that is run when the computer is powered up is known as
266
a) boot program
b) bootloader
c) initializer
d) bootstrap program
Answer: D
Answer: B
Answer: B
267
77 What is full form of ISR?
Answer: C
Answer: A
Answer: A
268
80 The systems which allow only one process execution at a time is known as:
a) uniprogramming systems
b) uniprocessing systems
c) unitasking systems
Answer: B
Answer: A
269
Answer: A
84 Which of the below written system call returns the process identifier of any
terminated child?
a) wait
b) exit
c) fork
d) get
Answer: A
85 Which of the below written module gives control of the CPU to the process
selected by the short-term scheduler?
a) dispatcher
b) interrupt
c) scheduler
Answer: A
270
c) the activity to next be executed by the process
Answer: D
87 Interval from the time of submission of any process to the time of completion is
known as
a) waiting time
b) turnaround time
c) response time
d) throughput
Answer: B
88 Which scheduling algorithm from below written allocates the CPU first to the
process that requests the CPU first?
c) priority scheduling
Answer: A
271
89 What is right about priority scheduling algorithm?
Answer: A
90 In priority scheduling algorithm, when any process arrives at ready queue, its
priority is compared with the priority of which one?
a) all process
c) parent process
d) init process
Answer: B
272
Answer: B
Answer: D
Answer: A
c) process
a) multiprocessor systems
Answer: B
a) time
b) space
c) money
Answer: A
97 Which are the two steps from below written for any process execution?
Answer: B
Answer: C
a) When a process switches from the running state to the ready state
b) When a process goes from the running state to the waiting state
c) When a process switches from the waiting state to the ready state
Answer: B
101 The switching of the CPU from one process some other is known as:
a) process switch
b) task switch
275
c) context switch
Answer: D
b) the time of dispatching any process from running to ready state and CPU kept
idle
c) the time to stop one process and start running another one
Answer: C
Answer: A
276
a) increase the throughput
Answer: A
d) the total time from the completion till the submission of a process
Answer: D
d) the total time from the completion till the submission of a process
Answer: B
277
109 What is meaning of Response time?
a) total time taken from submission time till the completion time
b) total time taken from submission time till the start of response is produced
c) total time taken from submission time till the response is output
Answer: B
a) data consistency
b) data insecurity
c) data inconsistency
Answer: C
112 The segment of code in which the process can change some common
variables, update tables, write into files is called:
a) program
b) critical section
d) synchronizing
278
Answer: B
113 Which of the below written conditions must be satisfied to solve the critical
section problem?
a) Mutual Exclusion
b) Progress
c) Bounded Waiting
Answer: D
116 How many variables required to be shared between processes to solve the
critical section problem?
a) one
b) two
c) three
d) four
Answer: B
a) single
b) atomic
279
c) static
Answer:
c) integer variable
Answer:
121 Which are the two atomic operations permissible on the semaphore?
a) wait
b) stop
c) hold
Answer:
Answer:
Answer:
124 The wait operation of the semaphore basically works on which one?
a) stop()
b) block()
c) hold()
d) wait()
Answer:
b) it is invalid
Answer: A
127 Code that changes the value of the semaphore is which one?
Answer: C
128 What happens if a non-recursive mutex is locked more than one time?
a) Starvation
b) Deadlock
c) Aging
d) Signaling
Answer: B
282
129 What is meaning of semaphore?
a) is a binary mutex
Answer: C
Answer: B
a) is a binary mutex
283
Answer: B
a) 1
b) -1
c) 0.7
d) 0.5
Answer: A
a) System calls
b) IPC mechanisms
c) System protection
Answer: B
a) Mutual Exclusion
b) Bounded Waiting
c) Aging
d) Progress
284
Answer: B
Answer: c
Answer: B
a) that can be used by any one process at a time and is not depleted by that use
Answer: A
a) mutual exclusion
Answer: D
a) the system can allocate resources to each process in some order and still avoid a
deadlock
Answer: A
286
a) defining a linear ordering of resource types
b) using thread
c) using pipes
Answer: A
a) banker’s algorithm
b) round-robin algorithm
c) elevator algorithm
d) karn’s algorithm
Answer: A
a) in advance processes rarely know how many resource they will need
Answer: D
287
146 For proper effective operating system, when deadlock should be checked?
Answer: C
a) deadlock
b) starvation
c) inversion
d) aging
Answer: B
148 Which of the below written is a mathematical way to determine the deadlock
existence?
b) starvation graph
c) inversion graph
288
Answer: A
Answer: A
b) interrupts
c) system calls
d) special programs
Answer: C
Answer: B
153 For a deadlock to come up, which of the below written conditions must hold
simultaneously?
a) Mutual exclusion
b) No preemption condition
Answer: D
154 For mutual exclusion condition to prevail in the system, which is correct?
a) at least one resource of the system must be held in a non sharable mode
Answer: A
290
b) to ensure that all of the required conditions do not hold
Answer: A
157 For non sharable resources like a printer, what is meaning of mutual
exclusion?
a) must exist
c) may exist
Answer: A
a) is required
b) is not required
Answer: B
291
160 One way to ensure that the circular wait system never holds is to
____________
b) to never let a process acquire resources that are held by other processes
Answer: A
c) operating system
d) resources
Answer: A
b) the system can allocate various resources to each process in some order and still
avoid a deadlock
292
Answer: B
165 A system is in a safe state only if there exists which one from below:
a) safe allocation
b) safe resource
c) safe sequence
Answer: C
a) deadlocks
b) not deadlocks
c) fatal
Answer: B
167 If no cycle exists in the resource allocation graph then what is correct about
system?
293
c) all of the mentioned
Answer: B
168 The resource allocation graph will be not applicable to any resource allocation
system
Answer: A
a) less efficient
b) more efficient
c) equal
Answer: A
294
170 The data structures available in the Banker’s algorithm is which one from
below:
a) Available
b) Need
c) Allocation
Answer: D
a) Allocation-Available
b) Max-Available
c) Max-Allocation
d) Allocation-Max
Answer: C
172 The wait for graph is a deadlock detection algorithm which will be applicable
when
295
Answer: A
174 If the wait for graph contains a cycle then what is correct?
Answer: B
a) rarely
b) frequently
Answer: B
176 What will be the disadvantage of invoking the detection algorithm for every
request?
296
b) excessive time consumed in the request to be allocated memory
Answer: C
Answer: A
182 The two ways of aborting any processes and eliminating deadlocks are which
one?
Answer: C
297
183 Those processes should be denied on occurrence of a deadlock, the termination
of which?
Answer: B
184 The process to be aborted is chosen on the basis of which below factors?
Answer: D
c) Amount of time any deadlocked process has thus far consumed during its
execution
298
Answer: C
186 If we preempt any resource from any process, the process cannot continue
with its normal execution and it should be
a) aborted
b) rolled back
c) terminated
d) queued
Answer: B
187 To _______ to a safe state, the system requires to keep complete information
about the various states of processes.
Answer: B
188 If the resources are always preempted from the same process then what can
occur.
a) deadlock
299
b) system crash
c) aging
d) starvation
Answer: D
191 In which type of streaming option multimedia file is delivered to client, but not
shared?
a) real-time streaming
b) progressive download
c) compression
Answer: A
a) high storage
Answer: C
193 The delay that occurs during the playback of a stream is known as_____
300
a) stream delay
b) playback delay
c) jitter
d) event delay
Answer: C
Answer: D
Answer: D
301
196 Which of the below written resource is not necessarily required on a file
server?
a) secondary storage
b) processor
c) network
d) monitor
Answer: D
302
PROGRAMMING
C++
A. Structured Programming
C. Functional Programming
Answer: C
303
a) // comment
b) /* comment */
d) // comment */
Answer: C
D. Type-less language
Answer: B
304
6 Which of the below written keyword supports dynamic method resolution?
A. abstract
B. Virtual
C. Dynamic
D. Typeid
a) Bjarne Stroustrup
b) Dennis Ritchie
c) Ken Thompson
d) Brian Kernighan
Answer: A
A. Exception Handling
B. Reflection
C. Operator Overloading
D. Namespaces
Answer: B
305
9 A language which has the capability to generate new data type is known as:
a) Extensible
b) Overloaded
c) Encapsulated
d) Reprehensible
Answer: A
A. C language
B. Java Language
C. C# language
D. B language
306
A
Answer: A
a) Encapsulation
b) Abstraction
c) Inheritance
d) Polymorphism
Answer: C
Answer: D
Answer: B
17 Which of the below written class allows to declare only one object of it?
a) Abstract class
b) Virtual class
c) Singleton class
308
d) Friend class
Answer: C
a) Friend constructor
b) Copy constructor
c) Default constructor
d) Parameterized constructor
Answer: A
Answer: B
a) Static function
b) Friend function
309
c) Constant function
d) Virtual function
Answer: B
21 What of the below written name used for functions inside a class?
a) Member variables
b) Member functions
c) Class functions
d) Class variables
Answer: B
a) Function
b) Class
c) Object
d) Operator function
Answer: C
Answer: D
24 Which of the below written provides a programmer with the facility of using
object of a class inside other some other classes?
a) Inheritance
b) Composition
c) Abstraction
d) Encapsulation
Answer: B
a) 1
b) 2
c) 3
d) 4
Answer: B
311
26 How run-time polymorphisms are implemented using C++?
a) Using Inheritance
c) Using Templates
Answer: D
a) Using Inheritance
c) Using Templates
Answer: C
a) int
b) float
c) class
d) string
Answer: C
312
29 Which of the below written concept means that addition of new components to
a program as it runs?
a) Data hiding
b) Dynamic binding
c) Dynamic loading
d) Dynamic typing
Answer: C
a) Virtual polymorphism
b) Transient polymorphism
c) Ad-hoc polymorphism
d) Pseudo polymorphism
Answer: C
a) Top-down
b) Bottom-up
c) Left-right
d) Right-left
313
Answer: B
a) >>
b) <<
c) <
d) >
Answer: B
33 Which of the below written cannot be used with the virtual keyword?
a) Class
b) Member functions
c) Constructors
d) Destructors
Answer: C
a) Virtual functions
b) Operator functions
c) Constant functions
d) Static functions
314
Answer: A
Answer: D
36 Which of the below written supports the concept that reusability is a desirable
feature of a language?
Answer: D
a) Function overloading
b) Operator overloading
315
c) Templates
Answer: D
a) I only
b) II only
c) Both I and II
d) Neither I nor II
Answer: D
a) Multiple
b) Multilevel
c) Distributive
d) Hierarchical
Answer: C
316
40 What will happen if a class does not have a name?
c) It is not allowed
Answer: B
41 Which of the below written members are inherited but are not accessible in any
case?
a) Private
b) Public
c) Protected
Answer: A
317
Answer: D
Answer:
Answer: D
a. Time taken by read or write head mechanism to position itself over correct
cylinder
d. None of above
a) C++ property to avoid multiple copies of the base class into children/derived
class
d) C++ property to ensure that a private member of the base class can be accessed
somehow
Answer: A
49 Which of the below written data type is used to represent the absence of various
parameters?
319
a) int
b) short
c) void
d) float
Answer: C
50 Which of the below written is the best suited to represent the logical value?
a) integer
b) boolean
c) character
d) float
Answer: B
51 When any language is capable to make new data type mean, it can be known as
a) overloaded
b) extensible
c) encapsulated
d) reprehensible
Answer: B
320
52 Which of the below is the correct definition of any array?
Answer: A
53 Which of the below written operator is having the right to left association in the
following?
a) Array subscripting
b) Function call
d) Type cast
Answer: D
a) postfix
b) unary
c) shift
d) equality
321
Answer: A
Answer: A
a) 4
b) 3
c) 5
d) 6
Answer: C
a) Bitwise operator
b) Conditional operator
c) Multiplicative operator
d) Addition operator
322
Answer: B
a) 4
b) 2
c) 3
d) 1
Answer: A
59 Which of the below written looping process is best used when number of
iterations is known?
a) for
b) while
c) do-while
Answer: A
60 Which of the below written is the default return value of functions in C++?
a) int
b) char
323
c) float
d) void
Answer: A
Answer: A
a) compile-time
b) run-time
c) never expanded
Answer: A
Answer: A
c) Error occurs
d) Segmentation fault
Answer: B
67 Which of the below written feature is used in function overloading & function
with default argument?
a) Encapsulation
b) Polymorphism
c) Abstraction
d) Modularity
Answer: B
325
68 Which one of the below written is the correct syntax of including a user defined
header file of C++?
a) #include <userdefined.h>
b) #include <userdefined>
c) #include “userdefined”
d) #include [userdefined]
Answer: C
a) return function
b) caller
c) called function
d) main function
Answer: A
a) operator overloading
b) constructor overloading
c) destructor overloading
d) function overloading
326
Answer: B
a) *
b) &
c) _
d) %
Answer: B
Answer: A
73 What should be passed in the parameter when function does not need any
parameter?
a) void
b) blank space
327
d) tab space
Answer: B
c) Set of characters that are used in the name of the main function of the program
Answer: A
a) void
b) int
c) float
d) no return type
Answer: D
a) <<
b) >>
328
c) >
d) <
Answer: B
a) 0
b) 1
c) 2
d) Not Fixed
Answer: A
78 Which of the below written rule will not affect the friend function?
a) private & protected members of any class cannot be accessed from outside
Answer: A
79 Which keyword from below written is used to declare the friend function?
a) firend
329
b) friend
c) classfriend
d) myfriend
Answer: B
b) friend class;
c) friend class
d) friend class()
Answer: A
81 Wrapping data and its various functionality into a single entity is popularly
called:
a) Abstraction
b) Encapsulation
c) Polymorphism
d) Modularity
Answer: B
330
a) function declaration
b) function definition
c) main function
d) block function
Answer: A
a) derived
b) base
d) class
Answer: B
a) members
b) functions
d) classes
Answer: C
331
86 Which of the below written operator is used to declare destructor?
a) #
b) ~
c) @
d) $
Answer: B
87 Which of the below written constructor will initialize the base class data
member?
a) derived class
b) base class
c) class
Answer: B
88 which of the below written class is used to design the base class?
a) abstract class
b) derived class
c) base class
332
Answer: A
a) $
b) =0
c) &
d) !
Answer: B
a) virtual function
c) derived class
d) base class
Answer: B
Answer: A
b) derived class
d) virtual class
Answer: A
a) Class specifically used as base class with at least one virtual function.
b) Class specifically used as base class with at least one pure virtual functions
Answer: B
Answer: B
Answer: C
a) try
b) throw
335
c) catch
d) handler
Answer: C
a) throw
b) try
c) catch
d) handler
Answer: A
a) bad_cast
b) bad_typeid
c) bad_exception
d) bad_alloc
Answer: A
int main()
336
{
int a=10;
int b,c;
b = a++;
c = a;
cout<<a<<b<<c;
return 0;
(A) 111011
(B) 111111
(C) 101011
(D) 101010
Answer: A
int main()
int a = 10;
cout<<a++;
return 0;
}
337
(A) 10
(B) 11
(C) 12
Answer: A
int main()
a++;
cout<<a;
return 0;
(A) 10
(B) 11
Answer: C
338
107 How many times STET-EXAM is printed?
int main()
int i=0;
lbl:
cout<<"STET-EXAM";
i++;
if(i<5)
goto lbl;
return 0;
(A) Error
(B) 5 times
(C) 4 times
(D) 6 times
Answer: B
int a=10;
cout<<a++;
return 0;
(A) 11
(B) 10
(C) Error
(D) 0
Answer: B
#include <iostream>
int main() {
return 0;
(C) Error
(D) 0
Answer: A
#include <iostream>
int main() {
return 0;
(A)
250
500
750
(B) 750
341
(C) 500
(D) Error
Answer: A
#include <iostream>
#include <string>
int main () {
return 0;
(B) Anand
(C) Error
(D) 0
Answer: A
342
112 What will be output?
#include <iostream>
#include <string>
int main () {
string x = "20";
string y = "30";
string z = x + y;
cout << z;
return 0;
(A) 20
(B) 30
(C) 50
(D) 2030
Answer: D
#include <iostream>
#include <string>
343
using namespace std;
int main() {
cout << "The length of the txt string is: " << [Link]();
return 0;
(A) BIHARBOARD
(C) 10
(D) Error
Answer: B
#include <iostream>
#include <string>
int main() {
string fullName;
(C) AMIT
(D) Error
Answer: B
#include <iostream>
#include <cmath>
int main() {
return 0;
(A) 81
(B) 9
(C) 0
(D) Error
Answer: B
345
116 What will be output?
#include <iostream>
int main() {
int x = 30;
int y = 28;
if (x > y) {
return 0;
(C) 0
(D) Error
Answer: B
#include <iostream>
int main() {
} else {
return 0;
(C) 0
(D) Error
Answer: A
#include <iostream>
int main() {
return 0;
(C) 0
(D) Error
Answer: A
#include <iostream>
int main() {
int day = 4;
switch (day) {
case 6:
break;
case 7:
default:
return 0;
(D) Error
Answer: C
#include <iostream>
int main() {
int i = 0;
do {
i++;
}
349
while (i < 5);
return 0;
(A)
(B) 01234
(C) 012345
(D) Error
Answer: A
#include <iostream>
int main() {
return 0;
(A)0
(B) 02468
(C) 012345
(D) Error
Answer: A
#include <iostream>
int main() {
int i = 0;
while (i < 8) {
if (i == 4) {
i++;
351
continue;
i++;
return 0;
(A) 0
(B) 01234567
(C) 0
(D) Error
Answer: A
#include <iostream>
#include <string>
352
using namespace std;
int main() {
cars[0] = "Opel";
return 0;
(A) books
(C) Opel
(D) Error
Answer: C
#include <iostream>
#include <string>
int main() {
return 0;
(A) 0: Volvo
1: BMW
2: Maruti
3: Mazda
(B) CARS
(C) 0
(D) Error
Answer: A
#include <iostream>
#include <string>
int main() {
(A) Biryani
Biryani
(C) 0
(D) Error
Answer: A
#include <iostream>
#include <string>
int main() {
return 0;
(A) BIRYANI
355
0x6dfed4
0x6dfed4
(C) 0
(D) Error
Answer: A
#include <iostream>
#include <string>
int main() {
return 0;
(A) 0x6dfed4
Biryani
(D) Error
Answer: A
#include <iostream>
void myFunction();
int main() {
myFunction();
return 0;
void myFunction() {
(A) 0
(B) STET!
(C) MyFunction
(D) Error
Answer: B
357
129 What will be output?
#include <iostream>
#include <string>
int main() {
myFunction("Anil");
myFunction("Suraj");
myFunction("Vijay");
return 0;
(A) 0
Suraj refsnes
Vijay refsnes
(C) MyFunction
(D) Error
358
130 What will be output?
#include <iostream>
#include <string>
int main() {
myFunction("Slovakia");
myFunction("India");
myFunction();
myFunction("USA");
return 0;
(A) 0
(B) Slovakia
India
Nepal
USA
(C) MyFunction
(D) Error
359
Answer: B
#include <iostream>
#include <string>
cout << fname << " Refsnes. " << age << " years old. \n";
int main() {
myFunction("Ajay", 3);
myFunction("Vinod", 14);
myFunction("Anjana", 30);
return 0;
(C)Error
(D)0
Answer: A
360
132 What will be output?
#include<iostream>
void main() {
cout<<s<<" ";
s++;
cout<<s<<" ";
a)STET STET
b)C++ ++
c)++ ++
Answer: D
#include<iostream>
#include<string.h>
main() {
361
cout<<strcmp("strcmp()","strcmp()");
a) 0
b)100
c)10000
Answer: A
#include <iostream>
class MyClass {
public:
int x;
private:
int y;
};
int main() {
MyClass myObj;
myObj.x = 50;
362
myObj.y = 75;
return 0;
(A) 50 75
(B) 50
75
(C) 0
(D) ERROR
Answer: D
#include <iostream>
class Employee {
private:
int salary;
public:
void setSalary(int p) {
salary = p;
int getSalary() {
363
return salary;
};
int main() {
Employee myObj;
[Link](80000);
return 0;
(A) 8000
(B) 80000
(C) 0
(D) ERROR
Answer: B
#include <iostream>
#include <string>
class Vehicle {
public:
364
string brand = "Ford";
void honk() {
};
public:
};
int main() {
Car myCar;
[Link]();
return 0;
Ford Shovik
(C) 0
(D) ERROR
365
Answer: A
#include <iostream>
class MyClass {
public:
void myFunction() {
};
// Child class
};
};
int main() {
MyGrandChild myObj;
[Link]();
return 0;
366
(A) Bihar STET Exam
(C) 0
(D) ERROR
Answer: A
#include <iostream>
#include <string>
// Base class
class Animal {
public:
void animalSound() {
};
// Derived class
public:
void animalSound() {
};
public:
void animalSound() {
};
int main() {
Animal myAnimal;
Pig myPig;
Dog myDog;
[Link]();
[Link]();
[Link]();
return 0;
(C) 0
(D) ERROR
Answer: A
#include <iostream>
int main() {
int x = 6;
int y = 7;
int sum = x + y;
return 0;
(A) 1
(B) 13
(C) 0
(D) ERROR
369
Answer: B
#include <iostream>
#include <string>
int main() {
cars[0] = "Opel";
return 0;
(A) Vans
(C) Opel
(D) Error
Answer: C
370
371
Violating integrity constraints during database transactions can lead to disallowed updates to maintain data consistency and integrity. This can prevent records from being incorrectly updated or deleted, thus preserving relationships and data accuracy .
The physical layer is crucial in network communications as it is responsible for the physical transmission of data through bit-by-bit delivery over a physical medium. It defines the electrical, mechanical, and procedural specifications for hardware .
The transport layer is responsible for process-to-process delivery and uses port addresses to identify processes on a host, ensuring data is delivered error-free and in sequence. The session layer, in the OSI model, manages sessions between applications, providing synchronization and dialog control. It links support layers to enhance communication .
Arrays are not suitable for storing non-homogeneous data elements because they are designed for data types that are uniform, benefiting from direct access and efficient memory allocation. For non-homogeneous data, structures like linked lists offer more flexibility .
File systems for storing data tend to suffer from data redundancy and inconsistency, difficulty in accessing data, and data isolation. These issues can lead to inefficient data retrieval and discrepancies in data integrity .
The Join operation combines two relations by merging pairs of tuples, one from each relation, into a single tuple, whereas the Union operation combines two 'similarly structured' tables by forming a set union, joining tuples with matching schemas .
A database table on the 'many' side of a one-to-many or many-to-many relationship must have a composite key to ensure the uniqueness of each record and properly represent the relationships between entities. This encompasses multiple columns that, together, enforce uniqueness .
A stack is significant due to its LIFO (Last In First Out) principle, useful for operations like backtracking, parsing, and recursion. However, it is not ideal for scheduling tasks that require FIFO processing, such as job scheduling, where a queue would be more appropriate .
The Fourth Normal Form (4NF) eliminates multi-valued dependencies by ensuring that a relation is in BCNF and that no non-trivial multi-valued dependencies exist unless they are a superkey, thus reducing redundancy and improving database structure .
A schema diagram is crucial because it provides a visual representation of the database structure, showing tables (relations), attributes, and keys, which helps in understanding and designing the database architecture effectively. It aids in identifying relationships and dependencies among data .