Unnamed: 0 int64 1 5.86k | Question stringclasses 24
values | Sample ANS stringclasses 24
values | Student ANS stringlengths 1 1.06k | Score float64 0 2.5 |
|---|---|---|---|---|
1,389 | What are common operations that can be performed on a data-structure? | The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence | The common operations that can be performed on data structures are:\na)add,subtact\nb)print\nc)max min\n | 1 |
1,390 | What are common operations that can be performed on a data-structure? | The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence | Common Operations that can be performed on a datastructure are :insertion deletion searching etc. | 1 |
1,392 | What are common operations that can be performed on a data-structure? | The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence | search operation , sort operation , insertion etc. can be commonly performed on a data structure | 1 |
1,393 | What are common operations that can be performed on a data-structure? | The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence | common operation that can be performed in data structure are:\n1)searching \n2)sorting\n3)insertion\n4)deletion | 1 |
1,394 | What are common operations that can be performed on a data-structure? | The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence | You can change the shape, structure and order of data items, you can insert, delete and modify the data items in a data structure. | 1 |
1,395 | What are common operations that can be performed on a data-structure? | The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence | Sort, insert, push, pop | 1 |
1,396 | What are common operations that can be performed on a data-structure? | The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence | Some common operations are:\nSorting\nMerging\nSearching\nInsertion\nDeletion | 1 |
1,397 | What are common operations that can be performed on a data-structure? | The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence | The common operations that can be performed on an data structure are traversal , insertion ,deletion opertations . | 1 |
1,398 | What are common operations that can be performed on a data-structure? | The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence | common operation performed on data structures are sorting, searching, traversing, storing etc. | 2 |
1,399 | What are common operations that can be performed on a data-structure? | The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence | searching, sorting, insertion, deletion ,object creation etc. | 2 |
1,400 | What are common operations that can be performed on a data-structure? | The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence | Common operations include insert, delete, sort, etc. | 2 |
1,401 | What are common operations that can be performed on a data-structure? | The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence | There are a number of operations which can be performed in data-structure such as insertion , deletion , addition , subtraction , multiplication division and so on. | 1 |
1,402 | What are common operations that can be performed on a data-structure? | The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence | insertion , deletion ,replacing, search an element in it ,sort the element. | 1 |
1,403 | What are common operations that can be performed on a data-structure? | The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence | Traversing: Traversing a Data Structure means to visit the element stored in it. It visits data in a systematic manner. This can be done with any type of DS. \nSearching: Searching means to find a particular element in the given data-structure. It is considered as successful when the required element is found. Searchin... | 1 |
1,404 | What are common operations that can be performed on a data-structure? | The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence | insert an element ,search for an element ,remove an element | 1 |
1,405 | What are common operations that can be performed on a data-structure? | The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence | common operations that can be performed on a data-structure are \nInsertion\nDeletion \nupdation\n | 1 |
1,406 | What are common operations that can be performed on a data-structure? | The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence | common operations that can be performed is insertion and deletion | 1 |
1,407 | What are common operations that can be performed on a data-structure? | The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence | Asymptomatic notations are mathematical representations to define or assign the complexity and efficiency of any algorithm. \nThere are mainly 3 - \nBig O notations , ex - O(n)\nTheta notations \nOmega Notations | 1 |
1,408 | What are common operations that can be performed on a data-structure? | The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence | 1)Searching\n2)Sorting\n3)Insertion | 1 |
1,409 | What are common operations that can be performed on a data-structure? | The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence | insertion.\ndeletion.\nsize.\nto check if its empty. | 1 |
1,410 | What are common operations that can be performed on a data-structure? | The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence | Operations performed on a data-structure: \n1) Sorting\n2) Searching | 1 |
1,411 | What are common operations that can be performed on a data-structure? | The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence | Common operation are;\n1.Insertion;\n2.Deletion;\n3Retrieval;\n4.Updation. | 1 |
1,412 | What are common operations that can be performed on a data-structure? | The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence | The common operations that can be performed on a data structure are searching,sorting, | 1 |
1,413 | What are common operations that can be performed on a data-structure? | The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence | Searching, Sorting and Traversing. | 1 |
1,414 | What are common operations that can be performed on a data-structure? | The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence | Insert: To add/insert a new value in the structure (for example: inserting new values in Linked Lists)\nDelete: to delete a pre-existing or user-inserted value\nEdit: To edit any inserted value.\nUpdate: To replace the original value with a better or later/newer one. (used in: MATLAB version of an SR Latch) | 1 |
1,415 | What are common operations that can be performed on a data-structure? | The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence | we can delete the element\nwe can search the element\nwe can insert or update the data structure | 1 |
1,416 | What are common operations that can be performed on a data-structure? | The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence | common operations that can be performed on a data structure are:\n1)searching\n2)sorting\n3)traversing | 1 |
1,417 | What are common operations that can be performed on a data-structure? | The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence | data is stored. operations such as searching, sorting in ascending or descending order, returning maximum or minimum element, traversaL can be performed on data structures, | 2 |
1,418 | What are common operations that can be performed on a data-structure? | The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence | 1. storing the elements\n2. searching the elements\n3. deleting the elements | 2 |
1,419 | What are common operations that can be performed on a data-structure? | The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence | The common operations that can be performed on a data structure include storing the elements, searching for any element, deleting the element. | 2.5 |
1,420 | What are common operations that can be performed on a data-structure? | The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence | common operations that can be performed on a data-structure are searching, sorting,insertion ,deletion,insertion and deletion at end /beginning/or at a particular position,merging,dividing,etc.. | 2.5 |
1,421 | What are common operations that can be performed on a data-structure? | The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence | add element to the data structure (push), delete element from it (pop), finding the top element etc | 2 |
1,422 | What are common operations that can be performed on a data-structure? | The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence | The common operators are-sorting, searching , insertion, deleting. | 2 |
1,423 | What are common operations that can be performed on a data-structure? | The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence | Like creating a node ,linked list ,and making tree for searching the node ,using bfs and dfs,\nmain is for sorting and searching that have many techniques for solve them. | 2 |
1,424 | What are common operations that can be performed on a data-structure? | The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence | traversal, sort, search, insertion, deletion | 2.5 |
1,425 | What are common operations that can be performed on a data-structure? | The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence | Many common operations can be performed on a data-structure like searching, sorting, traversing etc. | 2 |
1,426 | What are common operations that can be performed on a data-structure? | The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence | Inserting elements, Deleting elements, traversal on elements in data structure | 2 |
1,427 | What are common operations that can be performed on a data-structure? | The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence | Common operations that can be performed on data structures are insertion, deletion ,update and sort. | 2 |
1,428 | What are common operations that can be performed on a data-structure? | The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence | Common operations that can be performed on a Data Structures are Insertion,Deletion,searching,sorting etc | 2 |
1,429 | What are common operations that can be performed on a data-structure? | The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence | searching\nsorting \nare common operations that can be performed on a data structure | 1.5 |
1,430 | What are common operations that can be performed on a data-structure? | The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence | Some common operations are: Searching and sorting. | 1.5 |
1,431 | What are common operations that can be performed on a data-structure? | The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence | The common operations that can be performed on a linear data structure are we can insert new data, pop a value, replace a paricular value by another value,swapping two values, deletion etc. | 2 |
1,432 | What are common operations that can be performed on a data-structure? | The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence | additon updation and deletion of data | 2 |
1,433 | What are common operations that can be performed on a data-structure? | The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence | the common operations are push and pull ie insertion or retrieval of data. then there is sizeof operation which is to know to size of data structure. isfull() and isempty() structures are also used commonly. | 1.5 |
1,434 | What are common operations that can be performed on a data-structure? | The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence | Some common operations that can be performed on a data structure includes insertion into it, deletion and traversal through it. Sorting can also be done on the member items of a data structure. | 2.5 |
1,435 | What are common operations that can be performed on a data-structure? | The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence | Push\nDelete\nFront\nTop\n | 1.5 |
1,436 | What are common operations that can be performed on a data-structure? | The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence | searching , sorting are the common operation | 1.5 |
1,437 | What are common operations that can be performed on a data-structure? | The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence | 1. Insertion\n2.Deletion.\n3.updation.\n4.Searching . | 2 |
1,438 | What are common operations that can be performed on a data-structure? | The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence | insertion\ndeletion\nsearching\nsorting | 2 |
1,440 | What are common operations that can be performed on a data-structure? | The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence | common operations that can be performed are addition(+), multiplication(*), subtraction(-), division(/) of numbers into one another \ninsertion and deletion of inputs etc | 0 |
1,441 | What are common operations that can be performed on a data-structure? | The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence | Insertion , Deletion , Sorting , Searching are the common operation thar can be performed on data structure. | 2 |
1,442 | What are common operations that can be performed on a data-structure? | The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence | Searching,Sorting,Insertioin,Deletion are some of the operations that can be performed on a data structure. | 2 |
1,443 | What are common operations that can be performed on a data-structure? | The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence | Insertion, deltion,traverse | 2 |
1,444 | What are common operations that can be performed on a data-structure? | The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence | sorting searching | 1.5 |
1,445 | What are common operations that can be performed on a data-structure? | The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence | Some of the common operations that could be performed on a data structures are:-\n1. Insert:- To insert a value in the structures.\n2. Delete:- To delete the value from the structures.\n3. Traverse:- To visit the elements and values on the structure.\n4. Edit:- To edit the values of the structures.\n5. Store:- The data... | 2.5 |
1,446 | What are common operations that can be performed on a data-structure? | The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence | insert , delete , findmin , extractmin , sorting , searching | 2.5 |
1,448 | What are common operations that can be performed on a data-structure? | The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence | searching\nsorting\nmerging\n | 2 |
1,449 | What are common operations that can be performed on a data-structure? | The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence | it can be insertion , deletion ,replacement etc... | 1.5 |
1,450 | What are common operations that can be performed on a data-structure? | The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence | Inserting\nSearching\nSorting\nDeleting\nExtraction | 2 |
1,451 | What are common operations that can be performed on a data-structure? | The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence | insert, delete,etc. | 2 |
1,452 | What are common operations that can be performed on a data-structure? | The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence | searching, sorting | 1.5 |
1,453 | What are common operations that can be performed on a data-structure? | The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence | data storing and searching can be performed on a data structure. | 1.5 |
1,454 | What are common operations that can be performed on a data-structure? | The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence | Common operations performed are :\nadd() : to add an element\npop(): to delete an element\nisempty(): to check if the data structure is empty\nisfull(): to check if the data structure is full | 1 |
1,455 | What are common operations that can be performed on a data-structure? | The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence | Some common operations the can be performed on a data - structure are searching, insertion, deletion. | 2 |
1,456 | What are common operations that can be performed on a data-structure? | The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence | searching \nsorting \nmerging\ndividing\ntraversing | 2.5 |
1,457 | What are common operations that can be performed on a data-structure? | The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence | insertion \ndeletion \ntraverse\nsorting | 2 |
1,458 | What are common operations that can be performed on a data-structure? | The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence | Insertion\nDeletion\nTraversing\nSearching | 2.5 |
1,459 | What are common operations that can be performed on a data-structure? | The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence | insert , delete , search | 2 |
1,461 | What are common operations that can be performed on a data-structure? | The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence | 1 modified\n2 insert\n3 delete\n\n | 2 |
1,462 | What are common operations that can be performed on a data-structure? | The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence | linear & non linear. | 0 |
1,463 | What are common operations that can be performed on a data-structure? | The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence | 1)insertion \n2)deletion \n3)traversal | 2 |
1,464 | What are common operations that can be performed on a data-structure? | The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence | operations that can be performed on data structures are Boolean , algebra, matrix multiplication | 0 |
1,465 | Briefly explain the approaches to develop algorithms. | There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem ... | Algorithms are developed by first analysing the problem, then looking for a solution and then modifying our solution as to make sure the time and space complexity conditions are met. | 1 |
1,466 | Briefly explain the approaches to develop algorithms. | There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem ... | firstly we develop a pseudocode for the algorithm also known as naive approach and then we proceed to the development of the algorithm by determining the time complexity of the algorithm | 2.5 |
1,467 | Briefly explain the approaches to develop algorithms. | There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem ... | there can be many approaches to develop an algorithms we can use approaches like greedy algorithms , dynamic programming and divide and conquer | 2.5 |
1,468 | Briefly explain the approaches to develop algorithms. | There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem ... | Algorithms can be developed easily by following this methodology: \n1) Brute Force: Uses the maximum amount of loops and comparisons to find the solution\n2) Divide and Conquer: Divide problem into subproblems and then solve each subproblem to get the solution\n3) Backtracking: Traverse through every available solution... | 2.5 |
1,469 | Briefly explain the approaches to develop algorithms. | There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem ... | Brute Force: Direct approach to solve given problem. Usually it is not the optimal solution and is not efficient in terms of Time complexity or space complexity.\nDivide and Conquer: It involves dividing the problem into smaller subproblems then solving the sub problems and joining the solutions back together to solve ... | 2.5 |
1,470 | Briefly explain the approaches to develop algorithms. | There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem ... | Algorithms are develop to solve a problem in a good way according to its time and space complexity .\nFirstly the basic approach is Brute force search where we don't consider time and space as a barrier. our only aim is to find solution of a problem.\nSecondly there are algorithms like divide and conquer and many more ... | 2.5 |
1,472 | Briefly explain the approaches to develop algorithms. | There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem ... | Approaches to develop an algorithms are :-\n. Greedy approach\n. Divide and conquer\n. Backtracking \n. Dynamic programming | 2.5 |
1,473 | Briefly explain the approaches to develop algorithms. | There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem ... | There are many approaches used to develop algorithms\ngreedy approach - it is used for optimization purposes it not necessarily gives the best solution but the solution it gives takes less time and space\ndynamic programing - it is also used for optimization problems but it check every solution available and always giv... | 2.5 |
1,475 | Briefly explain the approaches to develop algorithms. | There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem ... | approaches are as follows-\n1. analyses of the given problem\n2. Thinking of the most suitable data structure which could solve the problem\n3. Build the naive approach to tackle the problem first\n4. find the best approach that could solve the problem in less complexity(space and time) than other . | 2.5 |
1,476 | Briefly explain the approaches to develop algorithms. | There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem ... | The approach to develop an algorithm is done in the following steps :-\n1) study the problem theory carefully\n2) Try to find the solution of the problem using calculation .\n3) Observe the solution and use notations to get the time complexity \n4) optimize you solution in terms of time and space complexity\n5) write ... | 2.5 |
1,477 | Briefly explain the approaches to develop algorithms. | There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem ... | Algorithms can be written by first understanding the given problem, then firstly taking the input values, then applying the basic idea and solving the problem, writing it in steps form.\n1.)write the basic solution.\n2.) take the input.\n3.) write the easiest n understandable algorithm. | 2.5 |
1,478 | Briefly explain the approaches to develop algorithms. | There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem ... | The approach to develop an algorithm include understanding the problem thoroughly and then suggesting a solution which satisfices the criteria of having suitable time complexity (ideally linear) and consuming minimum required external storage. | 2.5 |
1,479 | Briefly explain the approaches to develop algorithms. | There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem ... | different approaches are :\n- divide and conquer - understand the problem break it into sub problems and then solve the subproblems and then step by step move to the main problem\n- greedy approach : in each step find the best possible solution for the time being. | 2.5 |
1,480 | Briefly explain the approaches to develop algorithms. | There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem ... | - Understand the problem and break it into smaller problem.\n- Write steps to solve the smaller problem (irrespective of any programming language).\n- Optimise your solution and write steps for bigger problem. | 2.5 |
1,481 | Briefly explain the approaches to develop algorithms. | There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem ... | 1. start with what you have - the input\n2. identify the end goal - the output\n3. now identify is there any way you can use the basic algorithms(like for ex binary search, LCS, LIS, etc) to get the desired output\n4. now write the intermediate steps that can be used to take you to desired results | 2.5 |
1,482 | Briefly explain the approaches to develop algorithms. | There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem ... | In order to develop thr algorithm, we must;-\n1. First input all the information you have been given\n2. Predict the output by dry-running it.\n3. \n | 2.5 |
1,483 | Briefly explain the approaches to develop algorithms. | There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem ... | 1.predict and understand the problem statement .\n2.find the best suited data structure that can be used.\n3.develop all edges, base cases form recurrences if needed, function needed.\n4.analise the time constraints set the limits of the function accordingly .\n5.check if the time and space complexity can be reduced fu... | 2.5 |
1,484 | Briefly explain the approaches to develop algorithms. | There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem ... | Approach is as follows:\n1)We need to deeply understand what the problem statement is actually saying. For that we can use some examples to understand the problem.\n2)Then we need to find the best suited data structure for the given problem.\n3)Then draw the recursive tree for the problem to understand the approach.\n4... | 2.5 |
1,487 | Briefly explain the approaches to develop algorithms. | There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem ... | For developing algorithms \n1. understand the problem statement \n2.find all possible way to solve that problem\n3.develop the algorithm which takes minimal time as well as the space complexities \n4.to check if the particular problem is optimizable. | 1 |
1,488 | Briefly explain the approaches to develop algorithms. | There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem ... | Approach to develop algorithm :\n1. to write statements and step by step approach\n2. in form of pseudo code | 1 |
1,489 | Briefly explain the approaches to develop algorithms. | There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem ... | 1) try to get the output .\n2) try to get best Time complexity and space complexity in optimization\n3) first we check if the algorithm is able to handle Average case or not.\n | 1 |
1,490 | Briefly explain the approaches to develop algorithms. | There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem ... | First we read and understand the problem given to us.\nThen we think about the most optimal approach to solve the problem.\nWe check its time and space complexity and see that if there is any approach which takes lesser time.\nWe finally code the approach we have made.\n | 1 |
1,491 | Briefly explain the approaches to develop algorithms. | There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem ... | 1. First, we need to look for an efficient approach to solve a solution i.e. whether to use backtracking, greedy or DP approach. \n2. Once, the approach has been decided, then the solution to the problem is implemented using the approach. For example, in dive and conquer, the problem is divided into smaller sub-problem... | 2.5 |
1,492 | Briefly explain the approaches to develop algorithms. | There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem ... | 1.Firstly we divide the problems into sub problems. \n2. Try to find an optimal and efficient solution to them individually using Backtracking, DP, Greedy and brute approaches.\n3. We try to implement the approach designed by us and compile our program with main function.\n4. After our algorithm is complete, we look fo... | 2.5 |
1,493 | Briefly explain the approaches to develop algorithms. | There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem ... | Approach to develop an algorithm are:\n1) Analyze the given problem statement.\n2)Try to find the rough solution of the problem and try to create a flow chat for better understanding.\n3)write the pseudocode from the flowchart developed above.\n4)Check that the solution created by you is optimal and efficient or not if... | 2.5 |
1,494 | Briefly explain the approaches to develop algorithms. | There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem ... | Some approaches to develop algorithms are:\n1. Greedy approach: to consider the value or path that seems like best meeting our requirement without analyzing it further. May or may not give optimal solution. Eg: to find the shortest path to a goal, the next nearest city from the start is taken into our solution.\n2. Dyn... | 2.5 |
1,495 | Briefly explain the approaches to develop algorithms. | There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem ... | the approaches are firstly analyze the given problem then try to find the basic solution to that problem without going into the details at first then try to write the pseudo code for the solution according to you then dry run the code ,dry run the code for some of the random values then check whether you have got the d... | 2.5 |
1,496 | Briefly explain the approaches to develop algorithms. | There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem ... | we divide the given problem in smaller problem and start writing code for smaller problem . with this approach we will start developing techniques for bigger problem. | 2.5 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.