C Programming and Data Structures
C Programming and Data Structures
in/
CS3353 C PROGRAMMING AND DATA STRUCTURES
IMPORTANT QUESTION
C Programming and Data Structures
in
5. What are Arrays?
n.
13 - Mark
1. Explain Variables
2. Describe Expressions and Statements
aa
iy
3. Explain the functions of C programming
or
2 - Mark
1. What are structures?
2. Define union.
3. Write about Arrays and Functions.
4. What is File Handling?
13 - Mark
1. Describe Enumerated Data Types.
2. Explain Pointers.
3. Define preprocessor Directives with detailed reference.
https://www.poriyaan.in/ https://eee.poriyaan.in/
UNIT - III LINEAR DATA STRUCTURES
2 - Mark
1. List ADT in linear data structures
2. Define Implementation of Stack
3. State the Applications of linear data structures
4. Queue ADT linear data structures
5. What are Priority Queues?
6. Define Queue Implementation.
13 - Mark
in
1. Explain Abstract Data Types (ADTs)
n.
2. Describe Array-Based Implementation
3. Demonstrate Circular Linked List.
aa
4. Define stack ADT with detailed reference.
iy
5. Distinguish Linked List & Doubly- Linked
or
.p
13 - Mark
1. Explain tree Traversals.
2. Describe expression Trees.
3. Define Hash Functions with detailed reference.
4. Define Separate Chaining
5. Describe Open Addressing
6. Demonstrate Quadratic Probing
https://www.poriyaan.in/ https://eee.poriyaan.in/
UNIT V SORTING AND SEARCHING TECHNIQUES
2 - Mark
1. What is Insertion Sort
2. Define Quick Sort
3. Write about Heap Sort
4. What is Merge Sort
13 - Mark
1. Explain Linear Search
2. Describe Binary Search.
in
n.
aa
iy
or
.p
w
w
w
C Programming and Data Structures – Reg 2021 – CS3353
Unit I: C Programming Fundamentals : C Programming Fundamentals | Keywords, Variables and
Constants | Header Files | Data Types | Expressions using Operators | Input and Output Operations |
Decision Making and Conditional Statements | Functions | Recursive Functions | Arrays | Simple
Programs | Two Marks Questions with Answers
Unit III: a. Linear Data Structures – List : Linear Data Structures - List | Introduction to Data Structure
| Abstract Data Types (ADTs) | List ADT | Array Based Implementation | Linked List | Difference between
Array and Linked Listed | Doubly Linked List | Circular Linked List | Applications of Linked Lists | Two
Marks Questions with Answers
Unit III: b. Linear Data Structures Stacks and Queues : Linear Data Structures Stacks and Queues |
Concept of Stack | Stack ADT | Implementation of Stack | Applications of Stack | Expression | Infix to
Postfix Conversion | Evaluation of Postfix Expressions | Concept of Queue | Queue ADT | Queue
Implementation | Priority Queues | Applications of Queue | Two Marks Questions with Answers
Unit IV: a. Non-Linear Data Structures – Trees : Non-Linear Data Structures – Trees | Trees | Binary
Trees | Representation of Binary Tree | Tree Traversal | Expression Trees | Binary Search Tree |
Programming Examples | Two Marks Questions with Answers
Unit IV: b. Hashing : Hashing | Basic Concept | Hash Functions | Properties of Good Hash Function |
Collision Handling | Applications of Hashing | Two Marks Questions with Answers
Unit V: Sorting and Searching Techniques : Sorting and Searching Techniques | Sorting | Insertion
Sort | Quick Sort | Heap Sort | Merge Sort | Searching | Two Marks Questions with Answers
https://www.poriyaan.in/