计算先进先出简例

--------------------------------------------------------------------------

--  Author : htl258(Tony)

--  Date   : 2010-01-06 08:54:41

--  Version:Microsoft SQL Server 2008 (SP1) - 10.0.2531.0 (Intel X86)

--          Mar 29 2009 10:27:29

--          Copyright (c) 1988-2008 Microsoft Corporation

--          Developer Edition on Windows NT 5.1 <X86> (Build 2600: Service Pack 2)

--------------------------------------------------------------------------

--> 生成测试数据表:tb

 

IF NOT OBJECT_ID('[存货表]') IS NULL

    DROP TABLE [存货表]

GO

CREATE TABLE [存货表]([编码] NVARCHAR(10),[数量] INT,[单价] DECIMAL(18,1),[日期] DATETIME)

INSERT [存货表]

SELECT '01',5,2.2,N'2009-10-01' UNION ALL

SELECT '01',9,2.5,N'2009-10-01' UNION ALL

SELECT '01',12,2.1,N'2009-10-02' UNION ALL

SELECT '02',20,15.2,N'2009-10-20' UNION ALL

SELECT '02',16,12.8,N'2009-10-20'

GO

--SELECT * FROM [存货表]

 

 

--> 生成测试数据表:销售表

 

IF NOT OBJECT_ID('[销售表]') IS NULL

    DROP TABLE [销售表]

GO

CREATE TABLE [销售表]([编码] NVARCHAR(10),[销售数量] INT)

INSERT [销售表]

SELECT '01',8 UNION ALL

SELECT '02',30

GO

--SELECT * FROM [销售表]

 

-->SQL查询如下:

   

;with t as

(

    select rn=ROW_NUMBER()over(Order by 编码,日期),*      

    from 存货表

),t1 as

(

    select *,tmpsum=(select SUM(数量) from t where 编码=a.编码 and rn<=a.rn)

    from t a

)

update a set

    a.数量=a.数量-case

                  when  a.数量-(a.tmpsum-b.销售数量) <=0 then 0

                  when a.tmpsum-b.销售数量 <=0  then a.数量

              else a.数量-(a.tmpsum-b.销售数量)

            end

from t1 a

    join 销售表 b

       on a.编码=b.编码

     

select * from 存货表

/*

编码        数量         单价                                     日期

---------- ----------- --------------------------------------- -----------------------

01         0           2.2                                     2009-10-01 00:00:00.000

01         6           2.5                                     2009-10-01 00:00:00.000

01         12          2.1                                     2009-10-02 00:00:00.000

02         0           15.2                                    2009-10-20 00:00:00.000

02         6           12.8                                    2009-10-20 00:00:00.000

 

(5 行受影响)

*/

 

 

 

/*---------------------------------------------------

以下简例为查询实际应发数,以下测试数据s 表示数量,c 表示仓库。

假设某物料要出100个,求从各仓库分别应发出多少数量。

----------------------------------------------------*/

--> 生成测试数据表: [tb]

IF OBJECT_ID('[tb]') IS NOT NULL

    DROP TABLE [tb]

GO

CREATE TABLE [tb] ([id] [int],[s] [int],[c] [int])

INSERT INTO [tb]

SELECT '1','20','1' UNION ALL

SELECT '2','30','2' UNION ALL

SELECT '3','80','3' UNION ALL

SELECT '4','30','4'

 

--SELECT * FROM [tb]

 

-->SQL查询如下:

DECLARE @i INT = 100

 

SELECT id, s = CASE

                    WHEN l>0 THEN s

                    WHEN s+l<0 THEN 0

                    ELSE s+l

               END, c

FROM (

         SELECT *, @i-(

                    SELECT SUM(s)

                    FROM tb

                    WHERE id<= a.id

                ) l

         FROM tb a

     ) t

 

/*

id          s           c

----------- ----------- -----------

1           20          1

2           30          2

3           50          3

4           0           4

 

(4 行受影响)

*/

 

 

页面置换算法课设 private void FIFO_button1_Click(object sender, EventArgs e) { if (page.Length == 0 || strsize.Length == 0) MessageBox.Show("输入得页面序列或物理块数不能为空", "提示", MessageBoxButtons.OK); else { //初始化数据,并访问第一个页面 int i, j, u, losecount, changecount = 0; for (i = 0; i < size; i++) { X[i].Num = -1; X[i].Timer = 0; } X[0].Num = page[0]; X[0].Timer = 1; FIFO_label.Text = "FIFO\n" + (X[0].Num - 48).ToString() + "\n"; losecount = 1; //循环,按照页面序列,选择淘汰的页面并进行置换 for (i = 1; i < page.Length; i++) { u = 0;//进程的内存中是否存在要访问的页面的标记 //若内存中存在要访问的页面,则设置u=1,并退出循环 for (j = 0; j < size; j++) { if (X[j].Num == page[i]) { u = 1; break; } } //若内存中不存在要访问的页面,且内存中无空闲的空间则进行下列置换 if (u != 1 && X[size - 1].Num != -1) { j = GetMaxTime();//选择呆的时间最长的页面进行置换 X[j].Num = page[i]; X[j].Timer = 0; changecount++; losecount++; } //若内存中不存在要访问的页面,且内存中有空闲的空间则进行下列置换 if (u != 1 && X[size - 1].Num == -1) { for (j = 0; j < size; j++) { if (X[j].Num == -1) { X[j].Num = page[i]; losecount++; break; } } } //对内存中不为空的页面的时间加1 for (j = 0; j < size; j++) { if (X[j].Num != -1) X[j].Timer++; } //输出数据 for (j = 0; j < size; j++) { if (X[j].Num != -1) FIFO_label.Text += (X[j].Num - 48).ToString(); else FIFO_label.Text += " "; } FIFO_label.Text += "\n"; } FIFOlosepage = (float)losecount / (float)(page.Length);//缺页率 FIFO_label.Text += "访问次数是:" + page.Length + "\n页面置换次数:" + changecount + "\n缺页中断次数:" + losecount + "\n缺页率是:" + FIFOlosepage; } } (3)LRU置换算法 private void LRU_button1_Click(object sender, EventArgs e) { if (page.Length == 0 || strsize.Length == 0) MessageBox.Show("输入得页面序列或物理块数不能为空", "提示", MessageBoxButtons.OK); else { //初始化数据,并访问第一个页面,并输出访问结果 int i, j, u, losecount, changecount = 0; for (i = 0; i < size; i++) { X[i].Num = -1; X[i].Timer = 0; } X[0].Num = page[0]; X[0].Timer = 1; losecount = 1; LRU_label.Text = "LRU\n" + (X[0].Num - 48).ToString() + "\n"; //循环,按照页面序列依次访问页面,并输出访问结果 for (i = 1; i < page.Length; i++) { u = 0; //如果内存中存在要访问的页面,则置Timer为0,u为1 for (j = 0; j < size; j++) {
评论 1
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值