Search & Filtering
Create a Student class with fields RollNo, Name, City, Degree. Implement the ISerializable interface in Student class. And perform binary serialization on the Student Object
Implement a class MeraSet, which abstracts a mathematical Set of integral numbers. Maximum members can be 100. Implement following Member functions:
int Insert(int e) ; // adds value e to the set and returns 1, if the value already exists or the set has already 100 members, then it does not add and return -1.
int Size(); // return size of the set
int Remove(int e); // removes e from Set, and return 1. If e is not member of set, returns -1.
void Print(); // prints the members of the set in set notation e.g. Set = {1,2,3,8,-3 }
operator + ; // returns union of two sets
operator -; // returns difference set of two sets i.e. A-B
Make private member variables and more functions as you like.
myArray of strings as an input, write a JS program to convert all the strings in myArray to uppercase.Input
Sample Input 1
[ 'book', 'table', 'strawberries', 'lemons' ]
Sample Output 1
[ 'BOOK', 'TABLE', 'STRAWBERRIES', 'LEMONS' ]
"use strict";
process.stdin.resume();
process.stdin.setEncoding("utf-8");
let inputString = "";
let currentLine = 0;
process.stdin.on("data", (inputStdin) => {
inputString += inputStdin;
});
process.stdin.on("end", (_) => {
inputString = inputString.trim().split("\n").map((str) => str.trim());
main();
});
function readLine() {
return inputString[currentLine++];
}
/* not modify anything above this line */
function main() {
const myArray = JSON.parse(readLine().replace(/'/g, '"'));
/* Write your code here */
}
Add two polynomials
Given two polynomials A and B, write a program that adds the given two polynomials A and B
Output
Print the addition of polynomials A and B.
If the degree of polynomial is zero and the constant term is also zero, then just print 0 to represent the polynomial.
For term Cix^Pi, if the coefficient of the term Ci is 1, simply print x^Pi instead of 1x^Pi.Explanation
Test Case 1:-
Input:-
6
0 -20
1 23
2 30
3 19
4 6
5 17
9
0 -100
5 -89
6 -20
7 -1
1 20
2 4
3 99
4 -45
8 12
Output:-
12x^8 - x^7 - 20x^6 - 72x^5 - 39x^4 + 118x^3 + 34x^2 + 43x - 120
Note :- Need Space between - and + operators
Test Case 2:-
Input:-
4
0 5
1 0
2 10
3 6
3
0 1
1 2
2 4
Output :-
6x^3 + 14x^2 + 2x + 6
Note:- Need Space between - and + operators
Test Case 3:-
Input:-
5
0 -2
3 6
4 7
1 -3
2 -1
5
0 1
1 2
2 -4
3 3
4 5
Output:-
12x^4 + 9x^3 - 5x^2 - x - 1
Note:- Need Space between - and + operators
We need all test cases can be came when code was run. I want exact outputs for all test cases
You have store a record of students in a file record.txt. To make a file: Make a function to write in a file write_data().Each record contains the student's name, and there marks in Maths, Physics and Chemistry out of 100(write a check to ensure the entered marks is in range 0-100, if user enters marks out of this range, ask the user to re-enter the marks ). The marks can be floating values. The user enters names and marks for students. You are required to save the record in a record.txt. Once you done with the making file. Make a function read_data(d) that takes empty dictionary as a parameter Read the data from record.txt and add it into dictionary as a name and percentage The user then enters a student's name. Output the name, average percentage marks obtained by that student, correct to two decimal places and on the basis of marks display grades as well
Weighted final score Final grade 80 <= mark <= 100 A 70 <= mark < 80 B 60 <= mark < 70 C 50 <= mark < 60 D mark < 50 E
Implement your own version of the hash table using C# with mentioned functionalities: insert, delete, contains, get blue by key, size, iterator, traverse/print.
Use of similar data structures already present in the language/framework is not allowed.
Implement your own version of the N- child using C# with mentioned functionalities : insert, delete, contains, get elements by value, get elements by level, iterator breadth first, iterator depth first, traverse/print breadth first, traverse/print depth first.
Use of similar data structures already present in the language/framework is not allowed.
Implement your own version of the priority queue using C# with mentioned functionalities: enqueue, dequeue, peek, contains , reverse, size, iterator, traverse/print.
Use of similar data structures already present in the language/framework is not allowed.
Implement your own version of the queue using C# with mentioned functionalities: push, pop, peek, contains, reverse, size, iterator, traverse/print.
Use of similar data structures already present in the language/framework is not allowed.
Implement your own version of the stack data using C# with mentioned functionalities: push, pop, peek,contains, reverse, size, iterator, traverse/print.
Use of similar data structures already present in the language/framework is not allowed.
#339914 on Dec 2023