Scribd
Upload
1 views1 page

II Sem (CS) Data Structure Using C

The document outlines the structure of the First Internal Examination for the Computer Science course at Basireddy Memorial Degree College, focusing on Data Structures using C. It includes two parts: Part-A with five short answer questions and Part-B with five detailed questions, covering topics such as algorithms, time complexity, data structures, linked lists, stacks, and queues. The exam is scheduled for June 2026 and is designed to assess students' understanding of fundamental concepts in data structures.

Uploaded by

Srinivas Cnu
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
1 views1 page

II Sem (CS) Data Structure Using C

The document outlines the structure of the First Internal Examination for the Computer Science course at Basireddy Memorial Degree College, focusing on Data Structures using C. It includes two parts: Part-A with five short answer questions and Part-B with five detailed questions, covering topics such as algorithms, time complexity, data structures, linked lists, stacks, and queues. The exam is scheduled for June 2026 and is designed to assess students' understanding of fundamental concepts in data structures.

Uploaded by

Srinivas Cnu
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

BASIREDDY MEMORIAL DEGREE COLLEGE::NANDIKOTKUR

FIRST INTERNAL EXAMINATION -JUNE-2026


GROUP: Computer Science Course: 3 SEMESTER: II
TIME: 3 Hrs Sub: Data Structure using C Max. Marks: 70
PART-A
Answer any FIVE of the following questions 5*4=20

1. Define
III [Link](CA) an Algorithm. Mention any two characteristics of an algorithm.
V SEMESTER

2. What is Time Complexity? Give one example.


3. Define Abstract Data Type (ADT).
4. List any four differences between Arrays and Linked Lists.
5. What is a Singly Linked List?
6. Write the steps involved in traversing a linked list.
7. Define Stack ADT. Mention any two applications of stacks.
8. What is a Queue? State the FIFO principle.
PART-B
Answer ALL the following questions 5*10=50

9. (a) Explain the characteristics of an algorithm with suitable examples.


(Or)
(b) Discuss Time Complexity, Space Complexity, and Asymptotic Notations in
detail.

10. (a) Explain Data Structures and their types.


(Or)
(b) Explain the representation of Linked Lists in memory. Compare Linked Lists
and Arrays.

11. (a) Describe the different types of Linked Lists with neat diagrams.
(Or)
(b) What is Stack; Explain the Stack operation with examples?

12. (a) Explain the operations of insertion in a Singly Linked List:


a. At the beginning
b. At a specified position
c. At the end
(Or)
(b) Explain the Queue operations with example?

13. (a) Explain Circular Queue and De-Queue with suitable diagrams.
(Or)
(b) Explain the conversion of Infix expressions to Postfix expressions with an
example

You might also like