0% found this document useful (0 votes)
37 views1 page

Gate 2018

The document discusses many technical computing topics at a high level including data structures, algorithms, networks, cryptography, hardware and more.

Uploaded by

utagore58
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
37 views1 page

Gate 2018

The document discusses many technical computing topics at a high level including data structures, algorithms, networks, cryptography, hardware and more.

Uploaded by

utagore58
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
You are on page 1/ 1

implications

asymptotic complexity
kruskal like algorithms
heights of a binary search tree
number representations
linked lists
overflows,adders
cfgs
addressing modes for structures
static single assignment
errors in pointers
tcp=server-client
birthday attcks
functional dependencies in relational schema
first and follow functions
threads of a process share
guassian random variable,variance,median
kmaps
nfa,dfa
avg waiting time
miss rates in l1 and l2 caches
direct and indirect graphs
locks in mutual exclusion
limit functions
truth tables
euclidian norms
eigen values,symmetric matrices
error checking gf(2)
flip flops and clock cycles
grammar
turing machines
database aggregate functions
rsa algorithm
stop and wait arq protocol
optimal algorithm
risc cisc problems

You might also like