cp7024-Information retrieval Question papers

CP7102 Advanced Data Structure And Algorithm Question papers

CP7102 Advanced Data Structure And Algorithm E-books

E-Books Reference:

1.”How To Think about algorithm“by jeff Edmonds –Download

2.”The Art of Multi programming“by M.Herlihy and N..shavit- Download

3.”Algorithm Design Manual“by Steven S.skiena,Springer,2008-Download

4.”Data Structures and Algorithm“,A.V.Aho,J.E.Hopcroft, and D.Ullman,Pearson,2006-Download

5.”Randomized Algorithm“,Rajeev Motwani and Prabhakar Raghavan,Cambridge university press,1995-Download

6.”The Design and Analysis of computer Algorithms“,A.V.Aho,J.E.Hopcroft, and D.Ullman,Addison-wesley,1975.-Download

7.”Algorithm design“,J.kleinberg and E.Tardos,Pearson education 2006-Download

8.T.H. Cormen, C.E. Leiserson,R.L. Rivest and C. Stein, ” Introduction to Algorithms“,PHI Learning private limited, 2012- 3rd Edition-Download 4th Edition-Download

9.Peter Brass,”Advanced data Structures“, Cambridge university Press,2008-Download

10.S. Dasgupta, C.H. Papadimitriou, and U.V. Vazirani, “Algorithms“, McGrawHill,2008.-Download

NE7202 Network And Information Security Notes and E-books

REFERENCES:

1. William Stallings, “Cryptography and Network Security: Principles and Practices”, Third Edition, Pearson Education, 2006.

2. Matt Bishop ,“Computer Security art and science ”, Second Edition, Pearson Education, 2002.

3. Wade Trappe and Lawrence C. Washington, “Introduction to Cryptography with Coding Theory” Second Edition, Pearson Education, 2007.

4. Jonathan Katz, and Yehuda Lindell, Introduction to Modern Cryptography, CRC Press, 2007

5. Douglas R. Stinson, “Cryptography Theory and Practice”, Third Edition, Chapman & Hall/CRC, 2006

6. Wenbo Mao, “Modern Cryptography – Theory and Practice”, Pearson Education, First Edition, 2006.

7. Network Security and Cryptography, Menezes Bernard, Cengage Learning, New Delhi, 2011

8. Man Young Rhee, Internet Security, Wiley, 2003

9. OWASP top ten security vulnerabilities: http://xml.coverpages.org/OWASPTopTen.Pdf

NOTES:

UNIT I-  INTRODUCTION

DOWNLOAD- UNIT I- PPT

UNIT II- CRYPTOSYSTEMS & AUTHENTICATION

DOWNLOAD- UNIT II- PPT

UNIT III- PUBLIC KEY CRYPTOSYSTEMSDOWNLOAD- UNIT III- PPT

UNIT IV- SYSTEM IMPLEMENTATION

DOWNLOAD- UNIT IV- PPT

UNIT V- NETWORK SECURITY

DOWNLOAD- UNIT V- PPT

MA7155 APPLIED PROBABILITY AND STATISTICS Question paper (2013,2014,2015)

MA7155 Applied Probability and Statistics Notes

Written notes — Download

UNIT-I One Dimensional Random Variables Download

UNIT-II Two Dimensional Random Variables Download

UNIT-III Estimation theory Download

UNIT-IV Testing of Hypothesis Download

UNIT-V Multivariate Analysis Download  NOTES

Written notes — Download

References E-books Download below:

1.Jay L. Devore, “Probability and Statistics For Engineering and the Sciences”,Thomson

and Duxbury, 2002. E-book- Download

2.Richard Johnson. ”Miller & Freund’s Probability and Statistics for Engineer”, Prentice –

Hall , Seventh Edition, 2007.E-book- download

3.Richard A. Johnson and Dean W. Wichern, “Applied Multivariate Statistical Analysis”,

Pearson Education, Asia, Fifth Edition, 2002. E-book- download

4.Gupta S.C. and Kapoor V.K.”Fundamentals of Mathematical Statistics”, Sultan an Sons,

E-book- download

5.Dallas E Johnson , “Applied Multivariate Methods for Data Analysis”, Thomson an Duxbury

press,1998. E-book- download

CP7102 Advanced Data Structure And Algorithm Notes

Unit 1 – ITERATIVE AND RECURSIVE ALGORITHMS – Download

Unit 2 – OPTIMISATION ALGORITHMS –  Download

Unit 3 – DYNAMIC PROGRAMMING ALGORITHMS – Download

Unit 4 – SHARED OBJECTS AND CONCURRENT OBJECTS – Download

