Practice Data Structure Questions and Answers

• Which of the following is NOT among the OWASP Top 10 Web Security Risks?
• Which of the following phases in the Software Development Life Cycle (SDLC) ensures that the final product meets the agreed-upon requirements and specifica...
• Which design pattern is best suited for ensuring that a class has only one instance and provides a global point of access to it?
• Which of the following is a key principle of the SOLID design principles that focuses on ensuring a class has only one reason to change?
• Which of the following types of testing is typically conducted by end-users to verify that the developed software meets their requirements?
• In Java, what will be the output of the following code snippet? public class Test {     public static void main(String[] args) {         int...
• Which SQL command is used to remove only specific rows from a table while preserving the structure and other rows?
• What is the time complexity of searching an element in a balanced binary search tree (BST) with nnn nodes?
• What will be the output of the following Java snippet? class A {     public void display() {         System.out.println("Class A");     }}...
• In a data warehouse, which of the following best describes the concept of "data granularity"?
• Which of the following is a key characteristic of an effective Management Information System (MIS)?
• In system design, what is the primary purpose of a feasibility study?
• In the context of system analysis, which of the following best defines the "use case" diagram?
• Which of the following accurately describes the role of a "foreign key" in a relational database system?
• What is the primary purpose of an Entity-Relationship (ER) Diagram in database design?
• Which of the following best explains segmentation in memory management?
• In networking, what is the primary purpose of subnetting?
• Which of the following data structures is best suited for implementing a LIFO (Last In, First Out) mechanism?
• What is the best-case time complexity of the binary search algorithm ?
• Which of the following traversal methods is used to visit nodes in the order "left child, root, right child" in a binary tree?
• Which sorting algorithm is considered the most efficient for large datasets with no additional memory constraints?
• Which of the following best describes Abstraction in Object-Oriented Programming (OOP)?
• Which of the following is an example of Polymorphism in Object-Oriented Programming?
• Which of the following best illustrates Encapsulation in Object-Oriented Programming?
• What type of relationship is represented by Aggregation in Object-Oriented Programming?
• Which of the following is a key objective of the Requirement Analysis phase in the Software Development Lifecycle (SDLC)?
• Which testing type evaluates internal code logic and control flow?
• Which design pattern is best suited for managing the creation of objects without specifying their concrete classes?
• Which SOLID principle ensures that a class has only one reason to change?
• Which of the following statements is true about ACID properties in database transactions?
• Which type of database key is a candidate key that has not been chosen as the primary key?
• Which of the following is the main objective of the 3rd Normal Form (3NF) in database normalization?
• Which type of database join returns only the matching rows from two tables based on a condition?
• Which of the following is the primary goal of a Cross-Site Scripting (XSS) attack?
• Which of the following attacks can occur when a user is tricked into performing unintended actions on a trusted website without their knowledge?
• Which cryptographic concept ensures that data integrity is preserved and cannot be altered during transmission?
• Which of the following OWASP Top 10 risks involves insecure coding practices that allow attackers to gain access to sensitive data, such as usernames and p...
• Which of the following statements is true about deadlocks in an operating system?
• Which page replacement algorithm minimizes the number of page faults theoretically but is difficult to implement in practice?
• Which CPU scheduling algorithm always selects the process with the smallest burst time first, potentially leading to starvation?