MGKVP BCA 2018 DS_USING_C/C++

Mahatma Gandhi Kashi Vidyapeeth
BCA(3rd semester)
DATA STRUCTURES USING C/C++
2018
MM:75                                              Timing:3hrs

Attempt any five questions                       Each ques carry 15 marks.
Note : The answers to short questions                        should not exceed 200 words and the              answers to long questions should                    not exceed 500 words.


Q1 - (a) What do you mean by complexity of an algorithm? Explain the meaning of worst case analysis and best case analysis with an example. 8+7
(b) Why do we use asymptotic notation in the study of algorithm? Describe commonly used asymptotic notations and give their significance.

Q2 - (a) Define list. What are the types of linked list. What are the advantages and disadvantages of linked list and applications of linked list. 7+8 (b) Write a complete program in C to create a single linked list. Write functions to do the following operations.                  
 (i) Insert a new node at the end.         (ii) Delete the first node.

Q3 - (a) Given the following inorder and preorder traversal reconstruct a binary tree 5+10Inorder sequence : D,G,B,H,E,A,F,I,  Preorder sequence : A,B,D,G,E,H,C,F,I       (b) What is a Binary Tree ? What is the maximum number of nodes possible in a binary Tree of depth d. Explain the following terms with respect to Binary tress : (i) Strictly binary tree 
(ii) Complete binary tree 
(iii) Almost Complete binary tree.

Q4 - (a) Sort the following list using Heap Sort. 8+7         66,33,40,20,50,88,60,11,77,30,45,65   (b) Describe insertion sort with a proper algorithm. What is the complexity of insertion sort in the worst case?

mgkvppapers.blogspot.com

Q5 -  (a) Define Hashing. How do collisions happen during hashing? Explain the different techinques in resolving of collision. 8+7 (b) The following values are to be stored in a hash table :                           25,42,96,101,102,162,197               Describe how the values are hashed by using division method of hashing with a table size of 7. Use chaining as the method of collision resolution.

Q6 - (a) What is post fix notation? Explain with examples.                                       5+10
 (b) Write the algorithm for converting from infix to postfix.   

Q7 - (a) How do you push and pop elements in a stack. Explain the applications of stack?   5+10
(b) What are queues? Write down algorithm for inserting and deleting elements form a queue implemented using arrays.

Q8 - (a) Distinguish betweem stack and queue. 5+5+5(b) State the difference between array and linked list.                                                       (c) Explain the application of a stack for implemention function call and return mechanism.

Q9 - Write short notes on : 5+5+5   (a) Sparse Arrays                                              (b) Tridiagonal Matrix                                    (c) B- Tree.

ALL THE BEST
😊😊😊😊😊
mgkvppapers.blogspot.com

Comments

  1. Akash DixitAugust 27, 2021 at 5:25 PM

    I am very thankful to the author to write this fruitful information.It is worth sharing for other users.Thanks once again

    Top PGDM Colleges In Ghaziabad

    ReplyDelete

Post a Comment

Popular posts from this blog

MGKVP BCA 2ND SEM C PROGRAMMING QUESTION PAPER

Image
Here, you will find MGKVP BCA C programming question paper of previous years The important notes which is directed by the Mahatma Gandhi Kashi Vidyapeeth university while writing in your answer booklet are as follows : Attempt any five questions.All questions carry equal marks.The answers to short questions should not exceed 200 words and the answers to long questions should not exceed 500 words.The time of examination is three(3) hours and maximum marks is 75. BCA 2nd Sem C Programming Question Paper 2020: BCA C Programming Question Paper 2019: Q 1- (a)  How values can be stored in a 1-Dimensional array . Give example of various methods. (6 marks) (b)  Consider a 20 X 5 tow – dimensional array Marks which has base address = 1000 and the word size = 2.Now compute the address of the element Marks [18,4] assuming that the elements are stored in row major order. (2 marks) (c)  Write a program in C language to delete a number from a given location in an array. (7 marks) Q 2- ...
Read more

Mgkvp bca 6th semester Information System : Analysis Design and Implementation previous years question papers and notes

BCA INFORMATION SYSTEMS: ANALYSIS DESIGN AND IMPLEMENTATION Last year Question Papers : Mgkvp bca information Systems question papers 2016 Mgkvp bca information Systems question papers 2018 Mgkvp bca information Systems question papers 2019 Mgkvp bca information Systems question papers 2020 Mgkvp bca information Systems question papers 2021 STUDY  NOTES  FOR  Information System : Analysis Design and Implementation [PDF] mgkvp bca Information System: Analysis Design and Implementation study Notes and Important Question
Read more

MGKVP BCA COMPUTER FUNDAMENTAL QUESTION PAPER

Here , you will find MGKVP BCA computer fundamental and office automation question paper of previous years The important notes which is directed by the MGKVP university while writing in your answer booklet are as follows : Attempt any five questions.All questions carry equal marks.The answers to short questions should not exceed 200 words and the answers to long questions should not exceed 500 words.The time of examination is three(3) hours and maximum marks is 75. BCA Computer Fundamental Question Paper 2020: 1.(a) Draw and explain the basic building blocks of a digital computer with a neat block diagram? 8 marks (b) Enumerate the capabilities and characteristic digital computer? 7 marks 2. Differentiate between: Internal command and external command of MS-DOS. RAM and ROM Machine language and Assembly language Multi programming operating system. File and directory. 3x5=15 marks 3. Perform the following conversion: (BCA) 16 = (? )2 (10347) 8 = (?) 10 (10101011) 2  = (?) 8 (231) ...
Read more