Which of the following statement is false

- APointers are very useful.
- BPointers store the next data element of a list
- CData elements in linked lists need not be stored in adjacent space in memory
- DLinked lists are collection of the nodes that contain information part and next pointer.
- EArrays are dense lists and static data structure.

- What are the minimum number of queues needed to implement the priority queue?
- AOne
- BTwo
- CThree
- DFour

- The complexity of merge sort algorithm is
- AO(n)
- BO(log n)
- CO(n2)
- DO(n log n)

- The complexity of Bubble sort algorithm is
- AO(n)
- BO(log n)
- CO(n2)
- DO(n log n)

- The complexity of Binary search algorithm is
- AO(n)
- BO(log n)
- CO(n2)
- DO(n log n)

- The complexity of linear search algorithm is
- AO(n)
- BO(log n)
- CO(n2)
- DO(n log n)

- Which of the following data structure is linear data structure
- ATrees
- BGraphs
- CArray
- DNone of above

- Which of the following name does not relate to stacks
- AFIFO lists
- BLIFO list
- CPiles
- DPush-down lists

- The memory address of the first element of an array is called
- Afloor address
- Bfirst address
- Cfoundation address
- Dbase address

- A graph with one or more edges is at least
- A1-chromatic
- B2-chromatic
- C3-chromatic
- D4-chromatic

- Which data structure is needed to convert infix notations to postfix notations
- Alinear list
- Btree
- Cstack
- Dqueue

- Which sorting method is slowest
- AQuick sort
- BHeap sort
- CShell sort
- DBubble sort

- Which is having highest precedence in C
- Arelational operators
- Bequality operator
- Clogical operator
- Darithmetic operator

- Merge sort uses
- ADivide and conquer strategy
- BBacktracking approach
- CHeuristic search
- DGreedy approach

- Which of the languages is often translated to the pseudo code
- APASCAL
- BFORTRAN
- CPL/I
- DBASIC

- O log(n) can be conneted with
- ASelection sort
- BInsertion sort
- CBinary sort
- DMerge sort

- How many divisions are there in COBOL language
- ATwo
- BThree
- CFour
- DFive

- Which is ALGOL based simulation language
- AFORTRAN
- BSIMSCRIPT
- CGASP IV
- Dnone of above

- A linear list from which elements can be added or removed from either end is called
- Astack
- Bqueue
- Cdeque
- Dtree

- Recursive problems are implemented by
- Aqueues
- Bstacks
- Clinked lists
- Dstrings

- Recursive problems are implemented by
- Aqueues
- Bstacks
- Clinked lists
- Dstrings

- Sort which compares adjacent elements in a list and switches where necessary is
- AInsertion sort
- BHeap sort
- CQuick sort
- DBubble sort

- Which is problem oriented language
- ABASIC
- BPL/I
- CFORTRAN
- Dnone of above

- minimum number of stacks of size n required to implement a queue of size n
- AOne
- BTwo
- CThree
- DFour

- In C how many parameters can passed to a function
- A2
- B5
- C10
- Das many as defined in function definition

- Which statement we should ignore in structure programming
- AWHILE-DO
- BGO-TO
- CIT-ELSE
- DSWITCH

- Deletion from one end and insertion from other end is
- Astack
- Bbranch
- Ctree
- Dqueue

- Repeated execution of simple computation may cause compounding of
- Around off errors
- Bsyntax errors
- Crun time errors
- Dlogic errors

- ++i is equivalent to
- Ai = i + 2
- Bi = i + 1
- Ci = i + i
- Di = i - 1

- Information about an array used in a program will be stored in
- Asymbol table
- Bactivation record
- Cdope vector
- Dsystem table

Categories