[go: up one dir, main page]
Scribd
Upload
380 views2 pages

Affiliated To Bharathidasan University, Trichy) To Bharathidasan University, Trichy

This document appears to be a test from the Department of Computer Science at Sri Meenakshi Vidiya College on the subject of data structures and algorithms. The test has three parts: Part A contains 5 short answer questions worth 2 marks each, Part B contains 4 questions worth 5 marks each requiring longer explanations or algorithms, and Part C contains 2 questions worth 10 marks each. Questions cover topics like defining arrays, stacks, linked lists, infix notation, and algorithms for operations on arrays, stacks, queues, linked lists, and adding polynomials.

Uploaded by

Thanga Shan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
380 views2 pages

Affiliated To Bharathidasan University, Trichy) To Bharathidasan University, Trichy

This document appears to be a test from the Department of Computer Science at Sri Meenakshi Vidiya College on the subject of data structures and algorithms. The test has three parts: Part A contains 5 short answer questions worth 2 marks each, Part B contains 4 questions worth 5 marks each requiring longer explanations or algorithms, and Part C contains 2 questions worth 10 marks each. Questions cover topics like defining arrays, stacks, linked lists, infix notation, and algorithms for operations on arrays, stacks, queues, linked lists, and adding polynomials.

Uploaded by

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

SRI MEENAKSHI VIDIYAL

SRI MEENAKSHI VIDIYAL ARTS AND SCIENCE COLLEGE (Co-Education) (Affiliated


ARTS AND SCIENCE COLLEGE (Co-Education) to Bharathidasan University, Trichy)
(Affiliated to Bharathidasan University, Trichy) Paluvanchi Post, Marungapuri Tk. Trichy Dt. – 621 305
Paluvanchi Post, Marungapuri Tk. Trichy Dt. – 621 305
DEPARTMENT OF COMPUTER SCIENCE
DEPARTMENT OF COMPUTER SCIENCE CONTIUOUS INTERNAL ASSESSMENT TEST- I
CONTIUOUS INTERNAL ASSESSMENT TEST- I
Sub. Code: 16SCCCS5 Marks:50
Sub. Code: 16SCCCS5 Marks:50 Sub. Name: Data structures & Algorithms Hrs:2 Hrs.
Sub. Name: Data structures & Algorithms Hrs:2 Hrs.
Part-A 5x2=10
Part-A 5x2=10
1. Define array.
1. Define array. 2. Write the formula for finding number of elements in the array.
2. Write the formula for finding number of elements in the array. 3. Define stack with example.
3. Define stack with example. 4. Define Linked List.
4. Define Linked List. 5. Define infix notation with example.
5. Define infix notation with example.

Part-B 4x5=20 Part-B 4x5=20


6. a) Explain the various operations on array. (Or) 6. a) Explain the various operations on array. (Or)
b) Briefly explain the structure of stack. b) Briefly explain the structure of stack.
7. a) Explain the structure of queue. (Or) 7. a) Explain the structure of queue. (Or)
b) Write an algorithm for evaluation of expression. b) Write an algorithm for evaluation of expression.
8. a) Write a procedure for creating Linked List. (Or) 8. a) Write a procedure for creating Linked List. (Or)
b) List out the types of expressions with example. b) List out the types of expressions with example.
9. a) Explain the operations of stack. (Or) 9. a) Explain the operations of stack. (Or)
b) Briefly explain the operations on Linked List. b) Briefly explain the operations on Linked List.

Part-C 2x10=20 .

10. Explain the operations on stack. Part-C 2x10=20


11. Describe the operations on queue.
12. Write an algorithm for adding two polynomials. 10. Explain the operations on stack.
11. Describe the operations on queue.
12. Write an algorithm for adding two polynomials.
.

You might also like