0800CCT308042502

SET 2 Total Pages: 6

Reg No.:_______________ Name:_____________________________________

APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY

B.Tech Degree S6 (R,S) Examination April 2025 (2019 Scheme)
Course Code: CCT 308
Course name: COMPREHENSIVE COURSE WORK
Max. Marks: 50 Duration: 1 Hour

Instructions: (1) Each question carries one mark. No negative marks for wrong answers
(2) Total number of questions: 50
(3) All questions are to be answered. Each question will be followed by 4 possible answers of
which only ONE is correct.
(4) If more than one option is chosen, it will not be considered for valuation.
(5) Calculators are not permitted

1. What is the number of edges present in a complete graph having n vertices?

a) (n*(n-1))/2 b) n c) (n*(n+1))/2 data d)
inadequate
2. To represent hierarchical relationships between elements, which data structure is suitable?
a) Dequeue b) Graph c) Tree d) Priority

3. The best data structure to check whether an arithmetic expression has balanced parentheses is a
a) Queue b) Stack c) Tree d) Graph
4. When a pop() operation is called on an empty queue, what is the condition called?
a) Overflow b) Underflow c) Syntax error d) Garbage
5. The time complexity of heap sort in worst case is:
a) O(logn) b) O(n) c) O(nlogn) d) O(n2 )

6. What does the following function do for a given Linked List with the first node as head?
void fun1(struct node* head) {
if(head == NULL)
return;
fun1(head->next);
printf("%d ", head->data);
}

a) Prints all b) Prints all c) Prints alternative d) Prints

nodes of nodes of nodes of alternative
linked list linked list linked list nodes of

Page 1 of 6
 0800CCT308042502

in reverse in reverse linked list

order order

7. In a file which contains 1 million records and the order of the tree is 100, then what is the
maximum number of nodes to be accessed if B+ tree index is used?
a) 4 b) 3 c) 5 d) 6
8. In a graph, if every vertex is connected to every other vertex, the graph is known as:
a) sparse graph b) tree c) complete graph d) null graph
9. To implement a stack using queue (with only enqueue and dequeue operations), how many
queues will you need?
a) 1 b) 2 c) 3 d) 4
10. Which of the following c code is used to create a new node?
a) ptr = b) ptr = c) ptr = d) ptr =
(NODE*)mallo (NODE*)malloc(N (NODE*)malloc( (NODE)ma
c(sizeof(NODE ODE); sizeof(NODE*)); lloc(sizeof(
)); NODE));

11 A semaphore is used for

a) Process b) Synchronization c) File management d) Memory
termination and mutual allocation
exclusion

12 If a process is executing in its critical section, then no other processes can be executing in their
critical section. What is this condition called?
a) mutual b) critical exclusion c) synchronous d) asynchrono
exclusion exclusion us
exclusion
13 In a time sharing operating system, when the time slot assigned to a process is completed, the
process switches from the current state to?
a) Suspended state b) Terminated state c) Ready state d) Blocked
state

14 Thrashing is a situation in which:

a) Processes are b) CPU utilization is c) The system d) There is a
waiting for I/O very high spends most of deadlock
the time
swapping pages

15 Consider three CPU-intensive processes, which require 10, 20 and 30 time units and arrive at
times 0, 2 and 6 respectively. How many context switches are needed if the operating system

Page 2 of 6
 0800CCT308042502

implements a shortest remaining time first scheduling algorithm? Do not count the context
switches at time zero and at the end.
a) 1 b) 2 c) 3 d) 4
16 A system has 3 user processes each requesting 2 units of resource ‘R’. The minimum number
of units of R needed such that no deadlock will occur?
a) 3 b) 4 c) 5 d) 6
17 Which of the following are NOT shared by the threads of the same process?
a) Stack b) Registers c) Address space d) Message queue
a) a and d b) b and c c) a and b d) a, b and c

18 In demand paging, when a required page is not in memory, it results in

a) Segmentation b) Page fault c) Context switch d) Deadlock
fault
19 In FIFO page replacement algorithm, when a page must be replaced ____________
a) oldest page is b) newest page is c) random page is d) none of the
chosen chosen chosen mentioned

20 Paging suffers from .............. fragmentation

a) External b) Internal c) Physical d) All of the
above

21 What is an example of a NoSQL Database?

a) MySQL b) MongoDB c) Oracle d) PostgreSQ
L
22 Relations produced from E R Model will always be in
a) 1 NF b) 2 NF c) 3 NF d) 4 NF
23 The SQL statement to retrieve all columns from a table named employees is:
a) SELECT ALL b) SELECT * FROM c) GET * FROM d) FETCH
FROM employees; employees; ALL
employees; FROM
employees;

