What was the most challenging project you have ever worked on? Reverse a Linked List. What was your worst grade at your school, and why is that? Then write another procedure in C that reverses the words of a null-terminated sentence.
Tell me about your research. Design a data structure to store strings efficiently for following operations: Why do you want to work here? This was one of the easier questions, but the interviewer was incredibly stubborn in pushing for a very specific answer.
The two operations applicable to all stacks are: If a pop operation on the stack causes the stack pointer to move past the origin of the stack, a stack underflow occurs. What was your most difficult technical issue Tripple linked list to one single linked list Why should I hire you?
You are given a task to parse phone numbers out of a logfile on a linux system.
What was the most challenging project you have ever worked on? Find nth last number in a singly linked list. How many physical files are required to create a database within SQL Server. The city streets are laid out in a simple grid fashion, with 8 streets running north-south and 8 running east-west.
Stop when there are no more nodes, i. How would you find user data consisting of million entries spread across machines?
When a plate is removed from the stack, the one below it pops up to become the new top. Design a given change to the user interface for an Amazon shopper. Merge two sorted arrays.The inv estor could start the program (which reads in the text file), enter several new buy -and -sell transactions, and then exit the program (which writes the Write the updated information to a file.
We call these two interfaces StackADT and QueueADT. They are shown in Listing (see next page). List of all microsoft interview questions on glassdoor. February 26th, In a BST write a program to find 2 nodes x and y such that X+y=k: given a connected graph, color each node in the graph such that no two adjacent nodes have the same color.
how would you troubleshoot a router if ICMP is turned off. ____A hierarchical structure that place elements in nodes along branches that originate from a root.
F. ____A tree structure in which each node can have at most two children, and in which a unique path exists from the root to every other node.
G. ____A type of tree in which the key value of each node is less than. Given two very large binary trees T1, with millions of nodes, and T2, with hun- dreds of nodes, create an algorithm to decide if T2 is a subtree of T1.
There is a special linked list where each node have two pointers, one pointer for next node and one pointer for randomly chosen node.
C is a general-purpose programming language used for system programming (OS and embedded), libraries, games and cross-platform.
This tag should be used with general questions concerning the C language, as defined in the ISO standard (the latest. View all of your activity on GeeksforGeeks here.
B, Advant Navis Business Park, Sector, Noida, Uttar Pradesh -Download