DATA STRUCTURES AND APPLICATIONS | BCS304 | All 5 Modules Very Important Questions With Solutions (with CONCEPTS EXPLAINED)| 2022 Scheme | Video Course With Study Materials

About Course

Ace Your DSA (BCS304) Exams with Minimal Effort

Last-Minute POP Exam Preparation: Score 80+ with Ease

Struggling with DSA (BCS304) exam preparations? Worry no more! This comprehensive video course is your ultimate guide to acing your exams with minimal effort. Our expert instructor has meticulously curated a set of Very Important Questions (VIQs) spanning all 5 modules, ensuring you can maximize your scores in the least amount of time.

What You’ll Learn:

Detailed explanations of Model Paper questions.
Module wise very important questions.
Insights into frequently repeated questions from previous years.
Expert-identified crucial questions for your upcoming exams.

Course Features for DSA:

Pre-recorded Video Lectures: 4-5 hours of intensive, yet easy-to-follow lectures designed for last-minute preparation.
Downloadable Study Materials: Access all the study materials used in the video lectures, available for download to aid your preparation.
Targeted Learning: Focus on essential questions to score 80+ in your semester exams without unnecessary effort.

Why This Course?

Efficient Preparation: Designed specifically for last-minute exam prep, this course helps you get ready in just one day.
Expert Guidance: Benefit from the knowledge and experience of our expert instructor who knows what it takes to score high.
Proven Results: Follow our structured approach to effortlessly achieve top marks.

Ideal For:

Students enrolled in DSA (BCS304) looking for a quick and effective way to prepare for their exams.
Anyone needing a comprehensive review of crucial exam topics in a short period.

Course Duration:

4-5 hours of video content

Access:

Immediate access to all video lectures and study materials upon enrollment.

Join Now: Transform your last-minute study session into a successful exam strategy. Enroll now and get ready to score 80+ with ease!

Note: This course is specially designed for last-moment exam preparation to ensure you excel with minimal effort. Just study one day before the exam and achieve top marks!

Course Content

Module-1

1.Define data structure. Explain various operations on data structure (6)

02:46
2. Define data structure. Explain the classification of data structure with examples

03:22
3. What is structure? Explain the different types of structure with example and give difference between union and structure

07:09
4. List and explain the functions supported in C for dynamic memory allocation

04:21
5. Write a c program to demonstrate the basic operations on arrays

02:50
6. Explain any four string handling functions supported by c with syntax and example

02:13
7. What is Sparse matrix? Write the ADT of Sparse matrix. Give the triplet form of a given matrix and also find its transpose

06:50
8. Define Pointers. How to declare and initialize pointers, explain with example

04:00
9. Define stack. List and explain the various operations on stacks using arrays with stack overflow and stack underflow conditions

09:39
10. Write a c program to perform push(), pop(), display operations on STACK

02:12
11. Develop a C recursive program for Tower of Hanoi problem. Trace it for 3 disks with schematic call tree diagram

09:27
12. Write an algorithm to convert an infix expression to postfix expression and also trace the same for the expression

08:50
13. Write an algorithm to evaluate postfix expression and apply the same for the given postfix expression. ABC-D*+E$F+ and assume A=6 B=3 C=2 D=5 E=1 F=7

06:17
14. Convert the following infix expression into postfix expression using stack (5) A + (B*C-(D/E^F)*G)*H

08:08

Module-2

1.Write a c program to perform insertion, deletion and display operation on queue (OR) Define queue. Write Qinsert and Qdelete procedures for queues using arrays

05:38
2.Write short note on dequeue and priority queue(

05:35
3.Write a function CQinsert() and CQdelete() operation on circular queue

03:16
4.What is linked list. List and explain the different types of linked list with examples

04:55
5.Write a c function for the following operations on linked list

05:27
6.Define Ackerman function recursively and evaluate A(3,0). Also, develop c code for the same

05:34
7.Differentiate single(SLL) and Doubly(DLL) linked list

02:42
8.Differentiate single(SLL) and Doubly(DLL) linked list

05:06
9.Write a c function for the following operations on Circular linked list

08:26
10.What is recursion? Write the recursive procedure for

05:19
11.Write and explain how do you implement the operations of stack using singly linked list(SLL) with the help of C-statement

05:25
12.Write a node structure for the linked representation of a polynomial. Explain the algorithm to add two polynomials represented using linked list

04:33
13.Write a C function to add two polynomials represented as circular list with header node

03:00

Module-3

1. Write a C function to insert_front and delete_front using Doubly Linked List

02:50
2. Write a c function for concatenation of two doubly linked list

03:19
3. Describe the doubly linked list with advantages and disadvantages. Write a c function to delete a node from a circular doubly linked list with header node

05:48
4. For the given sparse matrix, write the diagrammatic linked list representation

08:20
5.What is a tree .with suitable example define

03:34
6.Consider the foloowing tree.Write the inorder, preorder , and post traversals for the tree T along with C functions.Also find the depth of the tree T

05:30
8.Write the function for :1)finding the length of the list 2)concatenation two list 3)Reverse the list

