|
所在平台: Udemy |
课程主页: https://www.udemy.com/course/bitwise-algorithms/
课程评论：没有评论
课程名称：比特操作算法：数据结构与算法（DSA） 课程概述：在面临编码轮次及面试时，您是否准备好应对比特操作相关的问题？欢迎参加“比特操作算法”专项课程。本课程将深入解析数字在计算机内部以比特和字节形式运作的原理，以及程序员如何在比特层面进行操作。课程将从基础知识入手，教授如何将十进制转换为比特，并运用位运算符，如按位与（AND）、或（OR）、非（NOT）和异或（XOR），以及更强大的位移运算符（左移和右移），还将涉及小端和大端架构等特征。 课程将解决以下使用比特算法的问题： 1. 检查两个数字是否符号不同 2. 清除最低有效位 3. 找到数组中唯一的元素 4. 给定数字加1，但不使用加法 5. 将数字乘以2.5，但不使用乘法 6. 判断给定数字是否为2的幂 7. 在不使用异或的情况下找到两个数字的异或结果 8. 计算将数字A转换为数字B所需翻转的位数 9. 在一个字节中交换两个半字节 这些算法将得到清晰的解释，并将在您喜欢的编程语言中进行实现。虽然对编程有基本了解是有利的，但并不强制要求。
Crack the coding rounds and interviews whenever a question on bit manipulation is asked!Welcome to the specific course on 'Bit Manipulation Algorithms'. This course will give you a deep understanding on how the numbers work as bits and bytes inside your computer and how to operate on bit level as a programmer?The course will begin with the basics of converting decimals into bits, operating on those bits using operators such as Bitwise AND, OR, NOT and XOR and the most powerful operators like left and right shifts, the architectural features such as Little Endian and Big Endian. Problems that are solved using Bitwise Algorithms:1. Checking whether the two numbers have different signs2. Clearing the Least Significant Bit3. Finding out the all alone element in an array4. Add 1 to the given number without using +15. Multiplying a number with 2.5 without using '*2.5'6. Printing whether the given number is a power of 27. Finding out the XOR of two numbers without using XOR8. Count the number of bits that have to be flipped to convert from A to B given two numbers A and B9. Swap the two nibbles in a byte. and so on. The algorithms will be clearly explained and implementation will be done in anyone of your favorite programming languages. A basic knowledge in programming is preferred but not a strong requirement.