24 In Two-Phase Locking (2PL), what happens in the growing phase?

a) Transactions b) Transactions c) Deadlocks occur d) Transaction
acquire locks release locks s rollback

25 What is the Lost Update Problem also known as?

a) W-W Conflict b) W-R Conflict c) R-R Conflict d) None

Page 3 of 6
 0800CCT308042502

26 Which of the following is not a valid constraint in a relational database?

a) PRIMARY b) FOREIGN KEY c) UNION KEY d) UNIQUE
KEY
27 Consider the given relation R(A,B,C,D) with the following set of Functional
Dependency. FD={AB→CD, C→D, C→A}. Find the Candidate Key.
a) {AB,BC} b) {AC,CD} c) B d) A
28 Which of the following is a DDL command?
a) Select b) Create c) Insert d) Delete
29 In which normal form is a relation if it has no transitive dependency?
a) 1NF b) 2NF c) 3NF d) BCNF
30 Let E1 and E2 be two entities in an ERdiagram with simple single-valued attributes. R1 and R2
are two relationships between E1 and E2, where R1 is one-to-many and R2 is many-to-many.
R1 and R2 do not have any attributes of their own. What is the minimum number of tables
required to represent this situation in the relational model?
a) 2 b) 3 c) 4 d) 5

31 Which device is used to connect different networks together?

a) Switch b) Repeater c) Router d) Hub

32 Spoofing in network security refers to

a) Hiding data b) Pretending to be c) Encrypting data d) Preventing
from attackers another packets brute force
user/system attacks

33 The main function of DHCP is

a) Assigning b) Assigning IP c) Encrypting data d)
MAC addresses addresses packets Controlling
dynamically network
congestion
34 IPSec operates at two different modes: _________ mode and _________ mode.

a) Transport b) Secure mode and c) Authentication d) Public

mode and Non-secure mode mode and mode and
Tunnel mode Encryption mode Private
mode

35 Which of the following protocols is used for encrypting email communications?

a) PGP b) HTTP c) Telnet d) DNS
36 The length of an IPv6 address is:

Page 4 of 6
 0800CCT308042502

a) 32 bits b) 64 bits c) 128 bits d) 256 bits

37 Which port is commonly used for HTTPS traffic?

a) 21 b) 53 c) 80 d) 443
38 Which command can be used to view the current IP configuration of a device?
a) ipconfig b) ifconfig c)
Both ipconfig d) netstat
and ifconfig
39 Given the mask 255.255.254.0. How many usable hosts per subnet is possible?
a) 510 b) 550 c) 562 d) 600
40 Which attack involves intercepting and altering communication between two parties?
a) Phishing b) Ransomware Attack c) Brute Force d) Man-in-
Attack Attack the-Middle
(MITM)
Attack
41 Which of the following is a post-quantum cryptographic algorithm?
a) AES b) RSA c) SHA-3 d) Lattice-
based
cryptograp
hy
42 A one-way function is a function that is
a) Easy to b) Reversible c) Used only for d) Used only
compute but encryption for
hard to decryption
reverse
43 Which of the following is not a type of digital certificate?
a) SSL certificate b) Code signing c) Personal d) Rail fence
certificate certificate certificate
44 Which of the following best describes non-repudiation in cryptography?
a) Ensuring that b) Preventing c) Guaranteeing d) Encrypting
data is only unauthorized that a sender data to
accessible to modification of data cannot deny prevent
authorized sending a eavesdropp
users message and a ing
receiver cannot
deny receiving
it

45 What is the purpose of an Initialization Vector (IV) in encryption?

a) To increase b) To ensure c) To replace the d) To decrypt
encryption uniqueness in encryption key data
speed encryption output

Page 5 of 6
 0800CCT308042502

46 Which of the following is an example of a side-channel attack?

a) b) c) d)
Brute-force Man-in-the-middle Timing attack Dictionary
attack attack attack

47 Which of the following is the key size of AES?

a) 128 b) 192 c) 256 d) All of the
Above
48 RSA algorithm is based on which mathematical problem?
a) Discrete b) Factoring large c) Elliptic curve d) Matrix
logarithm prime numbers multiplication factorizatio
problem n

49 All the below-stated processes are performed in the AES (Advanced Encryption Standard)
Algorithm. Which of the following process(s) are not performed in the final round of the AES?
a) b) c) d)
Substitution Shift rows Mix columns Add round
bytes key

50 Which two quantum mechanical concepts are essential to quantum cryptography?

a) b) c) d)
Heisenberg Fundamental Momentum Planck's
Uncertainty Principle and Bohr's Principle and Principle
Principle and Model Principle Photons and
Photon Principle Fundament
Polarization al Principle
Principle.

Page 6 of 6