.

C Programming: A Modern Approach, 2nd Edition by K. N. King

2012-03-12T12:07:00.000-07:00

DOWNLOAD

CLICK THIS

Theory of Computer Science: Automata, Languages and Computation by K.L.P. Mishra, N. Chandrasekaran

2012-03-12T01:51:00.001-07:00

Theory of Computer Science: Automata, Languages and Computation by K.L.P. Mishra, N. Chandrasekaran

This Third Edition, in response to the enthusiastic reception given by academia and students to the previous edition, offers a cohesive presentation of all aspects of theoretical computer science, namely automata, formal languages, computability, and complexity. Besides, it includes coverage of mathematical preliminaries.Features new to this edition are: expanded sections on pigeonhole principle and the principle of induction (both in Chapter 2); a rigorous proof of Kleene's theorem (Chapter 5); major changes in the chapter on Turing machines (TMs); a new section on high-level description of TMs; techniques for the construction of TMs; multitape TM and nondeterministic TM; a new chapter (Chapter 10) on decidability and recursively enumerable languages; a new chapter (Chapter 12) on complexity theory and NP-complete problems; a section on quantum computation in Chapter 12; objective-type questions in each chapter - with answers provided at the end of the book; eighty-three additional solved examples - added as Supplementary Examples in each chapter; and detailed solutions at the end of the book to chapter-end exercises.The book is designed to meet the needs of the undergraduate and postgraduate students of computer science and engineering as well as those of the students offering courses in computer applications.

download

click here

TECHRUIT JOB FAIR for 2010/2011/2012

2012-03-09T14:00:00.001-08:00

Interview Location : Ariyalur, Tamilnadu

Desired Qualification :
• 10TH, +2, ITI & Diploma, Arts & Science, MBA & MCA Students
• 2010 / 2011 / 2012 Passouts

Desired Experience : 0 to 3 Years

Walk-In Date : On 10th March 2012 (Saturday) : 10.00 AM to 5.30 PM

Walk-In Venue :
Meenakshi Ramasamy Polytechnic College,
Ariyalur,
TAMILNADU

C++: The Complete Reference, 3rd Edition

2012-03-09T13:56:00.000-08:00

Best-selling genius Herb Schildt covers everything from keywords, syntax, and libraries, to advanced features such as overloading, inheritance, virtual functions, namespaces, templates, and RTTI–plus, a complete description of the Standard Template Library (STL).

Herbert Schildt, “C++: The Complete Reference, 3rd Edition”

download
click this

Compro Technologies

2012-03-08T09:04:00.001-08:00

Compro Technologies

COMPRO TECHNOLOGIES” Off-Campus For Freshers : BE/ BTech : 2012 Batch : Delhi : On 30 Mar 2012, Last Date : 23/3/12

Website : www.comprotechnologies.com
Education : BE/BTech : CS, IT, IS, EC, EEE & Instrumentation
Experience : Freshers
Location : Delhi

Position: Software Developer

Job location: Delhi
Note: Locations are subject to change.

Event date: 30 Mar 2012
Last date: 23 Mar 2011

Salary Offered: Rs.470000/-

Experience Required: Fresher

Description:

About the company : Founded in 1986, Compro specializes in outsourced product development and custom technology solutions, utilizing best-of-class scalable, extensible technologies and processes. Compro is headquatered at New Delhi and has 6 offices worldover.

Eligibilty:
- BE/BTech from 2012 batch
- Branches CS, IT, IS, EC, EEE & Instrumentation
- Preference to CS/IT branches and premier institutes
- Excellent Academics (a minimum of 70% in 10th, 12th, Degree)
- High pH Score
Desired Traits:
- Conceptually strong on your engineering subjects / projects.
- High aptitude, clarity of thoughts & speed to pick up new things.

for detail

click this

IBM India Placement Drive - 2010 and 2011 Batch

2012-03-08T08:58:00.000-08:00

IBM India Placement Drive - 2010 and 2011 Batch

download

The C Puzzle Book, Revised Edition

2012-03-06T12:25:00.001-08:00

