Data Structures · Mid-Sem
Q1. Define a stack. [2]
Q2. Output of the code below? (a) 3 (b) 4 (c) 5 (d) 6
Q3. Convert A+B*C to postfix. [3]
Q4. add before printing!!
Q5. Explain queue overflow. [5]
#include <stdio.h>
int main() {
int a[5], sum = 0;
for (i=0; i<5; i++)
sum += a[i]
printf("%d", sum);
}Exponentor
Stop doing the same work by hand, every semester.
Press Space for each beat.
Arena
Secure online exams
Studio
40+ compilers
Android and iPhone
Arena
Secure online exams
Studio
40+ compilers
Android and iPhone
Praxis
by Exponentor
Six manual steps for every exam.
The tools exist. The gluing is manual.
Online exams that feel like a real contest.
The online examination portal of MGM's College of Engineering, Nanded. Faculty build timed MCQ and coding tests from a CSV, a PDF or plain notes; students take them in a secure, proctored, CodeChef-style exam room.
Given an array of N integers and a target K, print the number of pairs (i, j) with i < j and A[i] + A[j] = K.
Sample input5 6 1 5 3 3 2Sample output
2
int main() {
int n, k; cin >> n >> k;
map<int,int> seen;
long long ans = 0;
for (int i = 0; i < n; i++) {
// ...
}
}