LearnFrenzy

Sign in Take a free test

DSA & Algorithms GATE CSE · Data Structures & Algorithms · Mock 1

Full mock test · Mixed

GATE CSE · Data Structures & Algorithms · Mock 1

20 questions, 30 marks in the GATE CSE pattern – MCQ, MSQ and NAT, 1- and 2-mark questions, negative marks on MCQs only.

Duration: 55 min
Questions: 20
Maximum marks: 30
Wrong MCQ: −⅓ / −⅔ MSQ, NAT: 0

Sections

1-mark questions10 questions
2-mark questions10 questions

Before you start

The timer starts when you press Start test and the test is submitted automatically at 00:00.
GATE marking: each question is worth 1 or 2 marks. A wrong MCQ costs a third of its marks (−⅓ or −⅔). MSQ (select every correct option) and NAT (type the number) never lose marks, and an MSQ scores only if your selection is exactly right.
An on-screen calculator is next to the question palette, like the one in the real exam.
Mark for review lets you come back to a question. Marked questions that have an answer are still scored.
If the page reloads or your connection drops, your answers and remaining time are kept on this device.
Keyboard: 1–4 choose · N next · P previous · M mark for review.

Not visited Not answered Answered Marked for review Answered & marked

I have read the instructions Back

Question 1 Notation Beginner Practice MCQ +1−⅓

What does f(n) = O(g(n)) mean?

f(n) grows at least as fast as g(n) – a lower bound f(n) is the exact running time for every input f(n) and g(n) are always equal For large n, f(n) grows no faster than a constant times g(n) – an upper bound

Question 5 Tower of Hanoi Intermediate Practice Code executed MCQ +1−⅓

For 3 discs moved from A to C, what are the first three moves?

Python main.py

def hanoi(n, src, dst, via, out):
    if n == 0:
        return
    hanoi(n - 1, src, via, dst, out)
    out.append(src + dst)
    hanoi(n - 1, via, dst, src, out)

out = []
hanoi(3, 'A', 'C', 'B', out)
print(*out[:3])

ABBCAC ACABCB ABACBC ACABBC

Question 10 Call counting Beginner Practice Code executed NAT +1no negative

Each call makes two smaller calls. How many calls happen in total for f(3)? The program prints it.

Python main.py

calls = 0

def f(n):
    global calls
    calls += 1
    if n == 0:
        return
    f(n - 1)
    f(n - 1)

f(3)
print(calls)

Your answer

Question 18 Expression evaluation Intermediate Practice Code executed NAT +2no negative

What does this program print?

C++ main.cpp

#include <iostream>
#include <sstream>
#include <stack>
#include <string>

int main() {
    std::istringstream in("5 1 2 + 4 * + 3 -");
    std::stack<int> st;
    std::string t;
    while (in >> t) {
        if (isdigit(t[0])) { st.push(std::stoi(t)); continue; }
        int b = st.top(); st.pop();
        int a = st.top(); st.pop();
        st.push(t == "+" ? a + b : t == "-" ? a - b : a * b);
    }
    std::cout << st.top() << '\n';
}

Your answer

Questions 0 of 20 answered

1-mark questions

2-mark questions

Answered 0 Not answered 0 Marked 0 Not visited 20

N numeric answer · M multiple select