Scribd
Upload
3 views2 pages

C Programming Important Questions

The document outlines important questions and programming tasks related to C programming, organized into five units covering topics such as arithmetic operators, conditional statements, arrays, pointers, unions, data structures like stacks and queues, tree traversal techniques, and sorting algorithms. Each unit includes specific programming exercises and theoretical discussions to enhance understanding of C concepts. The document serves as a comprehensive guide for students preparing for examinations or assessments in C programming.

Uploaded by

Beno
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
3 views2 pages

C Programming Important Questions

The document outlines important questions and programming tasks related to C programming, organized into five units covering topics such as arithmetic operators, conditional statements, arrays, pointers, unions, data structures like stacks and queues, tree traversal techniques, and sorting algorithms. Each unit includes specific programming exercises and theoretical discussions to enhance understanding of C concepts. The document serves as a comprehensive guide for students preparing for examinations or assessments in C programming.

Uploaded by

Beno
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

C Programming Important Questions

Unit 1

 Design a program for arithmetic operators and conditional


statements each.
 Discuss on operations and conditional statements available
in C. And design a C program that illustrates both the
concepts.
 What do you mean by array in C? Construct a program on
Single and Multi-Dimensional arrays with output and explain
the same

Unit 2

 (i) Explain the need of pointers in C. And construct a neat


example that elaborates the concept of pointers to variables
and pointers to array. (ii) Discuss on union in C with an
example
 (i)State and explain the preprocessor directives. (ii)What are
different types of files available? Design a C program to copy
the content of one file to another.
 Explain Enum in C with a neat program as an example.

Unit 3
 (i)Define ADT and list the advantages of the same.(ii)Devise
an algorithm to perform push and pop operations in a
stack.(iii)List the advantages and disadvantages of
representing a group of items as an array versus a linked list.

 Elaborate on doubly linked list with its operations in detail.


 Elaborate circular linked list with its operations and
applications.
 (a) Give a brief note on Stack in C. Write the C code for
array implementation of stack with all its basic operation(b)
Implement the Queue data structure using Linked list in C.
Explain its applications.

Unit 4

 Discuss in detail about the tree traversal techniques with an


example.
 Compare and contrast linear probing, quadratic probing,
and double hashing as open addressing techniques for
collision resolution. Discuss their strengths and weaknesses
in practice.

 i) Construct a binary search tree for the values 45, 56, 39, 12,
34, 32, 10, 78, 67, 89, 91. Give the pre order and post order
traversal of the resultant binary search tree. ii) Write C
functions to perform deletion in Binary search tree
(Include all the cases)

Unit 5
 Sort the sequence 7,9,5,14,2,3,6,10 using the following
(i) Merge sort (ii)Quick sort (Picking the first element as the
pivot).
 Analyze the working principles of Quick Sort and Heap Sort
by explaining their algorithms in detail with example that
illustrates each sorting algorithm in action, showcasing how
they operate step-by-step.
 Show the heap sort process to the following input sequence
142, 543, 123, 65, 453, 879, 572, 434, 111, 242, 811, 102.

You might also like