Math, asked by rachanamamgain9657, 7 months ago

ingar
9
moll on 25/05/2 bdsm
adl ka
Rs 2011
2 Kg appla
(P37
5 notebooks
R
sko
3 Kg Sugos
feles
12 kb
21​

Answers

Answered by 77EnjoyLife
0

Answer:

??? ARE U COOKING MISS/MISTER IF YES I CANT COOK

Step-by-step explanation:

#TRULY SORRY

Previous Question
Next Question
Similar questions
History, 3 months ago
Name some of the saint-poet of Maharashtra​...
English, 3 months ago
correct answer = points spiral = report ​...
Math, 3 months ago
Josiah kept track of how many songs of each genre were played in an hour from his MP3 player. The counts are displayed in the table below. He has a total of 1,500 songs on his player. Josiah predicted the number of rock songs on his MP3 player to be 300 songs. Which statements about his solution are true? Select three choices. Josiah’s Music Sample 1 Sample 2 R & B 5 R & B 4 Pop...
Hindi, 7 months ago
बहुविकल्पीय प्रश्न 1. पत्र लिखने में भाषा का कौन-सा रूप प्रयोग किया गया है? (क) मौखिक भाषा (ख) सांकेतिक भाषा (स) लिखित भाषा (घ) इनमें से कोई नहीं 8​...
Hindi, 7 months ago
करमार और कन्याकुमारी भारत के किस-किस छोर पर स्थित है? ख. राघव ने दिल्ली से कन्याकुमारी जाने के लिए कौन-सी ट्रेन ली? लिखित (written) क. कन्याकुमारी जानेवाले सैलानियों का मुख्य उद्देश्य क्या होता है? ख. स्वामी विवेकानंद स्मारक क्यों प्रसिद्ध है? राघव के लिए कौन-से दृश्य अविस्मरणीय थे? जा से...​
Computer Science, 11 months ago
Consider an n n array a containing integer elements (positive, negative, and zero). Assume that the elements in each row of a are in strictly increasing order, and the elements of each column of a are in strictly decreasing order. (hence there cannot be two zeroes in the same row or the same column.) describe an efficient algorithm that counts the number of occurrences of the element 0 in a.
Computer Science, 11 months ago
Consider a binary tree of n vertices such that children of node k are 2*k and 2*k + 1. Vertex 1 is the root of tree and each node has an interger value associated with it. Such a tree may be represented by writing down vailes from consectitive nodes...
Computer Science, 11 months ago
Consider an array consisting of ve and +ve numbers. What would be the worst time comparisons an algorithm can take in order to segregate the numbers having same sign altogether i.E all +ve on one side and then a...