Quiz CST 355 TT

Question Details of Subject :QUIZ-CST-355
Page 1 of 41
Unit Code Group 1 Group 3 Unit Wise Total Total Questions : 241
1 1 0 1
2 140 0 140
3 0 100 100
Group Wise Total 141 100
QNo Question Id Question Description

1 1479059 consider a disk system having 16 recording surfaces and each surface is divided into 2k tracks and each track is further divided into 128 sectors. How
many bits are required to identify each sector?
Unit : 1, Group : 1
1.20
2.22 (Right)
3.21
4.23
2 1492110 We have a binary heap on n elements and wish to insert n more elements (not necessarily one after another) into this
Unit : 2, Group : 1
heap. The total time required for this is
1.O(logn)
2.O(n) (Right)
3.o(nlogn)
4.O(n^2)
3 1492285 To refer to a specific instance of a relation in relational model, term used is known as
Unit : 2, Group : 1
1.Relation instance (Right)
2.Relation entity
3.Relation tuple
4.Relation attribute
4 1492292
Which of the following is not a property of a transaction?
Unit : 2, Group : 1
1.Atomicity
2.Simplicity (Right)
3.Isolaion
4.Durability
5 1492059 What sorting algorithms have their best and worst case times equal?
Unit : 2, Group : 1
1.heap and selection sort
2.insertion sort & merge sort
3. merge sort and heap sort (Right)
4.None of these
6 1492200 A linear collection of data elements where the linear node is given by means of pointer is called?
Unit : 2, Group : 1
1.Node list
2.Linked list (Right)
3.Primitive list
4.None
University Information System - By - ERP Division Monday, April 15, 2019 1:28:01 PM
Page 2 of 41
7 1492234 A primary key is combined with a foreign key creates
Unit : 2, Group : 1
1.Parent-Child relationship between the tables that connect them. (Right)
2.Many to many relationship between the tables that connect them.
3.Network model between the tables that connect them.
4.None of the above.
8 1492202
What would be the asymptotic time complexity to find an element in the linked list?
Unit : 2, Group : 1
1.O(1)
2.O(n) (Right)
3.O(n^2)
4.None
9 1492221
E-R model uses this symbol to represent weak entity set?
Unit : 2, Group : 1
1.Dotted rectangle
2.Diamond
3.Doubly outlined rectangle (Right)
4.None of these
10 1492287
Consider a directed line(->) from the relationship set advisor to both entity sets instructor and student. This indicates
Unit : 2, Group : 1
_________ cardinality
1.One to many
2.One to one (Right)
3.Many to many
4.Many to one
11 1492151
Assuming int is of 4bytes, what is the size of int arr[15];?
Unit : 2, Group : 1
1.11
2.15
3.19
4.60 (Right)
12 1492283
In relational model, row of table is known to be
Unit : 2, Group : 1
1.Relation
2.Attribute
3.Tuple (Right)
4.Entity field
Page 3 of 41
13 1492197 The type of expression in which the operator succeeds its operands is?
Unit : 2, Group : 1
1.Infix Expression
2.Prefix Expression
3.Postfix Expression (Right)
4.None
14 1492212 Which of the following is the fastest sorting algorithm to sort a list?
Unit : 2, Group : 1
1.Quick sort (Right)
2.Bubble Sort
3.Binary sort
4.Linear sort
15 1492244 In E-R diagram generalization is represented by
Unit : 2, Group : 1
1.ellipse
2.dashed ellipse
3.rectangle
4.triangle (Right)
16 1492279
Process of analyzing relation schemas to achieve minimal redundancy and insertion or update anomalies is classified as
Unit : 2, Group : 1
1.Normalization of data (Right)

2.Denomination of data
3.Isolation of data
4.De-normalization of data
17 1492280
Considering relational database, functional dependency between two attributes A and B is denoted by
Unit : 2, Group : 1
1.A ? B (Right)
2.B ? A
3.AB ? R
4.R ? AB
18 1492148 How do you initialize an array in C?
Unit : 2, Group : 1
1.int arr[3] = (1,2,3);
2.int arr(3) = {1,2,3};
3.int arr[3] = {1,2,3}; (Right)
4.int arr(3) = (1,2,3);
19 1492216 ODBC stands for
Unit : 2, Group : 1
1.Object Database Connectivity
2.Oral Database Connectivity
3.Oracle Database Connectivity
4.Open Database Connectivity (Right)
Page 4 of 41
20 1492284
Relational model eases job of programmer, compared to earlier data models such as
Unit : 2, Group : 1
1.Network model
2.Hierarchical model
3.Semi-structured model
4.Both A and B (Right)
21 1492152 The minimum number of interchanges needed to convert the array 89, 19, 40, 17, 12, 10, 2, 5, 7, 11, 6, 9, 70 into a heap
Unit : 2, Group : 1
with the maximum element at the root is
1.0
2.1
3.2 (Right)
4.3
22 1492254
A table on the many side of a one to many or many to many relationship must:
Unit : 2, Group : 1
1.Be in Second Normal Form (2NF)

2.Be in Third Normal Form (3NF)
3.Have a single attribute key
4.Have a composite key (Right)
23 1492099 Which of the following sorting algorithms does not have a worst case running time of O(n^2)?
Unit : 2, Group : 1
1.Insertion Sort
2.Merge Sort (Right)
3.Quick Sort
4.Bubble Sort
24 1492117 The maximum number of binary search trees that can be formed with three nodes is
Unit : 2, Group : 1
1.5 (Right)
2.4
3.1
4.3
25 1492131 Preorder traversal of given BST is 12, 8, 6, 2, 7, 9, 10, 16, 15, 19, 17, 20. The postorder traversal is:
Unit : 2, Group : 1
1.2, 7, 6, 10, 9, 8, 15, 17, 20 19, 16, 12 (Right)
2.7, 2, 6, 8, 9, 10, 20, 17, 19, 15, 16, 12
3.7, 6, 2, 10, 9, 8, 15, 16, 17, 19, 20 , 12
4.2, 6, 7, 8, 9, 10, 12, 15, 16, 17, 19, 20
Page 5 of 41
26 1492142 Consider the label sequences obtained by the following pairs of traversals on a labeled binary tree. Which of these pairs
Unit : 2, Group : 1
identify a tree uniquely?
1. preorder and postorder 2. inorder and postorder
3. preorder and inorder 4. level-order and postorder
1.1 only
2.2 and 3 (Right)
3.3 only
4.4 only
27 1492199 Which type of traversal of binary search tree outputs the value in sorted order?
Unit : 2, Group : 1
1.Preorder
2.Inorder (Right)
3.Postorder
4.None
28 1492224 The conceptual model is
Unit : 2, Group : 1
1.dependent on hardware.
2.dependent on software.
3.dependent on both hardware and software.
4.independent of both hardware and software. (Right)
29 1492267 Which one of the following cannot be taken as a primary key?
Unit : 2, Group : 1
1.Id
2.Registration number
3.Dept_id
4.Street (Right)
30 1492274
If every functional dependency in set E is also in the closure of F then this is classified as
Unit : 2, Group : 1
1.FD is covered by E
2.E is covered by F (Right)
3.F is covered by E
4.F+ is covered by E
31 1492195 Consider the linked list implementation of a stack. Which of the following node is considered as Top of the stack?
Unit : 2, Group : 1
1.First Node (Right)
2.Last Node
3.Any Node
4.Middle Node
Page 6 of 41
32 1492196
Suppose we have numbers between 1 and 1000 in a binary search tree and want to search for the number 363. Which of
Unit : 2, Group : 1
the following sequence could not be the sequence of the node examined?
1.2, 252, 401, 398, 330, 344, 397, 363

