Getting started:
Related tutorials:
# Write a SQL query to search for all products with the word "camera" in either the | |
# product name or description: | |
Select * from product | |
where product_name like '%camera%' | |
or product_description like '%camera%' | |
<!--<?xml version="1.0" encoding="utf-8"?>--> | |
<!--<RelativeLayout xmlns:android="http://schemas.android.com/apk/res/android"--> | |
<!-- xmlns:app="http://schemas.android.com/apk/res-auto"--> | |
<!-- xmlns:tools="http://schemas.android.com/tools"--> | |
<!-- android:layout_width="match_parent"--> | |
<!-- android:layout_height="match_parent"--> | |
<!-- tools:context=".MainActivity">--> | |
/* | |
* | |
* Author: George Mossessian | |
* | |
* The MD4 hash algorithm, as described in https://tools.ietf.org/html/rfc1320 | |
*/ | |
#include <stdlib.h> |
/* sha3.c - an implementation of Secure Hash Algorithm 3 (Keccak). | |
* based on the | |
* The Keccak SHA-3 submission. Submission to NIST (Round 3), 2011 | |
* by Guido Bertoni, Joan Daemen, Michaël Peeters and Gilles Van Assche | |
* | |
* Copyright (c) 2013, Aleksey Kravchenko <[email protected]> | |
* | |
* Permission to use, copy, modify, and/or distribute this software for any | |
* purpose with or without fee is hereby granted. | |
* |
#Vigenere Cipher | |
alphabet_pos = {'A':0, 'a':0, 'B':1, 'b':1, 'C':2, 'c':2, 'D':3, 'd':3, | |
'E':4, 'e':4, 'F':5, 'f':5, 'G':6, 'g':6, 'H':7, 'h':7, 'I':8, 'i':8, | |
'J':9, 'j':9, 'K':10, 'k':10, 'L':11, 'l':11, 'M':12, 'm':12, 'N': 13, | |
'n':13, 'O':14, 'o':14, 'P':15, 'p':15, 'Q':16, 'q':16, 'R':17, 'r':17, | |
'S':18, 's':18, 'T':19, 't':19, 'U':20, 'u':20, 'V':21, 'v':21, 'W':22, | |
'w':22, 'X':23, 'x':23, 'Y':24, 'y':24, 'Z':25, 'z':25 } | |
def alphabet_position(letter): |
<template> | |
<div id="app"> | |
<!-- <app-Navbar></app-Navbar> | |
<app-Side-Nav></app-Side-Nav> --> | |
<app-Regular-User></app-Regular-User> | |
<app-Footer></app-Footer> | |
</div> | |
</template> | |
<script> | |
import MyFooter from '@/components/Shared/MyFooter' |
package assign6; | |
import java.util.*; | |
/** | |
* This class carries out the merge sort algorithm in parallel. | |
* | |
* @author Taylor Carr | |
* @version 1.0 | |
*/ |
# -*- coding: utf-8 -*- | |
""" | |
Created on Tue May 28 04:37:38 2019 | |
@author: Eslam Ahmed Genedy | |
""" | |
# Parent class | |
class Pets: |
#include <stdio.h> | |
#include <stdlib.h> | |
/* ****************************************************************** | |
ALTERNATING BIT AND GO-BACK-N NETWORK EMULATOR: VERSION 1.1 J.F.Kurose | |
This code should be used for PA2, unidirectional or bidirectional | |
data transfer protocols (from A to B. Bidirectional transfer of data | |
is for extra credit and is not required). Network properties: | |
- one way network delay averages five time units (longer if there |
Getting started:
Related tutorials: