Vector University

Mock Tests

Test your knowledge with our practice exams.

Data Structures Mock Test

  1. What is the time complexity of accessing an element in an array?
    O(1)
    O(n)
    O(log n)
    O(n^2)
  2. Which data structure follows LIFO?
    Queue
    Stack
    Array
    Linked List
  3. What is the worst-case time for quicksort?
    O(n log n)
    O(n^2)
    O(n)
    O(log n)
  4. In a binary search tree, where is the smallest element?
    Root
    Leftmost leaf
    Rightmost leaf
    Any leaf
  5. What does FIFO stand for?
    First In First Out
    First In Last Out
    Last In First Out
    Last In Last Out
  6. Which is not a linear data structure?
    Array
    Tree
    Queue
    Stack
  7. What is the space complexity of a graph with V vertices and E edges?
    O(V + E)
    O(V)
    O(E)
    O(V * E)
  8. Which sorting algorithm is stable?
    Quick Sort
    Merge Sort
    Heap Sort
    Selection Sort
  9. What is the best case for bubble sort?
    O(n)
    O(n log n)
    O(n^2)
    O(1)
  10. Which data structure uses hashing?
    Array
    Hash Table
    Stack
    Queue

Web Development Mock Test

  1. What does HTML stand for?
    HyperText Markup Language
    HighText Machine Language
    HyperText Machine Language
    HyperText Markup Link
  2. Which CSS property changes text color?
    font-size
    color
    background
    margin
  3. What is JavaScript used for?
    Styling
    Structure
    Interactivity
    Layout
  4. Which tag is for the largest heading?
    h1
    h2
    h3
    h4
  5. What does CSS stand for?
    Computer Style Sheets
    Cascading Style Sheets
    Creative Style Sheets
    Colorful Style Sheets
  6. Which is a JavaScript framework?
    HTML
    React
    CSS
    SQL
  7. What is responsive design?
    Fast loading
    Adapts to screen size
    Uses images
    No CSS
  8. Which HTTP method sends data?
    GET
    POST
    PUT
    DELETE
  9. What is an API?
    Application Programming Interface
    Application Program Index
    Application Protocol Interface
    Application Programming Index
  10. Which is a backend language?
    HTML
    Node.js
    CSS
    JavaScript (client-side)

AI Fundamentals Mock Test

  1. What is AI?
    Artificial Intelligence
    Automated Intelligence
    Advanced Intelligence
    Algorithmic Intelligence
  2. Which is supervised learning?
    Clustering
    Classification with labels
    Dimensionality reduction
    Anomaly detection
  3. What is overfitting?
    Model too simple
    Model too complex for data
    No training data
    Too much data
  4. Which metric for classification?
    Accuracy
    Mean Squared Error
    R-squared
    Silhouette Score
  5. What is a neural network?
    Database
    Inspired by brain
    Sorting algorithm
    Search tree
  6. Which is unsupervised learning?
    Regression
    Clustering
    Classification
    Forecasting
  7. What is bias in AI?
    Model preference
    Data imbalance
    Overfitting
    Underfitting
  8. Which is a deep learning framework?
    Pandas
    TensorFlow
    NumPy
    Matplotlib
  9. What is reinforcement learning?
    Labeled data
    Trial and error with rewards
    Unlabeled data
    Dimensionality reduction
  10. Why is AI ethics important?
    Faster processing
    Fairness and safety
    Cheaper costs
    More accurate

Algorithms Mock Test

  1. What is the time complexity of binary search?
    O(1)
    O(log n)
    O(n)
    O(n^2)
  2. Which algorithm is used for finding the shortest path in a graph?
    Dijkstra's
    Kruskal's
    Prim's
    Floyd-Warshall
  3. What does DFS stand for?
    Depth First Search
    Direct File System
    Data Flow Structure
    Dynamic Function Set
  4. Which sorting algorithm has the best average case?
    Bubble Sort
    Quick Sort
    Insertion Sort
    Selection Sort
  5. What is a greedy algorithm?
    Always optimal
    Makes locally optimal choices
    Uses backtracking
    For dynamic programming
  6. Which algorithm is used for topological sorting?
    Kahn's algorithm
    Bellman-Ford
    Floyd-Warshall
    Kruskal's
  7. What is the purpose of the Knuth-Morris-Pratt algorithm?
    Sorting
    String matching
    Graph traversal
    Number theory
  8. Which algorithm paradigm uses memoization?
    Greedy
    Divide and Conquer
    Dynamic Programming
    Backtracking
  9. What is the time complexity of the naive string matching algorithm?
    O(n)
    O(m*n)
    O(log n)
    O(n log n)
  10. Which algorithm is used for finding minimum spanning tree?
    Dijkstra's
    Kruskal's
    Bellman-Ford
    Floyd-Warshall

Database Management Mock Test

  1. What does SQL stand for?
    Structured Query Language
    Simple Query Language
    Standard Query Language
    Sequential Query Language
  2. Which is a NoSQL database?
    MySQL
    MongoDB
    PostgreSQL
    Oracle
  3. What is normalization in databases?
    Reducing redundancy
    Increasing redundancy
    Adding indexes
    Creating views
  4. Which key uniquely identifies a record?
    Foreign Key
    Primary Key
    Composite Key
    Candidate Key
  5. What is ACID in databases?
    Atomicity, Consistency, Isolation, Durability
    Accuracy, Completeness, Integrity, Durability
    Atomicity, Completeness, Isolation, Durability
    Accuracy, Consistency, Integrity, Durability
  6. Which SQL command is used to retrieve data?
    INSERT
    UPDATE
    SELECT
    DELETE
  7. What is a JOIN in SQL?
    Combining tables
    Sorting data
    Filtering data
    Grouping data
  8. Which is a database management system?
    HTML
    CSS
    MySQL
    JavaScript
  9. What is indexing in databases?
    Slowing down queries
    Speeding up queries
    Storing data
    Deleting data
  10. Which normal form eliminates transitive dependencies?
    1NF
    2NF
    3NF
    BCNF