This set of Software Defined Radio Architecture Questions and Answers for Campus interviews focuses on “Computational Processing Resources”.
1. PowerPC is an example for ____
a) General Purpose Processor
b) Digital Signal Processor
c) Application Specific Integrated Circuit
d) Field Programmable Gate Array
Explanation: PowerPC is a general purpose processor. It is generally programmed using standard C or C++. It provides different types of addressing modes, floating point and integration computation, large memory, and on and off chip cache memory.
2. ____ usage of resources within a module is a constraint imposed by software defined radio.
Explanation: Software defined radio has two constraints to consider during execution namely bounded usage of resources within a module or acceptable usage of computational resources and timing constraints.
3. ____ is a function in which the function definition includes the function itself.
a) User defined function
b) Pre-defined function
c) Main function
d) Recursive function
Explanation: Recursive function is a function in which the function definition includes the function itself. A recursive function must also consist of a base case which does not involve calling the function itself and a set of rules that reduce towards the base case.
4. Which among the following is not an example of primitive recursive function?
a) Sequential logic
b) Traversal filter
c) Recursive filter
d) Ackermann function
Explanation: A primitive recursive function is one in which the upper bound or the number of iterations to be performed is known. Most computable functions studied in number theory are primitive recursive. These include addition, subtraction, multiplication, etc. Sequential logic, traversal filter, recursive filter, bit manipulation, and data packing are common primitive recursive functions.
5. _______ function is a subset of ________ function.
a) Total recursive, primitive recursive
b) Partial recursive, total recursive
c) Primitive recursive, total recursive
d) μ-recursive, partial recursive
Explanation: Primitive recursive function is a subset of total recursive function. Total recursive function is a subset of partial recursive function. Partial recursive functions are otherwise called μ-recursive function.
6. If Z is a function of Y, and Y is a function of X then Z is a function of X. Which among the following options is the concept that supports the given statement?
c) Primitive recursion
Explanation: Composition is the point wise application of one function to the result of another to produce a third function. A set is closed under composition of functions.
7. Which among the following is the only conditional branching structure suitable for primitive recursion?
a) For loop
b) While loop
c) Do while loop
d) Go-to statement
Explanation: A primitive recursive function is one in which the upper bound or the number of iterations to be performed is known. Consider for a loop from i = 1 to N, N is fixed before entry into the loop and cannot be change within the loop. The for loop is the only structure that satisfies primitive recursive function.
8. A computable function must have a ____ that computes the function.
a) infinite procedure
b) finite dataset
c) finite procedure
d) infinite dataset
Explanation: A computable function must have afinite procedure or algorithm that computes the function. The function must be computable with the available information and instruction and must not require special insights or computational models.
9. Consider a function x to y. Partial function does not require every element of x to be mapped to some element of y.
Explanation: Partial function does not require every element of x to be mapped to some element of y. An example for partial function is the mapping of natural logarithm function to real numbers.
10. Digital signal processors have ____ functions to support high speed signal processing.
a) subtraction and accumulation
b) division and subtraction
c) addition and subtraction
d) multiplication and accumulation
Explanation: The DSP internal architecture is optimized to perform multiplication and accumulation quickly. This is done with the help of one or more multiplier and one or more accumulators. The memory structure is designed to fetch operands and instructions in parallel.
Sanfoundry Global Education & Learning Series – Software Defined Radio.
To practice all areas of Software Defined Radio Architecture for Campus Interviews, here is complete set of 1000+ Multiple Choice Questions and Answers.
Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social networks below and stay updated with latest contests, videos, internships and jobs!