The C Puzzle Book is an excellent choice for all programmers who want to expand on their basic knowledge of the C programming language. Completely compliant with ANSI C, this book has been designed to help readers gain a more thorough understanding of the C syntax and semantics through interesting puzzles that challenge the readers' proficiency with the basics. C programming specialist Alan Feuer covers major topics of C from different angles so the reader may gain a more complete understanding for the subject. He accomplishes this by including a variety of C program puzzles, challenging you to follow the puzzle through to determine the outcome. In many cases the programs are print statements, so the puzzle solution is the resulting printout. Once you have determined the puzzle solution, you may compare it with a detailed, step-by-step derivation offered in the book. The C Puzzle Book teaches intermediate C programming with an effective and unique method -- and it's fun! Working through formidable puzzles and checking your results fine tunes your skills for future programming challenges. This book is a great next step for any programmer who desires a deeper understanding of the C programming language.

DOWNLOAD

click here

Design and Analysis of Algorithms Ebook, notes and presentations covering full semester syllabus

2011-10-10T14:15:00.001-07:00

The attached e-books covers the following topics:

UNIT I BASIC CONCEPTS OF ALGORITHMS: Introduction – Notion of Algorithm – Fundamentals of Algorithmic Solving – Important Problem types – Fundamentals of the Analysis Framework – Asymptotic Notations and Basic Efficiency Classes.

UNIT II MATHEMATICAL ASPECTS AND ANALYSIS OF ALGORITHMS: Mathematical Analysis of Non-recursive Algorithm – Mathematical Analysis of Recursive Algorithm – Example: Fibonacci Numbers – Empirical Analysis of Algorithms – Algorithm Visualization.

UNIT III ANALYSIS OF SORTING AND SEARCHING ALGORITHMS: Brute Force – Selection Sort and Bubble Sort – Sequential Search and Brute-force string matching – Divide and conquer – Merge sort – Quick Sort – Binary Search – Binary tree- Traversal and Related Properties – Decrease and Conquer – Insertion Sort – Depth first Search and Breadth First Search.

UNIT IV ALGORITHMIC TECHNIQUES: Transform and conquer – Presorting – Balanced Search trees – AVL Trees – Heaps and Heap sort – Dynamic Programming – Warshall’s and Floyd’s Algorithm – Optimal Binary Search trees – Greedy Techniques – Prim’s Algorithm – Kruskal’s Algorithm – Dijkstra’s Algorithm – Huffman trees.

UNIT V ALGORITHM DESIGN METHODS: Backtracking – n-Queen’s Problem – Hamiltonian Circuit problem – Subset-Sum problem – Branch and bound – Assignment problem – Knapsack problem – Traveling salesman problem.

design and analysis of algorithm

2011-10-10T14:08:00.000-07:00

E-Book Details:

Title:	Introduction to Algorithms by Thomas H. Cormen, Charles E. Leiserson
Publisher:	McGraw-Hill Osborne
Author:	Thomas H. Cormen, Charles E. Leiserson
Edition:	Second Edition
EditionNumber:	2
ISBN:	0070131511
EAN:	9780027263367
No. of Pages:	984

Table of Contents:

The updated new edition of the classic Introduction to Algorithms is intended primarily for use in undergraduate or graduate courses in algorithms or data structures.

Like the first edition, this text can also be used for self-study by technical professionals since it discusses engineering issues in algorithm design as well as the mathematical aspects.
                        In its new edition, Introduction to Algorithms continues to provide a comprehensive introduction to the modern study of algorithms. The revision has been updated to reflect changes in the years since the book's original publication. New chapters on the role of algorithms in computing and on probabilistic analysis and randomized algorithms have been included. Sections throughout the book have been rewritten for increased clarity, and material has been added wherever a fuller explanation has seemed useful or new information warrants expanded coverage.
                                                               As in the classic first edition, this new edition of Introduction to Algorithms presents a rich variety of algorithms and covers them in considerable depth while making their design and analysis accessible to all levels of readers. Further, the algorithms are presented in pseudo code to make the book easily accessible to students from all programming language backgrounds . Each chapter presents an algorithm, a design technique, an application area, or a related topic. The chapters are not dependent on one another, so the instructor can organize his or her use of the book in the way that best suits the course's needs. Additionally, the new edition offers a 25% increase over the first edition in the number of problems, giving the book 155 problems and over 900 exercises that reinforce the concepts the students are learning.

