• Placement Questions
• /
• CMC
• /
• Programming

Frequently Asked CMC Programming Interview Questions with Answers

(#M40085995) CMC QUESTION Technical written test question Keep an EYE

Which of the following sorting algorithms does not have worst case running time of O(n2) ?
A Merge Sort
B Quick Sort
C Bubble Sort
D Insertion Sort

Asked In CMC Naveen (10 years ago)

Unsolved Read Solution (6)

Is this Puzzle helpful?   (31)   (4) Submit Your Solution Technical

(#M40085996) CMC QUESTION Technical written test question Keep an EYE

The following operations are performed on a stack:
push(10), push(20), pop, push(10), push(20), pop, pop, pop, push(20), pop. The sequence of values popped out is

A) 20, 10, 20, 10, 20
B) 20, 20, 10, 10, 20
C) 10, 20, 20, 10, 20
D) 20, 20, 10, 20, 10

Asked In CMC Naveen (10 years ago)

Unsolved Read Solution (8)

Is this Puzzle helpful?   (36)   (19) Submit Your Solution Technical

(#M40086001) CMC QUESTION Technical written test question Keep an EYE

Which of the following shell variable is used to return the process ID of the current shell?
A) $!
B) $$
C) $*
D) None

Asked In CMC Naveen (10 years ago)

Unsolved Read Solution (3)

Is this Puzzle helpful?   (3)   (0) Submit Your Solution Technical

(#M40086003) CMC QUESTION Technical written test question Keep an EYE

When a binary tree is traversed in preorder and inorder, the labels of the nodes are printed as below.
Preorder: A B C D E F G H
In order: B C A E G F D H
In what order the nodes appear if the same binary is traversed in post-order?
A) C B G F E H D A
B) C B E G F H D A
C) C B F G E D H A
D) Can’t be decided unless tree representation is given

Asked In CMC Naveen (10 years ago)

Unsolved Read Solution (2)

Is this Puzzle helpful?   (2)   (1) Submit Your Solution

(#M40085999) CMC QUESTION Technical written test question Keep an EYE

Which one of the following is the most suitable data structure for applications involving frequent additions and deletions of data elements?
A Stack
B Arrays
C Linear lists
D Linked list

Asked In CMC Naveen (10 years ago)

Unsolved Read Solution (3)

Is this Puzzle helpful?   (1)   (0) Submit Your Solution Technical

(#M40085997) CMC QUESTION Technical written test question Keep an EYE

In a memory system, read access takes 100 ns and write access takes 80 ns. If 60% of the access requests are reads, what is the average access time of the memory?
A) 3 ns
B) 92 ns
C) 108 ns
D) 88 ns

Asked In CMC Naveen (10 years ago)

Unsolved Read Solution (1)

Is this Puzzle helpful?   (4)   (1) Submit Your Solution Technical

(#M40086002) CMC QUESTION Technical written test question Keep an EYE

The system call that is key to multitasking in UNIX
A) Exec
B) Fork
C) System
D) None

Asked In CMC Naveen (10 years ago)

Unsolved Read Solution (1)

Is this Puzzle helpful?   (4)   (2) Submit Your Solution Technical

(#M40086000) CMC QUESTION Technical written test question Keep an EYE

Consider the C language code given below.
int *a;
int b[2];
a = b;
b[0] = -46;
b[1] = -23;
*a = -34;
(*++a)++;
What are the values of b[0], b[1] at the end.
A -34, -24
B -46, -22
C -34, -22
D -46, -23

Asked In CMC Naveen (10 years ago)

Unsolved Read Solution (4)

Is this Puzzle helpful?   (0)   (1) Submit Your Solution Technical

(#M40085994) CMC QUESTION Technical written test question Keep an EYE

The ideal data structure to handle backtracking is?
A Queue
B Tree
C Stack
D Linked list

Asked In CMC Naveen (10 years ago)

Unsolved Read Solution (1)

Is this Puzzle helpful?   (3)   (0) Submit Your Solution Technical