Scribd
Upload
37 views

CSE & IT Data Structures - DSA

The document outlines an internal test for a data structures and algorithms course. It contains questions in three parts - part A with 5 short questions worth 2 marks each, part B with 3 long-form questions worth 3 marks each, and part C with 2 programming questions worth 14 marks total. The test covers topics like arrays, linked lists, stacks, and more.

Uploaded by

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

CSE & IT Data Structures - DSA

The document outlines an internal test for a data structures and algorithms course. It contains questions in three parts - part A with 5 short questions worth 2 marks each, part B with 3 long-form questions worth 3 marks each, and part C with 2 programming questions worth 14 marks total. The test covers topics like arrays, linked lists, stacks, and more.

Uploaded by

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

Date of exam 16.11.2023 Time 03.00 pm to 04.

30 pm
Branch CSE Year & Sem II & III Max. marks: 60
Subject code CS3301 Subject Name: Data Structures

INTERNAL TEST -I
PART- A (5*2=10)
1. Define Data Structure?
2. List out the advantages of using Linked list over arrays.
3. Define Linear & non-Linear data structures. Give an example for each.
4. What is meant by abstract data type?
5. What is the importance of header nodes?

PART-B (12*3=36)
6. (a) What are the various operations on array? Discuss the advantages and disadvantages of using an array.
(OR)
(b) Write an insertion routine , in an array with an example.
7. (a) Write the routine to Print the list of elements in an array
(OR)
(b) Explain singly linked list in detail.
8. (a) Perform deletion operation in an array with a list of elements using a routine algorithm.
(OR)
(b) Discuss about balancing symbols concept of stack

PART-C (14*1=14)
9. (a)Write a code to execute an array implementation of stack with insertion( ), deletion( ),
peek( ) functions with an example stack elements.
(OR)
(b)Develop an algorithm to implement a doubly linked list. Give relevant examples and
diagrammatic illustrations.

STAFF INCHARGE HOD


Date of exam 16.11.2023 Time 03.00 pm to 04.30 pm
Branch IT Year & Sem II & III Max. marks: 60
Subject code CD3291 Subject Name: Data Structures and Algorithms

INTERNAL TEST -1
PART- A (5*2=10)
1. Define Data Structure?
2. List out the advantages of using Linked list over arrays.
3. Define Linear & non-Linear data structures. Give an example for each.
4. What is meant by abstract data type?
5. What is the importance of header nodes?

PART-B (12*3=36)
6. (a) What are the various operations on array? Discuss the advantages and disadvantages of using an array.
(OR)
(b) Write an insertion routine , in an array with an example.
7. (a) Write the routine to Print the list of elements in an array
(OR)
(b) Explain singly linked list in detail.
8. (a) Perform deletion operation in an array with a list of elements using a routine algorithm.
(OR)
(b) Discuss about balancing symbols concept of stack

PART-C (14*1=14)
9. (a) Write a code to execute an array implementation of stack with insertion( ), deletion( ),
peek( ) functions with an example stack elements.
(OR)
(b) Develop an algorithm to implement a doubly linked list. Give relevant examples and
diagrammatic illustrations.

STAFF INCHARGE HOD

You might also like