1. which of these checks for structural errors of a language

a)lexical analyser
b)parser
c)intermediate code
d)code optimisation

2. threads in the same process share the same

a)data section
b)stack
c)registers
d) thread id

3.the depth of a binary tree...

a)nlogn(base 2)
b) n*n
c)n

4.a program computing log(n) accepts 1000 inputs its execution time is 110 ms...when it doubles n to 2000 inputs. it becomes 120.....and what will be for 4000

a)130
b)140
c)150