Objective1 markeasySolution
What is the worst-case time complexity of Quick Sort algorithm?
- AO(n)
- BO(n log n)
- CO(n^2)
- DO(log n)
BCA Question Bank & MCQs — TU
Subject-wise practice questions, MCQs, and entrance exam preparation questions for Bachelor of Computer Application (TU).
TU · Academic Question Bank
Bachelor of Computer Application (BCA) Practice Hub
Explore chapter-wise questions, objective MCQs, and past exam questions with solutions.
Practice by Subject:
Semester 1
Semester 2
Semester 3
Semester 4
Semester 5
Semester 6
Semester 7
Semester 8
- Short5 marksmediumSolution
Differentiate between Linear Queue and Circular Queue. Explain how modulo arithmetic prevents false overflow.
- Objective1 markeasySolution
Which heuristic search algorithm evaluates nodes using f(n) = g(n) + h(n)?
- ABreadth-First Search
- BA* Search
- CDepth-First Search
- DHill Climbing
- Short5 marksmediumSolution
What is an admissible heuristic? Why is admissibility required for optimality in A* tree search?
- Objective1 markeasySolution
Which of the following is an invalid variable name in C?
- A_salary
- B1st_rank
- Ctotal_sum
- Dage2
- Objective1 markeasySolution
What is the return type of the malloc() function in C?
- Aint*
- Bchar*
- Cvoid*
- Dfloat
- Short5 marksmediumSolution
Explain the difference between call by value and call by reference in C with suitable code snippets.
- Short5 marksmediumSolution
What is recursion? Write a recursive function in C to calculate the factorial of a positive integer.
- Long10 markshardSolution
Explain dynamic memory allocation in C. Differentiate between `malloc()` and `calloc()`. Write a C program to dynamically allocate memory for N integers, sort them in ascending order, and free the memory.