COMPUTER SCIENCES, B.sc. SEMESTER II EXAMINATION,2018

Subject- COMPUTER SCIENCES (BCS-C-201), Data Structure

➡️Sessional Exam paper 2
  Department of Computer science, GKV, Haridwar 1st Sessional Exam ( 2017-18)

                  B.sc. II Semester

     BCS-C201:Data Structure and File             

Processing

Time: 1 hr.                          Maximum Marks: 20

                        Section-A

Note: Attempt all questions. Each question carries equal marks.( 2 × 2 = 4 )

Q.1 What do you understand by Linked Queue & Linked Stack?

Q.2 Compare Array and Linked List.

                      Section-B

Note: Attempt any two questions. Each question carries equal marks.( 3 × 2 = 6 )

Q.3 What do you understand by data         structures? Explain.

Q.4 Give the meaning of Stack. Explain its        applications.

Q.5 What do you understand by the         polynomials? How can it be implemented        using array and linked list?

Q.6 Explain Queue Data Structure and it's         types.

                    Section-C

Note: Attempt any one question. Each    question carries equal marks.( 10 × 1 = 10 )

Q.7 What do you understand by Infix and         postfix expression? Convert the following         Infix expression and postfix expression         using stack:

         A + ( B * C - ( D / E ^ F ) * ) G * H

Q.8 What do you understand by Linked List?  Explain in details.

➡️Sessional Exam Paper 2

Department of Computer science, GKV, Haridwar 2nd Sessional Exam ( 2017-18)

                B.sc. II Semester

       BCS-C201:Data Structure and File

      Processing

Time: 1 hr                           Maximum Marks: 20

                      Section-A

Note: Attempt all questions. Each question carries equal marks.( 2 × 2 = 4 )

Q.1 Define the meaning of binary search tree and strict binary tree ?

Q.2 Discuss the meaning of traversing a tree and it's types.

                          Section-B

Note: Attempt any two questions. Each question carries equal marks.( 3 × 2 = 6 )

Q.3 What do you understand by Hashing? Explain different methods.

Q.4 Explain binary search using algorithm and example.

Q.5 What do you understand by equal sized blocks and unequal sized blocks in memory management.

Q.6 Explain AVL tree in detail using example.

                          Section-C

Note: Attempt any one question. Each question carries equal marks.( 10 × 1 = 10 )

Q.7 What do you understand by B-tree? Perform the Insert operation In a B-tree (order-4) for the following keys.

Q.8  What do you understand by Tree traversing? Write the pre-order, In-order and post-order of the following tree.