Unit 5 – CONCURRENT DATA STRUCTURES – Download


CP7102 – Advanced Data Structures and Algorithms — Download


CP7102 – Advanced Data Structures and Algorithms Question paper -- Download

CP7024 INFORMATION RETRIEVAL TECHNIQUES(Syllabus-2013)

UNIT I INTRODUCTION

Motivation – Basic Concepts – Practical Issues - Retrieval Process – Architecture - Boolean Retrieval –Retrieval Evaluation – Open Source IR Systems–History of Web Search – Web Characteristics–The impact of the web on IR ––IR Versus Web Search–Components of a Search engine

UNIT II MODELING

Taxonomy and Characterization of IR Models – Boolean Model – Vector Model - Term Weighting – Scoring and Ranking –Language Models – Set Theoretic Models - Probabilistic Models – Algebraic Models – Structured Text Retrieval Models – Models for Browsing

 UNIT III INDEXING

Static and Dynamic Inverted Indices – Index Construction and Index Compression. Searching - Sequential Searching and Pattern Matching. Query Operations -Query Languages – Query Processing - Relevance Feedback and Query Expansion - Automatic Local and Global Analysis – Measuring Effectiveness and Efficiency

UNIT IV CLASSIFICATION AND CLUSTERING

Text Classification and Naïve Bayes – Vector Space Classification – Support vector machines and Machine learning on documents. Flat Clustering – Hierarchical Clustering –Matrix decompositions and latent semantic indexing – Fusion and Meta learning

UNIT V SEARCHING AND RANKING

 Searching the Web –Structure of the Web –IR and web search – Static and Dynamic Ranking - Web Crawling and Indexing – Link Analysis - XML Retrieval Multimedia IR: Models and Languages – Indexing and Searching Parallel and Distributed IR – Digital Libraries

REFERENCES:

1. Ricardo Baeza – Yates, BerthierRibeiro – Neto, Modern Information Retrieval: The concepts and Technology behind Search (ACM Press Books), Second Edition 2011--(Download)

 2. Christopher D. Manning, PrabhakarRaghavan, HinrichSchutze, Introduction to Information Retrieval, Cambridge University Press, First South Asian Edition 2012--(Download)

3. Stefan Buttcher, Charles L. A. Clarke, Gordon V. Cormack, Information Retrieval Implementing and Evaluating Search Engines, The MIT Press, Cambridge, Massachusetts London, England, 2010

CP7102 ADVANCED DATA STRUCTURES AND ALGORITHMS(Syllabus-2013)

UNIT I ITERATIVE AND RECURSIVE ALGORITHMS

Iterative Algorithms:Measures of Progress and Loop Invariants-Paradigm Shift: Sequence of Actions versus Sequence of Assertions- Steps to Develop an Iterative Algorithm-Different Types of Iterative Algorithms--Typical Errors-Recursion-Forward versus Backward- Towers of Hanoi- Checklist for Recursive Algorithms-The Stack Frame-Proving Correctness with Strong Induction- Examples of Recursive Algorithms-Sorting and Selecting Algorithms-Operations on Integers- Ackermann’s Function- Recursion on Trees-Tree Traversals- Examples- Generalizing the Problem - Heap Sort and Priority Queues-Representing Expressions.

UNIT II OPTIMISATION ALGORITHMS

 Optimization Problems-Graph Search Algorithms-Generic Search-Breadth-First Search- Dijkstra’s Shortest-Weighted-Path -Depth-First Search-Recursive Depth-First Search-Linear Ordering of a Partial Order- Network Flows and Linear Programming-Hill Climbing-Primal Dual Hill Climbing- Steepest Ascent Hill Climbing-Linear Programming-Recursive Backtracking- Developing Recursive Backtracking Algorithm- Pruning Branches-Satisfiability

UNIT III DYNAMIC PROGRAMMING ALGORITHMS

Developing a Dynamic Programming Algorithm-Subtle Points- Question for the Little Bird- Subinstances and Subsolutions-Set of Subinstances-Decreasing Time and Space-Number of Solutions-Code. Reductions and NP-Completeness-Satisfiability-Proving NP-Completeness- 3- Coloring- Bipartite Matching. Randomized Algorithms-Randomness to Hide Worst Cases- Optimization Problems with a Random Structure.

