Write an algorithm to solve the knapsack problem using greedy technique. Find the optimal solution to the knapsack instance n=7, m=15. (P1, P2, ………,P7) = (10,5,15,7,6,18,3) (W1,W2,…….,W7)=(2,3,5,7,1,4,1) Answer:-…
Programming in C++ Multiple Choice Questions 1. What is C++? a) C++ is an object oriented programming language b) C++ is a procedural programming language c) C++ supports both procedural…
With suitable example define the following (i) Binary tree (ii) Full binary tree (iii) Almost complete B.T (iv) Strict Binary tree (v) Level of B.T i) Binary Tree Binary Tree…
Differences between doubly linked lists and singly linked list Doubly linked lists Singly linked list SLL nodes contains 2 field -data field and next link field. DLL nodes contains 3…
A linked list, or one-way list, is a linear collection of data elements, called nodes, where the linear order is given by means of pointers. That is, each node is…
Define sparse matrix. Give sparse matrix representation of linked list for given matrix
To add two polynomials, examine their terms starting at the nodes pointed to by a and b. Below figure illustrates this process for the polynomials addition.
Write the postfix form of the following expression : 4$2*3-3+8/4/4(1+1)
evaluate for the given postix expression. ABC – D *+E$F+ and assume A = 6, B = 3, C = 2, D = 5, E = 1 and F =…
Write an algorithm to evaluate a postfix expression 1. opndstack = empty stack 2. Scan one char at a time from right to left in string. 3. If scan char…