2.924, 220, 911, 244, 898, 258, 362, 363
3.925, 202, 911, 240, 912, 245, 258, 363 (Right)
4.2, 399, 387, 219, 266, 382, 381, 278, 363
33 1492264
By default, which key creates Clustered index?
Unit : 2, Group : 1
1.Foreign Key
2.Unique Key
3.Primary Key (Right)
4.None
34 1492281
Constraint between two different attributes sets is classified as
Unit : 2, Group : 1
1.modification anomaly
2.functional dependency (Right)
3.insertion anomaly
4.deletion anomaly
35 1492057 Which of the following algorithmic paradigm is used in the merge sort?
Unit : 2, Group : 1
1.Dynamic Programming
2.Back Tracking
3.Divide and Conquer (Right)
4.Greedy method
36 1492198
If the elements ³A´³B´³C´and ³D´are placed in a stack and are deleted one at a time, in what order will they be
Unit : 2, Group : 1
removed?
1.ABCD
2.DCBA (Right)
3.DCAB
4.ABDC
37 1492223 Which of the following are the properties of entities?
Unit : 2, Group : 1
1.Groups
2.Tables
3.Attributes (Right)
4.Switchboards
Page 7 of 41
38 1492232 A data dictionary is a special file that contains:
Unit : 2, Group : 1
1.The name of all fields in all files.
2.The width of all fields in all files.
3.The data type of all fields in all files.
4.All of the above. (Right)
39 1492119
Let T be a tree with 10 vertices. The sum of the degree of all the vertices in T is_____
Unit : 2, Group : 1
1.10
2.15
3.18 (Right)
4.20
40 1492155
A Binary Search Tree (BST) stores values in the range 37 to 573. Consider the following sequence of keys.
Unit : 2, Group : 1
I. 81, 537, 102, 439, 285, 376, 305
II. 52, 97, 121, 195, 242, 381, 472
III. 142, 248, 520, 386, 345, 270, 307
IV. 550, 149, 507, 395, 463, 402, 270
Suppose the BST has been unsuccessfully searched for key 273. Which all of the above sequences list nodes in the
order in which we could have encountered them in the search?
1.II and III only

2.I and III only
3.III and IV only
4.III only (Right)
41 1492270 A top-to-bottom relationship among the items in a database is established by a
Unit : 2, Group : 1
1.Hierarchical schema (Right)
2.Network schema
3.Relational schema
4.All of the mentioned
42 1492272
If the attribute phone number is included in the relation all the values need not be entered into the phone number column.
Unit : 2, Group : 1
This type of entry is given as
1.0
2.-
3.Null (Right)
4.Old value
Page 8 of 41
43 1492126
Level order traversal of a rooted tree can be done by starting from the root and performing
Unit : 2, Group : 1
1.Breadth First Search (Right)

2.Depth First Search
3.Inorder Traversal
4.Preorder Traversal
44 1492140 Bubble sort is a stable sorting algorithm.
Unit : 2, Group : 1
1.Yes (Right)
2.No
3.
4.
45 1492265
Consider attributes ID, CITY and NAME. Which one of these can be considered as a super key?
Unit : 2, Group : 1
1.NAME
2.ID (Right)
3.CITY
4.CITY, ID
46 1492276
Form of dependency in which set of attributes that are neither a subset of any of keys nor candidate key is classified as
Unit : 2, Group : 1
1.transitive dependency (Right)

2.full functional dependency
3.partial dependency
4.prime functional dependency
47 1492594
In a relational schema, each tuple is divided into fields called
Unit : 2, Group : 1
1.Relations
2.Domains (Right)
3.Queries
4.All of the above
48 1492094 In worst case Quick Sort has order
Unit : 2, Group : 1
1.O(n log n)
2.O(log n)
3.O[n^2)/4]
4.O[n^2)/2] (Right)
Page 9 of 41
49 1492194
Consider the following operation performed on a stack of size 5.
Unit : 2, Group : 1
Push(1);
Pop();
Push(2);
Push(3);
Pop();
Push(4);
Pop();
Pop();
Push(5);
After the completion of all operation, the no of the element present on the stack are
1.1 (Right)
2.2
3.3
4.4
50 1492275
If there is more than one key for relation schema in DBMS then each key in relation schema is classified as
Unit : 2, Group : 1
1.Prime key
2.Super key
3.Candidate key (Right)
4.Primary key
51 1492122 Let T be a BST with 15 nodes. The minimum and maximum possible height of T are _________
Unit : 2, Group : 1
1.4 & 15 respectively
2.3 & 14 respectively (Right)
52 1492139 Quick sort is a stable sorting algorithm.
Unit : 2, Group : 1
1.Yes
2.No (Right)
3.
4.
Page 10 of 41
53 1492154
Unit : 2, Group : 1
1.A
2.B (Right)
3.c
4.D
54 1492220 It is possible to define a schema completely using
Unit : 2, Group : 1
1.VDL and DDL
2.DDL and DML (Right)
3.SDL and DDL
4.VDL and DML
55 1492271 A _____ indicates an absent value that may exist but be unknown or that may not exist at all.
Unit : 2, Group : 1
1.Empty tuple
2.New value
3.Null value (Right)
4.Old value
56 1492217 In an E-R diagram an entity set is represent by a
Unit : 2, Group : 1
1.rectangle (Right)
2.circle
3.diamond
4.ellipse
57 1492242 A logical schema
Unit : 2, Group : 1
1.is the entire database
2.is a standard way of organizing information into a accessible part
3.describe how data is actually stored on disk
4.none of these (Right)
Page 11 of 41
58 1492096 A sort which relatively passes through a list to exchange the first element with any element less than it and then repeats
Unit : 2, Group : 1
with a new first element is called
1.Quick Sort (Right)

