Advanced Problems in Inorganic Chemistry for IIT-Jee & Other Competitive Examinations

Advanced Problems in Inorganic Chemistry for IIT-Jee & Other Competitive Examinations
Advanced Problems in Inorganic Chemistry is designed to help aspiring engineers to focus on the subject and strengthen their grasp in solving problems related to various topics of inorganic chemistry in systematical manner. This book is divided into 9 chapters for a coherent flow of problems according to latest IIT-JEE format. The book also includes a wide range of questions asked in the exam and offers students an opportunity to familiarize themselves with the nature and complexity-level of questions asked in IIT-JEE.

Salient Features:
2800+ MCQs for practice
Strictly follows latest exam format
Also useful for Olympiad and other entrance exams
Buy the book Advanced Problems in Inorganic Chemistry for IIT-Jee & Other Competitive Examinations from

SSC: JE Mechanical Engineering Previous Year Solved Papers

SSC: JE Mechanical Engineering Previous Year Solved Papers
Previous Years Solved Papers: SSC: Mechanical Engineering is designed to help aspiring engineers to strengthen their grasp and understanding of the concepts of the subject. The book approaches the subject in a very conceptual and coherent manner. It covers questions from last years of SSC examinations.
Buy the book SSC: JE Mechanical Engineering Previous Year Solved Papers from

Unix Network Programming: The Sockets Networking Api – Vol.1: The Sockets Networking Api – Volume 1

Unix Network Programming: The Sockets Networking Api - Vol.1: The Sockets Networking Api - Volume 1
Unix Network Programming The Sockets And Networking API (Volume – 1) is a classic guide which describes comprehensive steps for building sturdy, high-performance network systems in any environment. Summary Of The Book Unix Network Programming The Sockets And Networking API (Volume – 1) is a book meant for those who want a comprehensive guide on writing programs that interact with each other through sockets, or APIs (Application Program Interface). This book caters to the people who are acquainted with sockets, as well as those who want to learn about sockets from the very basics. This edition offers new topics such as New Network Program Debugging Techniques and The New SCTP Transport Protocol, among others. The book is divided into three parts, An Introduction, Elementary Sockets and Advanced Sockets. Some of the topics covered in this book are Elementary TCP Sockets, Elementary UDP Sockets, Socket Options, Advanced I/O Functions, Routing Sockets, Signal-Driven I/O, Multicasting, Streams, Nonblocking I/O, Raw Sockets, Broadcasting, and Threads. The aim of this book is to offer expert advice on network programming for beginners as well as professionals. Even those people who simply aspire to have a basic understanding about the functioning of the networking components in their system can benefit from this book. This publication addresses techniques and their implementations, which conform to the critical standards in today’s industry. Building on the work of W. Richard Stevens, this edition is a fully up-to-date classic guide to UNIX Networking using Application Program Interface (API). The examples provided in the book are runnable code tested on Unix systems. About The Authors W. Richard Stevens was a programmer and author. His other works include UNIX Network Programming, Volume 2, Second Edition: Interprocess Communications, Advanced Programming in the UNIX Environment and TCP/IP Illustrated, Volume 2: The Implementation.  W. Richard Stevens procured his Ph.D (Systems Engineering) from the University of Arizona in 1982, and also holds M.S. and B.S.E. degrees. He quit his job in 1990 and became a full-time writer, occasionally hosting classes based on his books. He passed away in 1999. Bill Fenner works at AT&T labs as a principal technical staff member. His skill sets include network measurement and management and IP multicasting. He is also required to grant approval to all published documents that are routing-related at IETF, where he works in the capacity of a Routing Area Director. Andrew M. Rudoff has been working at Sun Microsystems for the past ten years as a Senior Software Engineer. His areas of speciality include File Systems, Operating Systems’ Internals Networking, and High Availability Software Architecture.
You can buy the book from

Elementary Number Theory

Elementary Number Theory
Elementary Number Theory, Seventh Edition, is written for undergraduate number theory course taken by math majors, secondary education majors, and computer science students. This contemporary text provides a simple account of classical number theory, set against a historical background that shows the subject’s evolution from antiquity to recent research. Written in David Burton’s engaging style, Elementary Number Theory reveals the attraction that has drawn leading mathematicians and amateurs alike to number theory over the course of history. About the Author David M. Burton University of New Hampshire Table of Contents 1 Preliminaries 1.1 Mathematical Induction 1.2 The Binomial Theorem 2 Divisibility Theory in the Integers 2.1 Early Number Theory 2.2 The Division Algorithm 2.3 The Greatest Common Divisor 2.4 The Euclidean Algorithm 2.5 The Diophantine Equation 3 Primes and Their Distribution 3.1 The Fundamental Theorem of Arithmetic 3.2 The Sieve of Eratosthenes 3.3 The Goldbach Conjecture 4 The Theory of Congruences 4.1 Carl Friedrich Gauss 4.2 Basic Properties of Congruence 4.3 Binary and Decimal Representations of Integers 4.4 Linear Congruences and the Chinese Remainder Theorem 5 Fermats Theorem 5.1 Pierre de Fermat 5.2 Fermats Little Theorem and Pseudoprimes 5.3 Wilsons Theorem 5.4 The Fermat-Kraitchik Factorization Method 6 Number-Theoretic Functions 6.1 The Sum and Number of Divisors 6.2 The Mobius Inversion Formula 6.3 The Greatest Integer Function 6.4 An Application to the Calendar 7 Eulers Generalization of Fermats Theorem 7.1 Leonhard Euler 7.2 Eulers Phi-Function 7.3 Eulers Theorem 7.4 Some Properties of the Phi-Function 8 Primitive Roots and Indices 8.1 The Order of an Integer Modulo n 8.2 Primitive Roots for Primes 8.3 Composite Numbers Having Primitive Roots 8.4 The Theory of Indices 9 The Quadratic Reciprocity Law 9.1 Eulers Criterion 9.2 The Legendre Symbol and Its Properties 9.3 Quadratic Reciprocity 9.4 Quadratic Congruences with Composite Moduli 10 Introduction to Cryptography 10.1 From Caesar Cipher to Public Key Cryptography 10.2 The Knapsack Cryptosystem 10.3 An Application of Primitive Roots to Cryptography 11 Numbers of Special Form 11.1 Marin Mersenne 11.2 Perfect Numbers 11.3 Mersenne Primes and Amicable Numbers 11.4 Fermat Numbers 12 Certain Nonlinear Diophantine Equations 12.1 The Equation 12.2 Fermats Last Theorem 13 Representation of Integers as Sums of Squares 13.1 Joseph Louis Lagrange 13.2 Sums of Two Squares 13.3 Sums of More Than Two Squares 14 Fibonacci Numbers 14.1 Fibonacci 14.2 The Fibonacci Sequence 14.3 Certain Identities Involving Fibonacci Numbers 15 Continued Fractions 15.1 Srinivasa Ramanujan 15.2 Finite Continued Fractions 15.3 Infinite Continued Fractions 15.4 Farey Fractions 15.5 Pells Equation 16 Some Recent Developments 16.1 Hardy, Dickson, and Erdos 16.2 Primality Testing and Factorization 16.3 An Application to Factoring: Remote Coin Flipping 16.4 The Prime Number Theorem and Zeta Function Miscellaneous Problems Appendixes General References Suggested Further Reading Tables Answers to Selected Problems Index
You can buy the book from