Scribd
Upload
3 views

CS3353 C Programming and DataStructures

The document is a question bank for a C Programming and Data Structures course, covering fundamental topics such as C declarations, data types, decision-making statements, and various operators. It also includes advanced features like pointers, linked lists, and binary trees, along with practical programming exercises. Additionally, it addresses sorting and searching techniques, including algorithms and their complexities.

Uploaded by

priyankarajan2706
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
3 views

CS3353 C Programming and DataStructures

The document is a question bank for a C Programming and Data Structures course, covering fundamental topics such as C declarations, data types, decision-making statements, and various operators. It also includes advanced features like pointers, linked lists, and binary trees, along with practical programming exercises. Additionally, it addresses sorting and searching techniques, including algorithms and their complexities.

Uploaded by

priyankarajan2706
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 4

CS3353 C Programming and DataStructures

QUESTION BANK
PART B&C
Unit- I C PROGRAMMING FUNDAMENTALS

1. (i) Explain in detail about “C” declarations and variables.


(ii) What are constants? Explain the various types of constants in C.
2. Discuss about the various data types in “C”.
3. Explain about the various decision making statements in “C” language. (or) Write
notes on Branching Statements in C.
4. Explain various operators in c with example? (or) Explain the different types of
operators used in C with necessary program.
5. Explain briefly about the formatted and unformatted I/O function in C.
6. Explain the different looping statement with example? (or) What is the purpose of
looping statement? Explain in detail the operations of various looping statement
with examples.
7. (i)Write a C program to check whether the given number is palindrome or not.
(ii) Write a C program to sum of digits of an integer.
8. Write a program to solve the Quadratic equation
9. Write a program to find whether a number is prime or not.
10. Describe the structure of a C program using “Calculator program” example.
11. Explain in detail about preprocessor directives with examples.
12. Explain the concept of storage classes with suitable example. What are the
Storage classes available in C ? Demonstrate the working of each storage class
13. Write a C program to find the sum of 10 non-negative numbers entered by the
user.
14. Write a C program to find the largest among 3 numbers entered bythe user.
15. What is an array? Explain the characteristics and Classification of an array with
examples.
Unit- II C PROGRAMMING-ADVANCED FEATURES
1. When is a null pointer used? (May 18)
2. What do you mean by Call by reference? Explain with an example.
3. What do you mean by Call by Value? Explain with an example.
4. Write a „C‟ Program to interchange two values using call by reference (or)
5. Can you subtract pointers from each other? Why would you?
6. How do you use a pointer to a function? When would you use a pointer to a
function?
7. Write a C program to generate Fibonacci series using function.
8. Write a C Program to find factorial of a given number using recursive function.
9. What is Pointer? How to pass pointer as an argument in function?
10. How can you pass an array to a function by value?
11. Explain the use of pointers in array handling with an example.

Unit- III LINEAR DATA STRUCTURES

1 Explain in detail about the linked list implementation using an example. State the
problems in freeing list node.
2 Write a program to reverse a linked list using recursion.
3 Write a routine to merge given two sorted linked lists.
4 Write an algorithm to insert an element into a linked list. Explain it with an
example
5 Write and explain the algorithm to copy a linked list.
6 What are the operations on singly linked list? Explain with an example.
7 Write a C code for singly linked list with insert, delete, and display operations
using structure pointers.
8 Describe the creation of a doubly linked list and appending the list. Give relevant
coding C.
Unit- IV NON-LINEAR DATA STRUCTURES

1 a) What are the types of representation of binary tree?


b) Show that for the perfect binary tree of height h containing 2h+1-1nodes
2 What is traversal? Give an algorithm for traversal in the binary tree. Or Explain
the tree traversal techniques with an example. (Dec 19)
3 Draw a Binary search tree for the following input list 60,25,75,15,50,66,33, 44.
Trace the algorithm to delete the nodes 25, 75, 44 from the tree.
4 Write a routine to implement the basic binary search tree operations. Or How to
insert and delete an element into a binary search tree and write down the code for
the insertion routine with an example. (Dec 19)
5 Explain in detail about Threaded binary trees.
6 Write the algorithm to construction an expression tree and construction ane
xpression tree for the input ab+cde+**
7 Show the result of inserting 10,12,1,14,6,5,8,15,3,9,7,4,11,13, and, 2, one at a
time, in to an initially empty binary heap.
8 Write and test a program that performs the operation Insert, DeleteMin, Build
Heap, Findmin, DecreaseKey, Delete, and IncreaseKey in a binary Heap.
9 Show the result of inserting 2, 4,1,5,9,3,6,7 in to an initially empty AVL Tree.
10 Write a procedure to implement AVL single and double rotations.

Unit- V SORTING AND SEARCHING TECHNIQUES

1 With example explain the binary search technique.


2 Explain the insertion sort with its time complexity.
3 State and explain the shell sort. State and explain the algorithm for shell sort. Sort
the elements using shell sort.
4 Explain separate chaining and extendible hashing.
5 Explain the common collision resolution strategies in open address hashing.
6 Explain the algorithm to perform Radix Sort with Example.
7 Write the selection sort algorithm and explain with suitable example. Give its worst
case, Average Case and Best case time complexities. Or Write an algorithm to
implement selection sort with suitable example.
8 Explain about collision resolution techniques.
9 Given input {4371,1323,6173,4199,4344,9679,1989} and a hash function h(X) = X
(mod 10).
10 Explain in detail about Rehashing method and extendible hashing.
When do you perform rehashing? Illustrate with example.
11 Distinguish between linear search and binary search. State and explain the
algorithms for both the search with example.

You might also like