They Say V I Say

The second adventure in Maz Evans's laugh-out-loud funny Vi Spyseries! PRAISE FOR THE SERIES: 'Twists, turns, spies and surprises. What more do you want? Tears? Laughter? Maz Evans delivers them all.'FRANK COTTRELL BOYCE 'Vi Spy: Licence to Chillis brilliant - knockabout, laugh-a-minute, heartfelt fun'ROSS MONTGOMERY 'Wildly hilarious'THE GUARDIAN Vi is failing at top spy school Rimmington Hall - even though the school motto is 'Failure is Not an Option'. To make it worse, nearly-stepbrother Russell Sprout is an A* student. Worst of all, Vi's shadowy nemesis Umbra is still at large. Can Vi unveil the arch-villain before she gets expelled and her parents ground her for ever? She'll need the help of old friends and new, including 9-year-old super-hacker Missy Fit and BFF Tamina, who aims to save the world in a different way ... The second book in a brilliant middle-grade comedy adventure series; follows book 1, Vi Spy: Licence to Chill, which was shortlisted for the Indie Book Awards. From the bestselling author of the Who Let the Gods Out?series; book 1 shortlisted for the Waterstones Book Prize. A laugh-out-loud funny, high-octane spy story perfect for readers aged 8 and up. Perfectly combines humour and heart: addresses the realities of being caught between divorcing parents. Praise for the WHO LET THE GODS OUT? series: 'I totally fell in love with Elliot and the gods, and I think you're all going to love them too.'ROBIN STEVENS 'One of the funniest new voices in children's literature. The laughs come thick and fast'DAVID SOLOMONS '[A] relentlessly witty, fast-paced middle grade adventure'M.G. LEONARD

Discrete Mathematics for Computer Science: An Example-Based Introduction is intended for a first- or second-year discrete mathematics course for computer science majors. It covers many important mathematical topics essential for future computer science majors, such as algorithms, number representations, logic, set theory, Boolean algebra, functions, combinatorics, algorithmic complexity, graphs, and trees. Features Designed to be especially useful for courses at the community-college level Ideal as a first- or second-year textbook for computer science majors, or as a general introduction to discrete mathematics Written to be accessible to those with a limited mathematics background, and to aid with the transition to abstract thinking Filled with over 200 worked examples, boxed for easy reference, and over 200 practice problems with answers Contains approximately 40 simple algorithms to aid students in becoming proficient with algorithm control structures and pseudocode Includes an appendix on basic circuit design which provides a real-world motivational example for computer science majors by drawing on multiple topics covered in the book to design a circuit that adds two eight-digit binary numbers Jon Pierre Fortney graduated from the University of Pennsylvania in 1996 with a BA in Mathematics and Actuarial Science and a BSE in Chemical Engineering. Prior to returning to graduate school, he worked as both an environmental engineer and as an actuarial analyst. He graduated from Arizona State University in 2008 with a PhD in Mathematics, specializing in Geometric Mechanics. Since 2012, he has worked at Zayed University in Dubai. This is his second mathematics textbook.