Publisher:
There are books on algorithms that are rigorous but incomplete and others that cover masses of material but lack rigor. Introduction to Algorithms combines rigor and comprehensiveness. The book covers a broad range of algorithms in depth, yet makes their design and analysis accessible to all levels of readers. Each chapter is relatively self-contained and can be used as a unit of study. The algorithms are described in English and in a pseudo code designed to be readable by anyone who has done a little programming. The explanations have been kept elementary without sacrificing depth of coverage
                                                    The first edition became the standard reference for professionals and a widely used text in universities worldwide. The second edition features new chapters on the role of algorithms, probabilistic analysis and randomized algorithms, and linear programming, as well as extensive revisions to virtually every section of the book. In a subtle but important change, loop invariants are introduced early and used throughout the text to prove algorithm correctness. Without changing the mathematical and analytic focus, the authors have moved much of the mathematical foundations material from Part I to an appendix and have included additional motivational material at the beginning.

Download:

Computer Netwoks By Andrew S.Tanenbaum

2011-10-10T13:37:00.000-07:00

Computer Networks

Computer Netwoks By Andrew S.Tanenbaum
The world's leading introduction to networking--fully updated for tomorrow's key technologies
Computer Networks, fourth edition, is the ideal introduction to today's networks--and tomorrow's. This classic bestseller has been thoroughly updated to reflect the newest and most important networking technologies with a special emphasis on wireless networking, including 802.11, Bluetooth'", broadband wireless, ad hoc networks, i-mode, and WAP. But fixed networks have not been ignored either, with coverage of ADSL, Internet over cable, gigabit Ethernet, peer-to-peer networks, NAT, and MPLS. And there is lots of new material on applications, including over 60 pages on the Web, plus Internet radio, Voice over IP, and video on demand. Finally, the coverage of network security has been revised and expanded to fill an entire chapter.
Author, educator, and researcher Andrew S. Tanenbaum, winner of the ACM Karl V. Karlstrom Outstanding Educator Award, carefully explains how networks work on the inside, from underlying hardware at the physical layer up through the top-level application layer. Tanenbanm covers all this and more:
· Physical layer (e.g., copper, fiber, wireless, satellites, and Internet over cable)
· Data link layer (e.g., protocol principles, protocol verification, HDLC, and PPP)
· MAC sublayer (e.g., gigabit Ethernet, 802.11, broadband wireless, and switching)
· Network layer (e.g., routing algorithms, congestion control, QoS, IPv4, and IPv6)
· Transport layer (e.g., socket programming, UDP, TCP, RTP, and network performance)
· Application layer (e.g., e-mail, the Web, PHP, wireless Web, MP3, and streaming audio)
· Network security (e.g., AES, RSA, quantum cryptography, IPsec, and Web security)
The book gives detailed descriptions of the principles associated with each layer and presents many examples drawn from the Internet and wireless networks.

NAME
Computer Networks(4th Edition)
AUTHOR
Andrew S. Tanenbaum

PUBLISHERS
Prentice Hall
USEFUL FOR
Engineering Students

DOWNLOAD

CLICK THIS

Data Structures And Algorithm Analysis By Mark Allen Weiss

2011-10-10T13:30:00.000-07:00

Data Structures And Algorithm Analysis
Data Structures And Algorithm Analysis By Mark Allen Weiss

In this book describes data structures, methods of organizing large amounts of data, and algorithm analysis, the estimation of the running time of algorithms. As computers become faster and faster, the need for programs that can handle large amounts of input becomes more acute. Paradoxically, this requires more careful attention to efficiency, since inefficiencies in programs become most obvious when input sizes are large. By analyzing an algorithm before it is actually coded, students can decide if a particular solution will be feasible. For example, in this text students look at specific problems and see how careful implementations can reduce the time constraint for large amounts of data from 16 years to less than a second. Therefore, no algorithm or data structure is presented without an explanation of its running time. In some cases, minute details that affect the running time of the implementation are explored.

Once a solution method is determined, a program must still be written. As computers have become more powerful, the problems they solve have become larger and more complex, thus requiring development of more intricate programs to solve the problems. The goal of this text is to teach students good programming and algorithm analysis skills simultaneously so that they can develop such programs with the maximum amount of efficiency.

