Are you searching for old question papers of 330701 Data structure Management from Gujarat Technological University ? You can here download 3rd Semester May June 2012 Question Paper. More details can be had below:
GTU Question Paper
Seat No.: ________ Enrolment No.______________
GUJARAT TECHNOLOGICAL UNIVERSITY
DIPLOMA ENGG.- IIIrd SEMESTER–EXAMINATION – MAY/JUNE- 2012
Subject code: 330701 Date: 28/05/2012
Subject Name: Data structure Management
Time: 02:30 pm – 05:00 pm Total Marks: 70
Instructions:
1. Attempt all questions.
2. Make suitable assumptions wherever necessary.
3. Figures to the right indicate full marks.
4. English version is considered to be Authentic
Q. 1 (a) (i) Give the syntax of declaring one dimensional array in C and explain with example. (3)
(ii) Explain row-major order of an array with example. (4)
(b) Declare a 5 x 5 array of integers in C and write a program segment to initialize all its diagonal elements to 1 and rest of the elements to 0. (7)
Q. 2 (a) Define stack. List the operations that can be performed on a stack and explain with example.
(b) Using array data structure, write an algorithm to push data items onto the stack.
OR
(b) Using array data structure, write an algorithm delete a data item from the circular queue.
GTU Question Paper
Seat No.: ________ Enrolment No.______________
GUJARAT TECHNOLOGICAL UNIVERSITY
DIPLOMA ENGG.- IIIrd SEMESTER–EXAMINATION – MAY/JUNE- 2012
Subject code: 330701 Date: 28/05/2012
Subject Name: Data structure Management
Time: 02:30 pm – 05:00 pm Total Marks: 70
Instructions:
1. Attempt all questions.
2. Make suitable assumptions wherever necessary.
3. Figures to the right indicate full marks.
4. English version is considered to be Authentic
Q. 1 (a) (i) Give the syntax of declaring one dimensional array in C and explain with example. (3)
(ii) Explain row-major order of an array with example. (4)
(b) Declare a 5 x 5 array of integers in C and write a program segment to initialize all its diagonal elements to 1 and rest of the elements to 0. (7)
Q. 2 (a) Define stack. List the operations that can be performed on a stack and explain with example.
(b) Using array data structure, write an algorithm to push data items onto the stack.
OR
(b) Using array data structure, write an algorithm delete a data item from the circular queue.
![Lucknow University B.A./B.Sc. (Part-III) (Back Paper) MATHEMATICS [ Third Paper ] Numerical Analysis and Programming in C - 2018 Question Paper](https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEjSRFF5B8mgwVKJswFbXFVMbYPkwZ5huZNYCbcvphN2nQ2jOctgxD-2OCGkKWECevFXYTdxUFbTDJhx7JzU880M-lNAV3yJhbPerY9N4OWHvh54NGmgoYOfAy9GWFzvBsiTMVcvjNuGYIs/s72-w640-c-h458/97+1.png "Lucknow University B.A./B.Sc. (Part-III) (Back Paper) MATHEMATICS [ Third Paper ] Numerical Analysis and Programming in C - 2018 Question Paper")
0 comments:
Pen down your valuable important comments below