BCA-2 

Index
Drive & Other PDF Notes Link
Tutorial Videos
Important Semester-end Examination Questions
Previous Year Semester-end Question Papers

Drive & Other PDF Notes Link
DATE : 22-06-2020
DATE: 19-06-2020
  • COURSE            BCA
  • SEMESTER       2ND   
  • PAPER                DS & C++
  • TOPIC                singly linked list - insertion, deletion, & traversal    
  • LINK                  https://bit.ly/2ZgDyas 
DATE: 13-05-2020

  • COURSE            BCA
  • SEMESTER       2ND   
  • PAPER                DS & C++
  • TOPIC                INTRODUCTION TO LINKEDLIST DATA STRUCTURE  PART-1        
  • LINK                  HTTPS://BIT.LY/LINKEDLIST-1-SUBODH

DATE: 11-05-2020

  • COURSE            BCA
  • SEMESTER       2ND   
  • PAPER                DS & C++
  • TOPIC                INTRODUCTION TO QUEUE DATA STRUCTURE            
  • LINK                   https://bit.ly/queue_subodh

DATE: 01-05-2020

  • COURSE            BCA
  • SEMESTER       2ND   
  • PAPER                DS & C++
  • TOPIC                INTRODUCTION TO THE DATA STRUCTURE            
  • LINK                   HTTPS://BIT.LY/DATA-STRU
 
   

   
  
 
 

Important Semester-end Examination Questions
    Click Here to Upload Previous Semester Question Papers

    DATA STRUCTURE   IMPORTANT QUESTIONS 

     [ Questions marked with bold & italic are most important]



    Data Structure
    1.     What is Data Structure? Explain different types of Data Structures and their operations.
    2.     Explain the difference between Linear & Non-Linear Data Structures.
    3.     What is Binary search? Write an algorithm for Binary search.
    4.     What is Searching? Write the difference between Sequential/Linear & Binary Search.
    5.     Explain with example Bubble and Merge sort.
    6.     Explain the Selection sort with an Algorithm and example. Also, mention its Time complexity. [ Kolhan-2017]
    7.     Explain Insertion sort with an example.
    8.     Explain the Stack and Queue data structure. [ Kolhan-2017]
    9.     Write the difference between Stack and Queue.
    10.  Explain the array implementation of Stack. (push, pop, traverse)
    11.  Explain the difference in array implementation of Stack and Queue.
    12.  What are various Queue operations? Explain with proper examples.
    13.  Write an algorithm to Push/Pop an element into a Stack. [ Kolhan-2017]
    14.  Write an algorithm to Insert/Delete an element into a Queue. [ Kolhan-2017]
    15.  Write an algorithm to evaluate postfix expression. [ Kolhan-2017]
    16.  Write an algorithm to convert infix expressions to postfix expressions.
    17.  Evaluate following postfix expression using a stack-50,40,+,18,14,-,4,*,+ [ Kolhan-2017]
    18.  Convert the following infix expression into postfix using stack – [ Kolhan-2017]
    (i) (A-B)+C*D/E-F   (ii) A*B+C/D (iii)(A+B)/(A-C)  (iv) A+(B*C) (v) A+B-C      
    19.  Write a short note on Linked – List. How it is represented? Explain its different types. [ Kolhan-2017]
    20.  Write the difference between the Singly and Doubly Linked list?
    21.  Write the difference between Circular and Doubly Linked lists?
    22.  Explain the difference between Linked-List and Array. [ Kolhan-2017]
    23.  Write a program to add an item in the desired location of the linked list.
    24.  Write an algorithm to add a node in the middle of the linked list.
    25.  Write an algorithm to add a node after a given node in the linked list.
    26.  Write a program to delete an item from the desired location of the linked list.
    27.   Write an algorithm to add a node from a Linked list.
    28.  Write a program to delete a node from the head/beginning of a Linked-list.
    29.  Explain the Tree, Binary Tree and Binary Search Tree [ Kolhan-2017].
    30.  Explain the different ways of traversal of Binary Tree-Preorder, Postorder and Inorder. [ Kolhan-2017]
    31.  Design a Binary Search Tree by using the following data elements 7,3,5,11,2,10,8 [ Kolhan-2017]
    32.  Write Pre-order, Post-order and In-order traverse of the following Binary tree – [ Kolhan-2017]













    33.  Draw the Binary Tree by using the following sequence of node –
    Pre-order: G, B, Q, A, C, K, F, P, D, E, R, H  In-order: Q, B, K, C, F, A, G, P, E, D, H, R
    34.  Write a program for Binary Search Tree.
    35.  Write algorithm for Pre-order traversing of a Tree.
    36. Question on Expression Tree.

     

    Previous Year Semester-end Question Papers

    Question Paper-BCA-2nd Semester Year 2018 of Kolhan University, Chaibasa


    Provided by Subodh Kumar (subodhkrmail@gmail.com), Asst. Prof. , BCA Dept., Jamshedpur Co-operative College, Jamshedpur

    Paper  Code: BCA 201 (2018)            Paper Name: C++ and Data Structure



    Paper  Code: BCA 202 (2018)            Paper Name: Probability & Statistic





    Paper  Code: BCA 203 (2018)            Paper Name: Logic Design





    Paper  Code: BCA 204 (2018)            Paper Name: Managerial Economics




    Question Paper-BCA-2nd Semester Year 2017 of Kolhan University, Chaibasa

    Provided by Subodh Kumar (subodhkrmail@gmail.com), Asst. Prof. , BCA Dept., Jamshedpur Co-operative College, Jamshedpur

    Paper  Code: BCA 201 (2017)            Paper Name: C++ and Data Structure




    Subscribe to: Posts (Atom)