0% found this document useful (0 votes)
11 views6 pages

CS3353 CPDS QB ECE

This document is a question bank for the subject CS3353 - C Programming and Data Structures for the academic year 2024-2025. It includes questions categorized by units covering topics such as C programming fundamentals, advanced features, and linear data structures, along with their corresponding levels of competence. The document is structured into Part-A and Part-B questions, focusing on various concepts and programming tasks related to C programming and data structures.

Uploaded by

alaguganesan06
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
11 views6 pages

CS3353 CPDS QB ECE

This document is a question bank for the subject CS3353 - C Programming and Data Structures for the academic year 2024-2025. It includes questions categorized by units covering topics such as C programming fundamentals, advanced features, and linear data structures, along with their corresponding levels of competence. The document is structured into Part-A and Part-B questions, focusing on various concepts and programming tasks related to C programming and data structures.

Uploaded by

alaguganesan06
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 6

Format No.

ACD-CF-QB
ST. JOSEPH’S COLLEGE OF ENGINEERING AND TECHNOLOGY
Elupatti, Thanjavur – 613 403 Issue No. 01
QUESTION BANK Rev. No. 00

Academic Year : 2024-2025 / ODD


Dept / Year / Semester : ECE/ II / III
Subject Code & Name : CS3353 – C PROGRAMMING AND DATA STRUCTURES

UNIT I - C PROGRAMMING FUNDAMENTALS


Data Types – Variables – Operations – Expressions and Statements – Conditional
Statements – Functions – Recursive Functions – Arrays – Single and Multi-Dimensional
Arrays.
PART-A
Q.No. Questions CO’S Level Competence
1 Define programming paradigm. C206.1 U Understanding
2 Give two examples for assignment statements. C206.1 Az Analyzing
3 What are keywords? Give an example C206.1 R Remembering
4 What do you mean by variables in ‘C’? C206.1 U Understanding
5 Identify the use of ternary or conditional operator. C206.1 U Understanding
6 What is a compilation process? C206.1 R Remembering
7 Differentiate between an expression and a statement in C. C206.1 R Remembering
8 What is the output of the programs given below? C206.1 R Remembering
9 Classify the different types of storage classes . C206.1 U Understanding
10 Discover the meaning of C pre-processor C206.1 R Remembering
11 Invent the difference between ++a and a++. C206.1 C Creating
12 Differentiate switch () and nested-if statement C206.1 Ap Applying
13 Summarize the various types of C operators. C206.1
14 Recommend the suitable example for infinite loop using while. C206.1
15 How to create a two-dimensional array? C206.1
16 What are the different ways of initializing array? C206.1
17 Define string. C206.1
18 Define multi-dimensional array. C206.1
19 Write a C program to find the length of given string. C206.1
20 What is a function? C206.1
21 What is the need for functions? C206.1
22 Compare actual parameter & formal argument C206.1
23 What is a function prototype? C206.1
24 Differentiate call by value and call by reference. C206.1
25 Write the advantages and disadvantages of recursion. C206.1
26 What is meant by Recursive function? C206.1
27 What are the steps in writing a function in a program? C206.1

PART-B
1 List the different data types available in C. C206.1 R Remembering
2 Explain the different types of operators available in C. C206.1 R Remembering
Explain about various decision-making statements available in C
3 C206.1 U Understanding
with illustrative programs
4 Write a C program to print the Fibonacci series of a given number. C206.1 U Understanding
5 Explain in detail about functions & Function prototypes? C206.1 R Remembering
6 Explain in detail about Recursion with its example C206.1
7 Tower of Hanoi with sample program? C206.1
What is an array? Discuss how to initialize a one dimensional and
8 C206.1
two-dimensional arrays with suitable example?

UNIT II - C PROGRAMMING - ADVANCED FEATURES

Structures – Union – Enumerated Data Types – Pointers: Pointers to Variables, Arrays and
Functions – File Handling – Preprocessor Directives.
PART-A
Q.No. Questions CO Level Competence

