sonangrai

.model small
.data
    msg db "KIST$"
.code
    main proc
        mov ax,@data
        mov ds,ax
        mov si,offset msg
    input:mov ah,1
        int 21h

sonangrai

.model small
.data
    msg db "KIST$"
.code
    main proc
        mov ax,@data
        mov ds,ax
        mov si,offset msg
    again:cmp [si],'$'
        je last

sonangrai

.model small
.data
    msg db "KIST$"
.code
    main proc
        mov ax,@data
        mov ds,ax
        mov si,offset msg
    again:cmp [si],'$'
        je last

sonangrai

.model small
.data
    msg db "KIST COLLEGE$"
.code
    main proc
        mov ax,@data
        mov ds,ax
        mov si,offset msg
    again:cmp [si],'$'
        je last

sonangrai

.model small
.stack 256
.data
    msg db "BIT 3rd sem$"
.code
    main proc
        mov ax,@data
        mov ds,ax
        call display
        call display

sonangrai

.model small
.stack 256
.data
    msg db "BIT 3rd sem$"
.code
    main proc
        mov ax,@data
        mov ds,ax
        call display
        mov ah,4ch

sonangrai

*Simplified directive
.model small
.stack 256
.data
    msg db "BIT 3rd sem$"
.code
    main proc
        mov ax,@data
        mov ds,ax
        mov dx,offset msg

sonangrai

*Program to display string
KIST segment
	msg db "BIT 3rd sem$"
KIST ends
COLLEGE segment 
	Assume DS:KIST , CS:COLLEGE
	main proc 
		mov dx,ds
		mov dx,offset msg
		mov ah,09h

sonangrai

#include<iostream>
#include<conio.h>
#include<stdlib.h>
using namespace std;

const int MAX = 5;
class cqueue
{
    int a[MAX],front,rear;
    public :

sonangrai

#include<iostream>
#include<conio.h>
#include<stdlib.h>
using namespace std;

void sort(int a[],int n)
{
	int i,j,temp;
	cout<<"the sorted numbers are"<<endl;
	for(i=0;i<n;i++)