BCA BBA IT SEM-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

Tutorial Vi   
           
  

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


    DATA STRUCTURE   IMPORTANT QUESTIONS 

    ****Updated foR 2024-28 SESSION ****

    MJ-3 (Data Structure with C++)
    1.     What is Data Structure? Explain different types of Data Structures [Kolhan-2023, Kolhan-2024] and their operations.
    2.     What is an algorithm? Why do we need to do an algorithm analysis? [Kolhan-2024]
    3.     What is Binary search? Write an algorithm for Binary search. [Kolhan-2023]
    4.     What is Searching [Kolhan-2023]? Write the difference between Sequential/Linear & Binary Search.
    5.     Write an algorithm to perform Bubble sort. [Kolhan-2023] and Quick Sort. [Kolhan-2024]
    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. Discuss overflow and underflow conditions. [ Kolhan-2017, Kolhan-2023]
    9.     Write the difference between Stack and Queue. [Kolhan -2023]
    10.  Explain various operations (Creation, PUSH, POP, Checking full/empty, Traversal) that can be performed on a Stack. [Kolhan-2024]
    11.  Explain the types of queue and their applications. [Kolhan-2024]
    12.  What are various Queue operations? Explain with proper examples.
    13.  Write an algorithm to Push/Pop an element into a Stack. [ Kolhan-2017, Kolhan-2023]
    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. [Kolhan-2023] How is it 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, Kolhan-2023, Kolhan-2024]
    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/insert a node into a Linked list. [Kolhan-2023]
    28.  Write a program to delete a node from the head/beginning of a Linked-list. [Kolhan-2023]
    29.  Explain the Tree, Binary Tree [Kolhan-2023] and Binary Search Tree [ Kolhan-2017]. Explain different components and properties of Binary Tree. [Kolhan-2023]
    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 Papers are available here for the Session - FYUGP 2022 (2022-26) onwards of Kolhan University, Chaibasa










    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: Comments (Atom)