Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                

Sbi (So) It Mock13 Sample

Download as pdf or txt
Download as pdf or txt
You are on page 1of 6

SBI(SO)IT

Practise Mock 13: 60 MCQs


Software Development (20 Qs)
1. Which of the following is a major difference between Cross-Site Scripting (XSS) and
Cross-Site Request Forgery (CSRF)?

 A) XSS exploits the trust a user has in a particular site, while CSRF exploits the
trust a site has in a user's browser.
 B) CSRF is mitigated using input sanitization, whereas XSS is mitigated using
tokens.
 C) XSS allows the attacker to steal cookies, while CSRF allows the attacker to
inject SQL commands.
 D) Both XSS and CSRF can be mitigated using encryption.

2. Consider the following SQL statement:

SELECT * FROM users WHERE username = 'admin' AND password = '' OR '1'
= '1';

What type of attack is this code vulnerable to?

 A) Cross-Site Scripting (XSS)


 B) SQL Injection
 C) Cross-Site Request Forgery (CSRF)
 D) DDoS Attack

1|P ag e
3. What is the main technique used to mitigate Cross-Site Scripting (XSS) attacks in
modern web applications?

 A) Encrypting user input


 B) Input validation and output encoding
 C) Using CAPTCHA for form submissions
 D) Limiting request size

4. In a Depth-First Search (DFS) traversal of a binary tree, which node is visited first?

 A) Root node
 B) Leftmost node
 C) Rightmost node
 D) The node with the smallest value

5. Consider the following code snippet:


def bfs(graph, start):
visited = []
queue = [start]

while queue:
vertex = queue.pop(0)
if vertex not in visited:
visited.append(vertex)
queue.extend(set(graph[vertex]) - set(visited))
return visited

What traversal strategy is this code implementing?

 A) Depth-First Search
 B) Breadth-First Search
 C) Binary Search
 D) Recursive Traversal

2|P ag e
18. In a circular queue implemented using an array of size n, when is the queue full?

 A) front == rear
 B) (rear + 1) % n == front
 C) rear == n-1
 D) front == n-1

19. Which of the following heap operations has the same time complexity as inserting
a new element into a heap?

 A) Heapify
 B) Delete Min
 C) Find Min
 D) Merge Heaps

20. You are given a complete binary tree. Which traversal algorithm will give you the
elements in sorted order?

 A) Pre-order
 B) In-order
 C) Post-order
 D) Level-order

Infra support (20 Qs)

21.Which synchronization primitive allows threads to be blocked until a certain


condition becomes true, avoiding busy-waiting?

o a) Spinlocks
o b) Semaphores
o c) Condition variables
o d) Mutex

6|P ag e
22.Which of the following memory allocation techniques reduces external
fragmentation the most?

o a) Paging
o b) Segmentation
o c) Fixed-partitioning
o d) Variable-partitioning

23.In a system using paging for memory management, the page size is 4 KB. If a
process needs to access the byte at virtual address 8196, which page number and
offset will it reference?

o a) Page 1, Offset 4
o b) Page 2, Offset 4
o c) Page 3, Offset 4
o d) Page 2, Offset 8

24. Which of the following scheduling algorithms optimizes the average waiting time?

 a) Round Robin
 b) FCFS
 c) SJF (Shortest Job First)
 d) Priority Scheduling

25. In the context of paging, what is a "page fault"?

 a) A situation where a page is modified


 b) A situation where a page is corrupted
 c) A situation where a requested page is not found in memory
 d) A situation where a page is found but its contents are incorrect

7|P ag e
38. In memory management, what is the purpose of a Translation Lookaside Buffer
(TLB)?

 a) To translate logical addresses to physical addresses.


 b) To store page tables.
 c) To cache frequently used page table entries.
 d) To store swapped-out pages.

39. Which of the following statements about demand paging is true?

 a) Pages are preloaded into memory before they are requested.


 b) Pages are loaded into memory only when they are accessed.
 c) All pages of a program must be loaded into memory at program start.
 d) Page replacement does not occur in demand paging.

40. In a system using FIFO page replacement with three frames, what happens if a
page fault occurs when the memory is full?

 a) The least recently used page is replaced.


 b) The first page loaded into memory is replaced.
 c) The most frequently used page is replaced.
 d) The page that will not be used for the longest time is replaced.

Networking(10 Qs)
1. Which of the following is true about a mesh network topology?

 a) It uses fewer cables than other topologies.


 b) It is highly redundant and offers multiple pathways for data.
 c) It operates only with wireless networks.
 d) It is more susceptible to collisions than a bus topology.

11 | P a g e
Cloud (10 Qs)
51. Which of the following best describes the key feature of "broad network access" in
cloud computing?

 a) Services are accessible via the Internet on various devices.


 b) Services are geographically limited.
 c) Services can only be accessed on dedicated servers.
 d) Services require specific network configurations to access.

52. Which of the following cloud deployment models involves hosting resources in a
third-party environment with shared infrastructure?

 a) Public Cloud
 b) Private Cloud
 c) Hybrid Cloud
 d) Community Cloud

53. Which cloud computing characteristic allows for dynamic scaling of resources
based on demand?

 a) Measured service
 b) Rapid elasticity
 c) Broad network access
 d) Resource pooling

54. What does "containerization" primarily focus on in cloud environments?

 a) Isolating applications within virtual machines.


 b) Running applications with dependencies in isolated environments.
 c) Consolidating physical servers into one virtual machine.
 d) Creating multiple virtual networks within a cloud service.

14 | P a g e

You might also like