StacksQueues Class

Tree Traversal

Normalisation

Programming with C-II BCOM(CS)

St. Pious X Degree & PG College for Women

Question Bank

Programming with C

            UNIT-1

Short Answer Questions

1)   What is printf(writing) and scanf(reading) values.

2)   What is a variable? Explain rules with examples.

Essay Answer Questions

1)   Write about History of C.

2)   Explain structure of C with diagram.

3)   Write about data types in detail with table.

4)   Write about Constants in C.

5)   Explain about Preprocessor in C

6)   Write about storage classes with examples.

7)   Explain about Formatted input and Formatted output.

UNIT-2

Essay Answer Questions

1)   What is an Operator? Explain different kinds of operators with examples.

2)   What is an Arithmetic Expression? Explain precedence with examples.

3)   Explain about Type Conversions in Expressions.

4)   Explain about Decision making and Branching statements with syntax and flowchart.

5)   Explain about Decision making and Looping statements with syntax and flowchart.

UNIT-3

Essay Answer Questions

1)   What is a Dynamic Array? Explain about One-Dimensional,Two-Dimensional and Multi-Dimensional arrays with examples.

2)   Write about programs on Matrix addition and Matrix subtraction.

3)   What is a String? Write about Declaring and Initializing string in detail.

4)   Explain getchar,gets() and putchar,puts() functions(Reading and Writing strings)

5)   Explain about string Handling functions with examples.

UNIT-4

Essay Answer Questions

1)   Explain about Built-In functions in C

2)   Write about need of user defined functions in C

3)   Explain Elements of User Defined functions.

4)   What is Recursion? Explain with example.

              

                       UNIT-V

Essay Answer Questions

1)   What is a Structure? Explain about Defining, Initializing a structure.

2)   Explain about  Accessing structure members

3)   Write about difference between structure and a union.

4)   Explain about structures and functions.

5)   Explain about Enumerated data type with example.

6)   What is a Pointer? Explain about Declaration of Pointers.

7)   Write about Pointers and Arrays.

DS unit-wise important questions

DATA STRUCTURES WITH C++

UNIT-I

4m questions(short type):

1) Define data structure

2) What is an ADT

3) Define algorithm, steps and characteristics

4) Define 1-D, 2-D and n-D arrays

5) Pros and cons of arrays

6) Briefly write about Stack ADT

7) Write how to convert infix to postfix expression

15m questions(essay):

1) Explain various types of data structures

2) Explain in detail analysis of algorithms

3) Algorithm design tools(pseudocode & flowchart)

4) Explain about string manipulation using arrays

5) Define stack. Explain different operations performed on stack

6) Describe in brief applications of stack

7) Pseudocode notations

UNIT-II

Short type:

1) Write in brief about recursion and its advantages

2) Write an algorithm on fibonacci series and factorial of given number

3) Iteration vs recursion

4) Define queue, circular queue and deque

5) Define Queue ADT

6) Define linked list, DLL and CLL

7) Advantages and disadvantages of linked list

8) Advantages of DLL over SLL

9) Write about header node in detail

10) New and delete operator in dynamic memory management

Essay type:

1) Variants of recursion (or) various types of recursion

2) Discuss recursive algorithm for tower of Hanoi's problem

3) What is queue. Discuss different operations on queue

4) Define linked list. Discuss different operations on linked list

5) Define DLL. Discuss different operations on doubly linked list

6) Define Circular linked list(CLL) and its types

UNIT-III

Short type:

1) Define tree, binary tree and complete binary tree

2) Define graph with example

3) All terms in trees and graphs

4) Define spanning tree and minimum spanning tree

5) Define hashing with example

6) Describe binary tree ADT and its properties

7) Define graph ADT

Essay type:

1) Representation of trees (array implementation & linked implementation)

2) Explain in detail tree traversal techniques

3) Applications of binary trees

4) Representation of graphs

5) Graph traversal techniques(DFS & BFS)

6) Spanning tree techniques(prims & kruskals)

7) Hash functions

8) Collision resolution strategies

UNIT-IV

Short type:

1) Define searching. List out various searching techniques

2) Difference between linear search & binary search

3) Define sorting. What is the need for sorting

4) Write the time complexities of various sorting algorithms

Essay type:

1) What is searching? Explain in brief various types of searching

2) All sorting techniques with definition, explaination, example and program

• Bubble sort
• Insertion sort
• Selection sort
• Quick sort
• Merge sort
• Heap sort