UNIT IV SHARED OBJECTS AND CONCURRENT OBJECTS

 Shared Objects and Synchronization -Properties of Mutual Exclusion-The Moral- The Producer– Consumer Problem -The Readers–Writers Problem-Realities of Parallelization-Parallel Programming- Principles- Mutual Exclusion-Time- Critical Sections--Thread Solutions-The Filter Lock-Fairness-Lamport’s Bakery Algorithm-Bounded Timestamps-Lower Bounds on the Number of Locations-Concurrent Objects- Concurrency and Correctness-Sequential Objects- Quiescent Consistency- Sequential Consistency-Linearizability- Formal Definitions- Progress Conditions- The Java Memory Model

UNIT V CONCURRENT DATA STRUCTURES

 Practice-Linked Lists-The Role of Locking-List-Based Sets-Concurrent Reasoning- Coarse- Grained Synchronization-Fine-Grained Synchronization-Optimistic Synchronization- Lazy Synchronization-Non-Blocking Synchronization-Concurrent Queues and the ABA Problem- Queues-A Bounded Partial Queue-An Unbounded Total Queue-An Unbounded Lock-Free Queue-Memory Reclamation and the ABA Problem- Dual Data Structures- Concurrent Stacks and Elimination- An Unbounded Lock-Free Stack- Elimination-The Elimination Backoff Stack


REFERENCES:

1. Jeff Edmonds, “How to Think about Algorithms”, Cambridge University Press, 2008.

2. M. Herlihy and N. Shavit, “The Art of Multiprocessor Programming”, Morgan Kaufmann, 2008.

3. Steven S. Skiena, “The Algorithm Design Manual”, Springer, 2008.

4. Peter Brass, “Advanced Data Structures”, Cambridge University Press, 2008.

5. S. Dasgupta, C. H. Papadimitriou, and U. V. Vazirani, “Algorithms” , McGrawHill, 2008.

6. J. Kleinberg and E. Tardos, "Algorithm Design“, Pearson Education, 2006.

7. T. H. Cormen, C. E. Leiserson, R. L. Rivest and C. Stein, “Introduction to Algorithms“, PHI Learning Private Limited, 2012.

8. Rajeev Motwani and Prabhakar Raghavan, “Randomized Algorithms”, Cambridge University Press, 1995.

9. A. V. Aho, J. E. Hopcroft, and J. D. Ullman, “The Design and Analysis of Computer Algorithms”, Addison-Wesley, 1975.

10. A. V. Aho, J. E. Hopcroft, and J. D. Ullman,”Data Structures and Algorithms”, Pearson,2006.

MA7155 APPLIED PROBABILITY AND STATISTICS(Syllabus)(2013)

 UNIT I ONE DIMENSIONAL RANDOM VARIABLES

 Random variables - Probability function – Moments – Moment generating functions and their properties – Binomial, Poisson, Geometric, Uniform, Exponential, Gamma and Normal distributions – Functions of a Random Variable.

UNIT II TWO DIMENSIONAL RANDOM VARIABLES

Joint distributions – Marginal and Conditional distributions – Functions of two dimensional random variables – Regression Curve – Correlation.

UNIT III ESTIMATION THEORY

 Unbiased Estimators – Method of Moments – Maximum Likelihood Estimation - Curve fitting by Principle of least squares – Regression Lines.

UNIT IV TESTING OF HYPOTHESES

Sampling distributions - Type I and Type II errors - Testsbased on Normal, t, Chi-Square and F distributions for testing of mean, variance and proportions – Tests for Independence of attributes and Goodness of fit.

UNIT V MULTIVARIATE ANALYSIS

Random Vectors and Matrices - Mean vectors and Covariance matrices - Multivariate Normal density and its properties - Principal components Population principal components - Principal components from standardized variables.


 REFERENCES:

1. Jay L. Devore, “Probability and Statistics for Engineering and the Sciences”, Thomson and Duxbury, 2002.

2. Richard Johnson. ”Miller & Freund’s Probability and Statistics for Engineer”, Prentice – Hall, Seventh Edition, 2007.

3. Richard A. Johnson and Dean W. Wichern, “Applied Multivariate Statistical Analysis”, Pearson Education, Asia, Fifth Edition, 2002.

4. Gupta S.C. and Kapoor V.K.”Fundamentals of Mathematical Statistics”, Sultan and Sons, 2001. 5. Dallas E Johnson, “Applied Multivariate Methods for Data Analysis”, Thomson and Duxbury press, 1998.



MA7155 – Applied Probability and Statistics —  Download

MA7155 – Applied Probability and Statistics Question paper -- Download

Typing Master Pro 7.10 licence key (serial key)

1 : Disable Network (disconnect your internet)
2 : Enter this 

Name: RathouR
Serial: 6DK3MF-QGBLKB-MLJB3L-CFFHGE3P

