[go: up one dir, main page]
Scribd
Upload
6 views1 page

Cycle Test 2

Uploaded by

rmdharaneesh31
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
6 views1 page

Cycle Test 2

Uploaded by

rmdharaneesh31
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
You are on page 1/ 1

K. S. R.

COLLEGE OF ENGINEERING, TIRUCHENGODE - 637 215


DEPARTMENT OF INFORMATION TECHNOLOGY
YEAR: II YEAR B.E (IoT) Cycle Test – II SEM : III
20IO342- Data Structures
Date: 11. 09.2024
PART – A (Answer all the Question) 5 * 2 = 10
1. Determine the prefix and postfix for the expression A+B*(C-D)/E. (Evaluating, CO4)
2. Justify the condition whether the queue is full and empty. (Evaluating, CO3)
3. State the rules to be followed during infix to postfix conversions (understanding, CO4)
4. What is Enque & Deque? (Remembering, CO3)
5. What are applications of Queues? (Remembering, CO3)
PART – B (Answer all the Question) 8 + 7 = 15
6. Demonstrate stack ADT and implement their operation using array (Understanding, CO3)
7. Define queue. Illustrate it operations using array. (Understanding, CO4)

K. S. R. COLLEGE OF ENGINEERING, TIRUCHENGODE - 637 215


DEPARTMENT OF INFORMATION TECHNOLOGY
YEAR: II YEAR B.E (IoT) Cycle Test – II SEM : III
20IO342- Data Structures
Date: 11. 09.2024
PART – A (Answer all the Question) 5 * 2 = 10
1. Determine the prefix and postfix for the expression A+B*(C-D)/E. (Evaluating, CO4)
2. Justify the condition whether the queue is full and empty. (Evaluating, CO3)
3. State the rules to be followed during infix to postfix conversions (understanding, CO4)
4. What is Enque & Deque? (Remembering, CO3)
5. What are applications of Queues? (Remembering, CO3)
PART – B (Answer all the Question) 8 + 7 = 15
6. Demonstrate stack ADT and implement their operation using array (Understanding, CO3)
7. Define queue. Illustrate it operations using array. (Understanding, CO4)

K. S. R. COLLEGE OF ENGINEERING, TIRUCHENGODE - 637 215


DEPARTMENT OF INFORMATION TECHNOLOGY
YEAR: II YEAR B.E (IoT) Cycle Test – II SEM : III
20IO342- Data Structures
Date: 11. 09.2024
PART – A (Answer all the Question) 5 * 2 = 10
1. Determine the prefix and postfix for the expression A+B*(C-D)/E. (Evaluating, CO4)
2. Justify the condition whether the queue is full and empty. (Evaluating, CO3)
3. State the rules to be followed during infix to postfix conversions (understanding, CO4)
4. What is Enque & Deque? (Remembering, CO3)
5. What are applications of Queues? (Remembering, CO3)
PART – B (Answer all the Question) 8 + 7 = 15
6. Demonstrate stack ADT and implement their operation using array (Understanding, CO3)
7. Define queue. Illustrate it operations using array. (Understanding, CO4)

You might also like