This book is suitable for either an advanced data structures (CS7) course or a first-year graduate course in algorithm analysis. Students should have some knowledge of intermediate programming, including such topics as pointers and recursion, and some background in discrete math.

NAME
Data Structures And Algorithm Analysis in C
AUTHOR
Mark Allen Weiss

PUBLISHERS
Addison Wesley
USEFUL FOR
Engineering Students

DOWNLOAD

CLICK HERE

Computer Graphics By Donald Hearn,M.Pauline Baker

2011-10-10T13:14:00.000-07:00

Computer Graphics

Computer Graphics By Donald Hearn,M.Pauline Baker

This timely new version of a popular computer graphics book features the C language in programming examples to demonstrate the implementation of graphics application. These well-known authors assume no prior knowledge of computer graphics when presenting the basic principles for the design, use, and
understanding of computer graphics systems. However, some knowledge of C programming is assumed as the reader learns how to use algorithms for creating and manipulating graphics displays.

From the Publisher
Reflecting the rapid expansion of the use of computer graphics and of C as a programming language of choice for implementation, this new version of the best-selling Hearn and Baker text converts all programming code into the C language. Assuming the reader has no prior familiarity with computer graphics, the authors present basic principles for design, use, and understanding of computer graphics systems. The authors are widely considered authorities in computer graphics, and are known for their accessible writing style.

From the Back Cover
This timely new version of a popular computer graphics book features the C language in programming examples to demonstrate the implementation of graphics application. These well-known authors assume no prior knowledge of computer graphics when presenting the basic principles for the design, use, and understanding of computer graphics systems. However, some knowledge of C programming is assumed as the reader learns how to use algorithms for creating and manipulating graphics displays.

NAME
Computer Graphics
AUTHOR
Donald Hearn,M.Pauline Baker

PUBLISHERS
Prentice Hall
USEFUL FOR
Engineering Students

IF YOU LIKE THIS THEN CLICK ON FACEBOOK LIKE BUTTON

DOWNLOAD

CLICK HERE

Organizational Behavior

2011-10-09T14:39:00.000-07:00

John Middleton,«Organizational Behavior»

Fast track route to understanding and managing human behavior in organizations. Covers the key areas of OB, from understanding individual and group behavior patterns and attitudes to work to building successful organizations and improving your personal effectiveness in the workplace. Examples and lessons from some of the world's most successful businesses, including Tesco, Sears, Sundaram-Clayton and The Natural Step, and ideas from the smartest thinkers including Charles Handy, Jack Wood, Edgar Schein and Shoshana Zuboff. Includes a glossary of key concepts and a comprehensive resources guide.

DOWNLOAD

CLICK THIS

Data Structures by Sahni

2011-10-09T13:22:00.000-07:00

Data Structures by Sahni

                                                                    DOWNLOAD


                                                              CLICK HERE

Operating System Concepts - 6th Edition

2011-10-09T08:31:00.000-07:00

Abraham Silberschatz, Peter Baer Galvin, Greg Gagne, «Operating System Concepts»
John Wiley & Sons | ISBN: 0471694665 | 2004 | PDF | 944 pages | 62.23 MB

This market-leading text has continued to define the operating systems course. This Six Edition not only presents the latest and most relevant systems, it also digs deeper to uncover those fundamental concepts that have remained constant throughout the evolution of today's operation systems. With this strong conceptual foundation in place, students can more easily understand the details related to specific systems.

DOWNLOAD

CLICK HERE

Tere Mere Phere (2011) DVDScr Hindi Movie Mediafire Links

2011-10-08T12:31:00.001-07:00

Tere Mere Phere (2011) :
Mediafire Links:400MB

DOWNLOAD

link1

link2

Hum Tum Shabana (2011) DVDScr Hindi Movie Mediafire Links

2011-10-08T12:19:00.000-07:00

Hum Tum Shabana (2011):
Mediafire Links:400MB

download

link1

link2

link3

link4

Love Breakups Zindagi (2011) SCAMRip Hindi Movie Mediafire Links

2011-10-08T12:07:00.000-07:00

Love Breakups Zindagi (2011) :
Mediafire Links:400MB