1 Define Structure in C C206.2 Az Analysing


2 How to Declare a member in Structure? C206.2 U Understanding
3 What you meant by structure definition? C206.2 Az Analysing
4 What is meant by Union in C? C206.2 U Understanding
5 How to define a union in C. C206.2 Az Analysing
6 Define typedef. C206.2 Ap Applying
7 What is an Address operator & Indirection operator? C206.2 Ap Applying
8 How is pointer arithmetic done? C206.2 R Remembering
9 List the header files in ‘C’ language. C206.2 E Evaluating
State the advantages of user defined functions over pre-defined
10 function. C206.2 Ap Applying

11 Write the syntax for pointers to structure. C206.2 R Remembering


12 Compare arrays and structures. C206.2 R Remembering
13 Difference between structure and union. C206.2
14 What are the functions supports for dynamic memory allocation? C206.2
15 What is the use of ‘typedef’’? C206.2
16 Write the syntax for pointers to structure. C206.2
PART-B
What is a structure? Create a structure with data members of
1 various types and declare two structure variables. Write a program C206.2 C Creating
to read data into these and print the same. Justify the need for
2 structured data type.to store the employee information using
Write a C program
structure and search a particular employee using Employee C206.2 U Understanding
number.
3 Define and declare a nested structure to store date, which including
C206.2 R Remembering
day, month and year.
Define a structure called student that would contain name, regno
and marks of five subjects and percentage. Write a C program to
4 read the details of name, regno and marks of five subjects for 30 C206.2 U Understanding
students and calculate the percentage and display the name, regno,
marks of 30 subjects and percentage of each student.
Explain about array of structures and pointers in structures with
5 C206.2 U Understanding
example program
Write a C program to create mark sheet for students using self-
6 C206.2 Az Analysing
referential structure.

Discuss about dynamic memory allocation with suitable


7 C206.2
example C program.
UNIT III – LINEAR DATASTRUCTURES
Abstract Data Types (ADTs) – List ADT – Array-Based Implementation – Linked List– Doubly-
Linked Lists – Circular Linked List – Stack ADT – Implementation of Stack– Applications –
Queue ADT – Priority Queues – Queue Implementation Applications.
PART-A
Q.No. Questions CO’S Level Competence
1 What is a data structure? C206.3 R Remembering
2 Why do we need data structures? C206.3 U Understanding
3 List some common data structures. C206.3 Az Analysing
4 How data structures are classified? C206.3 Ap Applying
5 Differentiate linear and non-linear data structure. C206.3 U Understanding
6 Define ADT (Abstract Data Type) C206.3 U Understanding
7 Mention the features of ADT. C206.3 R Remembering
8 Define List ADT C206.3 E Evaluating
9 What are the ways of implementing linked list? C206.3 Ap Applying
10 What are the types of linked lists? C206.3 Az Analysing
11 When singly linked list can be represented as circular linked list? C206.3 E Evaluating
12 List down the applications of List. C206.3 C Creating
13 What are the operations performed in list? C206.3 R Remembering
14 What is a circular linked list? C206.3 C Creating
15 What is the need for the header? C206.3
16 List three examples that uses linked list? C206.3
17 List out the different ways to implement the list? C206.3
18 Write the routine for insertion operation of singly linked list. C206.3
19 Define Stack. C206.3
20 What are the operations of the stack? C206.3
21 Write the routine to push a element into a stack. C206.3
22 Define queue. C206.3
23 What are the types of queue? C206.3
24 Define double ended queue C206.3
25 How the queue is implemented by linked list? C206.3
26 Define circular queue C206.3
PART-B
1 Explain the various operations of the list ADT with examples C206.3 R Remembering
2 Write the program for array implementation of lists C206.3 U Understanding
3 Write the program for array implementation of lists C206.3 R Remembering
4 Explain the operations of singly linked lists C206.3 Ap Applying
5 Explain the operations of doubly linked lists
Course Instructor HoD

You might also like