04:45
9.DefineThreaded binary tree.List its advantages and disadvantages. draw the one way threading and two-way threading of the following binary tree

05:19
10.Explain threaded binary trees and representation with a neat diagram.Also develop a C function to do the in-order traversal of a Threaded binary tree

06:09
11.Draw the binary tree for the following expression

06:48
12.Denfine expression tree. For the given tree traverse using in-order ,pre order and post-order traversal.

04:56
13.Outline the steps involved in construction of expression tree.Construct expression tree for the following input;

08:06
7.Differentiate single(SLL) and double(DLL) linked list

09:50

Module-4

1. Define Binary search tree. Draw the BST for the following input:

06:16
2. Write c function to insert an element in a Binary Search Tree (

04:01
3. Write the recursive search and Iterative search algorithm for a binary search tree

04:50
4. For the given data, draw a binary search tree and show the array and linked representation of the same

08:07
5. Construct binary search tree for the given set of values 14, 15, 4, 9, 7, 18, 3, 5, 16, 20. Also perform inorder, preorder, and postorder traversal of the obtained tree

21:31
6. Construct a binary search tree by using the following in-order and post-order traversals

04:17
7. A binary tree has 9 nodes. The inorder and preorder traversals yield the following sequences of nodes:

05:14
8. Define the following terminologies with examples:

03:54
9. Define graph. For the given graph show the adjacency matrix and adjacency list representation of the graph

05:42
10. Write an algorithm for Breadth first search and Depth first search

06:08
11. What are the methods used for traversing a graph. Explain any one with example and write the C function for the same

10:34
12. Define selection tree. Construct min winner tree for the runs of a game given below. Each run consists of values of players. Find the first 5 winners

13:02
13. Define Forest. Transform the given forest into a Binary tree and traverse using in-order, pre-order and post-order traversal

05:44

Module-5

1. What is Hashing? Discuss the properties of a good hash function. Explain the following hash function with proper example a. Division Method b. Midsquare Method c. Folding Method

07:04
2. Explain static and dynamic hashing in detail

06:20
3. What is chained hashing? Discuss its pros and cons. Construct the hash table to insert the keys: 7, 24, 18, 52, 36, 54, 11, 23 in a chained hash table of 9 memory locations. Use h(k) = k mod m

07:39
4. What is dynamic hashing? Explain the following techniques with examples i) Dynamic hashing using directories ii) Directory less dynamic hashing

08:02
5. Consider a hash table of size 10. Using linear probing, insert the keys 72, 27, 36, 24, 63, 81, 92, and 101 into the table

07:02
6. Consider a hash table of size 10. Using quadratic probing, insert the keys 72, 27, 36, 24, 63, 81, and 101 into the table. Take c1 = 1 and c2 = 3

07:18
7. Define the leftist tree. Give its declaration in C. Check whether the given binary tree is a leftist tree or not. Explain your answer

07:47
8. Define min Leftist tree. Meld the given min leftist trees

11:39
9. Define double ended priority queue and min-max heap. Explain Insertion and Deletion in a min- max heap with example

05:56
10. What is Optimal Binary Search Tree? Write a c function to find an Optimal Binary Search Tree.

03:12

Add this certificate to your resume to demonstrate your skills & increase your chances of getting noticed.

Student Ratings & Reviews

No Review Yet

About Course

Ace Your DSA (BCS304) Exams with Minimal Effort

Last-Minute POP Exam Preparation: Score 80+ with Ease

What You’ll Learn:

Course Features for DSA:

Why This Course?

Ideal For:

Course Duration:

Access:

What Will You Learn?

Course Content

Module-1

1.Define data structure. Explain various operations on data structure (6)

2. Define data structure. Explain the classification of data structure with examples

3. What is structure? Explain the different types of structure with example and give difference between union and structure

4. List and explain the functions supported in C for dynamic memory allocation

5. Write a c program to demonstrate the basic operations on arrays

6. Explain any four string handling functions supported by c with syntax and example

7. What is Sparse matrix? Write the ADT of Sparse matrix. Give the triplet form of a given matrix and also find its transpose

8. Define Pointers. How to declare and initialize pointers, explain with example

9. Define stack. List and explain the various operations on stacks using arrays with stack overflow and stack underflow conditions

10. Write a c program to perform push(), pop(), display operations on STACK

11. Develop a C recursive program for Tower of Hanoi problem. Trace it for 3 disks with schematic call tree diagram

12. Write an algorithm to convert an infix expression to postfix expression and also trace the same for the expression