DOWNLOAD

LINK1

LINK2

LINK3

artificalinteligence ebook

2011-10-08T12:00:00.000-07:00

download

artificalinteligence ebook

artificial intelligence notes

2011-10-08T11:41:00.000-07:00

download notes

click this

Environmental studies

2011-10-08T07:43:00.000-07:00

Download Environmental Studies by Anil Kumar De & De Arnab Kumar:

DOWNLOAD

click

force movie better quality

2011-10-07T07:42:00.000-07:00

Better Quality Print

Force (2011) DVDScr

Hindi | dvd rip | 500 MB |

The film is an action love story of a renegade cop who believes that the only way to eradicate crime is to give criminals the bullet - not handcuffs.

screenshot

DOWNLOAD

patrt 1

part2

part3

part4

part5

data structure by seymour lipschutz

2011-10-06T08:53:00.000-07:00

Summary of Schaum's Outline Of Data Structures

Seymour Lipschutz Biography

Seymour Lipschutz, Ph.D. (Philadelphia, PA), is presently on the Mathematics faculty at Temple University. He has written more than 15 Schaum's Outlines.

download

click link1

ENGLISH LANGUAGE COMMUNICATION SKILLS Ebook, presentation and lecture notes covering full semester syllabus

2011-10-06T04:54:00.000-07:00

this pdf covers all the syllabus of communication skill

DOWNLOAD
click this

Digital Logic and Computer Design: M. Morris Man 2nd Edition

2011-10-06T03:53:00.000-07:00

ISBN-10: 013140539X
ISBN-13: 978-0131405394

Author morris mano explains digital logic in most comprehensive way. Although the book is not user friendly author had covered enough topics to make it as standard text in colleges..
PS: The link is of second edition I have found and is scanned(I just say its readable)

Topics Covered:

Combinational Logic Design
Sequential Circuits
Registers and Counters
Memory and Programmable Logic Devices
Register Transfers and Datapaths
Sequencing and Control
Instruction Set Architecture
Central Processing Unit Designs
Input-Output and Communication
Memory Systems
if you have any problem in downloading write in comment i will fix it
DOWNLOAD
click this

.

C Programming: A Modern Approach, 2nd Edition by K. N. King

Theory of Computer Science: Automata, Languages and Computation by K.L.P. Mishra, N. Chandrasekaran

Theory of Computer Science: Automata, Languages and Computation by K.L.P. Mishra, N. Chandrasekaran

TECHRUIT JOB FAIR for 2010/2011/2012

C++: The Complete Reference, 3rd Edition

Compro Technologies

COMPRO TECHNOLOGIES” Off-Campus For Freshers : BE/ BTech : 2012 Batch : Delhi : On 30 Mar 2012, Last Date : 23/3/12

Website : www.comprotechnologies.com Education : BE/BTech : CS, IT, IS, EC, EEE & Instrumentation Experience : Freshers Location : Delhi

IBM India Placement Drive - 2010 and 2011 Batch

The C Puzzle Book, Revised Edition

Design and Analysis of Algorithms Ebook, notes and presentations covering full semester syllabus

design and analysis of algorithm

Computer Netwoks By Andrew S.Tanenbaum

Data Structures And Algorithm Analysis By Mark Allen Weiss

Computer Graphics By Donald Hearn,M.Pauline Baker

Organizational Behavior

Data Structures by Sahni

Operating System Concepts - 6th Edition

Tere Mere Phere (2011) DVDScr Hindi Movie Mediafire Links

Hum Tum Shabana (2011) DVDScr Hindi Movie Mediafire Links

Love Breakups Zindagi (2011) SCAMRip Hindi Movie Mediafire Links

artificalinteligence ebook

artificial intelligence notes

Environmental studies

force movie better quality

data structure by seymour lipschutz

Summary of Schaum's Outline Of Data Structures

ENGLISH LANGUAGE COMMUNICATION SKILLS Ebook, presentation and lecture notes covering full semester syllabus

Digital Logic and Computer Design: M. Morris Man 2nd Edition

Website : www.comprotechnologies.com
Education : BE/BTech : CS, IT, IS, EC, EEE & Instrumentation
Experience : Freshers
Location : Delhi