Contents Preface Chapter 1. Introduction Chapter 2. Link Layer Chapter 3. IP: Internet Protocol Chapter 4. ARP: Address Resolution Protocol Chapter 5. RARP: Reverse Address Resolution Protocol Chapter 6. ICMP: Internet Control Message Protocol Chapter 7. Ping Program Chapter 8. Traceroute Program Chapter 9. IP Routing Chapter 10. Dynamic Routing Protocols Chapter 11. UDP: User Datag…
Table of contents: 1. The Interview Process 2. Behind the Scenes 3. Special Situations 4. Before the Interview 5. Behavioral Preparation 6. Big O 7. Technical Questions (+ 5 Algorithm Approaches) 8. The Offer and Beyond 9. 189 Programming Questions and Answers
Table of Contents: Chapter 1 Dive in A Quick Dip: Breaking the Surface Chapter 2 Classes and Objects: A Trip to Objectville Chapter 3 Primitives and References: Know Your Variables Chapter 4 Methods Use Instance Variables: How Objects Behave Chapter 5 Writing a Program: Extra-Strength Methods Chapter 6 Get to Know the Java API: Using the Java Library Chapter 7 Inheritance and Polymo…
Table of contents: 1. Introduction to Networking. 2. How Computers Find Each Other on Networks. 3. How Data Gets Transported Over Networks. 4. Structured Cabling and Network Elements. 5. Network Cabling. 6. Wireless Networking. 7. Remote Access and Cloud Computing. 8. Network Risk Management. 9. Unified Communications and Network Performance Management. 10. Network Segmentation and Vi…
Contents: 1. Computer Networks and the Internet 2. Application Layer 3. Transport Layer 4. The Network Layer: Data Plane 5. The Network Layer: Control Plane 6. The Link Layer: Links, Access Networks, and LANs 7. Wireless and Mobile Networks 8. Security in Computer Networks 9. Multimedia Networking
1.Introduction 1.1.Classical Ciphers 1.2.Secret Key Encryption 1.3.Public-Key Encryption 2.Homomorphic Encryption 2.1.Homomorphic Encryption Definition 2.2.Goldwasser-Micali Encryption Scheme 2.3.ElGamal Encryption Scheme 2.4.Paillier Encryption Scheme 2.5.Boneh-Goh-Nissim Encryption Scheme 3.Fully Homomorphic Encryption 3.1.Fully Homomorphic Encryption Definition 3.2.Overview o…
Table of contents: I. Foundations 1. The Role of Algorithms in Computing 2. Getting Started 3. Growth of Functions 4. Divide-and-Conquer 5. Probabilistic Analysis and Randomized Algorithms II. Sorting and Order Statistics 6. Heapsort 7. Quicksort 8. Sorting in Linear Time 9. Medians and Order Statistics III. Data Structures 10. Elementary Data Structures 11. Hash Tables 12. B…
Contents: 1. Limits? What Limits? 2. Problems and Effective Procedures 3. The WHILE-Language 4. Semantics of WHILE 5. Extensions of WHILE 6. Programs as Data Objects 7. A Self-interpreter for WHILE 8. An Undecidable (Non-computable) Problem 9. More Undecidable Problems 10. Self-referencing Programs 11. The Church-Turing Thesis 12. Measuring Time Usage 13. Complexity Classes 14.…
PART 1: AUTOMATA AND LANGUAGES. 1. Regular Languages. 2. Context-Free Languages. PART 2: COMPUTABILITY THEORY. 3. The Church-Turing Thesis. 4. Decidability. 5. Reducibility. 6. Advanced Topics in Computability Theory. PART 3: COMPLEXITY THEORY. 7. Time Complexity. 8. Space Complexity. 9. Intractability. 10. Advanced Topics in Complexity Theory.
CONTENTS: 1.Integers 1.1.Natural Numbers 1.2.The Euclidean Algorithm 1.3.Fermat's Little Theorem and Its Generalisations 1.4.The Ring of Integers Modulo n. The Field Zp 1.5.Representation of Numbers 2.Cryptology 2.1.Classical Secret-Key Cryptology 2.2.Modern Public-Key Cryptology 2.3.Computational Complexity 2.4.The RSA Public-Key Cryptosystem 2.5.Applications of Cryptology 3…