|
|
Title Name | IGNOU BCA BCSL 33 2023 2024 Solution |
---|---|
Type | Soft Copy (E-Assignment) .pdf |
University | IGNOU |
Degree | BACHELOR DEGREE PROGRAMMES |
Course Code | BCA |
Course Name | Bachelor of Computer Applications |
Subject Code | BCSL 33 |
Subject Name | Data and File Structures Lab |
Year | 2023 2024 |
Session | - |
Language | English Medium |
Assignment Code | BCSL-033/Assignmentt-1//2023-24 |
Product Description | Assignment of BCA (Bachelor of Computer Applications) 2023-24. Latest BCSL 033 2023-24 Solved Assignment Solutions |
Last Date of IGNOU Assignment Submission | Last Date of Submission of IGNOU BCSL-033 (BCA) 2023-24 Assignment is for January 2023 Session: 30th September, 2023 (for December 2023 Term End Exam). Semester Wise January 2023 Session: 30th March, 2024 (for June 2024 Term End Exam). July 2023 Session: 30th September, 2023 (for December 2023 Term End Exam). |
Assignment Code | BCSL 33/2023 2024 |
|
Ques 1.
Write a program to multiply two matrices using array.
Ques 2.
Write a program to implement singly linked list for user inputs. Also, perform insertion and delete operation on it
Ques 3.
Write a program using linked list that accepts two polynomials as input and displays the resultant polynomial after performing the addition of the input polynomials.
Ques 4.
Write a program to implement doubly linked list for user inputs. Also, perform insertion and deletion operations on it.
Ques 5.
Write a program in C to sort user input data using quick sort method. Also, print the number of swaps and comparison operations performed for sorting the given data set.
Ques 6.
Write a program in C to search an input data from a set of data, stored in an array using binary search algorithm. Also, print the number of comparison operations performed for searching the given data.
Ques 7.
Write a program to implement two stacks with the help of single array
Ques 8.
Write a program to implement a DEQUE (Double Ended Queue) using a doubly linked list.
Ques 9.
Write a program to convert an infix expression to a postfix expression. Use appropriate data structure.
Ques 10.
Write a program to implement binary search tree (BST). Also, write functions to traverse the BST in In-order, Pre-order and Post-order forms.
|
IGNOU Doubts & Queries
Click to Contact Us
Call - 9199852182 Call - 9852900088 myabhasolutions@gmail.com WhatsApp - 9852900088