My New book C and Data Structures:A Snap Shot Oriented Treatise Using Live Engineering Examples

My Dear Learned Friend

First, let me apologize if we (Prof NB Venkateswarlu, AITAM & Prof EV Prasad, JNTU-K Principal) are disturbing your schedule in any way. We are here to share about our recent book titled “ C and Data Structures: A Snap Shot Oriented Treatise with Live Engineering Examples” published by S Chand & Co, New Delhi.

No doubt, you will be wondering why one more title while there are many established ones. We do accept the fact that we did follow those titles during our education also. However, we wanted to bring some facts about our title to your kind notice.

0. It is included in JNTU-A, JNTU-H and JNTU-K syllabuses.

1. This is an outcome of our experience of teaching more than 50000 (fifty thousand) students.
2. Thus, the book is dedicated to our students.
3. More than 1000 programs and 500 questions with answers are included. These questions include objective questions also.
4. We have aimed at a novice or a fresh student who did not have any exposure/touch with the computer at all before opening this book. Incidentally, we do feel a large portion of our Engineering candidates comes under this category.
5. We have experimented and employed a novel way of explaining working of a program, which we refer to “Snap Shot Oriented Learning” or “Trace based Learning ”. This is akin to human learning from the childhood. We have experimented with the thousands of students during last two decades, with such an experience we have designed our examples.
6. Many practical engineering problems are explained and solved. See the separate attachment having list of engineering problems solved.
7. C coding practices which are employed in the Industry are also discussed.
8. The book is forwarded by the eminent personalities in the field.

Please do see the enclosed leaflet having other silent aspects of the book along with contents.

Publisher would be glad if you can respond with your postal address and courses which you teach to arrange a review copy for you. You may find publishers details in the brochure to order. However, Mr. Bisht 9391326155 bisht_hyd@hotmail.com will be of help for any aspects related to availability of the book.

We would be delighted if you can intimate about this title to your colleagues and pals.

With best wishes

Prof N.B. Venkateswarlu

B.Tech(SVUCE, Tirupathi), M.Tech(IIT-K), Ph.D(BITS, Pilani), PDF(U of Leeds, UK)

www.ritchcenter.com/nbv

C and Data Structures: A Snap shot oriented Treatise with Live Engineering Examples.

N.B. Venkateswarlu

E.V. Prasad

S Chand & Co

List of Engineering/Mathematical Problems Solved

1. Quadratic Equation Solution. 87
2. Newton Raphson Method. 208
3. Application of Newton Raphson Method to a generalized equation. 284
4. Conversion of angle from radians to degrees, minutes and seconds. 41
5. Conversion of angle in degrees, minutes, and seconds to radians. 40
6. Conversion of temperature value from one scale to another. 97
7. Simpson rule to calculate the area under a curve. 232
8. Trapezoidal rule to calculate the area under the curve. 231
9. Calculating a functions value and derivative in a given domain with a given step value. 284
10. Calculating sum of the two vectors. 284
11. Calculating scalar product of two vectors. 285
12. Checking for uniqueness of a matrix. 335
13. Calculating transpose of a matrix. 332
14. Traversing a matrix in row-wise raster fashion. 337
15. Checking a matrix for magic matrix properties. 402
16. Calculating Determinant of a matrix. 504
17. Inverse of a matrix calculation. 506
18. Solving simultaneous equations. 507
19. Calculating the product of two matrices. 348
20. Adding two matrices. 346
21. Calculating quadratic term value between a vector and matrix. 347
22. Traversing a odd sized square matrix in a spiral fashion. 358
23. Towers of Honoi problem. 443
24. Eight queens problem. 445
25. Checking a number for its primality. 380
26. Calculating factorial value of an integer. 377
27. Calculating NCR value efficiently. 422
28. Euclid’s algorithm for finding GCF of two integers. 378
29. Solving exponential function. 149
30. Solving sinh(x) function 150
31. Generating Fibnocci series 146
32. Use of random numbers in testing IQ of a child. 237
33. Use of random numbers in estimating coin tossing the probability. 236
34. Use of random numbers in simulating a noisy channel. 239
35. Mean filtering a 1-D signal.. 286
36. Filtering a 1-D signal. 287
37. Calculating the histogram of a population of students marks. 272
38. Best fitting line using Least squares. 244
39. Correlation coefficient calculating between two series. 404
40. Program to print Pascal triangle. 381
41. Program to calculate LCM between two integers. 382
42. Program to calculate GCF between two integers. 383
43. Calculating outliers. 271
44. Calculating median of a population. 274
45. Calculating mode of a population. 279
46. Calculating a polynomial value in a given domain. 283
47. Normalizing a set of data. 295
48. Standardizing a set of data. 294
49. Calculating relative percentile of a set of students marks. 297
50. Scaling a data. 296
51. Calculating covariance matrix of a data set. 356
52. Examples to demonstrate the computational errors. 245
53. Adding two algebraic polynomials. 855
54. Subtracting two algebraic polynomials. 855
55. Multiplying two algebraic polynomials. 859
56. Horner’s method of calculating polynomial value. 427
57. Calculating Ackermann function. 433
58. Calculating Bezier coefficients for line drawing. 435
59. Calculating parity of an integer for error detection. 430
60. Calculating Cyclic redundancy checking (CRC) checksums. 616
61. Program to calculate Internet checksum. 617
62. Program to calculate longitudinal and vertical redundancy check. 620
63. Program to calculate Hamming bits. 621
64. Huffman coding 950
65. Minimum distance problem solution using Dijkstra’s Algorithm. 971
66. Calculating transitive closure of a graph. 966
67. Complex number manipulations. 542
68. Program to clip a point against a rectangular window. 625
69. Flood filling algorithm for graphic applications. 434
70. Pattern matching algorithms. 737
71. Adding two big integers 846
72. Adding sparse matrices. 734
73. Calculating transpose of a sparse matrix. 734
74. Converting infix expressions to postfix. 793
75. Evaluating RPN (Reverse Polish Notation) expressions. 792
76. Calculating mean and standard deviation of a population. 114

Parameter passing method in C language

C supports evidently two styles of parameter passing, to name
1. Passing by value
2. Passing by address.
In passing by value whatever operations or actions takes place in the function on formal argument will not really reflect on the orginal or actual argument.

In the case of passing by address, what ever action we carry out in the function in the addresses which are passed will really take place on the actual arguments.

For example, the following version of function SWAP will not exchange the values of the actual arguments.
void SWAP(int x, int y)
{
int T=x;
x=y;
y=T;
}
Where as the following version of SWAP does the required thing.
void SWAP(int *x, int *y)
{
int T=*x;
*x=*y;
*y=T;
}

We have some useful material kept at www.ritchcenter.com Please go through.
Prof NB Venkateswarlu
RITCH CENTER
www.ritchcenter.com/elearn