String palindrome

Write a program to to calculate string palindrome.

Fibonacci series

Write a program to calculate fibonacci series.

Calculate L.C.M of two numbers.

Write a program to calculate L.C.M of two numbers.

Calculate G.C.D of any two numbers

Write a program to calculate G.C.D of any two numbers.

Count number of bits are set to 1

Write a program to count number of bits are set to 1 in an integer.

Calculate daily expenditure if monthly expenditure is given

Write a program to calculate daily expenditure if monthly expenditure is given using loop.

Add between any two numbers using loop

Write a program to add between any two numbers using loop.

Palendrome number

Write a program to check given number is palendrome or not.

Armstrong number

Write a program to check given number is armstrong or not.

Prime factors of a number

Write a program in C language to calculate the prime factors of a number.

Strong number or not

Write a program to check the number is strong number or not.

Reverse a number

Write a program to to reverse a number.

Sum of digits of a number

Program to calculate the sum of digits of a number.

Factorial of a number

Program to calculate the factorial of a number:

Service counter

Consider a service counter. People waiting for service form a queue. At the start, the queue is empty and time is 0. The service time per person is 3 minutes. The input to the program consists of an integer N followed by a sequence of integers indicating the arrival time (in minutes) of the customers. These times are given as offset from the start of the simulation, so that an input of 44 means 44 minutes from the start of simulation.

Boolean OR of Two Digital Signals

Write a program to generate a boolean OR of two digital signals. A signal has two states, a high state and a low state. It is given as an array of positive integers in ascending order. Each pair of integer indicates the range of the signal in a high state. The array size will be even, so that the signal starts with a low state and ends with a low state.

Manipulate linked lists

Write a program in C to manipulate linked lists. The input to the program will be a sequence of instructions of the following three categories:

1. insert name age: create a node with item as the info field and insert into the current list.
2. remove N : remove the Nth item from the list.
3. print N : print the Nth item from the list. The name should be printed first and then the age with a space in between.
4. stop : end of instructions

Each of the instructions occurs on a different line.

The list should always be maintained in sorted order in increasing order of age. If there is more than one person of same age, the order should be as in the input. You may assume that the input is valid and correct. While executing remove or print, if the list does not have enough elements, the command should be
ignored.

You may assume that the name is always a single word with no spaces within. The age will be a positive integer. Terminate each line output with a newline character.

Snake and Ladder

Snakes and ladders is a very popular game. It's a 10x10 maze, with cells numbered from 0 to 99, and filled with snakes and ladders, as shown below in the figures. Every player gets a chance to play and advance in the maze, depending on the number they get on the dice when thrown.

Horizontal/Vertical Line Crossings

Archeologists have discovered a very ancient cave, with many pictures on its wall. Each of the picture contains only vertical and horizontal line segments. Experts have analysed these pictures and came to the conclusion that, these are hieroglyphs (like Egyptian writings). To extract the meaning from these glyphs, it is necessary to find out how many of these vertical and horizontal line segments intersect.

Each picture glyph is inscribed in a square of side 100, and each end point of the line segment is assigned an X-Y coordinate pair. All the X and Y values are integers in the range 0 to 100. The vertical line segment is described by an X value and two Y values (X, Y1, Y2). Similarly, a horizontal line segment is described by a Y value and a pair of X values (Y, X1, X2). For example, a horizontal line segment described by a triplet (12, 8, 57) is a segment joining points (8, 12) and (57, 12).

You have to write a program to compute the total number of intersections, given the details of vertical and horizontal line segments. Only the intersections between a pair of horizontal and vertical line segments are counted. Even if one segment is touching another, it is counted as an intersection. (See figure below)

Removal of ‘Zero’ Rows and Columns in a Matrix

Given an integer matrix of size, say, M x N, you have to write a program to remove all the rows and columns consisting of all zeros. Your program must remove those rows and columns that consist of zero valued elements only. That is, if all the elements in a row (column) are zeros, then remove that row (column). All the remaining rows and columns should be output.

Input Specification:

• The first line of input will have two integers, say, M and N. M specifies the number of rows in the matrix and N specifies the number of columns in the matrix.
• This will be followed by M lines, each consisting of N integers.

Note: Assume 1 ≤ M ≤ 10 and 1 ≤ N ≤ 10. Also, you may assume that there is at least one nonzero element in the given matrix.