Campus Placement Papers of Societe Generale

The data structure required to check whether an expression contains balanced parenthesis is

The pre-order and post order traversal of a Binary Tree generates the same output. The tree can have maximum

Assume single linked list pseudo code as follows?

struct Node {
data
next
}
record List {
Node firstNode
}

function1(List list) {
obsoleteNode = list.firstNode; list.firstNode = list.firstNode.next; free obsoleteNode;
}

function2(node node) {
obsoleteNode = node.next; node.next= node.next.next; free obsoleteNode;
}

function3(Node node,Node newNode) {
newNode.next = node.next;node.next= newNode
}

function4(List list, Node newNode) {
newNode.next = list.firstNode; list.firstNode = newNode;
}

Consider a linked list of n elements. What is the time taken to insert an element after an element pointed by some pointer?

In a linked list with n nodes, the time taken to insert an element after an element pointed by some pointer is

Consider the following code segment in C to traverse a binary tree using the preorder

typedef struct tree {
int info;
struct  *left;
struct  *right;
}node;

void preorder(node *tree)
{
if (t)
{
Statementl
Statement2
Statement3
}
}
The above Statements should be

One can convert a binary tree into its mirror image by traversing it in

A graph with n vertices will definitely have a parallel edge or self loop of the total number of edges are

Let A be an adjacency matrix of a graph G. The ij entry in the matrix A^k , gives

An adjacency matrix representation of a graph cannot contain information of :