cs301 data structures assignment 3 solution

• For educators
• English (US)
• English (India)
• English (UK)
• Greek Alphabet

This problem has been solved!

You'll get a detailed solution from a subject matter expert that helps you learn core concepts.

Question: Lab Assignment 3 CS 301 - Data Structures For this assignment you will implement a Doubly Linked List, that uses a Node class with a generic data type. Since the data type of the Node class is generic, we will be able to store any type of data in our list. You will also write a Driver program to test your implementation. Recall the difference between a

Define the class Node that methods use in the DoublyLinkedList class

This is the code of Node class

Not the question you’re looking for?

Post any question and get expert help quickly.

Your browser does not seem to support JavaScript. As a result, your viewing experience will be diminished, and you have been placed in read-only mode .

Please download a browser that supports JavaScript, or enable it if it's disabled (i.e. NoScript).

• Virtual University
• CS301 – Data Structures

CS301 Assignment 3 Solution and Discussion

Re: CS301 Assignment 3 Solution and Discussion

SEMESTER FALL 2020 CS301- Data Structures Total Marks: 20 Due Date: 21/01/2021 Instructions Please read the following instructions carefully before solving & submitting assignment: It should be clear that your assignment will not get any credit (zero marks) if: o The assignment is submitted after due date. o The submitted assignment is other than .doc/.docx file. o The submitted assignment does NOT open or file is corrupted. o The assignment is copied (from other student or ditto copy from handouts or internet). Uploading instructions

o For clarity and simplicity, you are required to Upload/Submit only .doc/.docx file.

Objective The objective of this assignment is: o Binary Search trees o AVL trees o Rotation cases of AVL trees o Balancing Factor of trees

For any query about the assignment, contact at [email protected] GOOD LUCK Marks: 20

Problem Statement:

You are required to construct AVL tree from the following data:

15 ,18 ,12, 8, 54, 5, 14, 13, 9, 61, 20, 17, 21

Solution Guidelines:

• You need to insert these data items one by one starting from the data item 15 in the same order in which they have written above.
• Show and perform necessary rotations where needed.
• In Solution show only the final AVL tree and only those steps in which rotation is applied.

Note: If you show only final tree and do not show the rotation steps then your marks will be deducted. Lectures Covered: This assignment covers Lecture # 15-26 Deadline: Your assignment must be uploaded/submitted at or before January 21 , 2021