2.Selection Sort
3.Heap Sort
4.Insertion Sort
59 1492128
A complete binary min-heap is made by including each integer in [1, 1023] exactly once. The depth of the node in heap is
Unit : 2, Group : 1
the length of the path from root of heap to that node. So, the root is at depth 0. The maximum depth at which integer 9
can appear is _____
1.12
2.8 (Right)
3.10
4.9
60 1492146 The prefix form of A-B/ (C * D ? E) is?
Unit : 2, Group : 1
1.-/*?ACBDE
2.-ABCD*?DE
3.-A/B*C?DE (Right)
4.-A/BC*?DE
61 1492246 Relation R has eight attributes ABCDEFGH. Fields of R contain only atomic values. F = {CH -> G, A -> BC, B -> CFH, E -
Unit : 2, Group : 1
> A, F -> EG} is a set of functional dependencies (FDs) so that F+ is exactly the set of FDs that hold for R. How many
candidate keys does the relation R have?
1.3
2.4 (Right)
3.5
4.6
62 1492134 What will be the postfix expression for following infix expression b * c + d / e
Unit : 2, Group : 1
1.b * c d e / +
2. b c * d e + /
3.b c d * e / +
4.b c * d e / + (Right)
63 1492225 The full form of DDL is
Unit : 2, Group : 1
1.Dynamic Data Language
2.Detailed Data Language
3.Data Definition Language (Right)
4.Data Derivation Language
64 1492268 An attribute in a relation is a foreign key if the _______ key from one relation is used as an attribute in that relation.
Unit : 2, Group : 1
1.Candidate
2.Primary (Right)
3.Super
4.Sub
Page 12 of 41
65 1492291
The ³all-or-none´property is commonly referred to as _________
Unit : 2, Group : 1
1.Isolation
2.Durability
3.Atomicity (Right)
4.None of the above
66 1492021 A stable sorting algorithm
Unit : 2, Group : 1
1.does not crash
2.does not run out of memory.
3.does not change the sequence of appearance of elements. (Right)
4.does not exists.
67 1492136 The best case complexity for Bubble Sort is:
Unit : 2, Group : 1
1.O(n) (Right)
2.O(1)
3.O(n*n)
4.O(logn)
68 1492206
Which among the below specified condition is applicable if the Queue is non - empty?
Unit : 2, Group : 1
1.rear>front (Right)
2.rear=front
3.rear<front
4.unpredictable
69 1492289
If you were collecting and storing information about your music collection, an album would be considered a(n) _____
Unit : 2, Group : 1
1.Relation
2.Entity (Right)
3.Instance
4.Attribute
70 1492015 What data structure is used for depth first traversal of a graph?
Unit : 2, Group : 1
1.queue
2.stack (Right)
3.list
4.None of the above
Page 13 of 41
71 1492201
In linked list each node contains minimum of two fields. One field is the data field to store the data second field is?
Unit : 2, Group : 1
1.Pointer to character
2.Pointer to integer
3.Pointer to node (Right)
4.Node
72 1492226
Which of the following is an advantage of view?
Unit : 2, Group : 1
1.Data security
2.Derived columns
3.Hiding of complex queries
4.All of the above (Right)
73 1492240 Hierarchical model is also called
Unit : 2, Group : 1
1.Tree structure (Right)
2.Plex structure
3.Normalize structure
4.Table structure
74 1492258
Which is a bottom-up approach to database design that design by examining the relationship between attributes?
Unit : 2, Group : 1
1.Functional dependency
2.Database modeling
3.Normalization (Right)
4.Decomposition
75 1492211 The operation of processing each element in the list is known as, _________.
Unit : 2, Group : 1
1.Sorting
2.Merging
3.Inserting
4.Traversal (Right)
76 1492014
What is the worst case time complexity of the linear search algorithm?
Unit : 2, Group : 1
1.?(1)
2.?(n)
3.?(log n)
4.?(n^2) (Right)
Page 14 of 41
77 1492018 Which method can find if two vertices x & y have a path between them?
Unit : 2, Group : 1
1.Depth First Search
2.Breadth First Search
3.Both A & B (Right)
4.None A or B
78 1492107 What is the number of swaps required to sort n elements using selection sort, in the worst case ?
Unit : 2, Group : 1
1.o(n) (Right)
2.o(nlogn)
3.o(n^2)
4.o(n^2 logn)
79 1492209
What does the push operation top = top +1 indicate while representing the stack in one - dimensional array?
Unit : 2, Group : 1
1.Stack Growing (Right)

2.Stack Shrinking
3.Stack Stability
4.Stack Instability
80 1492282 Normalization form which is based on transitive dependency is classified as
Unit : 2, Group : 1
1.1NF
2.2NF
3.3NF (Right)
4.4NF
81 1492137 The worst case complexity for Bubble Sort
Unit : 2, Group : 1
1.O(n)
2.O(1)
3.O(n*n) (Right)
4.O(logn)
82 1492203
In doubly linked lists, traversal can be performed?
Unit : 2, Group : 1
1.Only in forward direction

2.Only in reverse direction
3.In both directions (Right)
4.None
83 1492205
From where does the insertion and deletion of elements get accomplished in Queues?
Unit : 2, Group : 1
1.Front & Rear ends respectively

2.Rear & Front ends respectively (Right)
3.Only Front ends
4.Only Rear ends
Page 15 of 41
84 1492222
DBMS helps achieve
Unit : 2, Group : 1
1.Data independence
2.Centralized control of data
3.Neither (A) nor (B)
4.Both (A) and (B) (Right)
85 1492252 In the __________ normal form, a composite attribute is converted to individual attributes.
Unit : 2, Group : 1
1.First (Right)
2.Second
3.Third
4.Fourth
86 1492288
An entity set that does not have sufficient attributes to form a primary key is termed a __________
Unit : 2, Group : 1
1.Strong entity set

2.Variant set
3.Weak entity set (Right)
4.Variable set
87 1492249 ?Which of the following is TRUE?
Unit : 2, Group : 1
1.Every relation in 3NF is also in BCNF
2.A relation R is in 3NF if every non-prime attribute of R is fully functionally dependent on every key of R
3.Every relation in BCNF is also in 3NF (Right)
4.No relation can be in both BCNF and 3NF
88 1492145 The postfix form of A*B+C/D is?
Unit : 2, Group : 1
1.*AB/CD+
2.AB*CD/+ (Right)
3.A*BC+/D
4.ABCD+/*
89 1492213
If F is a set of functional dependencies, then the closure of F is denoted by?
Unit : 2, Group : 1
1.F*
2.Fo (Right)
3.F+
4.F
Page 16 of 41
90 1492193
Which of the following statement about binary tree is CORRECT?
Unit : 2, Group : 1
1.Every binary tree is either complete or full

2.Every complete binary tree is also a full binary tree
3.Every full binary tree is also a complete binary tree (Right)
4. A binary tree cannot be both complete and full
91 1492259
Which forms simplifies and ensures that there are minimal data aggregates and repetitive groups:
Unit : 2, Group : 1
1.1NF
2.2NF
3.3NF (Right)
4.All of the mentioned
92 1492102 The quick sort algorithm exploits _________ design technique
Unit : 2, Group : 1
1.Greedy
2.Dynamic programming
3.Divide and Conquer (Right)
4.Backtracking
93 1492138 Bubble Sort is a stable sorting algorithm
Unit : 2, Group : 1
1.Yes (Right)
2.No
3.
4.
94 1492153 Consider a binary max-heap implemented using an array. Which one of the following array represents a binary max-
Unit : 2, Group : 1
heap?
1.25, 12, 16, 13, 10, 8, 14

2.25, 12, 16, 13, 10, 8, 14
3.25, 14, 16, 13, 10, 8, 12 (Right)
4.25, 14, 12, 13, 10, 8, 16
95 1492058 What is the worst case performance of Selection sort algorithm?
Unit : 2, Group : 1
1.O(log n)
2.O(n* n) (Right)
3.O(n)
4.O(nlogn)
96 1492115
Which of the following sorting algorithms has the lowest worst-case complexity?
Unit : 2, Group : 1
1.Bubble Sort
2.Merge Sort (Right)
3.Quick Sort
4.Selection Sort
Page 17 of 41
97 1492133 For Preorder, Inorder and Postorder traversal, the nodes are traversed in
Unit : 2, Group : 1
1.Root Left Right, Left Root Right, Left Right Root resp. (Right)
2.Root Right Left, Right Root Left, Right Left Root resp.
3.Root Left Right, Left Right Root, Left Root Right resp.
4.Left Right Root, Left Root Right, Root Left Right resp.
98 1492208 When is the pop operation on Stack considered to be an error?
Unit : 2, Group : 1
1.Only when the stack is empty (Right)
2.Only when the stack is full
3.When the stack is neither empty nor full
4.Cannot be predicted
99 1492215
If A→B, A→ C then which of the following is true?
Unit : 2, Group : 1
1.A?BC
2.A?B
3.A?C
4.All of the mentioned (Right)
100 1492229
Which of the following is another name for the weak entity?
Unit : 2, Group : 1
1.Child (Right)
2.Owner
3.Dominant
4.None of the above
101 1492230
NULL is
Unit : 2, Group : 1
1.the same as 0 for integer

2.the same as blank for character
3.the same as 0 for integer and blank for character
4.not a value (Right)
102 1492261
Which forms are based on the concept of functional dependency:
Unit : 2, Group : 1
1.1NF
2.2NF
3.3NF (Right)
4.4NF
Page 18 of 41
103 1492262
Empdt1(empcode, name, street, city, state, pincode).
Unit : 2, Group : 1
For any pincode, there is only one city and state. Also, for given street, city and state, there is just one pincode. In
normalization terms, empdt1 is a relation in
1.1 NF only
2.2 NF and hence also in 1 NF (Right)
3.3NF and hence also in 2NF and 1NF
4.BCNF and hence also in 3NF, 2NF and 1NF
104 1492207 Which direction of scanning is suitable for the evaluation of a prefix expression?
Unit : 2, Group : 1
1.Left to Left
2.Right to Right
3.Left to Right
4.Right to Left (Right)
105 1492273 The primary key must be
Unit : 2, Group : 1
1.Unique
2.Not null
3.Both Unique and Not null (Right)
4.Either Unique or Not null
106 1492020 A pivot element to partition unsorted list is used in
Unit : 2, Group : 1
1.Merge Sort
2.Quick Sort (Right)
3.Insertion sort
4.Selection Sort
107 1492103 The maximum number of binary search trees that can be formed with n nodes is
Unit : 2, Group : 1
1.n!
2.n
3.n+1
4.2n!/(n+1)!n! (Right)
108 1492237 Which one of the following is NOT true for a view:
Unit : 2, Group : 1
1.View is derived from other tables.
2.View is a virtual table.
3.A view definition is permanently stored as part of the database. (Right)
4.View never contains derived columns.
109 1492256
Which-one of the following statements about normal forms is FALSE?
Unit : 2, Group : 1
1.BCNF is stricter than 3 NF

2.Lossless, dependency -preserving decomposition into 3 NF is always possible
3.Loss less, dependency ±preserving decomposition into BCNF is always possible (Right)
4.Any relation with two attributes is BCNF
Page 19 of 41
110 1492269
What is true about Unique and primary key?
Unit : 2, Group : 1
1.Unique can have multiple NULL values but Primary can¶t have.
2.Unique can have single NULL value but Primary can¶t have even single. (Right)
3.Both can have duplicate values.
4.None of the Mentioned
111 1492135 What would be the worst case time complexity of the Insertion Sort algorithm?
Unit : 2, Group : 1
1.O(n^2) (Right)
2.O(nlogn)
3.O(n)
4.O(n^1.5)
112 1492149 When does the ArrayIndexOutOfBoundsException occur?
Unit : 2, Group : 1
1.Compile-time
2.Run-time (Right)
3.Not an error
4.None of the above
113 1492210 Which of the following data structure is not a Linear Data Structure?
Unit : 2, Group : 1
1.Array
2.Linked lists
3.Both of these
4.None of these (Right)
114 1492260
Which forms has a relation that possesses data about an individual entity:
Unit : 2, Group : 1
1.2NF
2.3NF
3.4NF (Right)
4.5NF
115 1492214 An entity set that does not have sufficient attributes to form a primary key is a
Unit : 2, Group : 1
1.strong entity set
2.weak entity set (Right)
3.simple entity set
4.primary entity set
116 1492227
Which database level is closest to the users?
Unit : 2, Group : 1
1.External (Right)
2.Internal
3.Physical
4.Conceptual
Page 20 of 41
117 1492263
Which of the following are steps in query processing?
Unit : 2, Group : 1
1.Parsing and translation

2.Optimization
3.Evaluation
118 1492278 Functional dependency of two sets E and F are considered as equivalent if
Unit : 2, Group : 1
1.E + F = E - F
2.E * = F 2
3.E 2 = F 2
4.E * = F * (Right)
119 1492595
DFD stands for
Unit : 2, Group : 1
1.Data Flow Document

2.Data File Diagram
3.Data Flow Diagram (Right)
4.None of the above
120 1492596
Data independence means
Unit : 2, Group : 1
1.data is defined separately and not included in programs.

2.programs are not dependent on the physical attributes of data
3.programs are not dependent on the logical attributes of data
4.both B and C (Right)
121 1492132 The result of postfix notation 2 3 * 5 4 * + 9 - lies in
Unit : 2, Group : 1
1.range of 0 to 10
2.range of 11 to 20 (Right)
3.range of 21 to 30
4.range of 31 to 40
122 1492257
Functional Dependencies are the types of constraints that are based on______
Unit : 2, Group : 1
1.Key (Right)
2.Key revisited
3.Superset key
4.None of the mentioned
Page 21 of 41
123 1492266
Which one of the following attribute can be taken as a primary key?
Unit : 2, Group : 1
1.Name
2.Street
3.Id (Right)
4.Department
124 1492293
Which of the following systems is responsible for ensuring durability?
Unit : 2, Group : 1
1.Recovery system (Right)

2.Atomic system
3.Concurrency control
4.Compiler system
125 1492019 Index of arrays in C programming language starts from
Unit : 2, Group : 1
1.0
2.1
3.either 0 or 1 (Right)
4.undefined
126 1492204
Linked lists are not suitable for the implementation of?
Unit : 2, Group : 1
1.Insertion sort
2.Radix sort
3.Polynomial manipulation
4.Binary search (Right)
127 1492219 A DBMS query language is designed to
Unit : 2, Group : 1
1.support end users who use English-like commands.
2.support in the development of complex applications software.
3.specify the structure of a database.
4.all of the above. (Right)
128 1492236 In E-R Diagram derived attribute are represented by
Unit : 2, Group : 1
1.Ellipse
2.Dashed ellipse (Right)
3.Rectangle
4.Triangle
129 1492255 Tables in second normal form (2NF):
Unit : 2, Group : 1
1.Eliminate all hidden dependencies (Right)
2.Eliminate the possibility of a insertion anomalies
3.Have a composite key
4.Have all non key fields depend on the whole primary key
Page 22 of 41
130 1492090
What data structures you should use for dictionary searching and it should be capable of doing spell check also?
Unit : 2, Group : 1
1.Array
2.Hashing (Right)
3.Linked list
4.Tree
131 1492290
Consider a relation scheme R = (A, B, C, D, E, H) on which the following functional dependencies hold: {A±!B, BC±!D,
Unit : 2, Group : 1
E±!C, D±!A}. What are the candidate keys of R?
1.AE, BE
2.AE, BE, DE
3.AEH, BEH, BCH
4.AEH, BEH, DEH (Right)
132 1492112
The inorder and preorder traversal of a binary tree are DBEAFCG and ABDECFG respectively. The postorder traversal
Unit : 2, Group : 1
of the binary tree is
1.DEBFGCA (Right)
2.EDBGFCA
3.EDBFGCA
4.DEFGBCA
133 1492144
The data structure required to check whether an expression contains balanced parenthesis is?
Unit : 2, Group : 1
1.Stack (Right)
2.Queue
3.Array
4.Tree
134 1492147
What is the result of the following operation: Top (Push (S, X))
Unit : 2, Group : 1
1.X (Right)
2.S
3.Null
4.None
Page 23 of 41
135 1492016 Which of the following searching techniques do not require the data to be in sorted form?
Unit : 2, Group : 1
1.Binary Search (Right)
2.Interpolation search
3.Linear search
4.All of the above
136 1492141
A priority-Queue is implemented as a Max-Heap, Initially, it has 5 elements. The level-order traversal of the heap is given
Unit : 2, Group : 1
below: 10, 8, 5, 3, 2 Two new elements µ¶and µ¶are inserted in the heap in that order. The level order traversal of the
heap after the insertion of the elements is
1.10, 8, 7, 5, 3, 2, 1
2.10, 8, 7, 2, 3, 1, 5
3.10, 8, 7, 3, 2, 1, 5 (Right)
4.10, 8, 7, 1, 2, 3, 5
137 1492143
We have a binary heap on n elements and wish to insert n more elements (not necessarily one after another) into this
Unit : 2, Group : 1
heap. The total time required for this is
1.O(logn)
2.O(n) (Right)
3.O(nlogn)
4.O(n^2)
138 1492150 Which data structure is used for implementing recursion?
Unit : 2, Group : 1
1.Queue
2.Stack (Right)
3.Array
4.List
139 1492277
What is the full form of SQL?
Unit : 2, Group : 1
1.Structured Query Language (Right)

2.Structured Query List
3.Simple Query Language
4.None of these
140 1492239
In E-R Diagram relationship type is represented by
Unit : 2, Group : 1
1.Ellipse
2.Dashed ellipse
3.Rectangle
4.Diamond (Right)
Page 24 of 41
141 1492286
Which of the following gives a logical structure of the database graphically?
Unit : 2, Group : 1
1.Entity-relationship diagram (Right)

2.Entity diagram
3.Database diagram
4.Architectural representation
142 1577403 The degree of any vertex of graph is .... ?
Unit : 3, Group : 3
1.The number of edges incident with vertex (Right)
2.Number of vertex in a graph
3.Number of vertices adjacent to that vertex
4.Number of edges in a graph
143 1579077 In asymmetric key cryptography, the private key is kept by
Unit : 3, Group : 3 1.sender
2.sender and receiver
3.all the connected devices to the network
4.reciever (Right)
144 1577480 The number of edges from the node to the deepest leaf is called _________ of the tree.
Unit : 3, Group : 3
1.Height (Right)
2.Depth
3.Length
145 1579084 In cryptography, what is cipher?
Unit : 3, Group : 3 1.algorithm for performing encryption and decryption (Right)
2.encrypted message
3.both algorithm for performing encryption and decryption and encrypted message
4.none of the mentioned
146 1579151 Communication between a computer and a keyboard involves ______________ transmission
Unit : 3, Group : 3
1.Automatic
2.Half duplex
3.Full duplex
4.Simplex (Right)
147 1577308 A connected graph T without any cycles is called ««
Unit : 3, Group : 3
1.free graph (Right)
2.no cycle graph
3.non cycle graph
4.circular graph
Page 25 of 41
148 1587050 Packets of the same session may be routed through different paths in:
(a) TCP, but not UDP
Unit : 3, Group : 3 (b) TCP and UDP
(c) UDP, but not TCP
(d) Neither TCP nor UDP
1.a
2.b (Right)
3.c
4.d
149 1577370 In a 2-tree, nodes with 0 children are called ««««
Unit : 3, Group : 3
1.Exterior node
2.Outside node
3.Outer node
4.External node (Right)
150 1587047
Consider different activities related to email.
Unit : 3, Group : 3
m1:Send an email from a mail client to mail server m2:Download an email from mailbox server to a mail client m3:Checking email in a web browser
Which is the applicable level protocol user in each activity?

(A) m1:HTTP, m2:SMTP, m3:POP
(B) m1:SMTP, m2:FTP, m3:HTTP
(C) m1:SMTP, m2:POP, m3:HTTP
(D) m1:POP, m2:SMTP, m3:IMAP
1.a
2.b
3.c (Right)
4.d
151 1579106
Unit : 3, Group : 3
Symmetric-key cryptography started thousands of years ago when people needed to exchange
1.files
2.packets
3.secrets (Right)
4.transmission
152 1587058 An organization has a class B network and wishes to form subnets for 64 departments. The subnet mask would be:
(a) 255.255.0.0
Unit : 3, Group : 3 (b) 255.255.64.0
(c) 255.255.128.0
(d) 255.255.252.0
1.a
2.b
3.c
4.d (Right)
Page 26 of 41
153 1579267 What is the nework id of 1.4.5.6
Unit : 3, Group : 3 1.1.4.5.6

2.1.0.0.0 (Right)
3.1.4.0.0
4.1.4.5.0
154 1587037 One of the header fields in an IP datagram is the Time to Live (TTL) field. Which of the following statements best explains the need for this
field?
Unit : 3, Group : 3 (A) It can be used to priortize packets
(B) It can be used to reduce delays
(C) It can be used to optimize throughput
(D) It can be used to prevent packet looping
1.a
2.b
3.c
4.d (Right)
155 1579114
Unit : 3, Group : 3
In Message Confidentiality, transmitted message must make sense to only intended
1.Receiver (Right)
2.sender
3.modular
4.translator
156 1579164 Two devices are in network if
Unit : 3, Group : 3 1.a process is running on both devices

2.a process in one device is able to exchange information with a process in another device (Right)
3.PIDs of the processes running of different devices are same
157 1586459 Data communication system spanning states, countries, or the whole world is ________
a) LAN
Unit : 3, Group : 3 b) WAN
c) MAN
d) None of the mentioned
1.a
2.b (Right)
3.c
4.d
Page 27 of 41
158 1587066
Which of the following is not true about Subnetting?
Unit : 3, Group : 3
(A) It can be applied only for single network.
(B) It is used to improve security.
(C) Here, bits are borrowed from network ID portion.
(D) Here, bits are borrowed from host ID portion.
1.a
2.b
3.c (Right)
4.d
159 1577271 The operation of processing each element in the list is known as ««
Unit : 3, Group : 3
1.sorting
2.merging
3.inserting
4.traversal (Right)
160 1586463 The domain name system is maintained by _______
a) distributed database system
Unit : 3, Group : 3 b) a single server
c) a single computer
d) none of the mentioned
1.a (Right)
2.b
3.c
4.d
161 1577282 Other name for directed graph is «««
Unit : 3, Group : 3
1.Direct graph
2.Digraph (Right)
3.Dir-graph
4.Dygraph
162 1577441 A graph G is called a ..... if it is a connected acyclic graph ?
Unit : 3, Group : 3
1.Cyclic graph
2.Regular graph
3.Tree (Right)
4.Not a graph
Page 28 of 41
163 1577244 What is the time, space complexity of following code:
Unit : 3, Group : 3
int a = 0, b = 0;
for (i = 0; i < N; i++) {
a = a + rand();
}
for (j = 0; j < M; j++) {
b = b + rand();
}
1.O(N * M) time, O(1) space

2.O(N + M) time, O(N + M) space
3.O(N + M) time, O(1) space (Right)
4.4O(N * M) time, O(N + M) space
164 1579169 Communication channel is shared by all the machines on the network in
Unit : 3, Group : 3 1.broadcast network (Right)

2.unicast network
3.multicast network
165 1577944 Which of the following is software metric that provides a quantitative measure of the logical complexity
Unit : 3, Group : 3 of a program?
1.Cyclomatic Complexity (Right)

2.LOC
3.Function Point
4.None of the above.
166 1579073
Unit : 3, Group : 3
We use Cryptography term to transforming messages to make them secure and immune to
1.Change
2.Idle
3.Attacks (Right)
4.Defend
Page 29 of 41
167 1579148 In the layer hierarchy as the data packet moves from the upper to the lower layers, headers are
Unit : 3, Group : 3 1.Added (Right)

2.Removed
3.Rearranged
4.Modified
168 1578559 SMTP defines
Unit : 3, Group : 3 1.message transport (Right)
2.message encryption
3.message content
169 1587049 In the slow start phase of the TCP congestion control algorithm, the size of the congestion window
(A) does not increase
Unit : 3, Group : 3 (B) increases linearly
(C) increases quadratically
(D) increases exponentially
1.a
2.b
3.c
4.d (Right)
170 1577189 Which of the following case does not exist in complexity theory?
Unit : 3, Group : 3
1. Best case
2. Worst case
3. Average case
4. Null case (Right)
171 1577291 Binary trees with threads are called as ««
Unit : 3, Group : 3
1.Threaded trees (Right)
2.Pointer trees
3.Special trees
4.Special pointer trees
172 1578493 Postfix expression for (A+B) *(C+D) is
Unit : 3, Group : 3
1.A B C * + D +
2.A B + C D + * (Right)
3.ABCD++*
4.None
173 1579178 A __________ is a device that forwards packets between networks by processing the routing information included in the packet.
Unit : 3, Group : 3 1.bridge

2.firewall
3.router (Right)
4.all of the mentioned
Page 30 of 41
174 1587034 Let G(x) be the generator polynomial used for CRC checking. What is the condition that should be satisfied by G(x) to detect odd number of
bits in error?
Unit : 3, Group : 3 (A) G(x) contains more than two terms
(B) G(x) does not divide 1+x^k, for any k not exceeding the frame length
(C) 1+x is a factor of G(x)
(D) G(x) has an odd number of terms.
1.a
2.b
3.c (Right)
4.d
175 1577352 A terminal node in a binary tree is called ««««
Unit : 3, Group : 3
1.Root
2.Leaf (Right)
3.Child
4.Branch
176 1577420 Length of the walk of a graph is .... ?
Unit : 3, Group : 3
1.The number of vertices in walk W
2.The number of edges in walk W (Right)
3.Total number of edges in a graph
4.Total number of vertices in a graph
177 1577639 What is a full binary tree?
Unit : 3, Group : 3
1.Each node has exactly zero or two children (Right)
2.Each node has exactly two children
3.All the leaves are at the same level
4.Each node has exactly one or two children
178 1587046 Two computers C1 and C2 are configured as follows. C1 has IP address 203.197.2.53 and netmask 255.255.128.0. C2 has IP address
203.197.75.201 and netmask 255.255.192.0. which one of the following statements is true?
Unit : 3, Group : 3 (A) C1 and C2 both assume they are on the same network
(B) C2 assumes C1 is on same network, but C1 assumes C2 is on a different network
(C) C1 assumes C2 is on same network, but C2 assumes C1 is on a different network
(D) C1 and C2 both assume they are on different networks.
1.a
2.b
3.c (Right)
4.d
179 1577475 The number of edges from the root to the node is called __________ of the tree.
Unit : 3, Group : 3
1.Height
2.Depth (Right)
3.Length
Page 31 of 41
180 1577950 Which of the following are parameters involved in computing the total cost of a software development
Unit : 3, Group : 3 project?
1.Hardware and software costs

2.Effort costs
3.Travel and training costs
181 1579247 Http uses the port number
Unit : 3, Group : 3 1.85

2.86
3.88 (Right)
4.82
182 1579256 what is the network id of 130.6.8.0
Unit : 3, Group : 3 1.130.6.8.0

2.130.6.0.0 (Right)
3.130.0.0.0
4.255.255.255.255
183 1586442 Which one of the following task is not done by data link layer?
a) framing
Unit : 3, Group : 3 b) error control
c) flow control
d) channel coding
1.a
2.b
3.c
4.d (Right)
184 1586465 An email client needs to know the _________ of its initial SMTP server.
a) IP address
Unit : 3, Group : 3 b) MAC address
c) Url
1.a (Right)
2.b
3.c
4.d
Page 32 of 41
185 1587069
Which device uses logical addressing system?
Unit : 3, Group : 3
(A) Hub
(B) Switch
(C) bridge
(D) Router
1.a
2.b
3.c
4.d (Right)
186 1577262 Which of the following algorithm pays the least attention to the ordering of the elements in the input
Unit : 3, Group : 3 list?
1.Insertion sort
2.Selection sort (Right)
3.Quick sort
4.None
187 1587040
Consider Subnet mask of class B network on the internet is 255.255.240.0 then, what is the maximum number of hosts per subnets?
Unit : 3, Group : 3
(A) 4098
(B) 4096
(C) 4094
(D) 4092
1.a
2.b
3.c (Right)
4.d
188 1577226 The complexity of Binary search algorithm is....
Unit : 3, Group : 3
1.O(n)
2.O(log n ) (Right)
3.O(n2)
4.O(n log n)
189 1577301 In Binary trees nodes with no successor are called ««
Unit : 3, Group : 3
1.End nodes
2.Terminal nodes (Right)
3.Final nodes
4.Last nodes
Page 33 of 41
190 1577390 A graph is a collection of.... ?
Unit : 3, Group : 3
1.Row and columns
2.Vertices and edges (Right)
3.Equations
4.None of these
191 1578580 The domain name system is maintained by _______
Unit : 3, Group : 3 1.a single computer
2.distributed database system (Right)
3.a single server
192 1579187
A Circuit-Switched Network is made of a set of switches connected by physical
Unit : 3, Group : 3
1.links (Right)
2.media
3.nodes
4.lines
193 1587061 Which one of the following uses UDP as the transport protocol?
(A) HTTP
Unit : 3, Group : 3 (B) Telnet
(C) DNS
(D) SMTP
1.a
2.b
3.c (Right)
4.d
194 1579093
Unit : 3, Group : 3
In symmetric-key cryptography, key locks and unlocks box is
1.same (Right)
2.shared
3.private
4.public
195 1579136 If you have to send multimedia data over SMTP it has to be encoded into
Unit : 3, Group : 3 1.Binary
2.Signal
3.ASCII (Right)
Page 34 of 41
196 1586458 Which one of the following is a transport layer protocol?
a) stream control transmission protocol
Unit : 3, Group : 3 b) internet control message protocol
c) neighbor discovery protocol
d) dynamic host configuration protocol
1.a (Right)
2.b
3.c
4.d
197 1577414 A graph with no edges is known as empty graph. Empty graph is also known as... ?
Unit : 3, Group : 3
1.Trivial graph (Right)
2.Regular graph
3.Bipartite graph
4.None of these
198 1578564 Simple mail transfer protocol (SMTP) utilizes _________ as the transport layer protocol for electronic mail transfer.
Unit : 3, Group : 3 1.UDP
2.TCP (Right)
3.TCP AND UDP
4.None of above
199 1577331 A connected graph T without any cycles is called a ««
Unit : 3, Group : 3
1.A tree graph

2.Free tree
3.A tree d
4.All of the above (Right)
200 1578596 The HTTP request message is sent in _________ part of three-way handshake.
Unit : 3, Group : 3 1.First
2.Second
3.Third (Right)
4.Fourth
201 1577337 Every node N in a binary tree T except the root has a unique parent called the «««of N.
Unit : 3, Group : 3
1.Antecedents
2.Predecessor (Right)
3.Forerunner
4.Precursor
Page 35 of 41
202 1578590 FTP is built on _____ architecture
Unit : 3, Group : 3 1.Client-server (Right)
2.P2P
3.Both of the mentioned
203 1579090 What is data encryption standard (DES)?
Unit : 3, Group : 3 1.block cipher (Right)
2.Stream cipher
3.bit cipher
204 1586446 Which one of the following is the multiple access protocol for channel access control?
a) CSMA/CD
Unit : 3, Group : 3 b) CSMA/CA
c) Both CSMA/CD & CSMA/CA
1.a
2.b
3.c (Right)
4.d
205 1579281 The physical layer concerns with
Unit : 3, Group : 3 1.bits

2.frames
3.packets (Right)
4.none of the mentiones
206 1586454 ICMP is primarily used for
a) error and diagnostic functions
Unit : 3, Group : 3 b) addressing
c) forwarding
1.a (Right)
2.b
3.c
4.d
207 1577958 slack time refer to:
Unit : 3, Group : 3
1.an activity
2.an event (Right)
3.both event and activity
4.none of above
208 1578569 A DNS client is called _________
Unit : 3, Group : 3 1.DNS updater
2.DNS resolver (Right)
3.DNS handler
Page 36 of 41
209 1579098 Keys used in cryptography are
Unit : 3, Group : 3
1.secret key
2.private key
3.public key
4.all of the mentioned (Right)
210 1586457 Which one of the following is a version of UDP with congestion control?
a) datagram congestion control protocol
Unit : 3, Group : 3 b) stream control transmission protocol
c) structured stream transport
1.a (Right)
2.b
3.c
4.d
211 1579157 Three or more devices share a link in ________ connection
Unit : 3, Group : 3 1.Unipoint

2.Multipoint (Right)
3.Point to point
212 1586462 Which one of the following allows client to update their DNS entry as their IP address change?
a) dynamic DNS
Unit : 3, Group : 3 b) mail transfer agent
c) authoritative name server
1.a (Right)
2.b
3.c
4.d
213 1586464 Simple mail transfer protocol (SMTP) utilizes _________ as the transport layer protocol for electronic mail transfer.
a) TCP
Unit : 3, Group : 3 b) UDP
c) DCCP
d) SCTP
1.a (Right)
2.b
3.c
4.d
214 1577457 Dijkstra¶s Algorithm will work for both negative and positive weights?
Unit : 3, Group : 3
1.True
2.False (Right)
3.
4.
Page 37 of 41
215 1578549 SMTP uses the TCP port
Unit : 3, Group : 3 1.
2.
3.
4.
216 1586452 Which one of the following routing algorithm can be used for network layer design?
a) shortest path algorithm
Unit : 3, Group : 3 b) distance vector routing
c) link state routing
d) all of the mentioned
1.a
2.b
3.c
4.d (Right)
217 1586455 Which one of the following is a transport layer protocol used in networking?
a) TCP
Unit : 3, Group : 3 b) UDP
c) Both TCP and UDP
1.a
2.b
3.c (Right)
4.d
218 1578585 Expansion of FTP is
Unit : 3, Group : 3 1.Fine Transfer Protocol
2.File Transfer Protocol (Right)
3.First Transfer Protocol
219 1587052 The address resolution protocol (ARP) is used for:
(a) Finding the IP address from the DNS
Unit : 3, Group : 3 (b) Finding the IP address of the default gateway
(c) Finding the IP address that corresponds to a MAC address
(d) Finding the MAC address that corresponds to an IP address
1.a
2.b
3.c
4.d (Right)
220 1579143 The underlying Transport layer protocol used by SMTP is
Unit : 3, Group : 3 1.
2.
3.
4.
Page 38 of 41
221 1579277 Network congestion occurs
Unit : 3, Group : 3 1.in case of traffic overloading (Right)

2.when a system terminates
3.when connection between two nodes terminates
222 1586461 Servers handle requests for other domains _______
a) directly
Unit : 3, Group : 3 b) by contacting remote DNS server
c) it is not possible
1.a
2.b (Right)
3.c
4.d
223 1577448 Graph traversal is different from a tree traversal, because:
Unit : 3, Group : 3
1.Tree is not connected
2.graphs may have loops
3.trees has root (Right)
4.None of these
224 1587044
What is the maximum window size for data transmission Using Selective Repeat protocol with n-bit frame sequence number?
Unit : 3, Group : 3
(A) 2n
(B) 2n-1
(C) 2n-2
(D) 2n-1
1.a
2.b
3.c
4.d (Right)
225 1577347 TREE[1]=NULL indicates tree is ««
Unit : 3, Group : 3
1.Overflow
2.Underflow
3.Empty (Right)
4.Full
226 1577362 Which indicates pre-order traversal?
Unit : 3, Group : 3
1.Left sub-tree, Right sub-tree and root
2.Right sub-tree, Left sub-tree and root
3.Root, Left sub-tree, Right sub-tree (Right)
4.Right sub-tree, root, Left sub-tree
Page 39 of 41
227 1577430 If the origin and terminus of a walk are same, the walk is known as... ?
Unit : 3, Group : 3
1.Open
2.Closed (Right)
3.Path
4.None of these
228 1587057 The reverse address resolution protocol (RARP) is used for:
(a) Finding the IP address from the DNS
Unit : 3, Group : 3 (b) Finding the IP address of the default gateway
(c) Finding the IP address that corresponds to a MAC address
(d) Finding the MAC address that corresponds to an IP address
1.a
2.b
3.c (Right)
4.d
229 1577215 The complexity of linear search algorithm is.....
Unit : 3, Group : 3
1.O(n) (Right)
2.O(log n)
3.O(n2)
4.O(n log n)
230 1579130 To create Web Pages we use a term, called
Unit : 3, Group : 3
1.TCP/IP
2.WWW
3.HTML (Right)
4.FTP
231 1579242
A switched network consists of a series of interlinked nodes, called
Unit : 3, Group : 3
1.endpoints
2.packets
3.switches (Right)
4.links
232 1587030 In the IPv4 addressing format, the number of networks allowed under Class C addresses is
(A) 2^14
Unit : 3, Group : 3 (B) 2^7
(C) 2^21
(D) 2^24
1.a
2.b
3.c (Right)
4.d
Page 40 of 41
233 1587064
Match the following:
Unit : 3, Group : 3
(P) SMTP (1) Application layer (Q) BGP (2) Transport layer (R) TCP (3) Data link layer (S) PPP (4) Network layer (5) Physical layer
(A) P ±2 Q ±1 R ±3 S ±5

(B) P ±1 Q ±4 R ±2 S ±3
(C) P ±1 Q ±4 R ±2 S ±5
(D) P ±2 Q ±4 R ±1 S ±3
1.a
2.b (Right)
3.c
4.d
234 1577232 The worst case occur in quick sort when..
Unit : 3, Group : 3
1.Pivot is the median of the array
2.Pivot is the smallest element (Right)
3.Pivot is the middle element
235 1578593 Mode of data transfer in FTP
Unit : 3, Group : 3 1.Stream mode
2.Block mode (Right)
3.Compressed mode
236 1579197
A switch in a datagram network uses a
Unit : 3, Group : 3
1.destination address
2.sender address
3.routing table (Right)
4.header
237 1586456 Transmission control protocol is
a) connection oriented protocol
Unit : 3, Group : 3 b) uses a three way handshake to establish a connection
c) recievs data from application as a single stream
d) all of the mentioned
1.a
2.b
3.c
4.d (Right)
Page 41 of 41
238 1586460 Multiplexing technique that shifts each signal to a different carrier frequency
a) FDM
Unit : 3, Group : 3 b) TDM
c) Both FDM & TDM
1.a (Right)
2.b
3.c
4.d
239 1577256
What is the time complexity of following code:
Unit : 3, Group : 3
int a = 0;
for (i = 0; i < N; i++) {
for (j = N; j > i; j--) {
a = a + i + j;
}
}
1.O(N)
2.O(N*log(N))
3.O(N * Sqrt(N))
4.O(N*N) (Right)
240 1577467 What would be the DFS traversal of the given Graph?
Unit : 3, Group : 3
1.ABCED (Right)
2.AEDCB
3.EDCBA
4.ADECB
241 1578600 What is WPA?
Unit : 3, Group : 3 1.wi-fi protected access (Right)
2.wired protected access
3.wired process access
4.wi-fi process access

Quiz CST 355 TT

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Quiz CST 355 TT

Uploaded by

Copyright:

Available Formats

Question Details of Subject :QUIZ-CST-355

QNo Question Id Question Description

1.Normalization of data (Right)

1.Be in Second Normal Form (2NF)

1.2, 252, 401, 398, 330, 344, 397, 363

II. 52, 97, 121, 195, 242, 381, 472

III. 142, 248, 520, 386, 345, 270, 307

IV. 550, 149, 507, 395, 463, 402, 270

1.II and III only

1.Breadth First Search (Right)

1.transitive dependency (Right)

1.Quick Sort (Right)

1.Stack Growing (Right)

1.Only in forward direction

1.Front & Rear ends respectively

1.Strong entity set

1.Every binary tree is either complete or full

1.25, 12, 16, 13, 10, 8, 14

1.the same as 0 for integer

1.BCNF is stricter than 3 NF

1.Parsing and translation

1.Data Flow Document

1.data is defined separately and not included in programs.

1.Recovery system (Right)

1.Structured Query Language (Right)

1.Entity-relationship diagram (Right)

Which is the applicable level protocol user in each activity?

Unit : 3, Group : 3 1.1.4.5.6

Unit : 3, Group : 3 1.a process is running on both devices

1.O(N * M) time, O(1) space

Unit : 3, Group : 3 1.broadcast network (Right)

1.Cyclomatic Complexity (Right)

Unit : 3, Group : 3 1.Added (Right)

Unit : 3, Group : 3 1.bridge

1.Hardware and software costs

Unit : 3, Group : 3 1.85

Unit : 3, Group : 3 1.130.6.8.0

1.A tree graph

Unit : 3, Group : 3 1.bits

Unit : 3, Group : 3 1.Unipoint

Unit : 3, Group : 3 1.in case of traffic overloading (Right)

(A) P ±2 Q ±1 R ±3 S ±5

You might also like