AM Software Test 8

Welcome to your AM Software Test 8

Which data structure is used in the implementation of recursion?

Which sorting algorithm has the best average-case time complexity?

Which of the following is NOT a Black-box testing technique?

Which data structure is most efficient for implementing Dijkstra’s algorithm?

In software engineering, what does “Cyclomatic Complexity” measure?

Which of the following databases supports ACID properties strictly?

. Which traversal technique is used in Depth-First Search (DFS)?

What is the time complexity of binary search?

Which testing is done without executing the code?

Which algorithm is used for deadlock detection in OS?

Which data structure is used in Breadth-First Search (BFS)?

Which hashing technique minimizes collisions?

Which is not part of the Software Development Life Cycle (SDLC)?

What is the main disadvantage of linked lists over arrays?

Which scheduling algorithm may cause starvation?

Which testing ensures that new changes don’t break existing features?

Which tree structure is used in database indexing?

Which of these algorithms is NOT greedy?

What is the main goal of software verification?

Which of the following is an NP-complete problem?

Which technique is used for resolving deadlocks?

Which protocol ensures reliable communication in networks?

Which is NOT an Agile methodology?

What is Big-O of Merge Sort?

Which layer of OSI handles encryption?

Which database model uses nodes and edges?

In OOP, which principle hides internal implementation?

Which memory is the fastest?

Which scheduling algorithm is best for time-sharing systems?

Which of these is NOT a functional requirement?

Leave a Reply

Your email address will not be published. Required fields are marked *

Scroll to Top