Question-Bank-MCA101 - C - DS
Question-Bank-MCA101 - C - DS
INDORE (M.P.)
PROGRAMMING IN C WITH
DATA STRUCTURE
MCA-101
Question Bank
2 What is Token? What are the different types of token available in C language
3 Write and explain the basic concepts of a C program
What is an identifier (variable)? What are the rules to construct identifier (variable)? Classify
4 the following as valid/invalid Identifiers.
i) num2 ii) $num1 iii) +add iv) a_2 v) 199_space vi) _apple vii)#12
What is variable? List the restrictions on the variable names. Explain the rules for constricting
5
variables in C language.
6 What are basic data types available in „C‟? Write the significance of each data type
8 Write a C program that computes the size of int, float, double and char
9 List all conditional control statements used in C. Explain any two with syntax and example
What is two way selection statements? Explain if, if else, and cascaded if-else with
10
examples.
11 Write a C program to find the biggest of three numbers.
Sl. Questions
No
1 What is Data Structure? Describe the types of Data Structures.
2 List the area of applications of Data Structure.
3 Differentiate linear and non-linear data structure.
4 What are the operations that can be performed on a stack?
5 Write the steps involved in the insertion and deletion of an element in the stack.
8 Define a Stack. Write a C Program explain the linked list implementation of Stack.
9 Define the queue data structure. List some applications of queue data structure.
11 What are the scenarios in which an element can be inserted into the circular queue?
Sl. Questions
No
1 Define Linked List Data structure. What are the advantages of Linked List over an array?
7 Explain the insertion operation in linked list. How nodes are inserted after a specified node.
What is doubly linked list? What are the advantages of doubly linked list over
8
singly linked list?
What is the circular linked list? Write the C program to insert a node in circular
9
singly list at the beginning.
Compare singly and circular linked list while performing insertion and deletion
10
operations.
Sl. Questions
No
1 Explain the difference between a binary tree and a binary search tree?
2 Explain the difference between Depth-First Search (DFS) and Breadth-First Search (BFS)
4 Explain the steps to perform an pre-order, in-order, post-order traversal in a binary tree?
5 How do you check if a given binary tree is a subtree of another binary tree?
11 Explain: (a) Heap Definition (b) forests (c) Complete binary tree