K

@krishp

DAA

C++
3 years ago
PRACTICAL -1 Aim: Implementation and Time analysis of linear and binary search algorithm. Solution (Linear Search): #include<stdio.h> #include<conio.h> #include<string.h> int main() { int arr[10],i,j; printf("Enter the numbers in array :");

wt master

PHP
3 years ago
IU2041050078 Web Technology Krish Patel IU2041050078 Web Technology Krish Patel Practical - 2 • Write a program to make table using HTML. <!DOCTYPE html> <html lang="en"> <head> <title>Document</title> </head> <body>

All in one

C
3 years ago
// bit stuffing #include<stdio.h> #include<string.h> int main() { int a[20],b[30],i,j,k,count,n; printf("Enter frame size:"); scanf("%d",&n); printf("Enter the frame in the form of 0 and 1 :");

error detection

C
3 years ago
#include <stdio.h> int main() { int arr[8]; int arr1[8]; int arr2[8]; int arr3[8]; int carry=0; int carry1=0;

CRC

C
3 years ago
#include<bits/stdc++.h> using namespace std; string xor1(string a, string b) { string result = "";

byte stuffing

C
3 years ago
#include<stdio.h> #include<string.h> int main(){ char a[20],b[20]; int i,n,j; char f,s; printf("Enter the size of the frame : "); scanf("%d",&n); n=n*2; printf("\nEnter the characters in frame : \n");

byte stuffing

C
3 years ago
#include<stdio.h> #include<string.h> int main(){ char a[20],b[20]; int i,n,j; char f,s; printf("Enter the size of the frame : "); scanf("%d",&n); n=n*2; printf("\nEnter the characters in frame : \n");

byte stuffing

C
3 years ago
#include<stdio.h> #include<string.h> int main(){ char a[20],b[20]; int i,n,j; char f,s; printf("Enter the size of the frame : "); scanf("%d",&n); n=n*2; printf("\nEnter the characters in frame : \n");

bit stuffing

C
3 years ago
#include<stdio.h> #include<string.h> int main() { int a[20],b[30],i,j,k,count,n; printf("Enter frame size:"); scanf("%d",&n); printf("Enter the frame in the form of 0 and 1 :"); for(i=0; i<n; i++) scanf("%d",&a[i]);

xerox timetable

Erlang
3 years ago
<html> <body> <table border="1"> <tr> <th colspan="10">Indus University <br> Time Table</th> </tr> <tr> <td>Course</td>

Time Table Xerox

Python
3 years ago
<html> <body> <table border="1"> <tr> <th colspan="10">Indus University <br>Time Table</th> </tr> <tr> <td>course</td>

pyrhon

Python
3 years ago
a="life is hell" print(len(a)) print(a[::1]) print(a[::2]) print(a[::-1]) print(a[-1::-1]) b="hell is life" print(a,b)

Priority non preemptive

C++
4 years ago
#include<iostream.h> int main() { int bt[20],p[20],wt[20],tat[20],pr[20],i,j,n,total=0,pos,temp,avg_wt,avg_tat; cout<<"Enter Total Number of Process:"; cin>>n;

SJF

C
4 years ago
#include<stdio.h> void main() { int bt[20],p[20],wt[20],tat[20],i,j,n,total=0,pos,temp; float avg_wt,avg_tat; printf("Enter number of process:"); scanf("%d",&n);

FCFS

C++
4 years ago
#include<iostream> using namespace std; int main() { int n,bt[20],wt[20],tat[20],avwt=0,avtat=0,i,j; cout<<"Enter total number of processes(maximum 20):"; cin>>n;

fetch data from a file and display data into another file in reverse order.

Bash
4 years ago
#!/bin/bash echo "Enter File Name : \c " read fileName if [ -f $fileName ] then str=`cat $fileName` len=`echo $str|wc -c` i=$len

display all executable files, directories and zero sized files.

Bash
4 years ago
#!/bin/bash echo "Enter Directory Name:" read dir ls $dir>tempfile.txt count=0 if [ -d $dir ];then for filename in `cat tempfile.txt` do

read n numbers as command arguments and sort them in descending order

Bash
4 years ago
#!/bin/bash read -p "Enter the number of values you want to sort " n for((i=0; i<$n; i++)) do read -p "Enter value of arr[$i]: " arr[$i] done #sorting code for((i=0; i<$n; i++)) do

will generate first n Fibonacci numbers like: 1, 1, 2, 3, 5, 13...

Bash
4 years ago
#!/bin/bash echo "How many number of terms to be generated ?" read n x=0 y=1 i=2 echo "Fibonacci Series up to $n terms :" echo "$x" echo "$y"

accept a number band display first n prime numbers as output

Bash
4 years ago
#!/bin/bash prime_1=0 echo "enter the range" read n echo " Prime number between 1 to $n is:" echo "1" echo "2" for((i=3;i<=n;)) do