Download HSN code for Pharmaceutical Products With GST Rate

The information provided below about HSN codes are used for GST purpose to classify goods. You may reconfirm with GST authorities whether your product HSN code is classified correctly below. The HSN codes under 02 digits, 04 digits, 06 digits and 08 digits explains and classifies broadly for each section of goods.

Click Here to Download File 1

NPTEL Online Course Week 5 Solution Implement a Matrix ADT

NPTEL Online Course Week 5 Solution Implement a Matrix ADT Assignment

You have to implement a matrix ADT using concepts of C++ classes taught in the lectures. The input matrices would be square matrices. Theclass must support the following functions:

1. Matrix Addition

2. Matrix Subtraction

3. Matrix Multiplication

NPTEL Online Course Week 5 Big Int Addition

NPTEL Online Course Week 5 Big Int Addition Assignment

Primitive int data type handles integers each of which can be stored using 32 bits. Similarly long data type also has a limit. In this assignment you have to implement a data type which handles numbers larger than int , long and long long.

You are given a number in decimal form. You need to build a data structure called BigInt which can store that data, and perform the following basic operations on that data type:

NPTEL Online Course Week 5 Solution Implementing a Hash Table ADT

NPTEL Online Course Week 5 Solution Implementing a Hash Table ADT Assignment

A hash table is a data structure that maps a set of keys to a given set of values. It uses a hash function to compute an index into an array of buckets or slots, from which the correct value can be found or to which a correct value can be inserted. A hash function will assign each key to a unique bucket or slot. In practice, however, there may be more than one key that will hash to the same bucket. Such an assignment is said to result in a collision.

NPTEL Week 5: Basic Data Structures and Lists Solutions

Solution of Week 5  Basic Data Structures and Lists NPTEL Online Course

1. Assume that the structure of a Linked List node is as follows:
 struct node{
     int data;
     struct node *next;
 };
 What does the following function print for a given Linked List which has elements in the order 1->2->3->4->5->6. 

NPTEL Week 3: Functions and Program Running Time Assignments Solution

Solution of assignment  of week 3 Online course conduct by  NPTEL on Programming, Data Structures and Algorithms

Functions and Program Running Time

Count pairs such that x^y > y^x

Evaluating a Polynomial

Evaluating a Recurrence Relation

Palindrome Checker

NPTEL Palindrome Checker

Write a program which takes a string as input and prints the longest prefix of the string whose reverse is a valid suffix of the string. For example, if "notation" is given as input, the prefix "no" is the longest prefix that has a matching valid suffix (namely "on") at the end.

NPTEL Evaluating a Recurrence Relation

A recurrence relation T is defined on n >= 0 and is given as T(n) = T(n-1) + 2*n with the base case T(0) = 1. You will be given one integer k and you have to write a program to find out T(k). The program must implement T( ) recursively.

NPTEL Evaluating a Polynomial

You are given a polynomial of degree n. The polynomial is of the form P(x) = anxn + an-1xn-1 + … + a0, where the ai‘s are the coefficients.  Given an integer x, write a program that will evaluate P(x).

You are provided with a function named power( ) that takes two positive integers x & y and returns xy. If y is 0, the function returns 1.

The prototype of this function is

NPTEL Count pairs such that x^y > y^x

Given a  sequence A of N positive integers, write a program to find the number of pairs (A[i], A[j]) such that i < j and A[i]A[j] > A[j]A[i] (A[i] raised to the power A[j] > A[j] raised to the power A[i]).

You are provided with a function named power( ) that takes two positive integers x & y and returns xy. If y is 0, the function returns 1.

The prototype of this function is

int power(int x, int y);

You do not have to write the program for power ( ) function. This function is automatically added at the end of the code segment that you write.

In your program, use this function to count the number of such pairs.