13. Write an algorithm to evaluate postfix expression and apply the same for the given postfix expression. ABC-D*+E$F+ and assume A=6 B=3 C=2 D=5 E=1 F=7

14. Convert the following infix expression into postfix expression using stack (5) A + (B*C-(D/E^F)*G)*H

Module-2

1.Write a c program to perform insertion, deletion and display operation on queue (OR) Define queue. Write Qinsert and Qdelete procedures for queues using arrays

2.Write short note on dequeue and priority queue(

3.Write a function CQinsert() and CQdelete() operation on circular queue

4.What is linked list. List and explain the different types of linked list with examples

5.Write a c function for the following operations on linked list

6.Define Ackerman function recursively and evaluate A(3,0). Also, develop c code for the same

7.Differentiate single(SLL) and Doubly(DLL) linked list

8.Differentiate single(SLL) and Doubly(DLL) linked list

9.Write a c function for the following operations on Circular linked list

10.What is recursion? Write the recursive procedure for

11.Write and explain how do you implement the operations of stack using singly linked list(SLL) with the help of C-statement

12.Write a node structure for the linked representation of a polynomial. Explain the algorithm to add two polynomials represented using linked list

13.Write a C function to add two polynomials represented as circular list with header node

Module-3

1. Write a C function to insert_front and delete_front using Doubly Linked List

2. Write a c function for concatenation of two doubly linked list

3. Describe the doubly linked list with advantages and disadvantages. Write a c function to delete a node from a circular doubly linked list with header node

4. For the given sparse matrix, write the diagrammatic linked list representation

5.What is a tree .with suitable example define

6.Consider the foloowing tree.Write the inorder, preorder , and post traversals for the tree T along with C functions.Also find the depth of the tree T

8.Write the function for :1)finding the length of the list 2)concatenation two list 3)Reverse the list

9.DefineThreaded binary tree.List its advantages and disadvantages. draw the one way threading and two-way threading of the following binary tree

10.Explain threaded binary trees and representation with a neat diagram.Also develop a C function to do the in-order traversal of a Threaded binary tree

11.Draw the binary tree for the following expression

12.Denfine expression tree. For the given tree traverse using in-order ,pre order and post-order traversal.

13.Outline the steps involved in construction of expression tree.Construct expression tree for the following input;

7.Differentiate single(SLL) and double(DLL) linked list

Module-4

1. Define Binary search tree. Draw the BST for the following input:

2. Write c function to insert an element in a Binary Search Tree (

3. Write the recursive search and Iterative search algorithm for a binary search tree

4. For the given data, draw a binary search tree and show the array and linked representation of the same

5. Construct binary search tree for the given set of values 14, 15, 4, 9, 7, 18, 3, 5, 16, 20. Also perform inorder, preorder, and postorder traversal of the obtained tree

6. Construct a binary search tree by using the following in-order and post-order traversals

7. A binary tree has 9 nodes. The inorder and preorder traversals yield the following sequences of nodes:

8. Define the following terminologies with examples:

9. Define graph. For the given graph show the adjacency matrix and adjacency list representation of the graph

10. Write an algorithm for Breadth first search and Depth first search

11. What are the methods used for traversing a graph. Explain any one with example and write the C function for the same

12. Define selection tree. Construct min winner tree for the runs of a game given below. Each run consists of values of players. Find the first 5 winners

13. Define Forest. Transform the given forest into a Binary tree and traverse using in-order, pre-order and post-order traversal

Module-5

1. What is Hashing? Discuss the properties of a good hash function. Explain the following hash function with proper example a. Division Method b. Midsquare Method c. Folding Method

2. Explain static and dynamic hashing in detail

3. What is chained hashing? Discuss its pros and cons. Construct the hash table to insert the keys: 7, 24, 18, 52, 36, 54, 11, 23 in a chained hash table of 9 memory locations. Use h(k) = k mod m

4. What is dynamic hashing? Explain the following techniques with examples i) Dynamic hashing using directories ii) Directory less dynamic hashing

5. Consider a hash table of size 10. Using linear probing, insert the keys 72, 27, 36, 24, 63, 81, 92, and 101 into the table

6. Consider a hash table of size 10. Using quadratic probing, insert the keys 72, 27, 36, 24, 63, 81, and 101 into the table. Take c1 = 1 and c2 = 3

7. Define the leftist tree. Give its declaration in C. Check whether the given binary tree is a leftist tree or not. Explain your answer

8. Define min Leftist tree. Meld the given min leftist trees

9. Define double ended priority queue and min-max heap. Explain Insertion and Deletion in a min- max heap with example

10. What is Optimal Binary Search Tree? Write a c function to find an Optimal Binary Search Tree.

Get a Course Completion Certificate

14. Convert the following infix expression into postfix expression using stack (5) A + (BC-(D/E^F)G)*H