Discussion is right way to get Solution of the every assignment, Quiz and GDB. We are always here to discuss and Guideline, Please Don't visit Cyberian only for Solution. Cyberian Team always happy to facilitate to provide the idea solution. Please don't hesitate to contact us! [NOTE: Don't copy or replicating idea solutions.] Quiz Copy Solution Mid and Final Past Papers Live Chat

https://youtu.be/TYX0Vr3gm1M

Discussion is right way to get Solution of the every assignment, Quiz and GDB. We are always here to discuss and Guideline, Please Don't visit Cyberian only for Solution. Cyberian Team always happy to facilitate to provide the idea solution. Please don't hesitate to contact us! %(red)[NOTE: Don't copy or replicating idea solutions.] Quiz Copy Solution Mid and Final Past Papers Live Chat

CS301-assignment-no3-Solution.docx

File Sharing

• M All Subjects MidTerm and Final Term Solved Paper Links Attached Please check moaaz past papers
• M How can I receive Reputation earning from Cyberian? 100% Discount on Fee
• A Components of Cricket Match Prediction
• M How to HTML Image Link
• First post Last post Go to my next post

• Discussions

Howdy, Stranger!

It looks like you're new here. If you want to get involved, click one of these buttons!

Quick Links

• Recent Discussions
• 34 All Categories
• jobs & career opportunities

Our Friends

•   Online Worker

Who's Online 0

Cs301 assignment no 3 solution fall 2021.

You are required to construct AVL tree from the following data:

15,18,12, 8,54,5,14,13,9,61,20,17,21

CS301 ASSIGNMENT NO 3 SOLUTION  FALL 2021

CS301 ASSIGNMENT NO 3 SOLUTION FALL 2021 is given in description

Acc311   acc501   acc311    acc501   acf619    acfi619   bif401   bif402   bif501   bif601   bif602, bif604   bif619   bif720   bif731   bif732   bif733   bit701   bit703   bit710   bit715   bio101   bio102  , bio201   bio202   bio203   bio204   bio301   bio302   bio303   bio401   bio502   bio503   bio601   bio731  , bio732   bio733   bio734 bnk601 bnk603 bnk604 bnk610 bnk612 bnk619 bnk620, bnk701 bnk703 bnk704 bnk725 bnki619 bnki620 bt101 bt102 bt201 bt301 bt302 bt401, bt402 bt403 bt404 bt405 bt406 bt503 bt504 bt505 bt601 bt603 bt605 bt619 bt720 bt731, bt732 bt733 bt734 bt735 bti619, cs001 cs101 cs201 cs202 cs204 cs205 cs206 cs301 cs302  cs304 cs310 cs311 cs312 cs314 cs315 cs401, cs402 cs403 cs405 cs406  cs407 cs408 cs409 cs410 cs411 cs420 cs431 cs432 cs435 cs441 cs501 cs502 , cs504 cs506 cs507 cs508 cs510 cs519 cs601 cs602 cs603 cs604 cs605  cs606 cs607 cs608 cs609 cs610, cs611 cs614  cs615 cs619 cs620 cs625 cs701 cs702 cs703 cs704  cs706 cs707 cs708 cs709 cs710 , cs711 cs712 cs713 cs716 cs718 cs720 cs721  cs723 cs724 cs726 cs799 com619 comi619, term of services   privacy policy   members   topics   about us   search engine  .

• High School
• You don't have any recent items yet.
• You don't have any courses yet.
• You don't have any books yet.
• You don't have any Studylists yet.
• Information

CS301 P Lab Exercises - Lab manual

Data structures (cs 301), virtual university of pakistan, recommended for you, students also viewed.

• Cs 301 assignment 02
• 290048301 CS201 Final Term Solved Papers
• Power Platform Licensing Guide May 2024
• Assignment 1 mgt101 - Copy

Related documents

• Cs301 assignment Solution#2.docx Pin2
• CS401 Assignmen#2 Solution 2023 by Artist H25
• CS301P Lab quiz 1,2,3 - best and repetitive mcqs
• Lab Manual CS301 New
• CS301p - good course

Related Studylists

Preview text, lab manual cs301p – data structures (practical), (practical), lab no. lab topic, 1 lab 1: learn to implement linked list data structure 2, 2 lab 2: learn to implement stack data structure 11, 3 lab 3: learn to implement queue data structure 19, 4 lab 4 : learn to implement binary search tree data structure 24, 5 lab 5 : learn to implement binary search tree traversals (in-order,pre-, order,post-order), 6 lab 6 : learn to implement function call by value, by reference and by, 7 lab 7: learn to build/draw avl tree and understand different types of, rotations performed while constructing an avl tree, 8 lab 8: learn to build/draw avl tree 54, 9 lab 9 : learn to delete nodes from avl with the help of rotations 55, 10 lab 10 : learn to build frequency table and huffman encoding tree 59, 11 lab 11: learn to implement min heap using insert( ) method 61, 12 lab 12: learn to implement min heap using buildheap( ) method 64, 13 lab 13: learn to a build union tree by using union by size method 67, 14 lab 14:learn to implement binary search algorithm 70, 15 lab 15 : build hash table using linear probing collision resolution, 16 lab 16: learn to sort array using elementary sorting algorithms. 73, private variables (faculty object, node * nextnode), faculty get(), void set(faculty object), node * getnext(), void setnext(node * nextnode), list class:, data members:, private variables (int size, node * headnode, node * currentnode), member functions:, void add (faculty addobject); (to add the data of faculty member into, the linked list node), faculty get();, bool next();, friend void traverse(list list); (to visit each node and display the data of, a faculty members stored in that node), #include <iostream>, using namespace std;, class faculty{, string name;, string post;, void setname(string name){, this->name= name;, void setpost(string post){, this->post= post;, void setage(int age){, this->age=age;, string getname(){, return name;, string getpost(){, return post;, int getage(){, return age;, class node {, void add (faculty addobject);, friend void traverse(list list);, node * headnode;, node * currentnode;, /* constructor */, list::list() {, headnode = new node();, headnode->setnext(null);, currentnode = null;, /* add() class method */, void list::add (faculty addobject) {, node * newnode = new node();, newnode->set(addobject);, if( currentnode = null ), newnode->setnext(currentnode->getnext());, currentnode->setnext( newnode );, currentnode = newnode;, newnode->setnext(null);, headnode->setnext(newnode);, /* get() class method */, faculty list::get() {, if (currentnode = null), return currentnode->get();, /* next() class method */, list = savedcurrentnode;, int main() {, faculty member;, string name,post;, cout<<"==============enter faculty, information================="<<endl;, for(int a=0;a<5;a++){, cout<<"enter faculty member age: "<<endl;, cin>>age;, cout<<"enter faculty member name: "<<endl;, cin>>name;, if(age>=25 && age<=35){, post="lecturer";, else if(age>=36 && age<=45){, post="assistant professor";, else if(age>=46 && age<=60){, post="professor";, member(name);, member(age);, member(post);, list(member);, traverse(list);, lab title: learn to implement stack data structure, objectives: get the knowledge of implementing stack data structure using linked list and array, in c++ programming language., tool: dev c++, description:, note: numbers must be shown in reverse order only by using pop () method, lab 2 solution, class node{, int object;, node *nextnode;, int num_get() { return object; };, void num_set(int object) { this->object = object; };, node * getnext() { return nextnode; };, void setnext(node * nextnode) { this->nextnode = nextnode; };, class stack_array, stack_array() { size = 5; current = -1;} //constructor, int pop_array(){ return a[current--];} // the pop function, void push_array(int x){a[++current] = x;} // the push function, int isempty(){return ( current == -1 );} // will return true when stack is empty, int isfull(){ return ( current == size-1);} // will return true when stack is full, int object; // the data element, //poping elements from stack and displaying values, int stack_linkedlist ::pop_list(), if(head==null){, cout<<"list is empty"<<endl;, int x =head->num_get();, node * p = head;, head=head->getnext();, cout<<" \n"<< x;, int main(){, int n=0; // option, int k; // total number to be entered in linked list, int j; // used to push elements in linked list, int m; // used to push elements in linked list, stack_linkedlist s;, stack_array sa;, while (n < 5) {, cout << "\n enter your choice \n";, cout << "1 : add stack element in linked list \n";, cout << "2 : add stack element in array \n";, cout << "3 : pop stack elements in linked list and display \n";, cout << "4 : pop stack elements in array and display \n";, cout <<"enter any other number to close the program \n";, scanf("%d", &n);, switch (n) {, cout << "enter the total number you want to entered \n";, cin>>k;, cout<<"please enter the numbers \n";, for(int i = 1; i <= k; i++), cin>>j;, s_list(j); // push the element at the top, cout<<"numbers added in linked list successfully \n";, if(sa()) // checking stack is full or not, cout <<"\n stack is full, can't insert new element";, cout <<"\n stack is empty, can't pop";, lab title: learn to implement queue data structure, objectives: get the knowledge of implementing queue data structure using linked list in c++, programming language., write a c++ program to create a queue (using linked list), your program should meet the following, requirements:, 1. the queue will store only even numbers and just display those numbers without removing them., 2. then you have to delete the first even element from the queue and show the remaining numbers, structure of classes:, the program should contain the following classes:,  two private variables (int object, node * nextnode),  functions:, void set (int object), queue class,  two public variables (node *front, *rear), void enqueue (int x);, int dequeue ();, void display ();, int isempty();, sample output:.

• Multiple Choice

Course : Data Structures (cs 301)

University : virtual university of pakistan.

• Discover more from: Data Structures cs 301 Virtual University of Pakistan 262   Documents Go to course
• More from: Data Structures cs 301 Virtual University of Pakistan 262   Documents Go to course
• More from: Data Structures - 08/12/2024 by Rimsha jamil 5 5 documents Go to Studylist