Thanks :)

Important File Extensions

Zipped File 7z — 7-Zip compressed file gzip (.gz) — Compressed file .tar.gz, .tgz — gzipped tar file jar — ZIP file with manifest for use with Java applications RAR Rar Archive (.rar) — for multiple file archive (rar to .r01-.r99 to s01 and so on) zip — popular compression format   Desktop publishing .indd - Adobe InDesign .psd - Adobe Photoshop .pdf - Adobe Acrobat or Adobe Reader .qxd - QuarkXPress Document /Spreadsheet Files .xl - Excel Spreadsheet .xlr - Works Spreadsheet .xlsx - Microsoft Excel Open XML Spreadsheet .log - Log File .odt - OpenDocument Text Document .pages - Pages Document .doc - Microsoft Word Document .docx - Microsoft Word Open XML Document .tex - LaTeX Source Document .wps - Microsoft Works Word Processor Document .msg - Outlook Mail Message .rtf - Rich Text Format File .txt -   Plain Text File  .vcf -   vCard File .dat -   Data File .pptx -   PowerPoint Open XML Presentation .sdf -   Standard Data File .csv  -   Comma Seperated Values File .xml -   XML File .pps -   PowerPoint Slide Show .ppt  -   PowerPoint Presentation   Audio Files .aif   -   Audio Interchange File Format .mpa  -   MPEG-2 Audio File .ra  -   Real Audio File .iff  -   Interchange File Format .wav  -   WAVE Audio File .wma  -   Windows Media Audio File .mp3  -   MP3 Audio File   Video Files .avi  -  Audio Video Interleave File .3gp  -  3GPP Multimedia File .flv  -  Flash Video File .mpg  -  MPEG Video File .vob  -  DVD Video Object File .mp4  -  MPEG-4 Video File .3g2  -  3GPP2 Multimedia File .m4v  -  iTunes Video File .wmv  -  Windows Media Video File .swf  -  ShockWave Flash   Image Files .gif   -  Graphical Interchange Format File .jpg  -  JPEG Image .bmp  -  Bitmap Image File .psd   -  Adobe Photoshop Document .png  -  Portable Network Graphic .jpg  -  JPEG Image (Full form is Joint Photographic Experts Group)   Database Files .mdf - Microsoft SQL Server Database .sql - bundled SQL queries .pdb  -  Program Database .dbf  -  Database File .accdb  -  Access 2007 Database File .db   -  Database File .sql  -  Structured Query Language Data File .mdb  -  Microsoft Access Database   Executable Files .exe  - Windows Executable File .bat  - DOS Batch File   Programe/Code Files .cgi  - Common Gateway Interface Script .vb  - VBScript File .cs  - C Sharp file .jar  - Java Archive File .bat  - DOS Batch File .aspx  - Asp.net Extension .asp  - Active Server Page .php  - PHP Source Code File .cpp   - C++ Source Code File .c    - C/C++ Source Code File   Web Files .cer  - Internet Security Certificate .css  - Cascading Style Sheet .html   - Hypertext Markup Language File .js  - JavaScript File .jsp  - Java Server Page .htm  - Hypertext Markup Language File .xhtml  - Extensible Hypertext Markup Language File .rss   - Really Simple Syndication   Other Files .tmp   - Temporary File .bak   - Backup File .cab - cabinet file

Basic Concepts of hardware

Memory in Computers and Disks / Drives

There are several different types of memory:

· RAM (random-access memory): This is also known as main memory.  Computers can write and read data from RAM.   This is in contrast to ROM  which permits you only to read data.  However, most RAM is volatile, which means that it requires a steady flow of electricity to maintain its contents.  As soon as the power is turned off, whatever data was in RAM is lost. The users access data in RAM memory randomly as per needs.  RAM can be erased or written over at will by the computer programme

· ROM (read-only memory):  Computers almost always contain a small amount of read-only memory, commonly known as ROM.  This memory holds instructions for starting up the computer. As name indicates you can only read from this memory and cannot write anything on it.  Moreover, it is non-volatile in nature  i.e. even when power is switched off, the memory is not lost.

Thus, we can say that RAM is like a slate where you can write something for immediate reference and then wipe / change data by adding or deleting when it is not needed, but ROM is like a printed book, where once the text is  printed then it cannot be altered.

· PROM (programmable read-only memory): A PROM is a memory chip on which you can store a  programme.. But once the PROM has been used, you cannot wipe it clean and use it to store something else. Like ROMs, PROMs are non-volatile.

