Tefko Saracevic, Rutgers University 1 Practice for logical operators Boolean search statements and Venn diagrams.

Slides:



Advertisements
Similar presentations
Develop a search statement for searching a database? First, you need to understand what a database is and how it is compiled. Then, you can learn how to.
Advertisements

Ver 2.0. Producing questions with QFT 1.Ask as many questions as you can. 2. Do not stop to discuss, judge, or answer any questions. 3.Write down every.
SIMPLIFY using a Venn Digram or Laws of Set Algebra Pamela Leutwyler.
Machine Learning Instance Based Learning & Case Based Reasoning Exercise Solutions.
Chapter 7 Logic, Sets, and Counting
Shade the Venn diagram to represent the set A' U (A ∩ B)
Chapter 7 Logic, Sets, and Counting Section 3 Basic Counting Principles.
BOOLEAN LOGIC APPLIED TO ONLINE SEARCHING By Miss T. © Janet Tillman/The Master’s College, 2004, 2007, 2009, permission is granted for non-profit educational.
© Tefko Saracevic, Rutgers University1 Search strategy & tactics Governed by effectiveness & feedback.
© Tefko Saracevic, Rutgers University adapted for sectoin 21 PRINCIPLES OF SEARCHING 17:610:530 (02) Paul Kantor SCILS, Rm. 307 (732) /Ext
© Tefko Saracevic, Rutgers University1 1.Discussion 2.Information retrieval (IR) model (the traditional models). 3. The review of the readings. Announcement.
© Tefko Saracevic, Rutgers University1 Interaction in information retrieval There is MUCH more to searching than knowing computers, networks & commands,
Information retrieval (IR)
© Tefko Saracevic1 Search strategy & tactics Governed by effectiveness&feedback.
© Tefko Saracevic, Rutgers University1 PRINCIPLES OF SEARCHING 17:610:530 (01) Tefko Saracevic SCILS, Rm. 306 (732) /Ext. 8222
© Tefko Saracevic, Rutgers University 1 Vox populi: the public searching of the Web: A longitudinal study of large samples of Excite queries Dietmar Wofram.
Given Connections Solution
1 Guide to exercise 2 Brief examples Tefko Saracevic.
Tefko Saracevic, Rutgers University 1 How to print slides from a PowerPoint presentation 1. You can print a presentation while you are online OR you can.
Tefko Saracevic, Rutgers University 1 How to print slides from a PowerPoint presentation 1. You can print a presentation while you are online OR you can.
© Tefko Saracevic 1 Information retrieval (IR): traditional model 1.Why? Rationale for the module. Definition of IR 2.System & user components 3.Exact.
Unit 10 – Logic and Venn Diagrams
A CB SHADING VENN DIAGRAMS Try these Venn Diagram shading questions involving 2 sets Question 1Question 2 Question 3Question 4.
SOLVING VENN DIAGRAMS The universal Set, U, and the sets A, B and Contained within it are such that: Find:
Chapter 3: Set Theory and Logic
APPLIED TO ONLINE SEARCHING © Janet Tillman/The Master’s College, , permission is granted for non-profit educational use; any reproduction or.
Proof of Pythagoras’s Theorem GCSE Higher. ‘Prove’ means what exactly? A proof in mathematics is a process of logical steps Each step makes a statement.
© Tefko Saracevic, Rutgers University1 Mediation in librarianship & information retrieval Reference interview Human-human interaction Question negotiation.
2.6 Linear Inequalities in Two Variables
Algebra I Chapter 10 Review
Evaluation INST 734 Module 5 Doug Oard. Agenda Evaluation fundamentals  Test collections: evaluating sets Test collections: evaluating rankings Interleaving.
Valeria Urquijo Boolean Operators March 4, 2010
CMPF144 FUNDAMENTALS OF COMPUTING THEORY Module 2: Abilities of Computers.
HAWKES LEARNING SYSTEMS Students Matter. Success Counts. Copyright © 2013 by Hawkes Learning Systems/Quant Systems, Inc. All rights reserved. Section 7.3.
Boolean Operators Are You Connected? Presented by: (Insert Your Name Here)
SECTION 2-3 Set Operations and Cartesian Products Slide
Search Logic Viewing Results Labs 3-4 Dr. Dania Bilal IS 530 Fall 2007.
Internet Research – Illustrated, Fourth Edition Unit B.
© Tefko Saracevic 1 Exercise: Logical operators Boolean search statements and Venn diagrams.
Learning Objectives for Section 7.3 Basic Counting Principles
Karnaugh Maps (K maps). What are Karnaugh 1 maps?  Karnaugh maps provide an alternative way of simplifying logic circuits.  Instead of using Boolean.
Invitation to Critical Thinking Chapter 6
What are Boolean Operators? Mrs. Sereno & Mrs. Gadbury 2012.
Unit B Constructing Complex Searches Internet Research Third Edition.
Produce Your Questions Four essential rules for producing your own questions: Ask as many questions as you can. Do not stop to discuss, judge, or answer.
Intro to Inequalities Unit 4 Section 4.1. Definition A statement that a mathematical expression is greater than or less than another expression.
REVIEWING HCF AND LCM ONLY FOR 3 OR 4 NUMBERS!. FOR 2 NUMBERS.. NOTHING CHANGES! DRAW THE VENN DIAGRAM! HCF  WHAT IS COMMON (IN THE MIDDLE) LCM  WHAT.
EXERCISE 1.4 MICROMETER SCREW GAUGE. D mm C mm B mm A mm    Q1. The diagram shows a micrometer screw gauge. Which reading is.
SEPTEMBER 2015 Databases. Database (review) A database is a collection of data arranged for ease and speed of search and retrieval (The American Heritage.
Boolean Algebra. LO:  Understand why Boolean algebra is used  Understand basic Boolean algebra notation  Understand why Boolean algebra is used  Understand.
Venn Diagrams.
Programmable Logic Controller
Boolean Operations and Expressions Addition = = = = 1 Multiplication 0 * 0 = 0 0 * 1 = 0 1 * 0 = 0 1 * 1 = 1.
Chapter 1 Connections to Algebra Review
1. Expand 2. Business search 3. Dialindex search
For each shape, compare the shaded part to the total number of parts
Logic Gates, Boolean Algebra and Karnaugh Maps
Part 1: Boolean algebra & Venn diagrams Part 2: Starting Scopus
Algebra substitution.
What do these fractions mean? Do they hold the same value?
موضوع پروژه : بازیابی اطلاعات Information Retrieval
Exercise: Logical operators
SHADING VENN DIAGRAMS
4 Categorical Propositions
Karnaugh Maps (K maps).
12cm Area 64cm2 Area 100cm2 ? ? Area ?cm2 12cm Area 36cm2
12cm Area 64cm2 Area 100cm2 ? ? Area ?cm2 12cm Area 36cm2
Digital Systems Section 3 Boolean Algebra. Digital Systems Section 3 Boolean Algebra.
DIAGRAM IT!.
Presentation transcript:

Tefko Saracevic, Rutgers University 1 Practice for logical operators Boolean search statements and Venn diagrams

Tefko Saracevic, Rutgers University 2 Exact match - Boolean search You retrieve exactly what you ask for in the query: –all documents that have the term(s) with logical connection(s), and possible other restrictions (e.g. to be in titles) as stated in the query –exactly: nothing less, nothing more Based on matching following rules of Boolean algebra, or algebra of sets –‘new algebra’ –presented by circles in Venn diagrams

Tefko Saracevic, Rutgers University 3 Boolean algebra & Venn diagrams Four basic operations: 123 AB A alone. All documents that have A. Shade 1 & 2. E.G. apples 123 AB A AND B. Shade 2 apples AND oranges 123 AB A OR B. Shade 1, 2, 3 apples OR oranges 123 AB A NOT B. Shade 1 apples NOT oranges

Tefko Saracevic, Rutgers University 4 Venn diagrams … cont. Complex statements allowed e.g A B C (A OR B) AND C Shade 4,5,6 (apples or oranges) AND Florida (A OR B) NOT C Shade what? (apples or oranges NOT Florida

Tefko Saracevic, Rutgers University 5 Directions for exercise Slide 7 provides a Venn diagram with numbered sets and a number of search statements –for each statement shade the appropriate set or sets –e.g. for (A OR B) AND C the sets are 4, 5, 6 Slide 8 is for practice Slide 9 has the answers –BUT NOTE: one of the answers is WRONG! Which one?

Tefko Saracevic, Rutgers University 6 Order of operations Rules for the order in which operations are done effect the answer - so follow them Dialog order of operation is: 1. First are done all operations that are in parentheses, then: 2. (W), (N), (S), (L), or (F) 3. NOT 4. AND 5. OR e.g. for A OR B AND C, first is done B AND C, and then A OR the results of B AND C, thus this is the same as A OR (B AND C)

Tefko Saracevic, Rutgers University 7 Venn diagrams AB C 1. A AND B 2. A OR B 3. A OR B AND C 4. (A OR B) AND C 5. A AND B NOT C 6. A AND (B NOT C) 7. (A AND B) NOT C 8. (A NOT B) AND C 9. A NOT (B AND C) 10. A NOT B AND C 11. A AND (B OR C) 12. A AND B OR C 13. A OR (B AND C) 14. A OR B OR C 15 A AND B AND C

Tefko Saracevic, Rutgers University A B C Use for exercise & shading

Tefko Saracevic, Rutgers University 9 1. A AND B2,5 2. A OR B1,2,3,4,5,6 3. A OR B AND C1,2,4,5,6 4. (A OR B) AND C4,5,6 5. A AND B NOT C2 6. A AND (B NOT C)2 7. (A AND B) NOT C2 8. (A NOT B) AND C4 9. A NOT (B AND C)6 10. A NOT B AND C4 11. A AND (B OR C)2,4,5 12. A AND B OR C2,4,5,6,7 13. A OR (B AND C)1,2,4,5,6 14. A OR B OR C1,2,3,4,5,6,7 15 A AND B AND C AB C Venn diagrams: solutions p.s. one of them is wrong!