Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
Community
Free resources
From our blog
Recent questions in Data Structures and Algorithms
No documents found, press Enter to search
momodu-joshua
about 5 years ago
Data Structures and Algorithms
0
umang-rawat
about 5 years ago
Data Structures and Algorithms
explain working of poly-phase merge sort and advantages of it with help of example
define poly-phase merge sort
0
domevityr
over 5 years ago
Data Structures and Algorithms
Computer Science question
(a). Iteration and recursion are two very fundamental concepts underlying things we do in computing.
(i). In your own words, compare and contrast the terms Iteration and Recursion in the context of solving problems in business, science or engineering; and explain the areas of use (in practice) of each of them.
(ii). Using practical examples in business, science or engineering, explain reasons why people still use recursion to solve problems even-though iteration is more efficient.
(b). In various fields of human endeavor, we use queues and stacks on daily basis.
(i). In your own words, distinguish between queues and stacks in the context of computer-based information systems as against business operations; and draw a table of comparison to illustrate your answer.
(ii). Provide two practical examples where we use queues and/or stacks in each of the following fields:
(i). Business
(ii). Education
(iii). Manufacturing
(iv). Computer Science
0
domevityr
over 5 years ago
Data Structures and Algorithms
Data Structures and Algorithms
(a). Data analysts and programmers frequently use Arrays and ArrayLists in their work. Typically, ABS insurance brokerage company has been using singly-linked lists to keep track of customers that its salesmen have won for the company.
(i). Critically compare and contrast Arrays and ArrayLists in the context of data structures that organizations use to store data in their data marts and databases.
(ii). Describe the kinds of data that the following types of organizations may store using Arrays and those that they can store using ArrayLists:
(α) a telecommunication’s firm
(b) a manufacturing firm
(iii). In your own words, describe how ABS insurance brokerage company can use singly-linked lists to keep track of customers that its salesmen have won for the company; and draw a suitable diagram (with hypothetical data) to illustrate your answer.
0
domevityr
over 5 years ago
Data Structures and Algorithms
not sure for the questions
(a). Individuals sort things (in ascending or descending order) in their daily lives, using various sorting algorithms. As an intern at AGL Inc., you are required to sort salaries of AGL workers in ascending order and you are contemplating to use either Insertion Sort or Selection Sort.
(i). Using appropriate examples, compare and contrast the use of Insertion Sort and Selection Sort algorithms, indicating their relative efficiencies.
(ii). In your own words, explain the circumstances under which it is better to use Insertion sort, and the circumstances under which it is better to use Selection sort for an assignment like this.
(b). A SHS student has approached you for assistance in doing the following two assignments:
- writing an essay on the use and abuse of social media; and
- writing a Java program to for exam registration.
0
domevityr
over 5 years ago
Data Structures and Algorithms
analyze those algorithms; and you intend to use Big-O notation
Three world-class pharmaceutical companies have developed algorithms for developing an efficacious vaccine for coronavirus pandemic. World Health Organization has engaged you as a Consultant to analyze those algorithms; and you intend to use Big-O notation for that task.
(i). Discuss, in detail, what you will do on this assignment (using the Big-O notation).
(ii). Make a cogent assessment of the relevance of using Big-O notation in analyzing the three pharmaceutical companies’ algorithms.
0
neha-hatkar
over 2 years ago
Data Structures and Algorithms
How to be a good programmer
Methods to be able to do good coding
8
quynh-nga-nguyen
over 2 years ago
Data Structures and Algorithms
Implement a complex ADT and algorithm in an executable programing language to solve a given problem
Implement a complex ADT and algorithm in an executable programing language to solve a given problem
1
osama-junaid
over 4 years ago
Data Structures and Algorithms
Please help me with the correct answer and explanation.
(a) Construct a Binary Search Tree (BST) for the given data
11, 9, 34, 6, 10, 20, 45, 0, 7, 38, 52, 46
Also write the pseudocode for the following;
i. Deleting a node in BST
ii. Adding a node in BST.
(c) Apply the following Union operation for disjoint set over the given data and construct the resultant tree.
20, 16, 25, 6, 17, 21, 29, 0, 7, 28, 51, 46
i. Union (20, 0) ii. Union (51, 46)
ii. Union (51, 46)
iii. Union (29, 28) iv. Union (25, 0)
iv. Union (25, 0)
v. Union (28, 20) vi. Union (17, 28)
vi. Union (17, 28)
1
bangash110
over 4 years ago
Data Structures and Algorithms
Implement the Merge Sort algorithm in JAVA?
I want the java program(source code).
6
bangash110
over 4 years ago
Data Structures and Algorithms
Implement the problem of 2D Maxima in java?
I want the java program(source code).
8
husni-abad
over 4 years ago
Data Structures and Algorithms
What is the difference between data structures and algorithms
Data structures and algorithms in c language
6
umang-rawat
about 5 years ago
Data Structures and Algorithms
explain working of poly-phase merge sort and advantages of it with help of example
define poly-phase merge sort
0
umang-rawat
about 5 years ago
Data Structures and Algorithms
explain working of poly-phase merge sort and advantages of it with help of example
concept of poly-phase merge sort
1
osama-junaid
over 4 years ago
Data Structures and Algorithms
Please help me with the correct answer and explanation.
(a) Construct a Binary Search Tree (BST) for the given data
11, 9, 34, 6, 10, 20, 45, 0, 7, 38, 52, 46
Also write the pseudocode for the following;
i. Deleting a node in BST
ii. Adding a node in BST.
(c) Apply the following Union operation for disjoint set over the given data and construct the resultant tree.
20, 16, 25, 6, 17, 21, 29, 0, 7, 28, 51, 46
i. Union (20, 0) ii. Union (51, 46)
ii. Union (51, 46)
iii. Union (29, 28) iv. Union (25, 0)
iv. Union (25, 0)
v. Union (28, 20) vi. Union (17, 28)
vi. Union (17, 28)
1
aasif
almost 10 years ago
Data Structures and Algorithms
Is Stack a justified data structure for a program to save news articles for later reading in a published order?
Jackie wants to develop a program to save news articles for later reading. Jackie oftensaves related articles, and always reads in published order so as not to be confused bylearning about related events out of order.
- Is a stack an appropriate choice of data structure for this project? Justify your answer.
1
shoosh-969
over 7 years ago
Data Structures and Algorithms
Write a java program to find the maximum element in an array and determine the maximum number of primitive operations executed by a program
Write a java program to find the maximum element in an array and determine the maximum number of primitive operations executed by a program
1
sureesh
over 9 years ago
Data Structures and Algorithms
Could a stack be used to test whether a string is a palindrome
- A palindrome is a string of characters (a word, phrase, or sentence) that is the same regardless of whether you read it forward or backward—assuming that you ignore spaces, punctuation, and case. For example, Taco cat is a palindrome. So is A man, a plan, a canal: Panama.
- Describe how you could use a stack to test whether a string is a palindrome. Include pseudocode if necessary to demonstrate your points.
2
Data Structures and Algorithms