Search - lab1 j

Search - lab1 j - List

[OS Develop] jos DL : 0: JOS 教学操作系统的 LAB1-LAB2实现源代码-JOS teaching LAB1-LAB2 operating system source code to achieve
Date : 2025-07-08 Size : 109kb User : zhumin
[matlab] lab1 DL : 0: lear N = 10^5 EB_NO = [-1:30] liu1 = zeros(1,N) liu2 = zeros(1,N) for ii = 1:length(EB_NO) m= (2*(rand(1,N)>0.5)-1) + j*(2*(rand(1,N)>0.5)-1) s = (1/sqrt(2))*m normalization of energy to 1 n = 1/sqrt(2)*[randn(1,N) + j*randn(1,N)] -lear N = 10^5 EB_NO = [-1:30] liu1 = zeros(1,N) liu2 = zeros(1,N) for ii = 1:length(EB_NO) m= (2*(rand(1,N)>0.5)-1) + j*(2*(rand(1,N)>0.5)-1) s = (1/sqrt(2))*m normalization of energy to 1 n = 1/sqrt(2)*[randn(1,N) + j*randn(1,N)]
Date : 2025-07-08 Size : 1kb User : yunliangqiu
[Other] code DL : 1: binary tree asm lab1-In computer science, binary tree is a widely used data structure. Here we will look at infinite binary tree where the node is a pair of integers. The tree is constructed as follows: 1. The root is the pair (1,1). 2. If a node is (a,b) then its left child is (a+b,b) and its right child (a,a+b) Given the pair (a,b) of some node of the binary tree descibed above, suppose you are traversing the root of the tree to the given node along the shortest possible path. Can you find out the times you have to go to a left child and the times to a right child. Input: The first line contains the number of input sets, each of which is consisted of a single line containing two integers i and j ( 1<=i,j<=2*10^9) that represent a node (i,j). You can assume that this is a valid node in the binary tree described above.
Date : 2025-07-08 Size : 1.88mb User : zhangshuyuan