Multiple Choice Questions

Basic programming

Set 1

 

Q1.  logA B =…….?

a=log A + log B ;

b=log A − log B  

c=XAXB = XA+B 

d=logA/logB 

[su_spoiler title=”Answer – Click Here:” class=”padding: -10px;”]A[/su_spoiler]

Q2. we can convert temperatures from Fahrenheit to Celsius by applying the formula ……

a=IntCell temporary = 37;

b=printDigit( n % 10 );

c=C = 5(F − 32)/9

d=None of these

[su_spoiler title=”Answer – Click Here:” class=”padding: -10px;”]A[/su_spoiler]

Q3. Encapsulation is …….?

a= Member functions

b=Information hiding

c=Methods

d=Constructor

[su_spoiler title=”Answer – Click Here:” class=”padding: -10px;”]B[/su_spoiler]

Q4. A function is being passed by placing it inside an object. This object is commonly known as a ……….

a=Function of all operator

b=Function object

c=Operator overloading

d=Object

[su_spoiler title=”Answer – Click Here:” class=”padding: -10px;”]B[/su_spoiler]

Q.5. In C++, there are several different mechanisms for returning from a function. The most

straightforward mechanism to use is …….

a=Call by value

b=Call by value

c=Return by reference

d=Return by value

[su_spoiler title=”Answer – Click Here:” class=”padding: -10px;”]D[/su_spoiler]

Q6.Many languages, C and Java included, pass all parameters using ……..

a=Call by reference

b=Call by Value

c=Return by value

d=Return by reference

[su_spoiler title=”Answer – Click Here:” class=”padding: -10px;”]B[/su_spoiler]

Q7. Reference variables are often used to avoid copying objects across ……..

a=Function-describe boundaries

b=Function-call boundaries

c=Function-Constructor

d=Function destructor

[su_spoiler title=”Answer – Click Here:” class=”padding: -10px;”]B[/su_spoiler]

Q.8An ……  is an expression that identifies a non-temporary object.

a=L values

b=R values

c=References

d=Values

[su_spoiler title=”Answer – Click Here:” class=”padding: -10px;”]A[/su_spoiler]

Q.9 An ……..  is an expression that identifies a temporary object or is a value (such as a literal constant) not associated with any object.

a=L values

b=R values

c=References

d=Values

[su_spoiler title=”Answer – Click Here:” class=”padding: -10px;”]B[/su_spoiler]

Q10. Assignment and comparison of pointer variables in C++ is based on the value of the ……..

a=Pointer

b=Class

c=Object

d=Variables

[su_spoiler title=”Answer – Click Here:” class=”padding: -10px;”]A[/su_spoiler]

 

Data Structures MCQs

Basic Concepts

1. Introduction to Data Structures
   • Abstract Data Types (ADT) MCQs
2. Complexity Analysis MCQs
   • Time complexity MCQs
   • Space complexity MCQs
   • Big O, Big Ω, Big Θ notations MCQs

Linear Data Structures MCQs

1. Arrays MCQs
   • One-dimensional arrays MCQs
   • Multi-dimensional arrays MCQs
   • Operations: traversal, insertion, deletion MCQs
2. Linked Lists MCQs
   • Singly linked list MCQs
   • Doubly linked list MCQs
   • Circular linked list MCQs
3. Stacks MCQs
   • Stack operations (push, pop, peek) MCQs
   • Applications of stacks (expression evaluation, recursion) MCQs
4. Queues MCQs
   • Queue operations (enqueue, dequeue, front, rear) MCQs
   • Types: Simple queue, circular queue, priority queue, deque MCQs

Non-Linear Data Structures MCQs

1. Trees MCQs
   • Binary trees MCQs
   • Binary Search Trees (BST) MCQs
   • AVL Trees MCQs
   • B-trees and B+ trees MCQs
   • Tree traversal methods (in-order, pre-order, post-order) MCQs
2. Heaps MCQs
   • Min-heap MCQs
   • Max-heap MCQs
   • Heap operations (insertion, deletion, heapify) MCQs
   • Applications of heaps (priority queues, heap sort) MCQs
3. Graphs MCQs
   • Graph representation (adjacency matrix, adjacency list) MCQs
   • Graph traversal algorithms (DFS, BFS) MCQs
   • Shortest path algorithms (Dijkstra’s, Bellman-Ford) MCQs
   • Minimum Spanning Tree (Kruskal’s, Prim’s) MCQs

Hashing MCQs MCQs

1. Hash Tables
   • Hash functions MCQs
   • Collision resolution techniques (chaining, open addressing) MCQs
   • Applications of hashing MCQs

Sorting and Searching Algorithms MCQs 

1. Sorting Algorithms MCQs
   • Bubble sort MCQs
   • Selection sort MCQs
   • Insertion sort MCQs
   • Merge sort MCQs
   • Quick sort MCQs
   • Heap sort MCQs
2. Searching Algorithms MCQs
   • Linear search MCQs
   • Binary search MCQs
   • Interpolation search MCQs

Miscellaneous

1. Memory Management in data structures MCQs
   • Dynamic memory allocation MCQs
   • Garbage collection MCQs
2. String Manipulation Algorithms MCQs
   • Pattern matching (KMP, Rabin-Karp) MCQs
   • String hashing MCQs

1. Data Structures MCQs 1
2. Data Structures MCQs 2
3. Data Structures MCQs 3
4. Data Structures MCQs 4
5. Data Structures MCQs 5
6. Stacks Solved MCQs
7. Queues MCQs
8. pointer mcqs
9. Array MCQs