Professional Documents
Culture Documents
Made Easy Publication
Made Easy Publication
Computer
Science & IT
Revised & Updated
For
GATE, PSUs
& OTHER COMPETITIVE EXAMS
Publications
Publications
I feel every candidate has ability to succeed but competitive environment and
quality guidance is required to achieve high level goals. At MADE EASY, we
help you to discover your hidden talent and success quotient to achieve your
ultimate goals. In my opinion IAS, ESE, GATE & PSU’s exams are tool to enter in
to main stream of Nation serving. The real application of knowledge and talent
starts, after you enter in to the working system. Here in MADE EASY you are also
trained to become winner in your life and achieve job satisfaction.
MADE EASY aluminae have shared their winning stories of success and
expressed their gratitude towards quality guidance of MADE EASY. Our students
have not only secured All India First Ranks in ESE, GATE and PSU entrance
examinations but also secured top positions in their career profiles. Now, I invite
you to become aluminae of MADE EASY to explore and achieve ultimate goal of
your life. I promise to provide you quality guidance with competitive environment
which is far advanced and ahead than the reach of other institutions. You will
get the guidance, support and inspiration that you need to reach the peak of
your career.
I have true desire to serve Society and Nation by way of making easy path of
the education for the people of India.
After a long experience of teaching in Computer Science & IT over the period of
time MADE EASY team realised that there is a need of good Handbook which
can provide the crux of Computer Science & IT in a concise form to the student
to brush up the formulae and important concepts required for GATE and other
competitive examinations. This handbook contains all the formulae and important
theoretical aspects of Computer Science & IT. It provides much needed revision
aid and study guidance before examinations.
Chapter 1 : Chapter 4 :
Discrete and Engineering Programming and Data
Mathematics.................................. 1-62 Structures................................. 141-163
I. Mathematical Logic............................................. 1
I. Programming in C........................................... 141
II. Combinatorics....................................................... 5
II. Functions and Recursion.............................. 149
III. Set Theory & Algebra........................................11
IV. Graph Theory.......................................................30 III. Abstract Data Types, Arrays and
V. Probability............................................................40 Linked Lists........................................................ 152
VI. Linear Algebra.....................................................45 IV. Stacks and Queues......................................... 155
VII. Numerical Methods..........................................50 V. Trees, BSTs and Binary Heaps..................... 158
VIII. Calculus.................................................................54
Chapter 5 :
Chapter 2 :
Algorithms............................... 164-183
Digital Logic............................... 63-104
I. Analysis and Asymptotic Notations......... 164
I. Logic Functions..................................................63
II. Minimization........................................................68 II. Divide-and-Conquer...................................... 169
III. Combinational Circuits....................................73 III. Greedy Approach............................................ 172
IV. Sequential Circuit...............................................85 IV. Dynamic Programming................................ 175
V. Number Representation and Computer V. Graph Traversals, Hashing and
Arithmetic.............................................................97
Sorting................................................................ 178
VI. Complexity Classes: P, NP,
Chapter 8 : Chapter 11 :
Operating System.................... 223-255 ** Information Systems and Software
I. Processes and Threads.................................. 223
Engineering.............................. 319-332
II. IPC, Concurrency and Synchronization.. 226
I. Information Gathering, Requirement &
III. Deadlock............................................................ 234
IV. CPU Scheduling............................................... 236 Feasibility Analysis.......................................... 319
V. Memory Management and II. DFDs and Process Specifications............... 321
Virtual Memory................................................ 240 III. I/O Design, Process Life Cycle..................... 322
VI. I/O and File Systems, Protection IV. Planning and Managing the Project........ 326
and Security...................................................... 250
V. Design, Coding, Testing, Implementation
and Maintenance............................................ 328
Chapter 9 :
Databases................................. 256-284
Chapter 12 :
I. ER-model and Relational Model................ 256
** Web Technologies................ 333-342
II. Database Design............................................. 261
I. HTML..................................................................333
III. SQL....................................................................... 267 II. XML....................................................................335
IV. File Structures (B and B+ Trees).................. 273 III. Basic Concepts of Client-Server
V. Transactions and Concurrency Computing......................................................340
Control................................................................ 276
nnnn