· EPROM (erasable programmable read-only memory): An EPROM is a special type of PROM that can be erased by exposing it to ultraviolet light.

· EEPROM (electrically erasable programmable read-only memory):An EEPROM is a special type of PROM that can be erased by exposing it to an electrical charge.

Memory is measured in bytes.  A byte is usually made up of 8 bits and represents one character - a letter, digit or symbol.   The number of bytes that can be held is a measure of the memory and storage capacity.   Bytes are usually measured in groups of kilobytes, megabytes, gigabytes and terabytes. 

Disk Drives

Secondary memory is also known as external memory or storage.  It consists of Hard Discs,   Floppy Disc (now a days out of fashion) , CDs  and DVDs  as well as pen drives.  External device consists of more storage space and most dynamic in terms of storing data. 
The disk drive determines the path by which you send and receive information to the computer. Information stored on a disk is measured in bytes.   We have already explained the methods used to represent bytes

1. a : drive is  popularly known as floppy drive as it was usually reserved for the floppy disks.  Floppy disk or diskette used to comes in two basic sizes; 5.25 inch and 3.5 inch. Both have a low and high density versions though 3.5 inch high density disks are the most common. However, now a days most of the PCs do not have this drive as floppy has become obsolete.   The later date diskettes that were inserted into the a: drive were 3 ½ inch size which could hold 1.44 megabyte of information.   Initially these disk had to be formatted before being put to use, but later on  pre-formatted disks were available. Formatting prepares the disk to be written upon. Diskettes can also be write-protected. This prevents you from writing on the disk. To write-protect a disk, slide the corner tab to uncover the opening.

2. c: drive is popularly reserved for the hard disk drive in computers   It is a thick Frisbee-like disk inside the computer, which can hold considerable higher  information than a diskette. The hard disk drive reads and stores information faster than the a: drive.  The memory size of these hard disks has greatly enhanced in last few years.

3. d: drive is mostly used for CD-ROM i.e. for playing the CDs .  CDs are inserted into this drive. A CD can contain more information than 100 diskettes. Computers are not able to write to the CD-ROM drive unless a CD Burner is present. The CD-ROM drives read information at various speeds.  However, sometimes d: drive is a part of the Hard Disk as such disks are partitioned into more than one segment where c:,  d:  and even e: are used for hard disk which has been partitioned.

In addition to above standard features for drives, now a days :

4. Some computers today come equipped with a zip drive. A zip drive provides additional storage space. A zip disk is inserted into the zip drive. The zip disk can hold 100 megabytes of information. Zip drives can be attached to an existing computer.

5. DVD (Digital Versatile Disc) drive is a new technology that stores more information than a CD-ROM and can be written upon. A DVD disk is inserted into this drive. The drive may come built into the computer or may be attached. These disk often are used to store movies or interactive video games. The disk resembles a CD but has 7 times the storage capacity.

6. Pen Drives are now popular and may be shown as e: or f: drives.   These are used to store data which needs to be carried somewhere else.

Disk size	Amount of storage	Approximate printed  8.5 x 11 inch pages
3.5 high density	1.44 Mb	720 pages
CD	650 Mb	a small library
DVD	4.5 Gb	a feature length movie
DVD dual layer	8 Gb	a long feature length movie with extras

Methods Used for Reading of Memory :

Sequential access refers to reading or writing data records in sequential order, that is, one record after the other. To read record 10, for example, you would first need to read records 1 through 9. This differs from random access, in which you can read and write records in any order.    Some programming languages and operating systems distinguish between sequential-access data files and random-access data files, allowing you to choose between the two types.   Sequential-access files are faster if you always access records in the same order. Random-access files are faster if you need to read or write records in a random order.

Devices can also be classified as sequential access or random access. For example, a tape drive is a sequential-access device because to get to point q on the tape, the drive needs to pass through points a through p.    The disk drive, on the other hand, is a random-access devicebecause the drive can  access any point on the disk without passing through all intervening points.

MODEM  :  Full form of modem is MOdulator and DEModulator. The modem is a converter of analog to digital and digital to analog.  Thus, we can say that a modem is a mechanical means of translating computer information or retrieving information from the Internet via a phone line.  It needs communication software in order to work and can be attached internally or externally.   Internet transmission can also take place over an ISDN line or the even faster T1 line. No modem is necessary for these types of transmission but you will need an ISDN adapter. Modems are measured by the speed that the information is transferred. The measuring tool is called the baud rate. Originally modems worked at speeds below 2400 baud but today analog speeds of 56,000 are standard. Cable, wireless or digital subscriber lines can transfer information much faster with rates of 300,000 baud and up.